/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 18:55:59,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 18:55:59,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 18:55:59,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 18:55:59,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 18:55:59,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 18:55:59,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 18:55:59,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 18:55:59,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 18:55:59,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 18:55:59,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 18:55:59,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 18:55:59,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 18:55:59,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 18:55:59,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 18:55:59,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 18:55:59,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 18:55:59,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 18:55:59,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 18:55:59,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 18:55:59,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 18:55:59,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 18:55:59,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 18:55:59,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 18:55:59,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 18:55:59,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 18:55:59,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 18:55:59,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 18:55:59,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 18:55:59,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 18:55:59,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 18:55:59,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 18:55:59,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 18:55:59,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 18:55:59,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 18:55:59,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 18:55:59,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 18:55:59,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 18:55:59,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 18:55:59,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 18:55:59,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 18:55:59,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 18:55:59,905 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 18:55:59,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 18:55:59,907 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 18:55:59,907 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 18:55:59,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 18:55:59,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 18:55:59,908 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 18:55:59,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 18:55:59,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 18:55:59,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 18:55:59,908 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 18:55:59,908 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 18:55:59,909 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 18:55:59,909 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 18:55:59,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 18:55:59,909 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 18:55:59,909 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 18:55:59,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 18:55:59,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 18:55:59,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 18:55:59,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 18:55:59,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 18:55:59,911 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 18:56:00,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 18:56:00,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 18:56:00,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 18:56:00,188 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 18:56:00,189 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 18:56:00,190 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-07-10 18:56:00,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3274cd3f/35f19d47982a454e96edb944fa50eac4/FLAG0854b6cab [2020-07-10 18:56:00,726 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 18:56:00,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-10 18:56:00,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3274cd3f/35f19d47982a454e96edb944fa50eac4/FLAG0854b6cab [2020-07-10 18:56:01,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3274cd3f/35f19d47982a454e96edb944fa50eac4 [2020-07-10 18:56:01,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 18:56:01,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 18:56:01,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 18:56:01,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 18:56:01,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 18:56:01,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be4e3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01, skipping insertion in model container [2020-07-10 18:56:01,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 18:56:01,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 18:56:01,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:56:01,374 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 18:56:01,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 18:56:01,433 INFO L208 MainTranslator]: Completed translation [2020-07-10 18:56:01,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01 WrapperNode [2020-07-10 18:56:01,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 18:56:01,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 18:56:01,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 18:56:01,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 18:56:01,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (1/1) ... [2020-07-10 18:56:01,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 18:56:01,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 18:56:01,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 18:56:01,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 18:56:01,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (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 [2020-07-10 18:56:01,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 18:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 18:56:01,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 18:56:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 18:56:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 18:56:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 18:56:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 18:56:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 18:56:02,174 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 18:56:02,174 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 18:56:02,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:56:02 BoogieIcfgContainer [2020-07-10 18:56:02,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 18:56:02,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 18:56:02,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 18:56:02,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 18:56:02,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:56:01" (1/3) ... [2020-07-10 18:56:02,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39096b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:56:02, skipping insertion in model container [2020-07-10 18:56:02,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:56:01" (2/3) ... [2020-07-10 18:56:02,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39096b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:56:02, skipping insertion in model container [2020-07-10 18:56:02,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:56:02" (3/3) ... [2020-07-10 18:56:02,187 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-10 18:56:02,199 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 18:56:02,208 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 18:56:02,223 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 18:56:02,246 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 18:56:02,246 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 18:56:02,246 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 18:56:02,247 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 18:56:02,247 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 18:56:02,247 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 18:56:02,247 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 18:56:02,247 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 18:56:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-10 18:56:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 18:56:02,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:02,280 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:02,280 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-10 18:56:02,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:02,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1704686879] [2020-07-10 18:56:02,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:02,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-10 18:56:02,524 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-10 18:56:02,526 INFO L263 TraceCheckUtils]: 0: Hoare triple {81#true} call ULTIMATE.init(); {81#true} is VALID [2020-07-10 18:56:02,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-10 18:56:02,527 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81#true} {81#true} #175#return; {81#true} is VALID [2020-07-10 18:56:02,528 INFO L263 TraceCheckUtils]: 3: Hoare triple {81#true} call #t~ret7 := main(); {81#true} is VALID [2020-07-10 18:56:02,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {81#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {81#true} is VALID [2020-07-10 18:56:02,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {81#true} ~p1~0 := #t~nondet0; {81#true} is VALID [2020-07-10 18:56:02,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {81#true} havoc #t~nondet0; {81#true} is VALID [2020-07-10 18:56:02,530 INFO L280 TraceCheckUtils]: 7: Hoare triple {81#true} havoc ~lk1~0; {81#true} is VALID [2020-07-10 18:56:02,530 INFO L280 TraceCheckUtils]: 8: Hoare triple {81#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {81#true} is VALID [2020-07-10 18:56:02,531 INFO L280 TraceCheckUtils]: 9: Hoare triple {81#true} ~p2~0 := #t~nondet1; {81#true} is VALID [2020-07-10 18:56:02,531 INFO L280 TraceCheckUtils]: 10: Hoare triple {81#true} havoc #t~nondet1; {81#true} is VALID [2020-07-10 18:56:02,531 INFO L280 TraceCheckUtils]: 11: Hoare triple {81#true} havoc ~lk2~0; {81#true} is VALID [2020-07-10 18:56:02,532 INFO L280 TraceCheckUtils]: 12: Hoare triple {81#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {81#true} is VALID [2020-07-10 18:56:02,532 INFO L280 TraceCheckUtils]: 13: Hoare triple {81#true} ~p3~0 := #t~nondet2; {81#true} is VALID [2020-07-10 18:56:02,533 INFO L280 TraceCheckUtils]: 14: Hoare triple {81#true} havoc #t~nondet2; {81#true} is VALID [2020-07-10 18:56:02,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {81#true} havoc ~lk3~0; {81#true} is VALID [2020-07-10 18:56:02,534 INFO L280 TraceCheckUtils]: 16: Hoare triple {81#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {81#true} is VALID [2020-07-10 18:56:02,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {81#true} ~p4~0 := #t~nondet3; {81#true} is VALID [2020-07-10 18:56:02,535 INFO L280 TraceCheckUtils]: 18: Hoare triple {81#true} havoc #t~nondet3; {81#true} is VALID [2020-07-10 18:56:02,535 INFO L280 TraceCheckUtils]: 19: Hoare triple {81#true} havoc ~lk4~0; {81#true} is VALID [2020-07-10 18:56:02,536 INFO L280 TraceCheckUtils]: 20: Hoare triple {81#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {81#true} is VALID [2020-07-10 18:56:02,536 INFO L280 TraceCheckUtils]: 21: Hoare triple {81#true} ~p5~0 := #t~nondet4; {81#true} is VALID [2020-07-10 18:56:02,536 INFO L280 TraceCheckUtils]: 22: Hoare triple {81#true} havoc #t~nondet4; {81#true} is VALID [2020-07-10 18:56:02,537 INFO L280 TraceCheckUtils]: 23: Hoare triple {81#true} havoc ~lk5~0; {81#true} is VALID [2020-07-10 18:56:02,537 INFO L280 TraceCheckUtils]: 24: Hoare triple {81#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {81#true} is VALID [2020-07-10 18:56:02,538 INFO L280 TraceCheckUtils]: 25: Hoare triple {81#true} ~p6~0 := #t~nondet5; {81#true} is VALID [2020-07-10 18:56:02,538 INFO L280 TraceCheckUtils]: 26: Hoare triple {81#true} havoc #t~nondet5; {81#true} is VALID [2020-07-10 18:56:02,539 INFO L280 TraceCheckUtils]: 27: Hoare triple {81#true} havoc ~lk6~0; {81#true} is VALID [2020-07-10 18:56:02,539 INFO L280 TraceCheckUtils]: 28: Hoare triple {81#true} havoc ~cond~0; {81#true} is VALID [2020-07-10 18:56:02,539 INFO L280 TraceCheckUtils]: 29: Hoare triple {81#true} assume !false; {81#true} is VALID [2020-07-10 18:56:02,540 INFO L280 TraceCheckUtils]: 30: Hoare triple {81#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {81#true} is VALID [2020-07-10 18:56:02,540 INFO L280 TraceCheckUtils]: 31: Hoare triple {81#true} ~cond~0 := #t~nondet6; {81#true} is VALID [2020-07-10 18:56:02,541 INFO L280 TraceCheckUtils]: 32: Hoare triple {81#true} havoc #t~nondet6; {81#true} is VALID [2020-07-10 18:56:02,541 INFO L280 TraceCheckUtils]: 33: Hoare triple {81#true} assume !(0 == ~cond~0); {81#true} is VALID [2020-07-10 18:56:02,542 INFO L280 TraceCheckUtils]: 34: Hoare triple {81#true} ~lk1~0 := 0; {81#true} is VALID [2020-07-10 18:56:02,542 INFO L280 TraceCheckUtils]: 35: Hoare triple {81#true} ~lk2~0 := 0; {81#true} is VALID [2020-07-10 18:56:02,542 INFO L280 TraceCheckUtils]: 36: Hoare triple {81#true} ~lk3~0 := 0; {81#true} is VALID [2020-07-10 18:56:02,543 INFO L280 TraceCheckUtils]: 37: Hoare triple {81#true} ~lk4~0 := 0; {81#true} is VALID [2020-07-10 18:56:02,543 INFO L280 TraceCheckUtils]: 38: Hoare triple {81#true} ~lk5~0 := 0; {81#true} is VALID [2020-07-10 18:56:02,544 INFO L280 TraceCheckUtils]: 39: Hoare triple {81#true} ~lk6~0 := 0; {81#true} is VALID [2020-07-10 18:56:02,545 INFO L280 TraceCheckUtils]: 40: Hoare triple {81#true} assume !(0 != ~p1~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:02,556 INFO L280 TraceCheckUtils]: 41: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:02,557 INFO L280 TraceCheckUtils]: 42: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:02,560 INFO L280 TraceCheckUtils]: 43: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:02,561 INFO L280 TraceCheckUtils]: 44: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:02,562 INFO L280 TraceCheckUtils]: 45: Hoare triple {85#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {85#(= 0 main_~p1~0)} is VALID [2020-07-10 18:56:02,563 INFO L280 TraceCheckUtils]: 46: Hoare triple {85#(= 0 main_~p1~0)} assume 0 != ~p1~0; {82#false} is VALID [2020-07-10 18:56:02,563 INFO L280 TraceCheckUtils]: 47: Hoare triple {82#false} assume 1 != ~lk1~0; {82#false} is VALID [2020-07-10 18:56:02,564 INFO L280 TraceCheckUtils]: 48: Hoare triple {82#false} assume !false; {82#false} is VALID [2020-07-10 18:56:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:02,581 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:02,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1704686879] [2020-07-10 18:56:02,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:02,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:02,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618526323] [2020-07-10 18:56:02,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-10 18:56:02,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:02,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:02,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:02,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:02,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:02,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:02,698 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-10 18:56:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:03,125 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-10 18:56:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:03,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-10 18:56:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-10 18:56:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-07-10 18:56:03,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 229 transitions. [2020-07-10 18:56:03,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:03,467 INFO L225 Difference]: With dead ends: 169 [2020-07-10 18:56:03,467 INFO L226 Difference]: Without dead ends: 112 [2020-07-10 18:56:03,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-10 18:56:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-10 18:56:03,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:03,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2020-07-10 18:56:03,596 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2020-07-10 18:56:03,596 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2020-07-10 18:56:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:03,607 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-10 18:56:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-10 18:56:03,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:03,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:03,609 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2020-07-10 18:56:03,609 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2020-07-10 18:56:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:03,620 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2020-07-10 18:56:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2020-07-10 18:56:03,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:03,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:03,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:03,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:03,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-10 18:56:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-10 18:56:03,631 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-10 18:56:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:03,631 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-10 18:56:03,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:03,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 142 transitions. [2020-07-10 18:56:03,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-10 18:56:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 18:56:03,808 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:03,809 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:03,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 18:56:03,809 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:03,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-10 18:56:03,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:03,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33177954] [2020-07-10 18:56:03,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:03,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-10 18:56:03,883 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-10 18:56:03,884 INFO L263 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2020-07-10 18:56:03,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {870#true} assume true; {870#true} is VALID [2020-07-10 18:56:03,884 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {870#true} {870#true} #175#return; {870#true} is VALID [2020-07-10 18:56:03,885 INFO L263 TraceCheckUtils]: 3: Hoare triple {870#true} call #t~ret7 := main(); {870#true} is VALID [2020-07-10 18:56:03,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {870#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {870#true} is VALID [2020-07-10 18:56:03,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {870#true} ~p1~0 := #t~nondet0; {870#true} is VALID [2020-07-10 18:56:03,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {870#true} havoc #t~nondet0; {870#true} is VALID [2020-07-10 18:56:03,886 INFO L280 TraceCheckUtils]: 7: Hoare triple {870#true} havoc ~lk1~0; {870#true} is VALID [2020-07-10 18:56:03,886 INFO L280 TraceCheckUtils]: 8: Hoare triple {870#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {870#true} is VALID [2020-07-10 18:56:03,887 INFO L280 TraceCheckUtils]: 9: Hoare triple {870#true} ~p2~0 := #t~nondet1; {870#true} is VALID [2020-07-10 18:56:03,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {870#true} havoc #t~nondet1; {870#true} is VALID [2020-07-10 18:56:03,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {870#true} havoc ~lk2~0; {870#true} is VALID [2020-07-10 18:56:03,888 INFO L280 TraceCheckUtils]: 12: Hoare triple {870#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {870#true} is VALID [2020-07-10 18:56:03,888 INFO L280 TraceCheckUtils]: 13: Hoare triple {870#true} ~p3~0 := #t~nondet2; {870#true} is VALID [2020-07-10 18:56:03,889 INFO L280 TraceCheckUtils]: 14: Hoare triple {870#true} havoc #t~nondet2; {870#true} is VALID [2020-07-10 18:56:03,889 INFO L280 TraceCheckUtils]: 15: Hoare triple {870#true} havoc ~lk3~0; {870#true} is VALID [2020-07-10 18:56:03,889 INFO L280 TraceCheckUtils]: 16: Hoare triple {870#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {870#true} is VALID [2020-07-10 18:56:03,890 INFO L280 TraceCheckUtils]: 17: Hoare triple {870#true} ~p4~0 := #t~nondet3; {870#true} is VALID [2020-07-10 18:56:03,890 INFO L280 TraceCheckUtils]: 18: Hoare triple {870#true} havoc #t~nondet3; {870#true} is VALID [2020-07-10 18:56:03,890 INFO L280 TraceCheckUtils]: 19: Hoare triple {870#true} havoc ~lk4~0; {870#true} is VALID [2020-07-10 18:56:03,891 INFO L280 TraceCheckUtils]: 20: Hoare triple {870#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {870#true} is VALID [2020-07-10 18:56:03,891 INFO L280 TraceCheckUtils]: 21: Hoare triple {870#true} ~p5~0 := #t~nondet4; {870#true} is VALID [2020-07-10 18:56:03,892 INFO L280 TraceCheckUtils]: 22: Hoare triple {870#true} havoc #t~nondet4; {870#true} is VALID [2020-07-10 18:56:03,892 INFO L280 TraceCheckUtils]: 23: Hoare triple {870#true} havoc ~lk5~0; {870#true} is VALID [2020-07-10 18:56:03,892 INFO L280 TraceCheckUtils]: 24: Hoare triple {870#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {870#true} is VALID [2020-07-10 18:56:03,893 INFO L280 TraceCheckUtils]: 25: Hoare triple {870#true} ~p6~0 := #t~nondet5; {870#true} is VALID [2020-07-10 18:56:03,893 INFO L280 TraceCheckUtils]: 26: Hoare triple {870#true} havoc #t~nondet5; {870#true} is VALID [2020-07-10 18:56:03,893 INFO L280 TraceCheckUtils]: 27: Hoare triple {870#true} havoc ~lk6~0; {870#true} is VALID [2020-07-10 18:56:03,894 INFO L280 TraceCheckUtils]: 28: Hoare triple {870#true} havoc ~cond~0; {870#true} is VALID [2020-07-10 18:56:03,894 INFO L280 TraceCheckUtils]: 29: Hoare triple {870#true} assume !false; {870#true} is VALID [2020-07-10 18:56:03,894 INFO L280 TraceCheckUtils]: 30: Hoare triple {870#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {870#true} is VALID [2020-07-10 18:56:03,895 INFO L280 TraceCheckUtils]: 31: Hoare triple {870#true} ~cond~0 := #t~nondet6; {870#true} is VALID [2020-07-10 18:56:03,895 INFO L280 TraceCheckUtils]: 32: Hoare triple {870#true} havoc #t~nondet6; {870#true} is VALID [2020-07-10 18:56:03,895 INFO L280 TraceCheckUtils]: 33: Hoare triple {870#true} assume !(0 == ~cond~0); {870#true} is VALID [2020-07-10 18:56:03,896 INFO L280 TraceCheckUtils]: 34: Hoare triple {870#true} ~lk1~0 := 0; {870#true} is VALID [2020-07-10 18:56:03,896 INFO L280 TraceCheckUtils]: 35: Hoare triple {870#true} ~lk2~0 := 0; {870#true} is VALID [2020-07-10 18:56:03,896 INFO L280 TraceCheckUtils]: 36: Hoare triple {870#true} ~lk3~0 := 0; {870#true} is VALID [2020-07-10 18:56:03,897 INFO L280 TraceCheckUtils]: 37: Hoare triple {870#true} ~lk4~0 := 0; {870#true} is VALID [2020-07-10 18:56:03,897 INFO L280 TraceCheckUtils]: 38: Hoare triple {870#true} ~lk5~0 := 0; {870#true} is VALID [2020-07-10 18:56:03,898 INFO L280 TraceCheckUtils]: 39: Hoare triple {870#true} ~lk6~0 := 0; {870#true} is VALID [2020-07-10 18:56:03,898 INFO L280 TraceCheckUtils]: 40: Hoare triple {870#true} assume 0 != ~p1~0; {870#true} is VALID [2020-07-10 18:56:03,899 INFO L280 TraceCheckUtils]: 41: Hoare triple {870#true} ~lk1~0 := 1; {874#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:03,900 INFO L280 TraceCheckUtils]: 42: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:03,901 INFO L280 TraceCheckUtils]: 43: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:03,902 INFO L280 TraceCheckUtils]: 44: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:03,903 INFO L280 TraceCheckUtils]: 45: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:03,904 INFO L280 TraceCheckUtils]: 46: Hoare triple {874#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {874#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:03,904 INFO L280 TraceCheckUtils]: 47: Hoare triple {874#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {874#(= 1 main_~lk1~0)} is VALID [2020-07-10 18:56:03,905 INFO L280 TraceCheckUtils]: 48: Hoare triple {874#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {871#false} is VALID [2020-07-10 18:56:03,906 INFO L280 TraceCheckUtils]: 49: Hoare triple {871#false} assume !false; {871#false} is VALID [2020-07-10 18:56:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:03,910 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:03,911 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33177954] [2020-07-10 18:56:03,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:03,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:03,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324003253] [2020-07-10 18:56:03,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 18:56:03,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:03,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:03,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:03,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:03,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:03,977 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-10 18:56:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:04,257 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-10 18:56:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:04,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 18:56:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 18:56:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2020-07-10 18:56:04,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2020-07-10 18:56:04,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:04,403 INFO L225 Difference]: With dead ends: 135 [2020-07-10 18:56:04,403 INFO L226 Difference]: Without dead ends: 133 [2020-07-10 18:56:04,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-10 18:56:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-10 18:56:04,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:04,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 110 states. [2020-07-10 18:56:04,498 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 110 states. [2020-07-10 18:56:04,498 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 110 states. [2020-07-10 18:56:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:04,505 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-10 18:56:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-10 18:56:04,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:04,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:04,507 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 133 states. [2020-07-10 18:56:04,507 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 133 states. [2020-07-10 18:56:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:04,515 INFO L93 Difference]: Finished difference Result 133 states and 173 transitions. [2020-07-10 18:56:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 173 transitions. [2020-07-10 18:56:04,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:04,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:04,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:04,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-10 18:56:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-10 18:56:04,522 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-10 18:56:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:04,522 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-10 18:56:04,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:04,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 141 transitions. [2020-07-10 18:56:04,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-10 18:56:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 18:56:04,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:04,682 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:04,682 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 18:56:04,682 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:04,683 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-10 18:56:04,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:04,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [999159661] [2020-07-10 18:56:04,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:04,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-10 18:56:04,780 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-10 18:56:04,780 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-10 18:56:04,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-10 18:56:04,780 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #175#return; {1633#true} is VALID [2020-07-10 18:56:04,781 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret7 := main(); {1633#true} is VALID [2020-07-10 18:56:04,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {1633#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1633#true} is VALID [2020-07-10 18:56:04,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {1633#true} ~p1~0 := #t~nondet0; {1633#true} is VALID [2020-07-10 18:56:04,782 INFO L280 TraceCheckUtils]: 6: Hoare triple {1633#true} havoc #t~nondet0; {1633#true} is VALID [2020-07-10 18:56:04,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {1633#true} havoc ~lk1~0; {1633#true} is VALID [2020-07-10 18:56:04,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {1633#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1633#true} is VALID [2020-07-10 18:56:04,783 INFO L280 TraceCheckUtils]: 9: Hoare triple {1633#true} ~p2~0 := #t~nondet1; {1633#true} is VALID [2020-07-10 18:56:04,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {1633#true} havoc #t~nondet1; {1633#true} is VALID [2020-07-10 18:56:04,784 INFO L280 TraceCheckUtils]: 11: Hoare triple {1633#true} havoc ~lk2~0; {1633#true} is VALID [2020-07-10 18:56:04,784 INFO L280 TraceCheckUtils]: 12: Hoare triple {1633#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1633#true} is VALID [2020-07-10 18:56:04,785 INFO L280 TraceCheckUtils]: 13: Hoare triple {1633#true} ~p3~0 := #t~nondet2; {1633#true} is VALID [2020-07-10 18:56:04,785 INFO L280 TraceCheckUtils]: 14: Hoare triple {1633#true} havoc #t~nondet2; {1633#true} is VALID [2020-07-10 18:56:04,792 INFO L280 TraceCheckUtils]: 15: Hoare triple {1633#true} havoc ~lk3~0; {1633#true} is VALID [2020-07-10 18:56:04,793 INFO L280 TraceCheckUtils]: 16: Hoare triple {1633#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1633#true} is VALID [2020-07-10 18:56:04,793 INFO L280 TraceCheckUtils]: 17: Hoare triple {1633#true} ~p4~0 := #t~nondet3; {1633#true} is VALID [2020-07-10 18:56:04,793 INFO L280 TraceCheckUtils]: 18: Hoare triple {1633#true} havoc #t~nondet3; {1633#true} is VALID [2020-07-10 18:56:04,794 INFO L280 TraceCheckUtils]: 19: Hoare triple {1633#true} havoc ~lk4~0; {1633#true} is VALID [2020-07-10 18:56:04,794 INFO L280 TraceCheckUtils]: 20: Hoare triple {1633#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1633#true} is VALID [2020-07-10 18:56:04,794 INFO L280 TraceCheckUtils]: 21: Hoare triple {1633#true} ~p5~0 := #t~nondet4; {1633#true} is VALID [2020-07-10 18:56:04,795 INFO L280 TraceCheckUtils]: 22: Hoare triple {1633#true} havoc #t~nondet4; {1633#true} is VALID [2020-07-10 18:56:04,795 INFO L280 TraceCheckUtils]: 23: Hoare triple {1633#true} havoc ~lk5~0; {1633#true} is VALID [2020-07-10 18:56:04,795 INFO L280 TraceCheckUtils]: 24: Hoare triple {1633#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1633#true} is VALID [2020-07-10 18:56:04,796 INFO L280 TraceCheckUtils]: 25: Hoare triple {1633#true} ~p6~0 := #t~nondet5; {1633#true} is VALID [2020-07-10 18:56:04,796 INFO L280 TraceCheckUtils]: 26: Hoare triple {1633#true} havoc #t~nondet5; {1633#true} is VALID [2020-07-10 18:56:04,796 INFO L280 TraceCheckUtils]: 27: Hoare triple {1633#true} havoc ~lk6~0; {1633#true} is VALID [2020-07-10 18:56:04,796 INFO L280 TraceCheckUtils]: 28: Hoare triple {1633#true} havoc ~cond~0; {1633#true} is VALID [2020-07-10 18:56:04,797 INFO L280 TraceCheckUtils]: 29: Hoare triple {1633#true} assume !false; {1633#true} is VALID [2020-07-10 18:56:04,797 INFO L280 TraceCheckUtils]: 30: Hoare triple {1633#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1633#true} is VALID [2020-07-10 18:56:04,800 INFO L280 TraceCheckUtils]: 31: Hoare triple {1633#true} ~cond~0 := #t~nondet6; {1633#true} is VALID [2020-07-10 18:56:04,801 INFO L280 TraceCheckUtils]: 32: Hoare triple {1633#true} havoc #t~nondet6; {1633#true} is VALID [2020-07-10 18:56:04,801 INFO L280 TraceCheckUtils]: 33: Hoare triple {1633#true} assume !(0 == ~cond~0); {1633#true} is VALID [2020-07-10 18:56:04,801 INFO L280 TraceCheckUtils]: 34: Hoare triple {1633#true} ~lk1~0 := 0; {1633#true} is VALID [2020-07-10 18:56:04,802 INFO L280 TraceCheckUtils]: 35: Hoare triple {1633#true} ~lk2~0 := 0; {1633#true} is VALID [2020-07-10 18:56:04,802 INFO L280 TraceCheckUtils]: 36: Hoare triple {1633#true} ~lk3~0 := 0; {1633#true} is VALID [2020-07-10 18:56:04,802 INFO L280 TraceCheckUtils]: 37: Hoare triple {1633#true} ~lk4~0 := 0; {1633#true} is VALID [2020-07-10 18:56:04,803 INFO L280 TraceCheckUtils]: 38: Hoare triple {1633#true} ~lk5~0 := 0; {1633#true} is VALID [2020-07-10 18:56:04,803 INFO L280 TraceCheckUtils]: 39: Hoare triple {1633#true} ~lk6~0 := 0; {1633#true} is VALID [2020-07-10 18:56:04,806 INFO L280 TraceCheckUtils]: 40: Hoare triple {1633#true} assume !(0 != ~p1~0); {1633#true} is VALID [2020-07-10 18:56:04,812 INFO L280 TraceCheckUtils]: 41: Hoare triple {1633#true} assume !(0 != ~p2~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:04,814 INFO L280 TraceCheckUtils]: 42: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:04,815 INFO L280 TraceCheckUtils]: 43: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:04,815 INFO L280 TraceCheckUtils]: 44: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:04,816 INFO L280 TraceCheckUtils]: 45: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:04,816 INFO L280 TraceCheckUtils]: 46: Hoare triple {1637#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1637#(= 0 main_~p2~0)} is VALID [2020-07-10 18:56:04,817 INFO L280 TraceCheckUtils]: 47: Hoare triple {1637#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1634#false} is VALID [2020-07-10 18:56:04,817 INFO L280 TraceCheckUtils]: 48: Hoare triple {1634#false} assume 1 != ~lk2~0; {1634#false} is VALID [2020-07-10 18:56:04,824 INFO L280 TraceCheckUtils]: 49: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-10 18:56:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:04,826 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:04,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [999159661] [2020-07-10 18:56:04,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:04,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:04,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597373862] [2020-07-10 18:56:04,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 18:56:04,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:04,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:04,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:04,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:04,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:04,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:04,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:04,879 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-10 18:56:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:05,276 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-10 18:56:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:05,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-10 18:56:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:05,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-10 18:56:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-10 18:56:05,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-10 18:56:05,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:05,482 INFO L225 Difference]: With dead ends: 266 [2020-07-10 18:56:05,483 INFO L226 Difference]: Without dead ends: 185 [2020-07-10 18:56:05,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-10 18:56:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-10 18:56:05,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:05,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 183 states. [2020-07-10 18:56:05,710 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 183 states. [2020-07-10 18:56:05,710 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 183 states. [2020-07-10 18:56:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:05,726 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-10 18:56:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-10 18:56:05,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:05,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:05,727 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 185 states. [2020-07-10 18:56:05,727 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 185 states. [2020-07-10 18:56:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:05,742 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2020-07-10 18:56:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2020-07-10 18:56:05,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:05,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:05,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:05,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-10 18:56:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-10 18:56:05,757 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-10 18:56:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:05,757 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-10 18:56:05,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:05,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 183 states and 240 transitions. [2020-07-10 18:56:05,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-10 18:56:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 18:56:05,994 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:05,995 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:05,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 18:56:05,995 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-10 18:56:05,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:05,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [902283649] [2020-07-10 18:56:05,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:06,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-10 18:56:06,041 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-10 18:56:06,041 INFO L263 TraceCheckUtils]: 0: Hoare triple {2908#true} call ULTIMATE.init(); {2908#true} is VALID [2020-07-10 18:56:06,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {2908#true} assume true; {2908#true} is VALID [2020-07-10 18:56:06,041 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2908#true} {2908#true} #175#return; {2908#true} is VALID [2020-07-10 18:56:06,042 INFO L263 TraceCheckUtils]: 3: Hoare triple {2908#true} call #t~ret7 := main(); {2908#true} is VALID [2020-07-10 18:56:06,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {2908#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2908#true} is VALID [2020-07-10 18:56:06,042 INFO L280 TraceCheckUtils]: 5: Hoare triple {2908#true} ~p1~0 := #t~nondet0; {2908#true} is VALID [2020-07-10 18:56:06,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {2908#true} havoc #t~nondet0; {2908#true} is VALID [2020-07-10 18:56:06,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {2908#true} havoc ~lk1~0; {2908#true} is VALID [2020-07-10 18:56:06,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {2908#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2908#true} is VALID [2020-07-10 18:56:06,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {2908#true} ~p2~0 := #t~nondet1; {2908#true} is VALID [2020-07-10 18:56:06,043 INFO L280 TraceCheckUtils]: 10: Hoare triple {2908#true} havoc #t~nondet1; {2908#true} is VALID [2020-07-10 18:56:06,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {2908#true} havoc ~lk2~0; {2908#true} is VALID [2020-07-10 18:56:06,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {2908#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2908#true} is VALID [2020-07-10 18:56:06,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {2908#true} ~p3~0 := #t~nondet2; {2908#true} is VALID [2020-07-10 18:56:06,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {2908#true} havoc #t~nondet2; {2908#true} is VALID [2020-07-10 18:56:06,044 INFO L280 TraceCheckUtils]: 15: Hoare triple {2908#true} havoc ~lk3~0; {2908#true} is VALID [2020-07-10 18:56:06,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {2908#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2908#true} is VALID [2020-07-10 18:56:06,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {2908#true} ~p4~0 := #t~nondet3; {2908#true} is VALID [2020-07-10 18:56:06,044 INFO L280 TraceCheckUtils]: 18: Hoare triple {2908#true} havoc #t~nondet3; {2908#true} is VALID [2020-07-10 18:56:06,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {2908#true} havoc ~lk4~0; {2908#true} is VALID [2020-07-10 18:56:06,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {2908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2908#true} is VALID [2020-07-10 18:56:06,045 INFO L280 TraceCheckUtils]: 21: Hoare triple {2908#true} ~p5~0 := #t~nondet4; {2908#true} is VALID [2020-07-10 18:56:06,045 INFO L280 TraceCheckUtils]: 22: Hoare triple {2908#true} havoc #t~nondet4; {2908#true} is VALID [2020-07-10 18:56:06,045 INFO L280 TraceCheckUtils]: 23: Hoare triple {2908#true} havoc ~lk5~0; {2908#true} is VALID [2020-07-10 18:56:06,046 INFO L280 TraceCheckUtils]: 24: Hoare triple {2908#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2908#true} is VALID [2020-07-10 18:56:06,046 INFO L280 TraceCheckUtils]: 25: Hoare triple {2908#true} ~p6~0 := #t~nondet5; {2908#true} is VALID [2020-07-10 18:56:06,046 INFO L280 TraceCheckUtils]: 26: Hoare triple {2908#true} havoc #t~nondet5; {2908#true} is VALID [2020-07-10 18:56:06,046 INFO L280 TraceCheckUtils]: 27: Hoare triple {2908#true} havoc ~lk6~0; {2908#true} is VALID [2020-07-10 18:56:06,046 INFO L280 TraceCheckUtils]: 28: Hoare triple {2908#true} havoc ~cond~0; {2908#true} is VALID [2020-07-10 18:56:06,046 INFO L280 TraceCheckUtils]: 29: Hoare triple {2908#true} assume !false; {2908#true} is VALID [2020-07-10 18:56:06,047 INFO L280 TraceCheckUtils]: 30: Hoare triple {2908#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {2908#true} is VALID [2020-07-10 18:56:06,047 INFO L280 TraceCheckUtils]: 31: Hoare triple {2908#true} ~cond~0 := #t~nondet6; {2908#true} is VALID [2020-07-10 18:56:06,047 INFO L280 TraceCheckUtils]: 32: Hoare triple {2908#true} havoc #t~nondet6; {2908#true} is VALID [2020-07-10 18:56:06,047 INFO L280 TraceCheckUtils]: 33: Hoare triple {2908#true} assume !(0 == ~cond~0); {2908#true} is VALID [2020-07-10 18:56:06,047 INFO L280 TraceCheckUtils]: 34: Hoare triple {2908#true} ~lk1~0 := 0; {2908#true} is VALID [2020-07-10 18:56:06,048 INFO L280 TraceCheckUtils]: 35: Hoare triple {2908#true} ~lk2~0 := 0; {2908#true} is VALID [2020-07-10 18:56:06,048 INFO L280 TraceCheckUtils]: 36: Hoare triple {2908#true} ~lk3~0 := 0; {2908#true} is VALID [2020-07-10 18:56:06,048 INFO L280 TraceCheckUtils]: 37: Hoare triple {2908#true} ~lk4~0 := 0; {2908#true} is VALID [2020-07-10 18:56:06,048 INFO L280 TraceCheckUtils]: 38: Hoare triple {2908#true} ~lk5~0 := 0; {2908#true} is VALID [2020-07-10 18:56:06,049 INFO L280 TraceCheckUtils]: 39: Hoare triple {2908#true} ~lk6~0 := 0; {2908#true} is VALID [2020-07-10 18:56:06,049 INFO L280 TraceCheckUtils]: 40: Hoare triple {2908#true} assume !(0 != ~p1~0); {2908#true} is VALID [2020-07-10 18:56:06,049 INFO L280 TraceCheckUtils]: 41: Hoare triple {2908#true} assume !(0 != ~p2~0); {2908#true} is VALID [2020-07-10 18:56:06,052 INFO L280 TraceCheckUtils]: 42: Hoare triple {2908#true} assume !(0 != ~p3~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:06,052 INFO L280 TraceCheckUtils]: 43: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:06,053 INFO L280 TraceCheckUtils]: 44: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:06,053 INFO L280 TraceCheckUtils]: 45: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:06,056 INFO L280 TraceCheckUtils]: 46: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:06,058 INFO L280 TraceCheckUtils]: 47: Hoare triple {2912#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {2912#(= 0 main_~p3~0)} is VALID [2020-07-10 18:56:06,061 INFO L280 TraceCheckUtils]: 48: Hoare triple {2912#(= 0 main_~p3~0)} assume 0 != ~p3~0; {2909#false} is VALID [2020-07-10 18:56:06,062 INFO L280 TraceCheckUtils]: 49: Hoare triple {2909#false} assume 1 != ~lk3~0; {2909#false} is VALID [2020-07-10 18:56:06,062 INFO L280 TraceCheckUtils]: 50: Hoare triple {2909#false} assume !false; {2909#false} is VALID [2020-07-10 18:56:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:06,064 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:06,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [902283649] [2020-07-10 18:56:06,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:06,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:06,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298739090] [2020-07-10 18:56:06,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-10 18:56:06,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:06,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:06,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:06,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:06,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:06,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:06,115 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-10 18:56:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:06,765 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-10 18:56:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:06,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-10 18:56:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-10 18:56:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-10 18:56:06,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-10 18:56:06,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:07,001 INFO L225 Difference]: With dead ends: 479 [2020-07-10 18:56:07,001 INFO L226 Difference]: Without dead ends: 325 [2020-07-10 18:56:07,003 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-10 18:56:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-10 18:56:07,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:07,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand 323 states. [2020-07-10 18:56:07,395 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand 323 states. [2020-07-10 18:56:07,395 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 323 states. [2020-07-10 18:56:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:07,409 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-10 18:56:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-10 18:56:07,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:07,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:07,410 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 325 states. [2020-07-10 18:56:07,411 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 325 states. [2020-07-10 18:56:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:07,424 INFO L93 Difference]: Finished difference Result 325 states and 427 transitions. [2020-07-10 18:56:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 427 transitions. [2020-07-10 18:56:07,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:07,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:07,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:07,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-10 18:56:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-10 18:56:07,439 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-10 18:56:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:07,439 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-10 18:56:07,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:07,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 426 transitions. [2020-07-10 18:56:07,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 426 edges. 426 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:07,895 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-10 18:56:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 18:56:07,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:07,897 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:07,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 18:56:07,897 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:07,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:07,898 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-10 18:56:07,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:07,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2098870642] [2020-07-10 18:56:07,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:07,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-10 18:56:07,979 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-10 18:56:07,979 INFO L263 TraceCheckUtils]: 0: Hoare triple {5169#true} call ULTIMATE.init(); {5169#true} is VALID [2020-07-10 18:56:07,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {5169#true} assume true; {5169#true} is VALID [2020-07-10 18:56:07,979 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5169#true} {5169#true} #175#return; {5169#true} is VALID [2020-07-10 18:56:07,980 INFO L263 TraceCheckUtils]: 3: Hoare triple {5169#true} call #t~ret7 := main(); {5169#true} is VALID [2020-07-10 18:56:07,980 INFO L280 TraceCheckUtils]: 4: Hoare triple {5169#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5169#true} is VALID [2020-07-10 18:56:07,980 INFO L280 TraceCheckUtils]: 5: Hoare triple {5169#true} ~p1~0 := #t~nondet0; {5169#true} is VALID [2020-07-10 18:56:07,980 INFO L280 TraceCheckUtils]: 6: Hoare triple {5169#true} havoc #t~nondet0; {5169#true} is VALID [2020-07-10 18:56:07,981 INFO L280 TraceCheckUtils]: 7: Hoare triple {5169#true} havoc ~lk1~0; {5169#true} is VALID [2020-07-10 18:56:07,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {5169#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5169#true} is VALID [2020-07-10 18:56:07,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {5169#true} ~p2~0 := #t~nondet1; {5169#true} is VALID [2020-07-10 18:56:07,981 INFO L280 TraceCheckUtils]: 10: Hoare triple {5169#true} havoc #t~nondet1; {5169#true} is VALID [2020-07-10 18:56:07,982 INFO L280 TraceCheckUtils]: 11: Hoare triple {5169#true} havoc ~lk2~0; {5169#true} is VALID [2020-07-10 18:56:07,982 INFO L280 TraceCheckUtils]: 12: Hoare triple {5169#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5169#true} is VALID [2020-07-10 18:56:07,982 INFO L280 TraceCheckUtils]: 13: Hoare triple {5169#true} ~p3~0 := #t~nondet2; {5169#true} is VALID [2020-07-10 18:56:07,982 INFO L280 TraceCheckUtils]: 14: Hoare triple {5169#true} havoc #t~nondet2; {5169#true} is VALID [2020-07-10 18:56:07,983 INFO L280 TraceCheckUtils]: 15: Hoare triple {5169#true} havoc ~lk3~0; {5169#true} is VALID [2020-07-10 18:56:07,983 INFO L280 TraceCheckUtils]: 16: Hoare triple {5169#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5169#true} is VALID [2020-07-10 18:56:07,983 INFO L280 TraceCheckUtils]: 17: Hoare triple {5169#true} ~p4~0 := #t~nondet3; {5169#true} is VALID [2020-07-10 18:56:07,983 INFO L280 TraceCheckUtils]: 18: Hoare triple {5169#true} havoc #t~nondet3; {5169#true} is VALID [2020-07-10 18:56:07,983 INFO L280 TraceCheckUtils]: 19: Hoare triple {5169#true} havoc ~lk4~0; {5169#true} is VALID [2020-07-10 18:56:07,984 INFO L280 TraceCheckUtils]: 20: Hoare triple {5169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5169#true} is VALID [2020-07-10 18:56:07,984 INFO L280 TraceCheckUtils]: 21: Hoare triple {5169#true} ~p5~0 := #t~nondet4; {5169#true} is VALID [2020-07-10 18:56:07,984 INFO L280 TraceCheckUtils]: 22: Hoare triple {5169#true} havoc #t~nondet4; {5169#true} is VALID [2020-07-10 18:56:07,984 INFO L280 TraceCheckUtils]: 23: Hoare triple {5169#true} havoc ~lk5~0; {5169#true} is VALID [2020-07-10 18:56:07,985 INFO L280 TraceCheckUtils]: 24: Hoare triple {5169#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5169#true} is VALID [2020-07-10 18:56:07,985 INFO L280 TraceCheckUtils]: 25: Hoare triple {5169#true} ~p6~0 := #t~nondet5; {5169#true} is VALID [2020-07-10 18:56:07,985 INFO L280 TraceCheckUtils]: 26: Hoare triple {5169#true} havoc #t~nondet5; {5169#true} is VALID [2020-07-10 18:56:07,985 INFO L280 TraceCheckUtils]: 27: Hoare triple {5169#true} havoc ~lk6~0; {5169#true} is VALID [2020-07-10 18:56:07,985 INFO L280 TraceCheckUtils]: 28: Hoare triple {5169#true} havoc ~cond~0; {5169#true} is VALID [2020-07-10 18:56:07,986 INFO L280 TraceCheckUtils]: 29: Hoare triple {5169#true} assume !false; {5169#true} is VALID [2020-07-10 18:56:07,986 INFO L280 TraceCheckUtils]: 30: Hoare triple {5169#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {5169#true} is VALID [2020-07-10 18:56:07,986 INFO L280 TraceCheckUtils]: 31: Hoare triple {5169#true} ~cond~0 := #t~nondet6; {5169#true} is VALID [2020-07-10 18:56:07,986 INFO L280 TraceCheckUtils]: 32: Hoare triple {5169#true} havoc #t~nondet6; {5169#true} is VALID [2020-07-10 18:56:07,986 INFO L280 TraceCheckUtils]: 33: Hoare triple {5169#true} assume !(0 == ~cond~0); {5169#true} is VALID [2020-07-10 18:56:07,987 INFO L280 TraceCheckUtils]: 34: Hoare triple {5169#true} ~lk1~0 := 0; {5169#true} is VALID [2020-07-10 18:56:07,987 INFO L280 TraceCheckUtils]: 35: Hoare triple {5169#true} ~lk2~0 := 0; {5169#true} is VALID [2020-07-10 18:56:07,987 INFO L280 TraceCheckUtils]: 36: Hoare triple {5169#true} ~lk3~0 := 0; {5169#true} is VALID [2020-07-10 18:56:07,987 INFO L280 TraceCheckUtils]: 37: Hoare triple {5169#true} ~lk4~0 := 0; {5169#true} is VALID [2020-07-10 18:56:07,988 INFO L280 TraceCheckUtils]: 38: Hoare triple {5169#true} ~lk5~0 := 0; {5169#true} is VALID [2020-07-10 18:56:07,988 INFO L280 TraceCheckUtils]: 39: Hoare triple {5169#true} ~lk6~0 := 0; {5169#true} is VALID [2020-07-10 18:56:07,988 INFO L280 TraceCheckUtils]: 40: Hoare triple {5169#true} assume !(0 != ~p1~0); {5169#true} is VALID [2020-07-10 18:56:07,988 INFO L280 TraceCheckUtils]: 41: Hoare triple {5169#true} assume 0 != ~p2~0; {5169#true} is VALID [2020-07-10 18:56:07,990 INFO L280 TraceCheckUtils]: 42: Hoare triple {5169#true} ~lk2~0 := 1; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:07,992 INFO L280 TraceCheckUtils]: 43: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:07,993 INFO L280 TraceCheckUtils]: 44: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:07,994 INFO L280 TraceCheckUtils]: 45: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:07,994 INFO L280 TraceCheckUtils]: 46: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:07,995 INFO L280 TraceCheckUtils]: 47: Hoare triple {5173#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {5173#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:07,996 INFO L280 TraceCheckUtils]: 48: Hoare triple {5173#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {5173#(= 1 main_~lk2~0)} is VALID [2020-07-10 18:56:07,996 INFO L280 TraceCheckUtils]: 49: Hoare triple {5173#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {5170#false} is VALID [2020-07-10 18:56:07,996 INFO L280 TraceCheckUtils]: 50: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2020-07-10 18:56:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:07,998 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:07,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2098870642] [2020-07-10 18:56:07,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:07,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:07,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579363919] [2020-07-10 18:56:07,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-10 18:56:08,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:08,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:08,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:08,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:08,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:08,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:08,046 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-10 18:56:08,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:08,711 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-10 18:56:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:08,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-10 18:56:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-10 18:56:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2020-07-10 18:56:08,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2020-07-10 18:56:08,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:08,868 INFO L225 Difference]: With dead ends: 399 [2020-07-10 18:56:08,868 INFO L226 Difference]: Without dead ends: 397 [2020-07-10 18:56:08,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-10 18:56:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-10 18:56:09,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:09,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand 323 states. [2020-07-10 18:56:09,295 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand 323 states. [2020-07-10 18:56:09,295 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 323 states. [2020-07-10 18:56:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:09,313 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-10 18:56:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-10 18:56:09,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:09,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:09,315 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 397 states. [2020-07-10 18:56:09,315 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 397 states. [2020-07-10 18:56:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:09,331 INFO L93 Difference]: Finished difference Result 397 states and 523 transitions. [2020-07-10 18:56:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2020-07-10 18:56:09,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:09,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:09,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:09,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-10 18:56:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-10 18:56:09,346 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-10 18:56:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:09,346 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-10 18:56:09,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:09,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 422 transitions. [2020-07-10 18:56:09,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-10 18:56:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:56:09,841 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:09,841 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:09,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 18:56:09,842 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:09,843 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-10 18:56:09,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:09,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984590836] [2020-07-10 18:56:09,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:09,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-10 18:56:09,896 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-10 18:56:09,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {7414#true} call ULTIMATE.init(); {7414#true} is VALID [2020-07-10 18:56:09,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {7414#true} assume true; {7414#true} is VALID [2020-07-10 18:56:09,897 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7414#true} {7414#true} #175#return; {7414#true} is VALID [2020-07-10 18:56:09,897 INFO L263 TraceCheckUtils]: 3: Hoare triple {7414#true} call #t~ret7 := main(); {7414#true} is VALID [2020-07-10 18:56:09,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {7414#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7414#true} is VALID [2020-07-10 18:56:09,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {7414#true} ~p1~0 := #t~nondet0; {7414#true} is VALID [2020-07-10 18:56:09,898 INFO L280 TraceCheckUtils]: 6: Hoare triple {7414#true} havoc #t~nondet0; {7414#true} is VALID [2020-07-10 18:56:09,898 INFO L280 TraceCheckUtils]: 7: Hoare triple {7414#true} havoc ~lk1~0; {7414#true} is VALID [2020-07-10 18:56:09,898 INFO L280 TraceCheckUtils]: 8: Hoare triple {7414#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7414#true} is VALID [2020-07-10 18:56:09,899 INFO L280 TraceCheckUtils]: 9: Hoare triple {7414#true} ~p2~0 := #t~nondet1; {7414#true} is VALID [2020-07-10 18:56:09,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {7414#true} havoc #t~nondet1; {7414#true} is VALID [2020-07-10 18:56:09,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {7414#true} havoc ~lk2~0; {7414#true} is VALID [2020-07-10 18:56:09,899 INFO L280 TraceCheckUtils]: 12: Hoare triple {7414#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7414#true} is VALID [2020-07-10 18:56:09,900 INFO L280 TraceCheckUtils]: 13: Hoare triple {7414#true} ~p3~0 := #t~nondet2; {7414#true} is VALID [2020-07-10 18:56:09,900 INFO L280 TraceCheckUtils]: 14: Hoare triple {7414#true} havoc #t~nondet2; {7414#true} is VALID [2020-07-10 18:56:09,900 INFO L280 TraceCheckUtils]: 15: Hoare triple {7414#true} havoc ~lk3~0; {7414#true} is VALID [2020-07-10 18:56:09,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {7414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7414#true} is VALID [2020-07-10 18:56:09,901 INFO L280 TraceCheckUtils]: 17: Hoare triple {7414#true} ~p4~0 := #t~nondet3; {7414#true} is VALID [2020-07-10 18:56:09,901 INFO L280 TraceCheckUtils]: 18: Hoare triple {7414#true} havoc #t~nondet3; {7414#true} is VALID [2020-07-10 18:56:09,901 INFO L280 TraceCheckUtils]: 19: Hoare triple {7414#true} havoc ~lk4~0; {7414#true} is VALID [2020-07-10 18:56:09,901 INFO L280 TraceCheckUtils]: 20: Hoare triple {7414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7414#true} is VALID [2020-07-10 18:56:09,901 INFO L280 TraceCheckUtils]: 21: Hoare triple {7414#true} ~p5~0 := #t~nondet4; {7414#true} is VALID [2020-07-10 18:56:09,902 INFO L280 TraceCheckUtils]: 22: Hoare triple {7414#true} havoc #t~nondet4; {7414#true} is VALID [2020-07-10 18:56:09,902 INFO L280 TraceCheckUtils]: 23: Hoare triple {7414#true} havoc ~lk5~0; {7414#true} is VALID [2020-07-10 18:56:09,902 INFO L280 TraceCheckUtils]: 24: Hoare triple {7414#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7414#true} is VALID [2020-07-10 18:56:09,902 INFO L280 TraceCheckUtils]: 25: Hoare triple {7414#true} ~p6~0 := #t~nondet5; {7414#true} is VALID [2020-07-10 18:56:09,903 INFO L280 TraceCheckUtils]: 26: Hoare triple {7414#true} havoc #t~nondet5; {7414#true} is VALID [2020-07-10 18:56:09,903 INFO L280 TraceCheckUtils]: 27: Hoare triple {7414#true} havoc ~lk6~0; {7414#true} is VALID [2020-07-10 18:56:09,903 INFO L280 TraceCheckUtils]: 28: Hoare triple {7414#true} havoc ~cond~0; {7414#true} is VALID [2020-07-10 18:56:09,903 INFO L280 TraceCheckUtils]: 29: Hoare triple {7414#true} assume !false; {7414#true} is VALID [2020-07-10 18:56:09,904 INFO L280 TraceCheckUtils]: 30: Hoare triple {7414#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7414#true} is VALID [2020-07-10 18:56:09,904 INFO L280 TraceCheckUtils]: 31: Hoare triple {7414#true} ~cond~0 := #t~nondet6; {7414#true} is VALID [2020-07-10 18:56:09,904 INFO L280 TraceCheckUtils]: 32: Hoare triple {7414#true} havoc #t~nondet6; {7414#true} is VALID [2020-07-10 18:56:09,904 INFO L280 TraceCheckUtils]: 33: Hoare triple {7414#true} assume !(0 == ~cond~0); {7414#true} is VALID [2020-07-10 18:56:09,904 INFO L280 TraceCheckUtils]: 34: Hoare triple {7414#true} ~lk1~0 := 0; {7414#true} is VALID [2020-07-10 18:56:09,905 INFO L280 TraceCheckUtils]: 35: Hoare triple {7414#true} ~lk2~0 := 0; {7414#true} is VALID [2020-07-10 18:56:09,905 INFO L280 TraceCheckUtils]: 36: Hoare triple {7414#true} ~lk3~0 := 0; {7414#true} is VALID [2020-07-10 18:56:09,905 INFO L280 TraceCheckUtils]: 37: Hoare triple {7414#true} ~lk4~0 := 0; {7414#true} is VALID [2020-07-10 18:56:09,905 INFO L280 TraceCheckUtils]: 38: Hoare triple {7414#true} ~lk5~0 := 0; {7414#true} is VALID [2020-07-10 18:56:09,906 INFO L280 TraceCheckUtils]: 39: Hoare triple {7414#true} ~lk6~0 := 0; {7414#true} is VALID [2020-07-10 18:56:09,906 INFO L280 TraceCheckUtils]: 40: Hoare triple {7414#true} assume !(0 != ~p1~0); {7414#true} is VALID [2020-07-10 18:56:09,906 INFO L280 TraceCheckUtils]: 41: Hoare triple {7414#true} assume !(0 != ~p2~0); {7414#true} is VALID [2020-07-10 18:56:09,906 INFO L280 TraceCheckUtils]: 42: Hoare triple {7414#true} assume 0 != ~p3~0; {7414#true} is VALID [2020-07-10 18:56:09,907 INFO L280 TraceCheckUtils]: 43: Hoare triple {7414#true} ~lk3~0 := 1; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:09,908 INFO L280 TraceCheckUtils]: 44: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:09,908 INFO L280 TraceCheckUtils]: 45: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:09,909 INFO L280 TraceCheckUtils]: 46: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:09,910 INFO L280 TraceCheckUtils]: 47: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:09,910 INFO L280 TraceCheckUtils]: 48: Hoare triple {7418#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7418#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:09,911 INFO L280 TraceCheckUtils]: 49: Hoare triple {7418#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7418#(= 1 main_~lk3~0)} is VALID [2020-07-10 18:56:09,911 INFO L280 TraceCheckUtils]: 50: Hoare triple {7418#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7415#false} is VALID [2020-07-10 18:56:09,912 INFO L280 TraceCheckUtils]: 51: Hoare triple {7415#false} assume !false; {7415#false} is VALID [2020-07-10 18:56:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:09,914 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:09,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984590836] [2020-07-10 18:56:09,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:09,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:09,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300450179] [2020-07-10 18:56:09,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-10 18:56:09,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:09,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:09,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:09,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:09,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:09,961 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-10 18:56:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:10,741 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-10 18:56:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:10,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-10 18:56:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 18:56:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2020-07-10 18:56:10,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2020-07-10 18:56:10,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:10,964 INFO L225 Difference]: With dead ends: 395 [2020-07-10 18:56:10,964 INFO L226 Difference]: Without dead ends: 393 [2020-07-10 18:56:10,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-10 18:56:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-10 18:56:11,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:11,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand 323 states. [2020-07-10 18:56:11,557 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand 323 states. [2020-07-10 18:56:11,557 INFO L87 Difference]: Start difference. First operand 393 states. Second operand 323 states. [2020-07-10 18:56:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:11,582 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-10 18:56:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-10 18:56:11,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:11,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:11,585 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand 393 states. [2020-07-10 18:56:11,585 INFO L87 Difference]: Start difference. First operand 323 states. Second operand 393 states. [2020-07-10 18:56:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:11,607 INFO L93 Difference]: Finished difference Result 393 states and 511 transitions. [2020-07-10 18:56:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2020-07-10 18:56:11,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:11,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:11,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:11,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-10 18:56:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-10 18:56:11,622 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-10 18:56:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:11,623 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-10 18:56:11,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:11,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 323 states and 418 transitions. [2020-07-10 18:56:12,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-10 18:56:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 18:56:12,156 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:12,156 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:12,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 18:56:12,157 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-10 18:56:12,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:12,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512865789] [2020-07-10 18:56:12,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:12,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-10 18:56:12,192 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-10 18:56:12,192 INFO L263 TraceCheckUtils]: 0: Hoare triple {9643#true} call ULTIMATE.init(); {9643#true} is VALID [2020-07-10 18:56:12,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {9643#true} assume true; {9643#true} is VALID [2020-07-10 18:56:12,192 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9643#true} {9643#true} #175#return; {9643#true} is VALID [2020-07-10 18:56:12,193 INFO L263 TraceCheckUtils]: 3: Hoare triple {9643#true} call #t~ret7 := main(); {9643#true} is VALID [2020-07-10 18:56:12,193 INFO L280 TraceCheckUtils]: 4: Hoare triple {9643#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9643#true} is VALID [2020-07-10 18:56:12,193 INFO L280 TraceCheckUtils]: 5: Hoare triple {9643#true} ~p1~0 := #t~nondet0; {9643#true} is VALID [2020-07-10 18:56:12,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {9643#true} havoc #t~nondet0; {9643#true} is VALID [2020-07-10 18:56:12,194 INFO L280 TraceCheckUtils]: 7: Hoare triple {9643#true} havoc ~lk1~0; {9643#true} is VALID [2020-07-10 18:56:12,194 INFO L280 TraceCheckUtils]: 8: Hoare triple {9643#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9643#true} is VALID [2020-07-10 18:56:12,194 INFO L280 TraceCheckUtils]: 9: Hoare triple {9643#true} ~p2~0 := #t~nondet1; {9643#true} is VALID [2020-07-10 18:56:12,194 INFO L280 TraceCheckUtils]: 10: Hoare triple {9643#true} havoc #t~nondet1; {9643#true} is VALID [2020-07-10 18:56:12,195 INFO L280 TraceCheckUtils]: 11: Hoare triple {9643#true} havoc ~lk2~0; {9643#true} is VALID [2020-07-10 18:56:12,195 INFO L280 TraceCheckUtils]: 12: Hoare triple {9643#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9643#true} is VALID [2020-07-10 18:56:12,195 INFO L280 TraceCheckUtils]: 13: Hoare triple {9643#true} ~p3~0 := #t~nondet2; {9643#true} is VALID [2020-07-10 18:56:12,196 INFO L280 TraceCheckUtils]: 14: Hoare triple {9643#true} havoc #t~nondet2; {9643#true} is VALID [2020-07-10 18:56:12,196 INFO L280 TraceCheckUtils]: 15: Hoare triple {9643#true} havoc ~lk3~0; {9643#true} is VALID [2020-07-10 18:56:12,196 INFO L280 TraceCheckUtils]: 16: Hoare triple {9643#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9643#true} is VALID [2020-07-10 18:56:12,196 INFO L280 TraceCheckUtils]: 17: Hoare triple {9643#true} ~p4~0 := #t~nondet3; {9643#true} is VALID [2020-07-10 18:56:12,197 INFO L280 TraceCheckUtils]: 18: Hoare triple {9643#true} havoc #t~nondet3; {9643#true} is VALID [2020-07-10 18:56:12,197 INFO L280 TraceCheckUtils]: 19: Hoare triple {9643#true} havoc ~lk4~0; {9643#true} is VALID [2020-07-10 18:56:12,197 INFO L280 TraceCheckUtils]: 20: Hoare triple {9643#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9643#true} is VALID [2020-07-10 18:56:12,197 INFO L280 TraceCheckUtils]: 21: Hoare triple {9643#true} ~p5~0 := #t~nondet4; {9643#true} is VALID [2020-07-10 18:56:12,198 INFO L280 TraceCheckUtils]: 22: Hoare triple {9643#true} havoc #t~nondet4; {9643#true} is VALID [2020-07-10 18:56:12,198 INFO L280 TraceCheckUtils]: 23: Hoare triple {9643#true} havoc ~lk5~0; {9643#true} is VALID [2020-07-10 18:56:12,198 INFO L280 TraceCheckUtils]: 24: Hoare triple {9643#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9643#true} is VALID [2020-07-10 18:56:12,215 INFO L280 TraceCheckUtils]: 25: Hoare triple {9643#true} ~p6~0 := #t~nondet5; {9643#true} is VALID [2020-07-10 18:56:12,216 INFO L280 TraceCheckUtils]: 26: Hoare triple {9643#true} havoc #t~nondet5; {9643#true} is VALID [2020-07-10 18:56:12,216 INFO L280 TraceCheckUtils]: 27: Hoare triple {9643#true} havoc ~lk6~0; {9643#true} is VALID [2020-07-10 18:56:12,216 INFO L280 TraceCheckUtils]: 28: Hoare triple {9643#true} havoc ~cond~0; {9643#true} is VALID [2020-07-10 18:56:12,216 INFO L280 TraceCheckUtils]: 29: Hoare triple {9643#true} assume !false; {9643#true} is VALID [2020-07-10 18:56:12,217 INFO L280 TraceCheckUtils]: 30: Hoare triple {9643#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9643#true} is VALID [2020-07-10 18:56:12,217 INFO L280 TraceCheckUtils]: 31: Hoare triple {9643#true} ~cond~0 := #t~nondet6; {9643#true} is VALID [2020-07-10 18:56:12,217 INFO L280 TraceCheckUtils]: 32: Hoare triple {9643#true} havoc #t~nondet6; {9643#true} is VALID [2020-07-10 18:56:12,217 INFO L280 TraceCheckUtils]: 33: Hoare triple {9643#true} assume !(0 == ~cond~0); {9643#true} is VALID [2020-07-10 18:56:12,218 INFO L280 TraceCheckUtils]: 34: Hoare triple {9643#true} ~lk1~0 := 0; {9643#true} is VALID [2020-07-10 18:56:12,218 INFO L280 TraceCheckUtils]: 35: Hoare triple {9643#true} ~lk2~0 := 0; {9643#true} is VALID [2020-07-10 18:56:12,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {9643#true} ~lk3~0 := 0; {9643#true} is VALID [2020-07-10 18:56:12,218 INFO L280 TraceCheckUtils]: 37: Hoare triple {9643#true} ~lk4~0 := 0; {9643#true} is VALID [2020-07-10 18:56:12,218 INFO L280 TraceCheckUtils]: 38: Hoare triple {9643#true} ~lk5~0 := 0; {9643#true} is VALID [2020-07-10 18:56:12,219 INFO L280 TraceCheckUtils]: 39: Hoare triple {9643#true} ~lk6~0 := 0; {9643#true} is VALID [2020-07-10 18:56:12,219 INFO L280 TraceCheckUtils]: 40: Hoare triple {9643#true} assume !(0 != ~p1~0); {9643#true} is VALID [2020-07-10 18:56:12,219 INFO L280 TraceCheckUtils]: 41: Hoare triple {9643#true} assume !(0 != ~p2~0); {9643#true} is VALID [2020-07-10 18:56:12,219 INFO L280 TraceCheckUtils]: 42: Hoare triple {9643#true} assume !(0 != ~p3~0); {9643#true} is VALID [2020-07-10 18:56:12,222 INFO L280 TraceCheckUtils]: 43: Hoare triple {9643#true} assume !(0 != ~p4~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:12,224 INFO L280 TraceCheckUtils]: 44: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:12,225 INFO L280 TraceCheckUtils]: 45: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:12,225 INFO L280 TraceCheckUtils]: 46: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:12,226 INFO L280 TraceCheckUtils]: 47: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:12,227 INFO L280 TraceCheckUtils]: 48: Hoare triple {9647#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {9647#(= 0 main_~p4~0)} is VALID [2020-07-10 18:56:12,228 INFO L280 TraceCheckUtils]: 49: Hoare triple {9647#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9644#false} is VALID [2020-07-10 18:56:12,228 INFO L280 TraceCheckUtils]: 50: Hoare triple {9644#false} assume 1 != ~lk4~0; {9644#false} is VALID [2020-07-10 18:56:12,228 INFO L280 TraceCheckUtils]: 51: Hoare triple {9644#false} assume !false; {9644#false} is VALID [2020-07-10 18:56:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:12,230 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:12,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512865789] [2020-07-10 18:56:12,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:12,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:12,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118923941] [2020-07-10 18:56:12,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-10 18:56:12,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:12,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:12,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:12,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:12,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:12,276 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-10 18:56:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:13,630 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-10 18:56:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:13,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-10 18:56:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-10 18:56:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 196 transitions. [2020-07-10 18:56:13,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 196 transitions. [2020-07-10 18:56:13,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:13,850 INFO L225 Difference]: With dead ends: 887 [2020-07-10 18:56:13,851 INFO L226 Difference]: Without dead ends: 593 [2020-07-10 18:56:13,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-10 18:56:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-10 18:56:14,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:14,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand 591 states. [2020-07-10 18:56:14,882 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand 591 states. [2020-07-10 18:56:14,882 INFO L87 Difference]: Start difference. First operand 593 states. Second operand 591 states. [2020-07-10 18:56:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:14,906 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-10 18:56:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-10 18:56:14,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:14,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:14,908 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 593 states. [2020-07-10 18:56:14,908 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 593 states. [2020-07-10 18:56:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:14,934 INFO L93 Difference]: Finished difference Result 593 states and 759 transitions. [2020-07-10 18:56:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 759 transitions. [2020-07-10 18:56:14,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:14,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:14,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:14,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-10 18:56:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-10 18:56:14,961 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-10 18:56:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:14,961 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-10 18:56:14,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:14,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 758 transitions. [2020-07-10 18:56:15,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 758 edges. 758 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-10 18:56:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-10 18:56:15,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:15,859 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:15,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 18:56:15,860 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-10 18:56:15,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:15,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356130135] [2020-07-10 18:56:15,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:15,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-10 18:56:15,899 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-10 18:56:15,899 INFO L263 TraceCheckUtils]: 0: Hoare triple {13792#true} call ULTIMATE.init(); {13792#true} is VALID [2020-07-10 18:56:15,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {13792#true} assume true; {13792#true} is VALID [2020-07-10 18:56:15,899 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {13792#true} {13792#true} #175#return; {13792#true} is VALID [2020-07-10 18:56:15,899 INFO L263 TraceCheckUtils]: 3: Hoare triple {13792#true} call #t~ret7 := main(); {13792#true} is VALID [2020-07-10 18:56:15,900 INFO L280 TraceCheckUtils]: 4: Hoare triple {13792#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {13792#true} is VALID [2020-07-10 18:56:15,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {13792#true} ~p1~0 := #t~nondet0; {13792#true} is VALID [2020-07-10 18:56:15,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {13792#true} havoc #t~nondet0; {13792#true} is VALID [2020-07-10 18:56:15,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {13792#true} havoc ~lk1~0; {13792#true} is VALID [2020-07-10 18:56:15,900 INFO L280 TraceCheckUtils]: 8: Hoare triple {13792#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13792#true} is VALID [2020-07-10 18:56:15,901 INFO L280 TraceCheckUtils]: 9: Hoare triple {13792#true} ~p2~0 := #t~nondet1; {13792#true} is VALID [2020-07-10 18:56:15,901 INFO L280 TraceCheckUtils]: 10: Hoare triple {13792#true} havoc #t~nondet1; {13792#true} is VALID [2020-07-10 18:56:15,901 INFO L280 TraceCheckUtils]: 11: Hoare triple {13792#true} havoc ~lk2~0; {13792#true} is VALID [2020-07-10 18:56:15,901 INFO L280 TraceCheckUtils]: 12: Hoare triple {13792#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {13792#true} is VALID [2020-07-10 18:56:15,902 INFO L280 TraceCheckUtils]: 13: Hoare triple {13792#true} ~p3~0 := #t~nondet2; {13792#true} is VALID [2020-07-10 18:56:15,902 INFO L280 TraceCheckUtils]: 14: Hoare triple {13792#true} havoc #t~nondet2; {13792#true} is VALID [2020-07-10 18:56:15,902 INFO L280 TraceCheckUtils]: 15: Hoare triple {13792#true} havoc ~lk3~0; {13792#true} is VALID [2020-07-10 18:56:15,902 INFO L280 TraceCheckUtils]: 16: Hoare triple {13792#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {13792#true} is VALID [2020-07-10 18:56:15,902 INFO L280 TraceCheckUtils]: 17: Hoare triple {13792#true} ~p4~0 := #t~nondet3; {13792#true} is VALID [2020-07-10 18:56:15,903 INFO L280 TraceCheckUtils]: 18: Hoare triple {13792#true} havoc #t~nondet3; {13792#true} is VALID [2020-07-10 18:56:15,903 INFO L280 TraceCheckUtils]: 19: Hoare triple {13792#true} havoc ~lk4~0; {13792#true} is VALID [2020-07-10 18:56:15,903 INFO L280 TraceCheckUtils]: 20: Hoare triple {13792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {13792#true} is VALID [2020-07-10 18:56:15,903 INFO L280 TraceCheckUtils]: 21: Hoare triple {13792#true} ~p5~0 := #t~nondet4; {13792#true} is VALID [2020-07-10 18:56:15,904 INFO L280 TraceCheckUtils]: 22: Hoare triple {13792#true} havoc #t~nondet4; {13792#true} is VALID [2020-07-10 18:56:15,904 INFO L280 TraceCheckUtils]: 23: Hoare triple {13792#true} havoc ~lk5~0; {13792#true} is VALID [2020-07-10 18:56:15,904 INFO L280 TraceCheckUtils]: 24: Hoare triple {13792#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {13792#true} is VALID [2020-07-10 18:56:15,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {13792#true} ~p6~0 := #t~nondet5; {13792#true} is VALID [2020-07-10 18:56:15,904 INFO L280 TraceCheckUtils]: 26: Hoare triple {13792#true} havoc #t~nondet5; {13792#true} is VALID [2020-07-10 18:56:15,905 INFO L280 TraceCheckUtils]: 27: Hoare triple {13792#true} havoc ~lk6~0; {13792#true} is VALID [2020-07-10 18:56:15,905 INFO L280 TraceCheckUtils]: 28: Hoare triple {13792#true} havoc ~cond~0; {13792#true} is VALID [2020-07-10 18:56:15,905 INFO L280 TraceCheckUtils]: 29: Hoare triple {13792#true} assume !false; {13792#true} is VALID [2020-07-10 18:56:15,905 INFO L280 TraceCheckUtils]: 30: Hoare triple {13792#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {13792#true} is VALID [2020-07-10 18:56:15,905 INFO L280 TraceCheckUtils]: 31: Hoare triple {13792#true} ~cond~0 := #t~nondet6; {13792#true} is VALID [2020-07-10 18:56:15,906 INFO L280 TraceCheckUtils]: 32: Hoare triple {13792#true} havoc #t~nondet6; {13792#true} is VALID [2020-07-10 18:56:15,906 INFO L280 TraceCheckUtils]: 33: Hoare triple {13792#true} assume !(0 == ~cond~0); {13792#true} is VALID [2020-07-10 18:56:15,906 INFO L280 TraceCheckUtils]: 34: Hoare triple {13792#true} ~lk1~0 := 0; {13792#true} is VALID [2020-07-10 18:56:15,906 INFO L280 TraceCheckUtils]: 35: Hoare triple {13792#true} ~lk2~0 := 0; {13792#true} is VALID [2020-07-10 18:56:15,906 INFO L280 TraceCheckUtils]: 36: Hoare triple {13792#true} ~lk3~0 := 0; {13792#true} is VALID [2020-07-10 18:56:15,907 INFO L280 TraceCheckUtils]: 37: Hoare triple {13792#true} ~lk4~0 := 0; {13792#true} is VALID [2020-07-10 18:56:15,907 INFO L280 TraceCheckUtils]: 38: Hoare triple {13792#true} ~lk5~0 := 0; {13792#true} is VALID [2020-07-10 18:56:15,907 INFO L280 TraceCheckUtils]: 39: Hoare triple {13792#true} ~lk6~0 := 0; {13792#true} is VALID [2020-07-10 18:56:15,907 INFO L280 TraceCheckUtils]: 40: Hoare triple {13792#true} assume !(0 != ~p1~0); {13792#true} is VALID [2020-07-10 18:56:15,907 INFO L280 TraceCheckUtils]: 41: Hoare triple {13792#true} assume !(0 != ~p2~0); {13792#true} is VALID [2020-07-10 18:56:15,908 INFO L280 TraceCheckUtils]: 42: Hoare triple {13792#true} assume !(0 != ~p3~0); {13792#true} is VALID [2020-07-10 18:56:15,908 INFO L280 TraceCheckUtils]: 43: Hoare triple {13792#true} assume 0 != ~p4~0; {13792#true} is VALID [2020-07-10 18:56:15,908 INFO L280 TraceCheckUtils]: 44: Hoare triple {13792#true} ~lk4~0 := 1; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:15,909 INFO L280 TraceCheckUtils]: 45: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:15,909 INFO L280 TraceCheckUtils]: 46: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:15,909 INFO L280 TraceCheckUtils]: 47: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:15,910 INFO L280 TraceCheckUtils]: 48: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:15,910 INFO L280 TraceCheckUtils]: 49: Hoare triple {13796#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {13796#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:15,911 INFO L280 TraceCheckUtils]: 50: Hoare triple {13796#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {13796#(= 1 main_~lk4~0)} is VALID [2020-07-10 18:56:15,911 INFO L280 TraceCheckUtils]: 51: Hoare triple {13796#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {13793#false} is VALID [2020-07-10 18:56:15,912 INFO L280 TraceCheckUtils]: 52: Hoare triple {13793#false} assume !false; {13793#false} is VALID [2020-07-10 18:56:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:15,914 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:15,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356130135] [2020-07-10 18:56:15,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:15,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:15,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123809127] [2020-07-10 18:56:15,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-10 18:56:15,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:15,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:15,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:15,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:15,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:15,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:15,969 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-10 18:56:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:17,471 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-10 18:56:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:17,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-10 18:56:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 18:56:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-10 18:56:17,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-10 18:56:17,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:17,653 INFO L225 Difference]: With dead ends: 715 [2020-07-10 18:56:17,653 INFO L226 Difference]: Without dead ends: 713 [2020-07-10 18:56:17,654 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-10 18:56:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-10 18:56:18,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:18,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 713 states. Second operand 591 states. [2020-07-10 18:56:18,699 INFO L74 IsIncluded]: Start isIncluded. First operand 713 states. Second operand 591 states. [2020-07-10 18:56:18,699 INFO L87 Difference]: Start difference. First operand 713 states. Second operand 591 states. [2020-07-10 18:56:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:18,733 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-10 18:56:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-10 18:56:18,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:18,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:18,736 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand 713 states. [2020-07-10 18:56:18,736 INFO L87 Difference]: Start difference. First operand 591 states. Second operand 713 states. [2020-07-10 18:56:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:18,769 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2020-07-10 18:56:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 903 transitions. [2020-07-10 18:56:18,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:18,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:18,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:18,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-10 18:56:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-10 18:56:18,800 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-10 18:56:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:18,800 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-10 18:56:18,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:18,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 591 states and 750 transitions. [2020-07-10 18:56:19,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 750 edges. 750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-10 18:56:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-10 18:56:19,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:19,653 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:19,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 18:56:19,654 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:19,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-10 18:56:19,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:19,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200301004] [2020-07-10 18:56:19,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:19,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-10 18:56:19,707 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-10 18:56:19,707 INFO L263 TraceCheckUtils]: 0: Hoare triple {17837#true} call ULTIMATE.init(); {17837#true} is VALID [2020-07-10 18:56:19,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {17837#true} assume true; {17837#true} is VALID [2020-07-10 18:56:19,707 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {17837#true} {17837#true} #175#return; {17837#true} is VALID [2020-07-10 18:56:19,708 INFO L263 TraceCheckUtils]: 3: Hoare triple {17837#true} call #t~ret7 := main(); {17837#true} is VALID [2020-07-10 18:56:19,708 INFO L280 TraceCheckUtils]: 4: Hoare triple {17837#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {17837#true} is VALID [2020-07-10 18:56:19,708 INFO L280 TraceCheckUtils]: 5: Hoare triple {17837#true} ~p1~0 := #t~nondet0; {17837#true} is VALID [2020-07-10 18:56:19,708 INFO L280 TraceCheckUtils]: 6: Hoare triple {17837#true} havoc #t~nondet0; {17837#true} is VALID [2020-07-10 18:56:19,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {17837#true} havoc ~lk1~0; {17837#true} is VALID [2020-07-10 18:56:19,709 INFO L280 TraceCheckUtils]: 8: Hoare triple {17837#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {17837#true} is VALID [2020-07-10 18:56:19,709 INFO L280 TraceCheckUtils]: 9: Hoare triple {17837#true} ~p2~0 := #t~nondet1; {17837#true} is VALID [2020-07-10 18:56:19,709 INFO L280 TraceCheckUtils]: 10: Hoare triple {17837#true} havoc #t~nondet1; {17837#true} is VALID [2020-07-10 18:56:19,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {17837#true} havoc ~lk2~0; {17837#true} is VALID [2020-07-10 18:56:19,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {17837#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {17837#true} is VALID [2020-07-10 18:56:19,710 INFO L280 TraceCheckUtils]: 13: Hoare triple {17837#true} ~p3~0 := #t~nondet2; {17837#true} is VALID [2020-07-10 18:56:19,710 INFO L280 TraceCheckUtils]: 14: Hoare triple {17837#true} havoc #t~nondet2; {17837#true} is VALID [2020-07-10 18:56:19,710 INFO L280 TraceCheckUtils]: 15: Hoare triple {17837#true} havoc ~lk3~0; {17837#true} is VALID [2020-07-10 18:56:19,711 INFO L280 TraceCheckUtils]: 16: Hoare triple {17837#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {17837#true} is VALID [2020-07-10 18:56:19,711 INFO L280 TraceCheckUtils]: 17: Hoare triple {17837#true} ~p4~0 := #t~nondet3; {17837#true} is VALID [2020-07-10 18:56:19,711 INFO L280 TraceCheckUtils]: 18: Hoare triple {17837#true} havoc #t~nondet3; {17837#true} is VALID [2020-07-10 18:56:19,711 INFO L280 TraceCheckUtils]: 19: Hoare triple {17837#true} havoc ~lk4~0; {17837#true} is VALID [2020-07-10 18:56:19,712 INFO L280 TraceCheckUtils]: 20: Hoare triple {17837#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {17837#true} is VALID [2020-07-10 18:56:19,712 INFO L280 TraceCheckUtils]: 21: Hoare triple {17837#true} ~p5~0 := #t~nondet4; {17837#true} is VALID [2020-07-10 18:56:19,712 INFO L280 TraceCheckUtils]: 22: Hoare triple {17837#true} havoc #t~nondet4; {17837#true} is VALID [2020-07-10 18:56:19,712 INFO L280 TraceCheckUtils]: 23: Hoare triple {17837#true} havoc ~lk5~0; {17837#true} is VALID [2020-07-10 18:56:19,712 INFO L280 TraceCheckUtils]: 24: Hoare triple {17837#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {17837#true} is VALID [2020-07-10 18:56:19,713 INFO L280 TraceCheckUtils]: 25: Hoare triple {17837#true} ~p6~0 := #t~nondet5; {17837#true} is VALID [2020-07-10 18:56:19,713 INFO L280 TraceCheckUtils]: 26: Hoare triple {17837#true} havoc #t~nondet5; {17837#true} is VALID [2020-07-10 18:56:19,713 INFO L280 TraceCheckUtils]: 27: Hoare triple {17837#true} havoc ~lk6~0; {17837#true} is VALID [2020-07-10 18:56:19,713 INFO L280 TraceCheckUtils]: 28: Hoare triple {17837#true} havoc ~cond~0; {17837#true} is VALID [2020-07-10 18:56:19,713 INFO L280 TraceCheckUtils]: 29: Hoare triple {17837#true} assume !false; {17837#true} is VALID [2020-07-10 18:56:19,714 INFO L280 TraceCheckUtils]: 30: Hoare triple {17837#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {17837#true} is VALID [2020-07-10 18:56:19,714 INFO L280 TraceCheckUtils]: 31: Hoare triple {17837#true} ~cond~0 := #t~nondet6; {17837#true} is VALID [2020-07-10 18:56:19,714 INFO L280 TraceCheckUtils]: 32: Hoare triple {17837#true} havoc #t~nondet6; {17837#true} is VALID [2020-07-10 18:56:19,714 INFO L280 TraceCheckUtils]: 33: Hoare triple {17837#true} assume !(0 == ~cond~0); {17837#true} is VALID [2020-07-10 18:56:19,714 INFO L280 TraceCheckUtils]: 34: Hoare triple {17837#true} ~lk1~0 := 0; {17837#true} is VALID [2020-07-10 18:56:19,715 INFO L280 TraceCheckUtils]: 35: Hoare triple {17837#true} ~lk2~0 := 0; {17837#true} is VALID [2020-07-10 18:56:19,715 INFO L280 TraceCheckUtils]: 36: Hoare triple {17837#true} ~lk3~0 := 0; {17837#true} is VALID [2020-07-10 18:56:19,715 INFO L280 TraceCheckUtils]: 37: Hoare triple {17837#true} ~lk4~0 := 0; {17837#true} is VALID [2020-07-10 18:56:19,715 INFO L280 TraceCheckUtils]: 38: Hoare triple {17837#true} ~lk5~0 := 0; {17837#true} is VALID [2020-07-10 18:56:19,715 INFO L280 TraceCheckUtils]: 39: Hoare triple {17837#true} ~lk6~0 := 0; {17837#true} is VALID [2020-07-10 18:56:19,716 INFO L280 TraceCheckUtils]: 40: Hoare triple {17837#true} assume !(0 != ~p1~0); {17837#true} is VALID [2020-07-10 18:56:19,716 INFO L280 TraceCheckUtils]: 41: Hoare triple {17837#true} assume !(0 != ~p2~0); {17837#true} is VALID [2020-07-10 18:56:19,716 INFO L280 TraceCheckUtils]: 42: Hoare triple {17837#true} assume !(0 != ~p3~0); {17837#true} is VALID [2020-07-10 18:56:19,716 INFO L280 TraceCheckUtils]: 43: Hoare triple {17837#true} assume !(0 != ~p4~0); {17837#true} is VALID [2020-07-10 18:56:19,717 INFO L280 TraceCheckUtils]: 44: Hoare triple {17837#true} assume !(0 != ~p5~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:19,718 INFO L280 TraceCheckUtils]: 45: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:19,719 INFO L280 TraceCheckUtils]: 46: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:19,719 INFO L280 TraceCheckUtils]: 47: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:19,720 INFO L280 TraceCheckUtils]: 48: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:19,721 INFO L280 TraceCheckUtils]: 49: Hoare triple {17841#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {17841#(= 0 main_~p5~0)} is VALID [2020-07-10 18:56:19,721 INFO L280 TraceCheckUtils]: 50: Hoare triple {17841#(= 0 main_~p5~0)} assume 0 != ~p5~0; {17838#false} is VALID [2020-07-10 18:56:19,722 INFO L280 TraceCheckUtils]: 51: Hoare triple {17838#false} assume 1 != ~lk5~0; {17838#false} is VALID [2020-07-10 18:56:19,722 INFO L280 TraceCheckUtils]: 52: Hoare triple {17838#false} assume !false; {17838#false} is VALID [2020-07-10 18:56:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:19,725 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:19,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200301004] [2020-07-10 18:56:19,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:19,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:19,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284632922] [2020-07-10 18:56:19,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-10 18:56:19,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:19,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:19,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:19,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:19,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:19,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:19,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:19,783 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-10 18:56:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:22,407 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-10 18:56:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:22,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-10 18:56:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-10 18:56:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2020-07-10 18:56:22,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 193 transitions. [2020-07-10 18:56:22,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:22,647 INFO L225 Difference]: With dead ends: 1667 [2020-07-10 18:56:22,647 INFO L226 Difference]: Without dead ends: 1105 [2020-07-10 18:56:22,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-10 18:56:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-10 18:56:24,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:24,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1105 states. Second operand 1103 states. [2020-07-10 18:56:24,930 INFO L74 IsIncluded]: Start isIncluded. First operand 1105 states. Second operand 1103 states. [2020-07-10 18:56:24,931 INFO L87 Difference]: Start difference. First operand 1105 states. Second operand 1103 states. [2020-07-10 18:56:24,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:24,971 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-10 18:56:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-10 18:56:24,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:24,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:24,973 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1105 states. [2020-07-10 18:56:24,974 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1105 states. [2020-07-10 18:56:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:25,020 INFO L93 Difference]: Finished difference Result 1105 states and 1375 transitions. [2020-07-10 18:56:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1375 transitions. [2020-07-10 18:56:25,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:25,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:25,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:25,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-10 18:56:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-10 18:56:25,086 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-10 18:56:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:25,087 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-10 18:56:25,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:25,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1374 transitions. [2020-07-10 18:56:26,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1374 edges. 1374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-10 18:56:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 18:56:26,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:26,938 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:26,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 18:56:26,939 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:26,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-10 18:56:26,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:26,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144355477] [2020-07-10 18:56:26,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:26,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-10 18:56:26,973 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-10 18:56:26,974 INFO L263 TraceCheckUtils]: 0: Hoare triple {25594#true} call ULTIMATE.init(); {25594#true} is VALID [2020-07-10 18:56:26,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {25594#true} assume true; {25594#true} is VALID [2020-07-10 18:56:26,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {25594#true} {25594#true} #175#return; {25594#true} is VALID [2020-07-10 18:56:26,974 INFO L263 TraceCheckUtils]: 3: Hoare triple {25594#true} call #t~ret7 := main(); {25594#true} is VALID [2020-07-10 18:56:26,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {25594#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {25594#true} is VALID [2020-07-10 18:56:26,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {25594#true} ~p1~0 := #t~nondet0; {25594#true} is VALID [2020-07-10 18:56:26,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {25594#true} havoc #t~nondet0; {25594#true} is VALID [2020-07-10 18:56:26,975 INFO L280 TraceCheckUtils]: 7: Hoare triple {25594#true} havoc ~lk1~0; {25594#true} is VALID [2020-07-10 18:56:26,975 INFO L280 TraceCheckUtils]: 8: Hoare triple {25594#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25594#true} is VALID [2020-07-10 18:56:26,976 INFO L280 TraceCheckUtils]: 9: Hoare triple {25594#true} ~p2~0 := #t~nondet1; {25594#true} is VALID [2020-07-10 18:56:26,976 INFO L280 TraceCheckUtils]: 10: Hoare triple {25594#true} havoc #t~nondet1; {25594#true} is VALID [2020-07-10 18:56:26,976 INFO L280 TraceCheckUtils]: 11: Hoare triple {25594#true} havoc ~lk2~0; {25594#true} is VALID [2020-07-10 18:56:26,976 INFO L280 TraceCheckUtils]: 12: Hoare triple {25594#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {25594#true} is VALID [2020-07-10 18:56:26,977 INFO L280 TraceCheckUtils]: 13: Hoare triple {25594#true} ~p3~0 := #t~nondet2; {25594#true} is VALID [2020-07-10 18:56:26,977 INFO L280 TraceCheckUtils]: 14: Hoare triple {25594#true} havoc #t~nondet2; {25594#true} is VALID [2020-07-10 18:56:26,977 INFO L280 TraceCheckUtils]: 15: Hoare triple {25594#true} havoc ~lk3~0; {25594#true} is VALID [2020-07-10 18:56:26,977 INFO L280 TraceCheckUtils]: 16: Hoare triple {25594#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {25594#true} is VALID [2020-07-10 18:56:26,977 INFO L280 TraceCheckUtils]: 17: Hoare triple {25594#true} ~p4~0 := #t~nondet3; {25594#true} is VALID [2020-07-10 18:56:26,978 INFO L280 TraceCheckUtils]: 18: Hoare triple {25594#true} havoc #t~nondet3; {25594#true} is VALID [2020-07-10 18:56:26,978 INFO L280 TraceCheckUtils]: 19: Hoare triple {25594#true} havoc ~lk4~0; {25594#true} is VALID [2020-07-10 18:56:26,978 INFO L280 TraceCheckUtils]: 20: Hoare triple {25594#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {25594#true} is VALID [2020-07-10 18:56:26,978 INFO L280 TraceCheckUtils]: 21: Hoare triple {25594#true} ~p5~0 := #t~nondet4; {25594#true} is VALID [2020-07-10 18:56:26,979 INFO L280 TraceCheckUtils]: 22: Hoare triple {25594#true} havoc #t~nondet4; {25594#true} is VALID [2020-07-10 18:56:26,979 INFO L280 TraceCheckUtils]: 23: Hoare triple {25594#true} havoc ~lk5~0; {25594#true} is VALID [2020-07-10 18:56:26,979 INFO L280 TraceCheckUtils]: 24: Hoare triple {25594#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {25594#true} is VALID [2020-07-10 18:56:26,979 INFO L280 TraceCheckUtils]: 25: Hoare triple {25594#true} ~p6~0 := #t~nondet5; {25594#true} is VALID [2020-07-10 18:56:26,979 INFO L280 TraceCheckUtils]: 26: Hoare triple {25594#true} havoc #t~nondet5; {25594#true} is VALID [2020-07-10 18:56:26,980 INFO L280 TraceCheckUtils]: 27: Hoare triple {25594#true} havoc ~lk6~0; {25594#true} is VALID [2020-07-10 18:56:26,980 INFO L280 TraceCheckUtils]: 28: Hoare triple {25594#true} havoc ~cond~0; {25594#true} is VALID [2020-07-10 18:56:26,980 INFO L280 TraceCheckUtils]: 29: Hoare triple {25594#true} assume !false; {25594#true} is VALID [2020-07-10 18:56:26,980 INFO L280 TraceCheckUtils]: 30: Hoare triple {25594#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {25594#true} is VALID [2020-07-10 18:56:26,981 INFO L280 TraceCheckUtils]: 31: Hoare triple {25594#true} ~cond~0 := #t~nondet6; {25594#true} is VALID [2020-07-10 18:56:26,981 INFO L280 TraceCheckUtils]: 32: Hoare triple {25594#true} havoc #t~nondet6; {25594#true} is VALID [2020-07-10 18:56:26,981 INFO L280 TraceCheckUtils]: 33: Hoare triple {25594#true} assume !(0 == ~cond~0); {25594#true} is VALID [2020-07-10 18:56:26,981 INFO L280 TraceCheckUtils]: 34: Hoare triple {25594#true} ~lk1~0 := 0; {25594#true} is VALID [2020-07-10 18:56:26,981 INFO L280 TraceCheckUtils]: 35: Hoare triple {25594#true} ~lk2~0 := 0; {25594#true} is VALID [2020-07-10 18:56:26,982 INFO L280 TraceCheckUtils]: 36: Hoare triple {25594#true} ~lk3~0 := 0; {25594#true} is VALID [2020-07-10 18:56:26,982 INFO L280 TraceCheckUtils]: 37: Hoare triple {25594#true} ~lk4~0 := 0; {25594#true} is VALID [2020-07-10 18:56:26,982 INFO L280 TraceCheckUtils]: 38: Hoare triple {25594#true} ~lk5~0 := 0; {25594#true} is VALID [2020-07-10 18:56:26,982 INFO L280 TraceCheckUtils]: 39: Hoare triple {25594#true} ~lk6~0 := 0; {25594#true} is VALID [2020-07-10 18:56:26,982 INFO L280 TraceCheckUtils]: 40: Hoare triple {25594#true} assume !(0 != ~p1~0); {25594#true} is VALID [2020-07-10 18:56:26,983 INFO L280 TraceCheckUtils]: 41: Hoare triple {25594#true} assume !(0 != ~p2~0); {25594#true} is VALID [2020-07-10 18:56:26,983 INFO L280 TraceCheckUtils]: 42: Hoare triple {25594#true} assume !(0 != ~p3~0); {25594#true} is VALID [2020-07-10 18:56:26,983 INFO L280 TraceCheckUtils]: 43: Hoare triple {25594#true} assume !(0 != ~p4~0); {25594#true} is VALID [2020-07-10 18:56:26,983 INFO L280 TraceCheckUtils]: 44: Hoare triple {25594#true} assume 0 != ~p5~0; {25594#true} is VALID [2020-07-10 18:56:26,984 INFO L280 TraceCheckUtils]: 45: Hoare triple {25594#true} ~lk5~0 := 1; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:26,984 INFO L280 TraceCheckUtils]: 46: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:26,985 INFO L280 TraceCheckUtils]: 47: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:26,985 INFO L280 TraceCheckUtils]: 48: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:26,986 INFO L280 TraceCheckUtils]: 49: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:26,987 INFO L280 TraceCheckUtils]: 50: Hoare triple {25598#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {25598#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:26,987 INFO L280 TraceCheckUtils]: 51: Hoare triple {25598#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {25598#(= 1 main_~lk5~0)} is VALID [2020-07-10 18:56:26,988 INFO L280 TraceCheckUtils]: 52: Hoare triple {25598#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {25595#false} is VALID [2020-07-10 18:56:26,988 INFO L280 TraceCheckUtils]: 53: Hoare triple {25595#false} assume !false; {25595#false} is VALID [2020-07-10 18:56:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:26,990 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:26,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144355477] [2020-07-10 18:56:26,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:26,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:26,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902376965] [2020-07-10 18:56:26,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-10 18:56:26,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:26,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:27,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:27,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:27,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:27,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:27,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:27,038 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-10 18:56:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:30,040 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-10 18:56:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:30,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-10 18:56:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 18:56:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2020-07-10 18:56:30,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2020-07-10 18:56:30,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:30,219 INFO L225 Difference]: With dead ends: 1315 [2020-07-10 18:56:30,219 INFO L226 Difference]: Without dead ends: 1313 [2020-07-10 18:56:30,220 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-10 18:56:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-10 18:56:32,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:32,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1313 states. Second operand 1103 states. [2020-07-10 18:56:32,617 INFO L74 IsIncluded]: Start isIncluded. First operand 1313 states. Second operand 1103 states. [2020-07-10 18:56:32,617 INFO L87 Difference]: Start difference. First operand 1313 states. Second operand 1103 states. [2020-07-10 18:56:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:32,669 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-10 18:56:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-10 18:56:32,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:32,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:32,672 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1313 states. [2020-07-10 18:56:32,672 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1313 states. [2020-07-10 18:56:32,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:32,754 INFO L93 Difference]: Finished difference Result 1313 states and 1599 transitions. [2020-07-10 18:56:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1599 transitions. [2020-07-10 18:56:32,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:32,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:32,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:32,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-10 18:56:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-10 18:56:32,801 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-10 18:56:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:32,801 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-10 18:56:32,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:32,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1358 transitions. [2020-07-10 18:56:34,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1358 edges. 1358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-10 18:56:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-10 18:56:34,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:34,550 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:34,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 18:56:34,550 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:34,551 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-10 18:56:34,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:34,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219643160] [2020-07-10 18:56:34,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:34,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-10 18:56:34,610 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-10 18:56:34,610 INFO L263 TraceCheckUtils]: 0: Hoare triple {33063#true} call ULTIMATE.init(); {33063#true} is VALID [2020-07-10 18:56:34,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {33063#true} assume true; {33063#true} is VALID [2020-07-10 18:56:34,611 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33063#true} {33063#true} #175#return; {33063#true} is VALID [2020-07-10 18:56:34,611 INFO L263 TraceCheckUtils]: 3: Hoare triple {33063#true} call #t~ret7 := main(); {33063#true} is VALID [2020-07-10 18:56:34,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {33063#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {33063#true} is VALID [2020-07-10 18:56:34,611 INFO L280 TraceCheckUtils]: 5: Hoare triple {33063#true} ~p1~0 := #t~nondet0; {33063#true} is VALID [2020-07-10 18:56:34,611 INFO L280 TraceCheckUtils]: 6: Hoare triple {33063#true} havoc #t~nondet0; {33063#true} is VALID [2020-07-10 18:56:34,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {33063#true} havoc ~lk1~0; {33063#true} is VALID [2020-07-10 18:56:34,612 INFO L280 TraceCheckUtils]: 8: Hoare triple {33063#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33063#true} is VALID [2020-07-10 18:56:34,612 INFO L280 TraceCheckUtils]: 9: Hoare triple {33063#true} ~p2~0 := #t~nondet1; {33063#true} is VALID [2020-07-10 18:56:34,612 INFO L280 TraceCheckUtils]: 10: Hoare triple {33063#true} havoc #t~nondet1; {33063#true} is VALID [2020-07-10 18:56:34,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {33063#true} havoc ~lk2~0; {33063#true} is VALID [2020-07-10 18:56:34,613 INFO L280 TraceCheckUtils]: 12: Hoare triple {33063#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {33063#true} is VALID [2020-07-10 18:56:34,613 INFO L280 TraceCheckUtils]: 13: Hoare triple {33063#true} ~p3~0 := #t~nondet2; {33063#true} is VALID [2020-07-10 18:56:34,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {33063#true} havoc #t~nondet2; {33063#true} is VALID [2020-07-10 18:56:34,613 INFO L280 TraceCheckUtils]: 15: Hoare triple {33063#true} havoc ~lk3~0; {33063#true} is VALID [2020-07-10 18:56:34,613 INFO L280 TraceCheckUtils]: 16: Hoare triple {33063#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {33063#true} is VALID [2020-07-10 18:56:34,614 INFO L280 TraceCheckUtils]: 17: Hoare triple {33063#true} ~p4~0 := #t~nondet3; {33063#true} is VALID [2020-07-10 18:56:34,614 INFO L280 TraceCheckUtils]: 18: Hoare triple {33063#true} havoc #t~nondet3; {33063#true} is VALID [2020-07-10 18:56:34,614 INFO L280 TraceCheckUtils]: 19: Hoare triple {33063#true} havoc ~lk4~0; {33063#true} is VALID [2020-07-10 18:56:34,614 INFO L280 TraceCheckUtils]: 20: Hoare triple {33063#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {33063#true} is VALID [2020-07-10 18:56:34,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {33063#true} ~p5~0 := #t~nondet4; {33063#true} is VALID [2020-07-10 18:56:34,615 INFO L280 TraceCheckUtils]: 22: Hoare triple {33063#true} havoc #t~nondet4; {33063#true} is VALID [2020-07-10 18:56:34,615 INFO L280 TraceCheckUtils]: 23: Hoare triple {33063#true} havoc ~lk5~0; {33063#true} is VALID [2020-07-10 18:56:34,615 INFO L280 TraceCheckUtils]: 24: Hoare triple {33063#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {33063#true} is VALID [2020-07-10 18:56:34,615 INFO L280 TraceCheckUtils]: 25: Hoare triple {33063#true} ~p6~0 := #t~nondet5; {33063#true} is VALID [2020-07-10 18:56:34,615 INFO L280 TraceCheckUtils]: 26: Hoare triple {33063#true} havoc #t~nondet5; {33063#true} is VALID [2020-07-10 18:56:34,616 INFO L280 TraceCheckUtils]: 27: Hoare triple {33063#true} havoc ~lk6~0; {33063#true} is VALID [2020-07-10 18:56:34,616 INFO L280 TraceCheckUtils]: 28: Hoare triple {33063#true} havoc ~cond~0; {33063#true} is VALID [2020-07-10 18:56:34,616 INFO L280 TraceCheckUtils]: 29: Hoare triple {33063#true} assume !false; {33063#true} is VALID [2020-07-10 18:56:34,616 INFO L280 TraceCheckUtils]: 30: Hoare triple {33063#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {33063#true} is VALID [2020-07-10 18:56:34,616 INFO L280 TraceCheckUtils]: 31: Hoare triple {33063#true} ~cond~0 := #t~nondet6; {33063#true} is VALID [2020-07-10 18:56:34,617 INFO L280 TraceCheckUtils]: 32: Hoare triple {33063#true} havoc #t~nondet6; {33063#true} is VALID [2020-07-10 18:56:34,617 INFO L280 TraceCheckUtils]: 33: Hoare triple {33063#true} assume !(0 == ~cond~0); {33063#true} is VALID [2020-07-10 18:56:34,617 INFO L280 TraceCheckUtils]: 34: Hoare triple {33063#true} ~lk1~0 := 0; {33063#true} is VALID [2020-07-10 18:56:34,617 INFO L280 TraceCheckUtils]: 35: Hoare triple {33063#true} ~lk2~0 := 0; {33063#true} is VALID [2020-07-10 18:56:34,617 INFO L280 TraceCheckUtils]: 36: Hoare triple {33063#true} ~lk3~0 := 0; {33063#true} is VALID [2020-07-10 18:56:34,618 INFO L280 TraceCheckUtils]: 37: Hoare triple {33063#true} ~lk4~0 := 0; {33063#true} is VALID [2020-07-10 18:56:34,618 INFO L280 TraceCheckUtils]: 38: Hoare triple {33063#true} ~lk5~0 := 0; {33063#true} is VALID [2020-07-10 18:56:34,618 INFO L280 TraceCheckUtils]: 39: Hoare triple {33063#true} ~lk6~0 := 0; {33063#true} is VALID [2020-07-10 18:56:34,618 INFO L280 TraceCheckUtils]: 40: Hoare triple {33063#true} assume !(0 != ~p1~0); {33063#true} is VALID [2020-07-10 18:56:34,618 INFO L280 TraceCheckUtils]: 41: Hoare triple {33063#true} assume !(0 != ~p2~0); {33063#true} is VALID [2020-07-10 18:56:34,619 INFO L280 TraceCheckUtils]: 42: Hoare triple {33063#true} assume !(0 != ~p3~0); {33063#true} is VALID [2020-07-10 18:56:34,619 INFO L280 TraceCheckUtils]: 43: Hoare triple {33063#true} assume !(0 != ~p4~0); {33063#true} is VALID [2020-07-10 18:56:34,619 INFO L280 TraceCheckUtils]: 44: Hoare triple {33063#true} assume !(0 != ~p5~0); {33063#true} is VALID [2020-07-10 18:56:34,619 INFO L280 TraceCheckUtils]: 45: Hoare triple {33063#true} assume !(0 != ~p6~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-10 18:56:34,620 INFO L280 TraceCheckUtils]: 46: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-10 18:56:34,620 INFO L280 TraceCheckUtils]: 47: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-10 18:56:34,620 INFO L280 TraceCheckUtils]: 48: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-10 18:56:34,621 INFO L280 TraceCheckUtils]: 49: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-10 18:56:34,621 INFO L280 TraceCheckUtils]: 50: Hoare triple {33067#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {33067#(= 0 main_~p6~0)} is VALID [2020-07-10 18:56:34,622 INFO L280 TraceCheckUtils]: 51: Hoare triple {33067#(= 0 main_~p6~0)} assume 0 != ~p6~0; {33064#false} is VALID [2020-07-10 18:56:34,622 INFO L280 TraceCheckUtils]: 52: Hoare triple {33064#false} assume 1 != ~lk6~0; {33064#false} is VALID [2020-07-10 18:56:34,622 INFO L280 TraceCheckUtils]: 53: Hoare triple {33064#false} assume !false; {33064#false} is VALID [2020-07-10 18:56:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:34,623 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:34,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219643160] [2020-07-10 18:56:34,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:34,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:34,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638200579] [2020-07-10 18:56:34,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-10 18:56:34,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:34,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:34,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:34,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:34,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:34,677 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-10 18:56:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:40,413 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-10 18:56:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:40,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-10 18:56:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-10 18:56:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2020-07-10 18:56:40,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2020-07-10 18:56:40,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:40,665 INFO L225 Difference]: With dead ends: 3153 [2020-07-10 18:56:40,665 INFO L226 Difference]: Without dead ends: 1103 [2020-07-10 18:56:40,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-10 18:56:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-10 18:56:43,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:43,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1103 states. Second operand 1103 states. [2020-07-10 18:56:43,092 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-10 18:56:43,092 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-10 18:56:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:43,138 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-10 18:56:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-10 18:56:43,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:43,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:43,140 INFO L74 IsIncluded]: Start isIncluded. First operand 1103 states. Second operand 1103 states. [2020-07-10 18:56:43,140 INFO L87 Difference]: Start difference. First operand 1103 states. Second operand 1103 states. [2020-07-10 18:56:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:43,186 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-10 18:56:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-10 18:56:43,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:43,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:43,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:43,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-10 18:56:43,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-10 18:56:43,229 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-10 18:56:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:43,229 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-10 18:56:43,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:43,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1103 states and 1294 transitions. [2020-07-10 18:56:44,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1294 edges. 1294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-10 18:56:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-10 18:56:44,825 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 18:56:44,825 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 18:56:44,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 18:56:44,826 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 18:56:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 18:56:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-10 18:56:44,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 18:56:44,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357054250] [2020-07-10 18:56:44,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 18:56:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 18:56:44,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-10 18:56:44,858 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-10 18:56:44,859 INFO L263 TraceCheckUtils]: 0: Hoare triple {43788#true} call ULTIMATE.init(); {43788#true} is VALID [2020-07-10 18:56:44,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {43788#true} assume true; {43788#true} is VALID [2020-07-10 18:56:44,859 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43788#true} {43788#true} #175#return; {43788#true} is VALID [2020-07-10 18:56:44,859 INFO L263 TraceCheckUtils]: 3: Hoare triple {43788#true} call #t~ret7 := main(); {43788#true} is VALID [2020-07-10 18:56:44,859 INFO L280 TraceCheckUtils]: 4: Hoare triple {43788#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43788#true} is VALID [2020-07-10 18:56:44,860 INFO L280 TraceCheckUtils]: 5: Hoare triple {43788#true} ~p1~0 := #t~nondet0; {43788#true} is VALID [2020-07-10 18:56:44,860 INFO L280 TraceCheckUtils]: 6: Hoare triple {43788#true} havoc #t~nondet0; {43788#true} is VALID [2020-07-10 18:56:44,860 INFO L280 TraceCheckUtils]: 7: Hoare triple {43788#true} havoc ~lk1~0; {43788#true} is VALID [2020-07-10 18:56:44,860 INFO L280 TraceCheckUtils]: 8: Hoare triple {43788#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {43788#true} is VALID [2020-07-10 18:56:44,860 INFO L280 TraceCheckUtils]: 9: Hoare triple {43788#true} ~p2~0 := #t~nondet1; {43788#true} is VALID [2020-07-10 18:56:44,861 INFO L280 TraceCheckUtils]: 10: Hoare triple {43788#true} havoc #t~nondet1; {43788#true} is VALID [2020-07-10 18:56:44,861 INFO L280 TraceCheckUtils]: 11: Hoare triple {43788#true} havoc ~lk2~0; {43788#true} is VALID [2020-07-10 18:56:44,861 INFO L280 TraceCheckUtils]: 12: Hoare triple {43788#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {43788#true} is VALID [2020-07-10 18:56:44,861 INFO L280 TraceCheckUtils]: 13: Hoare triple {43788#true} ~p3~0 := #t~nondet2; {43788#true} is VALID [2020-07-10 18:56:44,861 INFO L280 TraceCheckUtils]: 14: Hoare triple {43788#true} havoc #t~nondet2; {43788#true} is VALID [2020-07-10 18:56:44,862 INFO L280 TraceCheckUtils]: 15: Hoare triple {43788#true} havoc ~lk3~0; {43788#true} is VALID [2020-07-10 18:56:44,862 INFO L280 TraceCheckUtils]: 16: Hoare triple {43788#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {43788#true} is VALID [2020-07-10 18:56:44,862 INFO L280 TraceCheckUtils]: 17: Hoare triple {43788#true} ~p4~0 := #t~nondet3; {43788#true} is VALID [2020-07-10 18:56:44,862 INFO L280 TraceCheckUtils]: 18: Hoare triple {43788#true} havoc #t~nondet3; {43788#true} is VALID [2020-07-10 18:56:44,862 INFO L280 TraceCheckUtils]: 19: Hoare triple {43788#true} havoc ~lk4~0; {43788#true} is VALID [2020-07-10 18:56:44,863 INFO L280 TraceCheckUtils]: 20: Hoare triple {43788#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {43788#true} is VALID [2020-07-10 18:56:44,863 INFO L280 TraceCheckUtils]: 21: Hoare triple {43788#true} ~p5~0 := #t~nondet4; {43788#true} is VALID [2020-07-10 18:56:44,863 INFO L280 TraceCheckUtils]: 22: Hoare triple {43788#true} havoc #t~nondet4; {43788#true} is VALID [2020-07-10 18:56:44,863 INFO L280 TraceCheckUtils]: 23: Hoare triple {43788#true} havoc ~lk5~0; {43788#true} is VALID [2020-07-10 18:56:44,863 INFO L280 TraceCheckUtils]: 24: Hoare triple {43788#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {43788#true} is VALID [2020-07-10 18:56:44,864 INFO L280 TraceCheckUtils]: 25: Hoare triple {43788#true} ~p6~0 := #t~nondet5; {43788#true} is VALID [2020-07-10 18:56:44,864 INFO L280 TraceCheckUtils]: 26: Hoare triple {43788#true} havoc #t~nondet5; {43788#true} is VALID [2020-07-10 18:56:44,864 INFO L280 TraceCheckUtils]: 27: Hoare triple {43788#true} havoc ~lk6~0; {43788#true} is VALID [2020-07-10 18:56:44,864 INFO L280 TraceCheckUtils]: 28: Hoare triple {43788#true} havoc ~cond~0; {43788#true} is VALID [2020-07-10 18:56:44,864 INFO L280 TraceCheckUtils]: 29: Hoare triple {43788#true} assume !false; {43788#true} is VALID [2020-07-10 18:56:44,865 INFO L280 TraceCheckUtils]: 30: Hoare triple {43788#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {43788#true} is VALID [2020-07-10 18:56:44,865 INFO L280 TraceCheckUtils]: 31: Hoare triple {43788#true} ~cond~0 := #t~nondet6; {43788#true} is VALID [2020-07-10 18:56:44,865 INFO L280 TraceCheckUtils]: 32: Hoare triple {43788#true} havoc #t~nondet6; {43788#true} is VALID [2020-07-10 18:56:44,865 INFO L280 TraceCheckUtils]: 33: Hoare triple {43788#true} assume !(0 == ~cond~0); {43788#true} is VALID [2020-07-10 18:56:44,865 INFO L280 TraceCheckUtils]: 34: Hoare triple {43788#true} ~lk1~0 := 0; {43788#true} is VALID [2020-07-10 18:56:44,866 INFO L280 TraceCheckUtils]: 35: Hoare triple {43788#true} ~lk2~0 := 0; {43788#true} is VALID [2020-07-10 18:56:44,866 INFO L280 TraceCheckUtils]: 36: Hoare triple {43788#true} ~lk3~0 := 0; {43788#true} is VALID [2020-07-10 18:56:44,866 INFO L280 TraceCheckUtils]: 37: Hoare triple {43788#true} ~lk4~0 := 0; {43788#true} is VALID [2020-07-10 18:56:44,866 INFO L280 TraceCheckUtils]: 38: Hoare triple {43788#true} ~lk5~0 := 0; {43788#true} is VALID [2020-07-10 18:56:44,866 INFO L280 TraceCheckUtils]: 39: Hoare triple {43788#true} ~lk6~0 := 0; {43788#true} is VALID [2020-07-10 18:56:44,867 INFO L280 TraceCheckUtils]: 40: Hoare triple {43788#true} assume !(0 != ~p1~0); {43788#true} is VALID [2020-07-10 18:56:44,867 INFO L280 TraceCheckUtils]: 41: Hoare triple {43788#true} assume !(0 != ~p2~0); {43788#true} is VALID [2020-07-10 18:56:44,867 INFO L280 TraceCheckUtils]: 42: Hoare triple {43788#true} assume !(0 != ~p3~0); {43788#true} is VALID [2020-07-10 18:56:44,867 INFO L280 TraceCheckUtils]: 43: Hoare triple {43788#true} assume !(0 != ~p4~0); {43788#true} is VALID [2020-07-10 18:56:44,867 INFO L280 TraceCheckUtils]: 44: Hoare triple {43788#true} assume !(0 != ~p5~0); {43788#true} is VALID [2020-07-10 18:56:44,868 INFO L280 TraceCheckUtils]: 45: Hoare triple {43788#true} assume 0 != ~p6~0; {43788#true} is VALID [2020-07-10 18:56:44,875 INFO L280 TraceCheckUtils]: 46: Hoare triple {43788#true} ~lk6~0 := 1; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:56:44,892 INFO L280 TraceCheckUtils]: 47: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:56:44,895 INFO L280 TraceCheckUtils]: 48: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:56:44,896 INFO L280 TraceCheckUtils]: 49: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:56:44,897 INFO L280 TraceCheckUtils]: 50: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:56:44,897 INFO L280 TraceCheckUtils]: 51: Hoare triple {43792#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {43792#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:56:44,898 INFO L280 TraceCheckUtils]: 52: Hoare triple {43792#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {43792#(= 1 main_~lk6~0)} is VALID [2020-07-10 18:56:44,898 INFO L280 TraceCheckUtils]: 53: Hoare triple {43792#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {43789#false} is VALID [2020-07-10 18:56:44,898 INFO L280 TraceCheckUtils]: 54: Hoare triple {43789#false} assume !false; {43789#false} is VALID [2020-07-10 18:56:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 18:56:44,900 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 18:56:44,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357054250] [2020-07-10 18:56:44,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 18:56:44,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 18:56:44,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96121458] [2020-07-10 18:56:44,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-10 18:56:44,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 18:56:44,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 18:56:44,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:44,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 18:56:44,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 18:56:44,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 18:56:44,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:44,952 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-10 18:56:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:47,573 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-10 18:56:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 18:56:47,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-10 18:56:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 18:56:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-10 18:56:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 18:56:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2020-07-10 18:56:47,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2020-07-10 18:56:47,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:47,659 INFO L225 Difference]: With dead ends: 1103 [2020-07-10 18:56:47,660 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 18:56:47,662 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 18:56:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 18:56:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 18:56:47,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 18:56:47,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 18:56:47,663 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:56:47,663 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:56:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:47,663 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:56:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:56:47,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:47,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:47,664 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 18:56:47,664 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 18:56:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 18:56:47,665 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 18:56:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:56:47,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:47,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 18:56:47,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 18:56:47,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 18:56:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 18:56:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 18:56:47,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-10 18:56:47,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 18:56:47,666 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 18:56:47,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 18:56:47,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 18:56:47,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 18:56:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 18:56:47,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 18:56:47,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 18:56:47,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 18:56:48,105 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-10 18:56:48,914 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 18:56:49,293 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-10 18:56:49,674 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-10 18:56:50,637 WARN L193 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-10 18:56:50,768 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 18:56:51,041 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 18:56:51,432 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-10 18:56:51,779 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-10 18:56:51,943 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-10 18:56:52,224 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-10 18:56:52,595 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-10 18:56:52,741 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:56:52,741 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:56:52,741 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 18:56:52,741 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 18:56:52,741 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 18:56:52,741 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 18:56:52,742 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-10 18:56:52,742 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-10 18:56:52,742 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 18:56:52,742 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk5~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse2 .cse6 .cse3 .cse5) (and .cse0 .cse4 .cse1 .cse3) (and .cse1 .cse2 .cse6 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse0 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse7) (and .cse2 .cse7 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse0 .cse4 .cse7 .cse5) (and .cse4 .cse6 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse6) (and .cse0 .cse2 .cse7 .cse5))) [2020-07-10 18:56:52,743 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-10 18:56:52,743 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-10 18:56:52,743 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-10 18:56:52,743 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-10 18:56:52,743 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-10 18:56:52,744 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-10 18:56:52,744 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-10 18:56:52,744 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-10 18:56:52,745 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-10 18:56:52,745 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-10 18:56:52,745 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-10 18:56:52,746 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-10 18:56:52,746 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk6~0)) (.cse3 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p6~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-07-10 18:56:52,746 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-10 18:56:52,746 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-10 18:56:52,746 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-10 18:56:52,746 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-10 18:56:52,747 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse7) (and .cse8 .cse0 .cse6 .cse1 .cse2) (and .cse8 .cse5 .cse0 .cse7 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse3 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse0 .cse2 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse0 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse7 .cse4) (and .cse8 .cse5 .cse0 .cse6 .cse2))) [2020-07-10 18:56:52,747 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-10 18:56:52,747 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-10 18:56:52,747 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-10 18:56:52,747 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-10 18:56:52,747 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-10 18:56:52,747 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-10 18:56:52,748 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-10 18:56:52,748 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-10 18:56:52,748 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-10 18:56:52,748 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-10 18:56:52,748 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 18:56:52,748 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-10 18:56:52,749 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse3 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse6 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse7 .cse8 .cse0 .cse5 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse7 .cse8 .cse6 .cse9 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse9) (and .cse7 .cse8 .cse6 .cse2 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse6 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse2) (and .cse7 .cse6 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6 .cse1 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse1 .cse9 .cse4) (and .cse0 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse6 .cse1 .cse2) (and .cse7 .cse8 .cse0 .cse5 .cse2))) [2020-07-10 18:56:52,749 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-10 18:56:52,749 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-10 18:56:52,749 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-10 18:56:52,749 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-10 18:56:52,749 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 18:56:52,750 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-10 18:56:52,750 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-10 18:56:52,750 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-10 18:56:52,750 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-10 18:56:52,750 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-10 18:56:52,751 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-10 18:56:52,751 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-10 18:56:52,751 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-10 18:56:52,751 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-10 18:56:52,751 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3))) [2020-07-10 18:56:52,751 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 18:56:52,752 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-10 18:56:52,752 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-10 18:56:52,753 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-10 18:56:52,753 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-10 18:56:52,753 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-10 18:56:52,753 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-10 18:56:52,753 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-10 18:56:52,753 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-10 18:56:52,754 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-10 18:56:52,754 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-10 18:56:52,754 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-10 18:56:52,754 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-10 18:56:52,754 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-10 18:56:52,755 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-10 18:56:52,755 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= 1 main_~lk6~0) (= 0 main_~p6~0)) [2020-07-10 18:56:52,755 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-10 18:56:52,755 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-10 18:56:52,755 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 18:56:52,755 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-10 18:56:52,755 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-10 18:56:52,756 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-10 18:56:52,816 INFO L163 areAnnotationChecker]: CFG has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 18:56:52,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 06:56:52 BoogieIcfgContainer [2020-07-10 18:56:52,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 18:56:52,827 INFO L168 Benchmark]: Toolchain (without parser) took 51704.29 ms. Allocated memory was 136.8 MB in the beginning and 570.9 MB in the end (delta: 434.1 MB). Free memory was 101.6 MB in the beginning and 200.1 MB in the end (delta: -98.5 MB). Peak memory consumption was 335.6 MB. Max. memory is 7.1 GB. [2020-07-10 18:56:52,827 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 18:56:52,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.83 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 90.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 18:56:52,828 INFO L168 Benchmark]: Boogie Preprocessor took 142.30 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.9 MB in the beginning and 178.9 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 18:56:52,829 INFO L168 Benchmark]: RCFGBuilder took 601.72 ms. Allocated memory is still 200.8 MB. Free memory was 178.9 MB in the beginning and 148.6 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2020-07-10 18:56:52,830 INFO L168 Benchmark]: TraceAbstraction took 50644.81 ms. Allocated memory was 200.8 MB in the beginning and 570.9 MB in the end (delta: 370.1 MB). Free memory was 147.9 MB in the beginning and 200.1 MB in the end (delta: -52.2 MB). Peak memory consumption was 317.9 MB. Max. memory is 7.1 GB. [2020-07-10 18:56:52,832 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 309.83 ms. Allocated memory is still 136.8 MB. Free memory was 101.4 MB in the beginning and 90.9 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.30 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.9 MB in the beginning and 178.9 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 601.72 ms. Allocated memory is still 200.8 MB. Free memory was 178.9 MB in the beginning and 148.6 MB in the end (delta: 30.3 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50644.81 ms. Allocated memory was 200.8 MB in the beginning and 570.9 MB in the end (delta: 370.1 MB). Free memory was 147.9 MB in the beginning and 200.1 MB in the end (delta: -52.2 MB). Peak memory consumption was 317.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 45.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1351 SDtfs, 477 SDslu, 950 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...