/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-05 23:54:36,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-05 23:54:36,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-05 23:54:36,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-05 23:54:36,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-05 23:54:36,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-05 23:54:36,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-05 23:54:36,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-05 23:54:36,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-05 23:54:36,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-05 23:54:36,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-05 23:54:36,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-05 23:54:36,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-05 23:54:36,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-05 23:54:36,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-05 23:54:36,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-05 23:54:36,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-05 23:54:36,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-05 23:54:36,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-05 23:54:36,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-05 23:54:36,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-05 23:54:36,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-05 23:54:36,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-05 23:54:36,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-05 23:54:36,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-05 23:54:36,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-05 23:54:36,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-05 23:54:36,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-05 23:54:36,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-05 23:54:36,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-05 23:54:36,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-05 23:54:36,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-05 23:54:36,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-05 23:54:36,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-05 23:54:36,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-05 23:54:36,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-05 23:54:36,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-05 23:54:36,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-05 23:54:36,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-05 23:54:36,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-05 23:54:36,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-05 23:54:36,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-05 23:54:36,897 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-05 23:54:36,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-05 23:54:36,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-05 23:54:36,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-05 23:54:36,898 INFO L138 SettingsManager]: * Use SBE=true [2021-05-05 23:54:36,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-05 23:54:36,898 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-05 23:54:36,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-05 23:54:36,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-05 23:54:36,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:54:36,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-05 23:54:36,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-05 23:54:37,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-05 23:54:37,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-05 23:54:37,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-05 23:54:37,150 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-05 23:54:37,151 INFO L275 PluginConnector]: CDTParser initialized [2021-05-05 23:54:37,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2021-05-05 23:54:37,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3ab0f6f/4ac17a3e7fef43b5a1e2db61f24333a0/FLAGee2deea9e [2021-05-05 23:54:37,527 INFO L306 CDTParser]: Found 1 translation units. [2021-05-05 23:54:37,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2021-05-05 23:54:37,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3ab0f6f/4ac17a3e7fef43b5a1e2db61f24333a0/FLAGee2deea9e [2021-05-05 23:54:37,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3ab0f6f/4ac17a3e7fef43b5a1e2db61f24333a0 [2021-05-05 23:54:37,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-05 23:54:37,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-05 23:54:37,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:37,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-05 23:54:37,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-05 23:54:37,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:37" (1/1) ... [2021-05-05 23:54:37,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c99a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:37, skipping insertion in model container [2021-05-05 23:54:37,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:37" (1/1) ... [2021-05-05 23:54:37,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-05 23:54:37,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-05 23:54:38,031 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2021-05-05 23:54:38,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:38,048 INFO L203 MainTranslator]: Completed pre-run [2021-05-05 23:54:38,075 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i[893,906] [2021-05-05 23:54:38,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:38,095 INFO L208 MainTranslator]: Completed translation [2021-05-05 23:54:38,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38 WrapperNode [2021-05-05 23:54:38,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:38,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-05 23:54:38,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-05 23:54:38,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-05 23:54:38,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... [2021-05-05 23:54:38,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... [2021-05-05 23:54:38,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... [2021-05-05 23:54:38,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... [2021-05-05 23:54:38,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... [2021-05-05 23:54:38,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... [2021-05-05 23:54:38,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... [2021-05-05 23:54:38,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-05 23:54:38,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-05 23:54:38,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-05 23:54:38,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-05 23:54:38,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:54:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-05 23:54:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-05 23:54:38,160 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-05 23:54:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-05 23:54:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-05 23:54:38,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-05 23:54:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-05 23:54:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-05 23:54:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-05 23:54:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-05 23:54:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-05 23:54:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-05 23:54:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-05 23:54:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-05 23:54:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-05 23:54:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-05 23:54:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-05 23:54:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-05 23:54:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-05 23:54:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-05 23:54:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-05 23:54:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-05 23:54:38,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-05 23:54:38,438 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-05 23:54:38,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:38 BoogieIcfgContainer [2021-05-05 23:54:38,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-05 23:54:38,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-05 23:54:38,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-05 23:54:38,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-05 23:54:38,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 11:54:37" (1/3) ... [2021-05-05 23:54:38,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64515761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:38, skipping insertion in model container [2021-05-05 23:54:38,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:38" (2/3) ... [2021-05-05 23:54:38,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64515761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:38, skipping insertion in model container [2021-05-05 23:54:38,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:38" (3/3) ... [2021-05-05 23:54:38,444 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2021-05-05 23:54:38,452 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-05 23:54:38,455 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-05 23:54:38,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-05 23:54:38,490 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-05 23:54:38,491 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-05 23:54:38,491 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-05 23:54:38,491 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-05 23:54:38,491 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-05 23:54:38,491 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-05 23:54:38,491 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-05 23:54:38,491 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-05 23:54:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-05 23:54:38,508 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:38,509 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:38,509 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1772946259, now seen corresponding path program 1 times [2021-05-05 23:54:38,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:38,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713778969] [2021-05-05 23:54:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:38,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:38,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:38,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713778969] [2021-05-05 23:54:38,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713778969] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:38,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:38,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:38,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112109141] [2021-05-05 23:54:38,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:38,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:38,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:38,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:38,809 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:39,421 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2021-05-05 23:54:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:39,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-05 23:54:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:39,434 INFO L225 Difference]: With dead ends: 88 [2021-05-05 23:54:39,434 INFO L226 Difference]: Without dead ends: 47 [2021-05-05 23:54:39,436 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 254.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-05 23:54:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2021-05-05 23:54:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-05-05 23:54:39,467 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2021-05-05 23:54:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:39,467 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-05-05 23:54:39,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-05-05 23:54:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-05 23:54:39,468 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:39,468 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:39,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-05 23:54:39,469 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:39,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1794902226, now seen corresponding path program 1 times [2021-05-05 23:54:39,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:39,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681083805] [2021-05-05 23:54:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:39,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:39,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:39,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681083805] [2021-05-05 23:54:39,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681083805] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:39,579 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:39,579 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:39,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908067471] [2021-05-05 23:54:39,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:39,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:39,582 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:39,936 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2021-05-05 23:54:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:39,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-05 23:54:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:39,938 INFO L225 Difference]: With dead ends: 55 [2021-05-05 23:54:39,938 INFO L226 Difference]: Without dead ends: 53 [2021-05-05 23:54:39,939 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 151.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-05 23:54:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-05-05 23:54:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2021-05-05 23:54:39,946 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2021-05-05 23:54:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:39,947 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2021-05-05 23:54:39,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2021-05-05 23:54:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-05 23:54:39,947 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:39,947 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:39,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-05 23:54:39,948 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:39,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:39,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1560251136, now seen corresponding path program 1 times [2021-05-05 23:54:39,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:39,948 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285519351] [2021-05-05 23:54:39,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-05 23:54:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-05 23:54:40,051 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:40,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285519351] [2021-05-05 23:54:40,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285519351] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:40,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:40,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:40,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169430247] [2021-05-05 23:54:40,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:40,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:40,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:40,053 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-05 23:54:40,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:40,373 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2021-05-05 23:54:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:40,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2021-05-05 23:54:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:40,374 INFO L225 Difference]: With dead ends: 57 [2021-05-05 23:54:40,374 INFO L226 Difference]: Without dead ends: 55 [2021-05-05 23:54:40,374 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 144.6ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-05 23:54:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-05 23:54:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2021-05-05 23:54:40,381 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2021-05-05 23:54:40,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:40,381 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2021-05-05 23:54:40,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-05 23:54:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2021-05-05 23:54:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-05 23:54:40,382 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:40,382 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:40,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-05 23:54:40,382 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1084781042, now seen corresponding path program 1 times [2021-05-05 23:54:40,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:40,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622951159] [2021-05-05 23:54:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-05 23:54:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-05 23:54:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-05 23:54:40,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:40,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622951159] [2021-05-05 23:54:40,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622951159] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:40,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:40,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:40,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963386544] [2021-05-05 23:54:40,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:40,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:40,460 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-05 23:54:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:40,857 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2021-05-05 23:54:40,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:54:40,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-05 23:54:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:40,858 INFO L225 Difference]: With dead ends: 61 [2021-05-05 23:54:40,859 INFO L226 Difference]: Without dead ends: 59 [2021-05-05 23:54:40,859 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 189.6ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-05 23:54:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-05 23:54:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-05 23:54:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2021-05-05 23:54:40,866 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2021-05-05 23:54:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:40,866 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2021-05-05 23:54:40,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-05 23:54:40,867 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2021-05-05 23:54:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-05 23:54:40,867 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:40,867 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:40,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-05 23:54:40,868 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1893905473, now seen corresponding path program 1 times [2021-05-05 23:54:40,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:40,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482097388] [2021-05-05 23:54:40,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-05 23:54:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-05 23:54:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-05-05 23:54:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-05 23:54:40,958 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:40,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482097388] [2021-05-05 23:54:40,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482097388] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:40,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:40,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:40,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709526342] [2021-05-05 23:54:40,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:40,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:40,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:40,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:40,959 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-05 23:54:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:41,269 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2021-05-05 23:54:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-05-05 23:54:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:41,270 INFO L225 Difference]: With dead ends: 66 [2021-05-05 23:54:41,270 INFO L226 Difference]: Without dead ends: 64 [2021-05-05 23:54:41,271 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 117.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-05 23:54:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-05-05 23:54:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2021-05-05 23:54:41,277 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2021-05-05 23:54:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:41,278 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2021-05-05 23:54:41,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-05 23:54:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2021-05-05 23:54:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-05 23:54:41,279 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:41,279 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:41,279 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-05 23:54:41,279 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1991737873, now seen corresponding path program 1 times [2021-05-05 23:54:41,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:41,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299494130] [2021-05-05 23:54:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-05 23:54:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-05 23:54:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-05 23:54:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-05 23:54:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-05 23:54:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-05 23:54:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-05-05 23:54:41,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:41,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299494130] [2021-05-05 23:54:41,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299494130] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:41,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:41,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:41,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427948737] [2021-05-05 23:54:41,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:41,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:41,400 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-05 23:54:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:41,753 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2021-05-05 23:54:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-05 23:54:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2021-05-05 23:54:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:41,755 INFO L225 Difference]: With dead ends: 75 [2021-05-05 23:54:41,755 INFO L226 Difference]: Without dead ends: 73 [2021-05-05 23:54:41,755 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 156.3ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-05 23:54:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-05 23:54:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2021-05-05 23:54:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2021-05-05 23:54:41,763 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2021-05-05 23:54:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:41,763 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2021-05-05 23:54:41,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-05-05 23:54:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2021-05-05 23:54:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-05 23:54:41,765 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:41,765 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:41,765 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-05 23:54:41,765 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:41,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:41,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1947441265, now seen corresponding path program 1 times [2021-05-05 23:54:41,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:41,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817635363] [2021-05-05 23:54:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-05 23:54:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-05 23:54:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-05 23:54:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-05 23:54:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-05 23:54:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-05 23:54:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-05 23:54:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-05 23:54:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-05-05 23:54:41,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:41,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817635363] [2021-05-05 23:54:41,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817635363] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:41,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:41,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-05 23:54:41,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637955346] [2021-05-05 23:54:41,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-05 23:54:41,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-05 23:54:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-05 23:54:41,902 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-05 23:54:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:42,286 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2021-05-05 23:54:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-05 23:54:42,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2021-05-05 23:54:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:42,287 INFO L225 Difference]: With dead ends: 75 [2021-05-05 23:54:42,288 INFO L226 Difference]: Without dead ends: 73 [2021-05-05 23:54:42,288 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 180.8ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-05-05 23:54:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-05 23:54:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2021-05-05 23:54:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2021-05-05 23:54:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2021-05-05 23:54:42,307 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2021-05-05 23:54:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:42,307 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2021-05-05 23:54:42,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-05 23:54:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2021-05-05 23:54:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-05 23:54:42,308 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:42,309 INFO L523 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:42,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-05 23:54:42,309 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-05 23:54:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1358511123, now seen corresponding path program 1 times [2021-05-05 23:54:42,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:42,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033224097] [2021-05-05 23:54:42,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-05-05 23:54:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-05-05 23:54:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-05 23:54:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-05 23:54:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-05-05 23:54:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-05-05 23:54:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-05-05 23:54:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-05-05 23:54:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-05 23:54:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-05 23:54:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-05-05 23:54:42,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:42,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033224097] [2021-05-05 23:54:42,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033224097] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:42,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:42,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-05 23:54:42,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876277444] [2021-05-05 23:54:42,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-05 23:54:42,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-05 23:54:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:42,450 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-05-05 23:54:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:42,875 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2021-05-05 23:54:42,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-05 23:54:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2021-05-05 23:54:42,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:42,876 INFO L225 Difference]: With dead ends: 73 [2021-05-05 23:54:42,876 INFO L226 Difference]: Without dead ends: 0 [2021-05-05 23:54:42,877 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 234.1ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-05-05 23:54:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-05 23:54:42,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-05 23:54:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-05 23:54:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-05 23:54:42,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2021-05-05 23:54:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:42,877 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-05 23:54:42,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-05-05 23:54:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-05 23:54:42,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-05 23:54:42,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-05 23:54:42,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-05 23:54:43,718 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-05 23:54:43,718 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-05 23:54:43,718 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-05 23:54:43,718 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:43,718 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-05 23:54:43,718 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:43,718 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:43,718 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-05 23:54:43,718 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L194 CegarLoopUtils]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point L31(line 31) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point L60(line 60) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 24 67) no Hoare annotation was computed. [2021-05-05 23:54:43,719 INFO L194 CegarLoopUtils]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,719 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,719 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,719 INFO L194 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,719 INFO L194 CegarLoopUtils]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,719 INFO L194 CegarLoopUtils]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L198 CegarLoopUtils]: For program point L36(lines 36 63) no Hoare annotation was computed. [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L198 CegarLoopUtils]: For program point L53(line 53) no Hoare annotation was computed. [2021-05-05 23:54:43,720 INFO L198 CegarLoopUtils]: For program point L49(line 49) no Hoare annotation was computed. [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 24 67) no Hoare annotation was computed. [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (< (+ main_~i~0 1) main_~len~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L198 CegarLoopUtils]: For program point L38(line 38) no Hoare annotation was computed. [2021-05-05 23:54:43,720 INFO L194 CegarLoopUtils]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,720 INFO L198 CegarLoopUtils]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2021-05-05 23:54:43,721 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2021-05-05 23:54:43,721 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~j~0 5) main_~bufsize~0) (<= 0 main_~j~0) (< main_~i~0 main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,721 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~j~0 4) main_~bufsize~0)) [2021-05-05 23:54:43,721 INFO L198 CegarLoopUtils]: For program point L43(line 43) no Hoare annotation was computed. [2021-05-05 23:54:43,721 INFO L198 CegarLoopUtils]: For program point L39(line 39) no Hoare annotation was computed. [2021-05-05 23:54:43,721 INFO L198 CegarLoopUtils]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2021-05-05 23:54:43,721 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-05 23:54:43,721 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2021-05-05 23:54:43,721 INFO L198 CegarLoopUtils]: For program point L19(line 19) no Hoare annotation was computed. [2021-05-05 23:54:43,721 INFO L198 CegarLoopUtils]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-05-05 23:54:43,721 INFO L198 CegarLoopUtils]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-05-05 23:54:43,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 11:54:43 BoogieIcfgContainer [2021-05-05 23:54:43,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-05 23:54:43,731 INFO L168 Benchmark]: Toolchain (without parser) took 5797.48 ms. Allocated memory was 127.9 MB in the beginning and 176.2 MB in the end (delta: 48.2 MB). Free memory was 103.9 MB in the beginning and 67.8 MB in the end (delta: 36.1 MB). Peak memory consumption was 96.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:43,731 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 127.9 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-05 23:54:43,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.53 ms. Allocated memory is still 127.9 MB. Free memory was 103.9 MB in the beginning and 109.7 MB in the end (delta: -5.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:43,732 INFO L168 Benchmark]: Boogie Preprocessor took 21.57 ms. Allocated memory is still 127.9 MB. Free memory was 109.7 MB in the beginning and 108.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:43,732 INFO L168 Benchmark]: RCFGBuilder took 321.63 ms. Allocated memory is still 127.9 MB. Free memory was 108.1 MB in the beginning and 90.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:43,732 INFO L168 Benchmark]: TraceAbstraction took 5290.51 ms. Allocated memory was 127.9 MB in the beginning and 176.2 MB in the end (delta: 48.2 MB). Free memory was 89.8 MB in the beginning and 67.8 MB in the end (delta: 22.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:43,733 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 127.9 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 159.53 ms. Allocated memory is still 127.9 MB. Free memory was 103.9 MB in the beginning and 109.7 MB in the end (delta: -5.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 21.57 ms. Allocated memory is still 127.9 MB. Free memory was 109.7 MB in the beginning and 108.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 321.63 ms. Allocated memory is still 127.9 MB. Free memory was 108.1 MB in the beginning and 90.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5290.51 ms. Allocated memory was 127.9 MB in the beginning and 176.2 MB in the end (delta: 48.2 MB). Free memory was 89.8 MB in the beginning and 67.8 MB in the end (delta: 22.0 MB). Peak memory consumption was 83.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4389.2ms, OverallIterations: 8, TraceHistogramMax: 11, EmptinessCheckTime: 10.8ms, AutomataDifference: 3200.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 839.5ms, InitialAbstractionConstructionTime: 10.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 286 SDtfs, 247 SDslu, 491 SDs, 0 SdLazy, 1162 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1534.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1429.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 77.0ms AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 384 HoareAnnotationTreeSize, 55 FomulaSimplifications, 3224 FormulaSimplificationTreeSizeReduction, 117.0ms HoareSimplificationTime, 23 FomulaSimplificationsInter, 697 FormulaSimplificationTreeSizeReductionInter, 713.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 19.0ms SsaConstructionTime, 90.3ms SatisfiabilityAnalysisTime, 870.9ms InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((j + 5 <= bufsize && 0 <= j) && i < len) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize RESULT: Ultimate proved your program to be correct! Received shutdown request...