/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_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:16:26,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:16:26,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:16:26,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:16:26,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:16:26,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:16:26,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:16:26,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:16:26,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:16:26,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:16:26,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:16:26,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:16:26,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:16:26,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:16:26,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:16:26,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:16:26,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:16:26,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:16:26,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:16:26,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:16:26,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:16:26,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:16:26,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:16:26,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:16:26,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:16:26,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:16:26,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:16:26,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:16:26,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:16:26,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:16:26,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:16:26,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:16:26,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:16:26,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:16:26,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:16:26,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:16:26,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:16:26,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:16:26,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:16:26,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:16:26,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:16:26,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:16:26,261 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:16:26,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:16:26,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:16:26,263 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:16:26,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:16:26,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:16:26,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:16:26,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:16:26,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:16:26,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:16:26,265 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:16:26,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:16:26,265 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:16:26,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:16:26,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:16:26,266 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:16:26,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:16:26,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:16:26,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:16:26,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:16:26,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:16:26,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:16:26,267 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:16:26,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:16:26,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:16:26,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:16:26,579 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:16:26,579 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:16:26,580 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-07-18 00:16:26,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ddb9c2b/f48f318548f24255a85cb505923be927/FLAGffe2164fd [2020-07-18 00:16:27,185 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:16:27,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-07-18 00:16:27,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ddb9c2b/f48f318548f24255a85cb505923be927/FLAGffe2164fd [2020-07-18 00:16:27,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3ddb9c2b/f48f318548f24255a85cb505923be927 [2020-07-18 00:16:27,560 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:16:27,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:16:27,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:16:27,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:16:27,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:16:27,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598cff86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27, skipping insertion in model container [2020-07-18 00:16:27,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:16:27,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:16:27,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:16:27,800 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:16:27,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:16:27,838 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:16:27,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27 WrapperNode [2020-07-18 00:16:27,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:16:27,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:16:27,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:16:27,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:16:27,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (1/1) ... [2020-07-18 00:16:27,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:16:27,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:16:27,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:16:27,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:16:27,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (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-18 00:16:28,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:16:28,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:16:28,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:16:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:16:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:16:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:16:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:16:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:16:28,524 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:16:28,525 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:16:28,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:16:28 BoogieIcfgContainer [2020-07-18 00:16:28,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:16:28,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:16:28,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:16:28,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:16:28,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:16:27" (1/3) ... [2020-07-18 00:16:28,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb887d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:16:28, skipping insertion in model container [2020-07-18 00:16:28,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:27" (2/3) ... [2020-07-18 00:16:28,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb887d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:16:28, skipping insertion in model container [2020-07-18 00:16:28,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:16:28" (3/3) ... [2020-07-18 00:16:28,539 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-07-18 00:16:28,548 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:16:28,556 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:16:28,569 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:16:28,594 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:16:28,594 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:16:28,595 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:16:28,595 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:16:28,595 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:16:28,595 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:16:28,596 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:16:28,596 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:16:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-07-18 00:16:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 00:16:28,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:28,628 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] [2020-07-18 00:16:28,629 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569836, now seen corresponding path program 1 times [2020-07-18 00:16:28,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:28,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65732420] [2020-07-18 00:16:28,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:28,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-18 00:16:28,894 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-18 00:16:28,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {71#true} call ULTIMATE.init(); {71#true} is VALID [2020-07-18 00:16:28,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-18 00:16:28,898 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-18 00:16:28,899 INFO L263 TraceCheckUtils]: 3: Hoare triple {71#true} call #t~ret6 := main(); {71#true} is VALID [2020-07-18 00:16:28,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {71#true} is VALID [2020-07-18 00:16:28,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {71#true} ~p1~0 := #t~nondet0; {71#true} is VALID [2020-07-18 00:16:28,908 INFO L280 TraceCheckUtils]: 6: Hoare triple {71#true} havoc #t~nondet0; {71#true} is VALID [2020-07-18 00:16:28,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {71#true} havoc ~lk1~0; {71#true} is VALID [2020-07-18 00:16:28,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {71#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {71#true} is VALID [2020-07-18 00:16:28,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {71#true} ~p2~0 := #t~nondet1; {71#true} is VALID [2020-07-18 00:16:28,911 INFO L280 TraceCheckUtils]: 10: Hoare triple {71#true} havoc #t~nondet1; {71#true} is VALID [2020-07-18 00:16:28,912 INFO L280 TraceCheckUtils]: 11: Hoare triple {71#true} havoc ~lk2~0; {71#true} is VALID [2020-07-18 00:16:28,920 INFO L280 TraceCheckUtils]: 12: Hoare triple {71#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {71#true} is VALID [2020-07-18 00:16:28,920 INFO L280 TraceCheckUtils]: 13: Hoare triple {71#true} ~p3~0 := #t~nondet2; {71#true} is VALID [2020-07-18 00:16:28,921 INFO L280 TraceCheckUtils]: 14: Hoare triple {71#true} havoc #t~nondet2; {71#true} is VALID [2020-07-18 00:16:28,921 INFO L280 TraceCheckUtils]: 15: Hoare triple {71#true} havoc ~lk3~0; {71#true} is VALID [2020-07-18 00:16:28,922 INFO L280 TraceCheckUtils]: 16: Hoare triple {71#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {71#true} is VALID [2020-07-18 00:16:28,922 INFO L280 TraceCheckUtils]: 17: Hoare triple {71#true} ~p4~0 := #t~nondet3; {71#true} is VALID [2020-07-18 00:16:28,923 INFO L280 TraceCheckUtils]: 18: Hoare triple {71#true} havoc #t~nondet3; {71#true} is VALID [2020-07-18 00:16:28,923 INFO L280 TraceCheckUtils]: 19: Hoare triple {71#true} havoc ~lk4~0; {71#true} is VALID [2020-07-18 00:16:28,924 INFO L280 TraceCheckUtils]: 20: Hoare triple {71#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {71#true} is VALID [2020-07-18 00:16:28,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {71#true} ~p5~0 := #t~nondet4; {71#true} is VALID [2020-07-18 00:16:28,925 INFO L280 TraceCheckUtils]: 22: Hoare triple {71#true} havoc #t~nondet4; {71#true} is VALID [2020-07-18 00:16:28,925 INFO L280 TraceCheckUtils]: 23: Hoare triple {71#true} havoc ~lk5~0; {71#true} is VALID [2020-07-18 00:16:28,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {71#true} havoc ~cond~0; {71#true} is VALID [2020-07-18 00:16:28,929 INFO L280 TraceCheckUtils]: 25: Hoare triple {71#true} assume !false; {71#true} is VALID [2020-07-18 00:16:28,929 INFO L280 TraceCheckUtils]: 26: Hoare triple {71#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {71#true} is VALID [2020-07-18 00:16:28,930 INFO L280 TraceCheckUtils]: 27: Hoare triple {71#true} ~cond~0 := #t~nondet5; {71#true} is VALID [2020-07-18 00:16:28,930 INFO L280 TraceCheckUtils]: 28: Hoare triple {71#true} havoc #t~nondet5; {71#true} is VALID [2020-07-18 00:16:28,931 INFO L280 TraceCheckUtils]: 29: Hoare triple {71#true} assume !(0 == ~cond~0); {71#true} is VALID [2020-07-18 00:16:28,931 INFO L280 TraceCheckUtils]: 30: Hoare triple {71#true} ~lk1~0 := 0; {71#true} is VALID [2020-07-18 00:16:28,932 INFO L280 TraceCheckUtils]: 31: Hoare triple {71#true} ~lk2~0 := 0; {71#true} is VALID [2020-07-18 00:16:28,932 INFO L280 TraceCheckUtils]: 32: Hoare triple {71#true} ~lk3~0 := 0; {71#true} is VALID [2020-07-18 00:16:28,933 INFO L280 TraceCheckUtils]: 33: Hoare triple {71#true} ~lk4~0 := 0; {71#true} is VALID [2020-07-18 00:16:28,934 INFO L280 TraceCheckUtils]: 34: Hoare triple {71#true} ~lk5~0 := 0; {71#true} is VALID [2020-07-18 00:16:28,936 INFO L280 TraceCheckUtils]: 35: Hoare triple {71#true} assume !(0 != ~p1~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:28,937 INFO L280 TraceCheckUtils]: 36: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:28,938 INFO L280 TraceCheckUtils]: 37: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:28,940 INFO L280 TraceCheckUtils]: 38: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:28,941 INFO L280 TraceCheckUtils]: 39: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:28,944 INFO L280 TraceCheckUtils]: 40: Hoare triple {75#(= 0 main_~p1~0)} assume 0 != ~p1~0; {72#false} is VALID [2020-07-18 00:16:28,944 INFO L280 TraceCheckUtils]: 41: Hoare triple {72#false} assume 1 != ~lk1~0; {72#false} is VALID [2020-07-18 00:16:28,945 INFO L280 TraceCheckUtils]: 42: Hoare triple {72#false} assume !false; {72#false} is VALID [2020-07-18 00:16:28,953 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-18 00:16:28,956 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:28,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65732420] [2020-07-18 00:16:28,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:28,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:28,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437137345] [2020-07-18 00:16:28,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-18 00:16:28,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:28,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:29,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:29,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:29,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:29,111 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-07-18 00:16:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:29,544 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2020-07-18 00:16:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:29,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-18 00:16:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:29,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-18 00:16:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-18 00:16:29,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2020-07-18 00:16:29,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:29,896 INFO L225 Difference]: With dead ends: 147 [2020-07-18 00:16:29,896 INFO L226 Difference]: Without dead ends: 96 [2020-07-18 00:16:29,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 00:16:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-18 00:16:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-07-18 00:16:30,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:30,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2020-07-18 00:16:30,056 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2020-07-18 00:16:30,056 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2020-07-18 00:16:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:30,070 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-18 00:16:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-18 00:16:30,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:30,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:30,074 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2020-07-18 00:16:30,075 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2020-07-18 00:16:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:30,095 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-18 00:16:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-18 00:16:30,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:30,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:30,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:30,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-18 00:16:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-07-18 00:16:30,117 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2020-07-18 00:16:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:30,117 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-07-18 00:16:30,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:30,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 120 transitions. [2020-07-18 00:16:30,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-07-18 00:16:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 00:16:30,280 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:30,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] [2020-07-18 00:16:30,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:16:30,281 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1252462105, now seen corresponding path program 1 times [2020-07-18 00:16:30,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:30,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1533358434] [2020-07-18 00:16:30,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:30,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-18 00:16:30,350 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-18 00:16:30,351 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2020-07-18 00:16:30,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-18 00:16:30,352 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-18 00:16:30,352 INFO L263 TraceCheckUtils]: 3: Hoare triple {752#true} call #t~ret6 := main(); {752#true} is VALID [2020-07-18 00:16:30,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {752#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {752#true} is VALID [2020-07-18 00:16:30,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} ~p1~0 := #t~nondet0; {752#true} is VALID [2020-07-18 00:16:30,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {752#true} havoc #t~nondet0; {752#true} is VALID [2020-07-18 00:16:30,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {752#true} havoc ~lk1~0; {752#true} is VALID [2020-07-18 00:16:30,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {752#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {752#true} is VALID [2020-07-18 00:16:30,354 INFO L280 TraceCheckUtils]: 9: Hoare triple {752#true} ~p2~0 := #t~nondet1; {752#true} is VALID [2020-07-18 00:16:30,355 INFO L280 TraceCheckUtils]: 10: Hoare triple {752#true} havoc #t~nondet1; {752#true} is VALID [2020-07-18 00:16:30,355 INFO L280 TraceCheckUtils]: 11: Hoare triple {752#true} havoc ~lk2~0; {752#true} is VALID [2020-07-18 00:16:30,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {752#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {752#true} is VALID [2020-07-18 00:16:30,356 INFO L280 TraceCheckUtils]: 13: Hoare triple {752#true} ~p3~0 := #t~nondet2; {752#true} is VALID [2020-07-18 00:16:30,356 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#true} havoc #t~nondet2; {752#true} is VALID [2020-07-18 00:16:30,356 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#true} havoc ~lk3~0; {752#true} is VALID [2020-07-18 00:16:30,357 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {752#true} is VALID [2020-07-18 00:16:30,357 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#true} ~p4~0 := #t~nondet3; {752#true} is VALID [2020-07-18 00:16:30,358 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#true} havoc #t~nondet3; {752#true} is VALID [2020-07-18 00:16:30,358 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#true} havoc ~lk4~0; {752#true} is VALID [2020-07-18 00:16:30,358 INFO L280 TraceCheckUtils]: 20: Hoare triple {752#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {752#true} is VALID [2020-07-18 00:16:30,359 INFO L280 TraceCheckUtils]: 21: Hoare triple {752#true} ~p5~0 := #t~nondet4; {752#true} is VALID [2020-07-18 00:16:30,359 INFO L280 TraceCheckUtils]: 22: Hoare triple {752#true} havoc #t~nondet4; {752#true} is VALID [2020-07-18 00:16:30,359 INFO L280 TraceCheckUtils]: 23: Hoare triple {752#true} havoc ~lk5~0; {752#true} is VALID [2020-07-18 00:16:30,359 INFO L280 TraceCheckUtils]: 24: Hoare triple {752#true} havoc ~cond~0; {752#true} is VALID [2020-07-18 00:16:30,360 INFO L280 TraceCheckUtils]: 25: Hoare triple {752#true} assume !false; {752#true} is VALID [2020-07-18 00:16:30,360 INFO L280 TraceCheckUtils]: 26: Hoare triple {752#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {752#true} is VALID [2020-07-18 00:16:30,360 INFO L280 TraceCheckUtils]: 27: Hoare triple {752#true} ~cond~0 := #t~nondet5; {752#true} is VALID [2020-07-18 00:16:30,361 INFO L280 TraceCheckUtils]: 28: Hoare triple {752#true} havoc #t~nondet5; {752#true} is VALID [2020-07-18 00:16:30,361 INFO L280 TraceCheckUtils]: 29: Hoare triple {752#true} assume !(0 == ~cond~0); {752#true} is VALID [2020-07-18 00:16:30,361 INFO L280 TraceCheckUtils]: 30: Hoare triple {752#true} ~lk1~0 := 0; {752#true} is VALID [2020-07-18 00:16:30,361 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#true} ~lk2~0 := 0; {752#true} is VALID [2020-07-18 00:16:30,362 INFO L280 TraceCheckUtils]: 32: Hoare triple {752#true} ~lk3~0 := 0; {752#true} is VALID [2020-07-18 00:16:30,362 INFO L280 TraceCheckUtils]: 33: Hoare triple {752#true} ~lk4~0 := 0; {752#true} is VALID [2020-07-18 00:16:30,362 INFO L280 TraceCheckUtils]: 34: Hoare triple {752#true} ~lk5~0 := 0; {752#true} is VALID [2020-07-18 00:16:30,363 INFO L280 TraceCheckUtils]: 35: Hoare triple {752#true} assume 0 != ~p1~0; {752#true} is VALID [2020-07-18 00:16:30,363 INFO L280 TraceCheckUtils]: 36: Hoare triple {752#true} ~lk1~0 := 1; {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:30,364 INFO L280 TraceCheckUtils]: 37: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:30,366 INFO L280 TraceCheckUtils]: 38: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:30,367 INFO L280 TraceCheckUtils]: 39: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:30,369 INFO L280 TraceCheckUtils]: 40: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:30,371 INFO L280 TraceCheckUtils]: 41: Hoare triple {756#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {756#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:30,373 INFO L280 TraceCheckUtils]: 42: Hoare triple {756#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {753#false} is VALID [2020-07-18 00:16:30,374 INFO L280 TraceCheckUtils]: 43: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-18 00:16:30,377 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-18 00:16:30,378 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:30,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1533358434] [2020-07-18 00:16:30,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:30,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:30,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4602457] [2020-07-18 00:16:30,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 00:16:30,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:30,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:30,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:30,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:30,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:30,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:30,447 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 3 states. [2020-07-18 00:16:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:30,739 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2020-07-18 00:16:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:30,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 00:16:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-18 00:16:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-18 00:16:30,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2020-07-18 00:16:30,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:30,857 INFO L225 Difference]: With dead ends: 116 [2020-07-18 00:16:30,858 INFO L226 Difference]: Without dead ends: 114 [2020-07-18 00:16:30,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 00:16:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-18 00:16:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-07-18 00:16:30,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:30,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 94 states. [2020-07-18 00:16:30,957 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 94 states. [2020-07-18 00:16:30,958 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 94 states. [2020-07-18 00:16:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:30,964 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-18 00:16:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-18 00:16:30,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:30,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:30,966 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 114 states. [2020-07-18 00:16:30,966 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 114 states. [2020-07-18 00:16:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:30,973 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-18 00:16:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-18 00:16:30,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:30,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:30,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:30,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-18 00:16:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-07-18 00:16:30,980 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 44 [2020-07-18 00:16:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:30,980 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-07-18 00:16:30,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:30,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 119 transitions. [2020-07-18 00:16:31,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-07-18 00:16:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 00:16:31,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:31,117 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] [2020-07-18 00:16:31,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:16:31,118 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:31,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:31,119 INFO L82 PathProgramCache]: Analyzing trace with hash 755286414, now seen corresponding path program 1 times [2020-07-18 00:16:31,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:31,119 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [305074671] [2020-07-18 00:16:31,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:31,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-18 00:16:31,207 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-18 00:16:31,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2020-07-18 00:16:31,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-18 00:16:31,208 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-18 00:16:31,208 INFO L263 TraceCheckUtils]: 3: Hoare triple {1407#true} call #t~ret6 := main(); {1407#true} is VALID [2020-07-18 00:16:31,209 INFO L280 TraceCheckUtils]: 4: Hoare triple {1407#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1407#true} is VALID [2020-07-18 00:16:31,209 INFO L280 TraceCheckUtils]: 5: Hoare triple {1407#true} ~p1~0 := #t~nondet0; {1407#true} is VALID [2020-07-18 00:16:31,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {1407#true} havoc #t~nondet0; {1407#true} is VALID [2020-07-18 00:16:31,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {1407#true} havoc ~lk1~0; {1407#true} is VALID [2020-07-18 00:16:31,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {1407#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1407#true} is VALID [2020-07-18 00:16:31,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {1407#true} ~p2~0 := #t~nondet1; {1407#true} is VALID [2020-07-18 00:16:31,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {1407#true} havoc #t~nondet1; {1407#true} is VALID [2020-07-18 00:16:31,211 INFO L280 TraceCheckUtils]: 11: Hoare triple {1407#true} havoc ~lk2~0; {1407#true} is VALID [2020-07-18 00:16:31,211 INFO L280 TraceCheckUtils]: 12: Hoare triple {1407#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1407#true} is VALID [2020-07-18 00:16:31,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {1407#true} ~p3~0 := #t~nondet2; {1407#true} is VALID [2020-07-18 00:16:31,211 INFO L280 TraceCheckUtils]: 14: Hoare triple {1407#true} havoc #t~nondet2; {1407#true} is VALID [2020-07-18 00:16:31,212 INFO L280 TraceCheckUtils]: 15: Hoare triple {1407#true} havoc ~lk3~0; {1407#true} is VALID [2020-07-18 00:16:31,212 INFO L280 TraceCheckUtils]: 16: Hoare triple {1407#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1407#true} is VALID [2020-07-18 00:16:31,212 INFO L280 TraceCheckUtils]: 17: Hoare triple {1407#true} ~p4~0 := #t~nondet3; {1407#true} is VALID [2020-07-18 00:16:31,213 INFO L280 TraceCheckUtils]: 18: Hoare triple {1407#true} havoc #t~nondet3; {1407#true} is VALID [2020-07-18 00:16:31,213 INFO L280 TraceCheckUtils]: 19: Hoare triple {1407#true} havoc ~lk4~0; {1407#true} is VALID [2020-07-18 00:16:31,213 INFO L280 TraceCheckUtils]: 20: Hoare triple {1407#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1407#true} is VALID [2020-07-18 00:16:31,214 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#true} ~p5~0 := #t~nondet4; {1407#true} is VALID [2020-07-18 00:16:31,214 INFO L280 TraceCheckUtils]: 22: Hoare triple {1407#true} havoc #t~nondet4; {1407#true} is VALID [2020-07-18 00:16:31,214 INFO L280 TraceCheckUtils]: 23: Hoare triple {1407#true} havoc ~lk5~0; {1407#true} is VALID [2020-07-18 00:16:31,214 INFO L280 TraceCheckUtils]: 24: Hoare triple {1407#true} havoc ~cond~0; {1407#true} is VALID [2020-07-18 00:16:31,215 INFO L280 TraceCheckUtils]: 25: Hoare triple {1407#true} assume !false; {1407#true} is VALID [2020-07-18 00:16:31,215 INFO L280 TraceCheckUtils]: 26: Hoare triple {1407#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1407#true} is VALID [2020-07-18 00:16:31,215 INFO L280 TraceCheckUtils]: 27: Hoare triple {1407#true} ~cond~0 := #t~nondet5; {1407#true} is VALID [2020-07-18 00:16:31,215 INFO L280 TraceCheckUtils]: 28: Hoare triple {1407#true} havoc #t~nondet5; {1407#true} is VALID [2020-07-18 00:16:31,216 INFO L280 TraceCheckUtils]: 29: Hoare triple {1407#true} assume !(0 == ~cond~0); {1407#true} is VALID [2020-07-18 00:16:31,216 INFO L280 TraceCheckUtils]: 30: Hoare triple {1407#true} ~lk1~0 := 0; {1407#true} is VALID [2020-07-18 00:16:31,216 INFO L280 TraceCheckUtils]: 31: Hoare triple {1407#true} ~lk2~0 := 0; {1407#true} is VALID [2020-07-18 00:16:31,217 INFO L280 TraceCheckUtils]: 32: Hoare triple {1407#true} ~lk3~0 := 0; {1407#true} is VALID [2020-07-18 00:16:31,217 INFO L280 TraceCheckUtils]: 33: Hoare triple {1407#true} ~lk4~0 := 0; {1407#true} is VALID [2020-07-18 00:16:31,217 INFO L280 TraceCheckUtils]: 34: Hoare triple {1407#true} ~lk5~0 := 0; {1407#true} is VALID [2020-07-18 00:16:31,217 INFO L280 TraceCheckUtils]: 35: Hoare triple {1407#true} assume !(0 != ~p1~0); {1407#true} is VALID [2020-07-18 00:16:31,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {1407#true} assume !(0 != ~p2~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:31,219 INFO L280 TraceCheckUtils]: 37: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:31,220 INFO L280 TraceCheckUtils]: 38: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:31,221 INFO L280 TraceCheckUtils]: 39: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:31,221 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-18 00:16:31,222 INFO L280 TraceCheckUtils]: 41: Hoare triple {1411#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1408#false} is VALID [2020-07-18 00:16:31,223 INFO L280 TraceCheckUtils]: 42: Hoare triple {1408#false} assume 1 != ~lk2~0; {1408#false} is VALID [2020-07-18 00:16:31,223 INFO L280 TraceCheckUtils]: 43: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2020-07-18 00:16:31,225 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-18 00:16:31,226 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:31,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [305074671] [2020-07-18 00:16:31,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:31,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:31,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599031179] [2020-07-18 00:16:31,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 00:16:31,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:31,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:31,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:31,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:31,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:31,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:31,274 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2020-07-18 00:16:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:31,651 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2020-07-18 00:16:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:31,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-18 00:16:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-18 00:16:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:31,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-18 00:16:31,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-18 00:16:31,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:31,844 INFO L225 Difference]: With dead ends: 226 [2020-07-18 00:16:31,844 INFO L226 Difference]: Without dead ends: 157 [2020-07-18 00:16:31,845 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 00:16:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-18 00:16:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-07-18 00:16:32,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:32,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 155 states. [2020-07-18 00:16:32,026 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 155 states. [2020-07-18 00:16:32,026 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 155 states. [2020-07-18 00:16:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:32,037 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-18 00:16:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-18 00:16:32,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:32,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:32,039 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 157 states. [2020-07-18 00:16:32,039 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 157 states. [2020-07-18 00:16:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:32,051 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-18 00:16:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-18 00:16:32,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:32,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:32,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:32,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-18 00:16:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2020-07-18 00:16:32,063 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 44 [2020-07-18 00:16:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:32,063 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2020-07-18 00:16:32,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:32,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 200 transitions. [2020-07-18 00:16:32,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2020-07-18 00:16:32,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-18 00:16:32,300 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:32,300 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] [2020-07-18 00:16:32,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:16:32,304 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1863120818, now seen corresponding path program 1 times [2020-07-18 00:16:32,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:32,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1436249966] [2020-07-18 00:16:32,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:32,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-18 00:16:32,385 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-18 00:16:32,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2020-07-18 00:16:32,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-18 00:16:32,386 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-18 00:16:32,386 INFO L263 TraceCheckUtils]: 3: Hoare triple {2490#true} call #t~ret6 := main(); {2490#true} is VALID [2020-07-18 00:16:32,387 INFO L280 TraceCheckUtils]: 4: Hoare triple {2490#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2490#true} is VALID [2020-07-18 00:16:32,387 INFO L280 TraceCheckUtils]: 5: Hoare triple {2490#true} ~p1~0 := #t~nondet0; {2490#true} is VALID [2020-07-18 00:16:32,387 INFO L280 TraceCheckUtils]: 6: Hoare triple {2490#true} havoc #t~nondet0; {2490#true} is VALID [2020-07-18 00:16:32,387 INFO L280 TraceCheckUtils]: 7: Hoare triple {2490#true} havoc ~lk1~0; {2490#true} is VALID [2020-07-18 00:16:32,388 INFO L280 TraceCheckUtils]: 8: Hoare triple {2490#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2490#true} is VALID [2020-07-18 00:16:32,388 INFO L280 TraceCheckUtils]: 9: Hoare triple {2490#true} ~p2~0 := #t~nondet1; {2490#true} is VALID [2020-07-18 00:16:32,393 INFO L280 TraceCheckUtils]: 10: Hoare triple {2490#true} havoc #t~nondet1; {2490#true} is VALID [2020-07-18 00:16:32,393 INFO L280 TraceCheckUtils]: 11: Hoare triple {2490#true} havoc ~lk2~0; {2490#true} is VALID [2020-07-18 00:16:32,393 INFO L280 TraceCheckUtils]: 12: Hoare triple {2490#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2490#true} is VALID [2020-07-18 00:16:32,394 INFO L280 TraceCheckUtils]: 13: Hoare triple {2490#true} ~p3~0 := #t~nondet2; {2490#true} is VALID [2020-07-18 00:16:32,394 INFO L280 TraceCheckUtils]: 14: Hoare triple {2490#true} havoc #t~nondet2; {2490#true} is VALID [2020-07-18 00:16:32,394 INFO L280 TraceCheckUtils]: 15: Hoare triple {2490#true} havoc ~lk3~0; {2490#true} is VALID [2020-07-18 00:16:32,395 INFO L280 TraceCheckUtils]: 16: Hoare triple {2490#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2490#true} is VALID [2020-07-18 00:16:32,395 INFO L280 TraceCheckUtils]: 17: Hoare triple {2490#true} ~p4~0 := #t~nondet3; {2490#true} is VALID [2020-07-18 00:16:32,395 INFO L280 TraceCheckUtils]: 18: Hoare triple {2490#true} havoc #t~nondet3; {2490#true} is VALID [2020-07-18 00:16:32,395 INFO L280 TraceCheckUtils]: 19: Hoare triple {2490#true} havoc ~lk4~0; {2490#true} is VALID [2020-07-18 00:16:32,396 INFO L280 TraceCheckUtils]: 20: Hoare triple {2490#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2490#true} is VALID [2020-07-18 00:16:32,396 INFO L280 TraceCheckUtils]: 21: Hoare triple {2490#true} ~p5~0 := #t~nondet4; {2490#true} is VALID [2020-07-18 00:16:32,396 INFO L280 TraceCheckUtils]: 22: Hoare triple {2490#true} havoc #t~nondet4; {2490#true} is VALID [2020-07-18 00:16:32,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {2490#true} havoc ~lk5~0; {2490#true} is VALID [2020-07-18 00:16:32,402 INFO L280 TraceCheckUtils]: 24: Hoare triple {2490#true} havoc ~cond~0; {2490#true} is VALID [2020-07-18 00:16:32,402 INFO L280 TraceCheckUtils]: 25: Hoare triple {2490#true} assume !false; {2490#true} is VALID [2020-07-18 00:16:32,402 INFO L280 TraceCheckUtils]: 26: Hoare triple {2490#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2490#true} is VALID [2020-07-18 00:16:32,402 INFO L280 TraceCheckUtils]: 27: Hoare triple {2490#true} ~cond~0 := #t~nondet5; {2490#true} is VALID [2020-07-18 00:16:32,402 INFO L280 TraceCheckUtils]: 28: Hoare triple {2490#true} havoc #t~nondet5; {2490#true} is VALID [2020-07-18 00:16:32,403 INFO L280 TraceCheckUtils]: 29: Hoare triple {2490#true} assume !(0 == ~cond~0); {2490#true} is VALID [2020-07-18 00:16:32,403 INFO L280 TraceCheckUtils]: 30: Hoare triple {2490#true} ~lk1~0 := 0; {2490#true} is VALID [2020-07-18 00:16:32,403 INFO L280 TraceCheckUtils]: 31: Hoare triple {2490#true} ~lk2~0 := 0; {2490#true} is VALID [2020-07-18 00:16:32,403 INFO L280 TraceCheckUtils]: 32: Hoare triple {2490#true} ~lk3~0 := 0; {2490#true} is VALID [2020-07-18 00:16:32,404 INFO L280 TraceCheckUtils]: 33: Hoare triple {2490#true} ~lk4~0 := 0; {2490#true} is VALID [2020-07-18 00:16:32,404 INFO L280 TraceCheckUtils]: 34: Hoare triple {2490#true} ~lk5~0 := 0; {2490#true} is VALID [2020-07-18 00:16:32,404 INFO L280 TraceCheckUtils]: 35: Hoare triple {2490#true} assume !(0 != ~p1~0); {2490#true} is VALID [2020-07-18 00:16:32,404 INFO L280 TraceCheckUtils]: 36: Hoare triple {2490#true} assume 0 != ~p2~0; {2490#true} is VALID [2020-07-18 00:16:32,405 INFO L280 TraceCheckUtils]: 37: Hoare triple {2490#true} ~lk2~0 := 1; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:32,406 INFO L280 TraceCheckUtils]: 38: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:32,407 INFO L280 TraceCheckUtils]: 39: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:32,408 INFO L280 TraceCheckUtils]: 40: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:32,408 INFO L280 TraceCheckUtils]: 41: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:32,409 INFO L280 TraceCheckUtils]: 42: Hoare triple {2494#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:16:32,410 INFO L280 TraceCheckUtils]: 43: Hoare triple {2494#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {2491#false} is VALID [2020-07-18 00:16:32,410 INFO L280 TraceCheckUtils]: 44: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2020-07-18 00:16:32,412 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-18 00:16:32,413 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:32,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1436249966] [2020-07-18 00:16:32,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:32,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:32,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543353436] [2020-07-18 00:16:32,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 00:16:32,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:32,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:32,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:32,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:32,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:32,458 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 3 states. [2020-07-18 00:16:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:32,805 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2020-07-18 00:16:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:32,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 00:16:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-18 00:16:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-18 00:16:32,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2020-07-18 00:16:32,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:32,930 INFO L225 Difference]: With dead ends: 191 [2020-07-18 00:16:32,930 INFO L226 Difference]: Without dead ends: 189 [2020-07-18 00:16:32,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 00:16:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-18 00:16:33,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2020-07-18 00:16:33,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:33,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 155 states. [2020-07-18 00:16:33,159 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 155 states. [2020-07-18 00:16:33,159 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 155 states. [2020-07-18 00:16:33,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:33,167 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-18 00:16:33,167 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-18 00:16:33,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:33,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:33,168 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 189 states. [2020-07-18 00:16:33,169 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 189 states. [2020-07-18 00:16:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:33,176 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-18 00:16:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-18 00:16:33,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:33,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:33,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:33,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-18 00:16:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2020-07-18 00:16:33,183 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2020-07-18 00:16:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:33,183 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2020-07-18 00:16:33,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:33,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 198 transitions. [2020-07-18 00:16:33,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2020-07-18 00:16:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-18 00:16:33,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:33,414 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] [2020-07-18 00:16:33,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:16:33,414 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:33,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1939288392, now seen corresponding path program 1 times [2020-07-18 00:16:33,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:33,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660972573] [2020-07-18 00:16:33,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:33,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-18 00:16:33,459 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-18 00:16:33,459 INFO L263 TraceCheckUtils]: 0: Hoare triple {3567#true} call ULTIMATE.init(); {3567#true} is VALID [2020-07-18 00:16:33,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-18 00:16:33,460 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-18 00:16:33,460 INFO L263 TraceCheckUtils]: 3: Hoare triple {3567#true} call #t~ret6 := main(); {3567#true} is VALID [2020-07-18 00:16:33,461 INFO L280 TraceCheckUtils]: 4: Hoare triple {3567#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3567#true} is VALID [2020-07-18 00:16:33,461 INFO L280 TraceCheckUtils]: 5: Hoare triple {3567#true} ~p1~0 := #t~nondet0; {3567#true} is VALID [2020-07-18 00:16:33,461 INFO L280 TraceCheckUtils]: 6: Hoare triple {3567#true} havoc #t~nondet0; {3567#true} is VALID [2020-07-18 00:16:33,461 INFO L280 TraceCheckUtils]: 7: Hoare triple {3567#true} havoc ~lk1~0; {3567#true} is VALID [2020-07-18 00:16:33,462 INFO L280 TraceCheckUtils]: 8: Hoare triple {3567#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3567#true} is VALID [2020-07-18 00:16:33,462 INFO L280 TraceCheckUtils]: 9: Hoare triple {3567#true} ~p2~0 := #t~nondet1; {3567#true} is VALID [2020-07-18 00:16:33,468 INFO L280 TraceCheckUtils]: 10: Hoare triple {3567#true} havoc #t~nondet1; {3567#true} is VALID [2020-07-18 00:16:33,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {3567#true} havoc ~lk2~0; {3567#true} is VALID [2020-07-18 00:16:33,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {3567#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3567#true} is VALID [2020-07-18 00:16:33,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {3567#true} ~p3~0 := #t~nondet2; {3567#true} is VALID [2020-07-18 00:16:33,469 INFO L280 TraceCheckUtils]: 14: Hoare triple {3567#true} havoc #t~nondet2; {3567#true} is VALID [2020-07-18 00:16:33,469 INFO L280 TraceCheckUtils]: 15: Hoare triple {3567#true} havoc ~lk3~0; {3567#true} is VALID [2020-07-18 00:16:33,470 INFO L280 TraceCheckUtils]: 16: Hoare triple {3567#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3567#true} is VALID [2020-07-18 00:16:33,470 INFO L280 TraceCheckUtils]: 17: Hoare triple {3567#true} ~p4~0 := #t~nondet3; {3567#true} is VALID [2020-07-18 00:16:33,470 INFO L280 TraceCheckUtils]: 18: Hoare triple {3567#true} havoc #t~nondet3; {3567#true} is VALID [2020-07-18 00:16:33,470 INFO L280 TraceCheckUtils]: 19: Hoare triple {3567#true} havoc ~lk4~0; {3567#true} is VALID [2020-07-18 00:16:33,471 INFO L280 TraceCheckUtils]: 20: Hoare triple {3567#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3567#true} is VALID [2020-07-18 00:16:33,471 INFO L280 TraceCheckUtils]: 21: Hoare triple {3567#true} ~p5~0 := #t~nondet4; {3567#true} is VALID [2020-07-18 00:16:33,471 INFO L280 TraceCheckUtils]: 22: Hoare triple {3567#true} havoc #t~nondet4; {3567#true} is VALID [2020-07-18 00:16:33,471 INFO L280 TraceCheckUtils]: 23: Hoare triple {3567#true} havoc ~lk5~0; {3567#true} is VALID [2020-07-18 00:16:33,472 INFO L280 TraceCheckUtils]: 24: Hoare triple {3567#true} havoc ~cond~0; {3567#true} is VALID [2020-07-18 00:16:33,472 INFO L280 TraceCheckUtils]: 25: Hoare triple {3567#true} assume !false; {3567#true} is VALID [2020-07-18 00:16:33,472 INFO L280 TraceCheckUtils]: 26: Hoare triple {3567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3567#true} is VALID [2020-07-18 00:16:33,473 INFO L280 TraceCheckUtils]: 27: Hoare triple {3567#true} ~cond~0 := #t~nondet5; {3567#true} is VALID [2020-07-18 00:16:33,473 INFO L280 TraceCheckUtils]: 28: Hoare triple {3567#true} havoc #t~nondet5; {3567#true} is VALID [2020-07-18 00:16:33,473 INFO L280 TraceCheckUtils]: 29: Hoare triple {3567#true} assume !(0 == ~cond~0); {3567#true} is VALID [2020-07-18 00:16:33,473 INFO L280 TraceCheckUtils]: 30: Hoare triple {3567#true} ~lk1~0 := 0; {3567#true} is VALID [2020-07-18 00:16:33,474 INFO L280 TraceCheckUtils]: 31: Hoare triple {3567#true} ~lk2~0 := 0; {3567#true} is VALID [2020-07-18 00:16:33,474 INFO L280 TraceCheckUtils]: 32: Hoare triple {3567#true} ~lk3~0 := 0; {3567#true} is VALID [2020-07-18 00:16:33,474 INFO L280 TraceCheckUtils]: 33: Hoare triple {3567#true} ~lk4~0 := 0; {3567#true} is VALID [2020-07-18 00:16:33,474 INFO L280 TraceCheckUtils]: 34: Hoare triple {3567#true} ~lk5~0 := 0; {3567#true} is VALID [2020-07-18 00:16:33,475 INFO L280 TraceCheckUtils]: 35: Hoare triple {3567#true} assume !(0 != ~p1~0); {3567#true} is VALID [2020-07-18 00:16:33,475 INFO L280 TraceCheckUtils]: 36: Hoare triple {3567#true} assume !(0 != ~p2~0); {3567#true} is VALID [2020-07-18 00:16:33,476 INFO L280 TraceCheckUtils]: 37: Hoare triple {3567#true} assume !(0 != ~p3~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:33,477 INFO L280 TraceCheckUtils]: 38: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:33,478 INFO L280 TraceCheckUtils]: 39: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:33,479 INFO L280 TraceCheckUtils]: 40: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:33,480 INFO L280 TraceCheckUtils]: 41: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-18 00:16:33,481 INFO L280 TraceCheckUtils]: 42: Hoare triple {3571#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3568#false} is VALID [2020-07-18 00:16:33,482 INFO L280 TraceCheckUtils]: 43: Hoare triple {3568#false} assume 1 != ~lk3~0; {3568#false} is VALID [2020-07-18 00:16:33,482 INFO L280 TraceCheckUtils]: 44: Hoare triple {3568#false} assume !false; {3568#false} is VALID [2020-07-18 00:16:33,484 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-18 00:16:33,484 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:33,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660972573] [2020-07-18 00:16:33,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:33,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:33,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185538607] [2020-07-18 00:16:33,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 00:16:33,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:33,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:33,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:33,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:33,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:33,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:33,533 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 3 states. [2020-07-18 00:16:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:34,094 INFO L93 Difference]: Finished difference Result 403 states and 528 transitions. [2020-07-18 00:16:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:34,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-18 00:16:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:16:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:16:34,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 00:16:34,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:34,266 INFO L225 Difference]: With dead ends: 403 [2020-07-18 00:16:34,266 INFO L226 Difference]: Without dead ends: 273 [2020-07-18 00:16:34,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 00:16:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-07-18 00:16:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2020-07-18 00:16:34,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:34,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand 271 states. [2020-07-18 00:16:34,643 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 271 states. [2020-07-18 00:16:34,643 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 271 states. [2020-07-18 00:16:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:34,656 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-18 00:16:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-18 00:16:34,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:34,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:34,658 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 273 states. [2020-07-18 00:16:34,658 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 273 states. [2020-07-18 00:16:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:34,671 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-18 00:16:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-18 00:16:34,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:34,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:34,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:34,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-07-18 00:16:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2020-07-18 00:16:34,686 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 45 [2020-07-18 00:16:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:34,687 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2020-07-18 00:16:34,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:34,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 271 states and 346 transitions. [2020-07-18 00:16:35,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2020-07-18 00:16:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:16:35,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:35,113 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] [2020-07-18 00:16:35,114 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:16:35,114 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:35,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash -11355582, now seen corresponding path program 1 times [2020-07-18 00:16:35,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:35,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105379956] [2020-07-18 00:16:35,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:35,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-18 00:16:35,172 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-18 00:16:35,172 INFO L263 TraceCheckUtils]: 0: Hoare triple {5468#true} call ULTIMATE.init(); {5468#true} is VALID [2020-07-18 00:16:35,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-18 00:16:35,173 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-18 00:16:35,173 INFO L263 TraceCheckUtils]: 3: Hoare triple {5468#true} call #t~ret6 := main(); {5468#true} is VALID [2020-07-18 00:16:35,173 INFO L280 TraceCheckUtils]: 4: Hoare triple {5468#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5468#true} is VALID [2020-07-18 00:16:35,174 INFO L280 TraceCheckUtils]: 5: Hoare triple {5468#true} ~p1~0 := #t~nondet0; {5468#true} is VALID [2020-07-18 00:16:35,174 INFO L280 TraceCheckUtils]: 6: Hoare triple {5468#true} havoc #t~nondet0; {5468#true} is VALID [2020-07-18 00:16:35,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {5468#true} havoc ~lk1~0; {5468#true} is VALID [2020-07-18 00:16:35,174 INFO L280 TraceCheckUtils]: 8: Hoare triple {5468#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5468#true} is VALID [2020-07-18 00:16:35,175 INFO L280 TraceCheckUtils]: 9: Hoare triple {5468#true} ~p2~0 := #t~nondet1; {5468#true} is VALID [2020-07-18 00:16:35,175 INFO L280 TraceCheckUtils]: 10: Hoare triple {5468#true} havoc #t~nondet1; {5468#true} is VALID [2020-07-18 00:16:35,175 INFO L280 TraceCheckUtils]: 11: Hoare triple {5468#true} havoc ~lk2~0; {5468#true} is VALID [2020-07-18 00:16:35,175 INFO L280 TraceCheckUtils]: 12: Hoare triple {5468#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5468#true} is VALID [2020-07-18 00:16:35,175 INFO L280 TraceCheckUtils]: 13: Hoare triple {5468#true} ~p3~0 := #t~nondet2; {5468#true} is VALID [2020-07-18 00:16:35,175 INFO L280 TraceCheckUtils]: 14: Hoare triple {5468#true} havoc #t~nondet2; {5468#true} is VALID [2020-07-18 00:16:35,176 INFO L280 TraceCheckUtils]: 15: Hoare triple {5468#true} havoc ~lk3~0; {5468#true} is VALID [2020-07-18 00:16:35,176 INFO L280 TraceCheckUtils]: 16: Hoare triple {5468#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5468#true} is VALID [2020-07-18 00:16:35,176 INFO L280 TraceCheckUtils]: 17: Hoare triple {5468#true} ~p4~0 := #t~nondet3; {5468#true} is VALID [2020-07-18 00:16:35,176 INFO L280 TraceCheckUtils]: 18: Hoare triple {5468#true} havoc #t~nondet3; {5468#true} is VALID [2020-07-18 00:16:35,176 INFO L280 TraceCheckUtils]: 19: Hoare triple {5468#true} havoc ~lk4~0; {5468#true} is VALID [2020-07-18 00:16:35,176 INFO L280 TraceCheckUtils]: 20: Hoare triple {5468#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5468#true} is VALID [2020-07-18 00:16:35,177 INFO L280 TraceCheckUtils]: 21: Hoare triple {5468#true} ~p5~0 := #t~nondet4; {5468#true} is VALID [2020-07-18 00:16:35,177 INFO L280 TraceCheckUtils]: 22: Hoare triple {5468#true} havoc #t~nondet4; {5468#true} is VALID [2020-07-18 00:16:35,177 INFO L280 TraceCheckUtils]: 23: Hoare triple {5468#true} havoc ~lk5~0; {5468#true} is VALID [2020-07-18 00:16:35,178 INFO L280 TraceCheckUtils]: 24: Hoare triple {5468#true} havoc ~cond~0; {5468#true} is VALID [2020-07-18 00:16:35,178 INFO L280 TraceCheckUtils]: 25: Hoare triple {5468#true} assume !false; {5468#true} is VALID [2020-07-18 00:16:35,178 INFO L280 TraceCheckUtils]: 26: Hoare triple {5468#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5468#true} is VALID [2020-07-18 00:16:35,178 INFO L280 TraceCheckUtils]: 27: Hoare triple {5468#true} ~cond~0 := #t~nondet5; {5468#true} is VALID [2020-07-18 00:16:35,178 INFO L280 TraceCheckUtils]: 28: Hoare triple {5468#true} havoc #t~nondet5; {5468#true} is VALID [2020-07-18 00:16:35,179 INFO L280 TraceCheckUtils]: 29: Hoare triple {5468#true} assume !(0 == ~cond~0); {5468#true} is VALID [2020-07-18 00:16:35,179 INFO L280 TraceCheckUtils]: 30: Hoare triple {5468#true} ~lk1~0 := 0; {5468#true} is VALID [2020-07-18 00:16:35,179 INFO L280 TraceCheckUtils]: 31: Hoare triple {5468#true} ~lk2~0 := 0; {5468#true} is VALID [2020-07-18 00:16:35,179 INFO L280 TraceCheckUtils]: 32: Hoare triple {5468#true} ~lk3~0 := 0; {5468#true} is VALID [2020-07-18 00:16:35,180 INFO L280 TraceCheckUtils]: 33: Hoare triple {5468#true} ~lk4~0 := 0; {5468#true} is VALID [2020-07-18 00:16:35,180 INFO L280 TraceCheckUtils]: 34: Hoare triple {5468#true} ~lk5~0 := 0; {5468#true} is VALID [2020-07-18 00:16:35,180 INFO L280 TraceCheckUtils]: 35: Hoare triple {5468#true} assume !(0 != ~p1~0); {5468#true} is VALID [2020-07-18 00:16:35,180 INFO L280 TraceCheckUtils]: 36: Hoare triple {5468#true} assume !(0 != ~p2~0); {5468#true} is VALID [2020-07-18 00:16:35,181 INFO L280 TraceCheckUtils]: 37: Hoare triple {5468#true} assume !(0 != ~p3~0); {5468#true} is VALID [2020-07-18 00:16:35,181 INFO L280 TraceCheckUtils]: 38: Hoare triple {5468#true} assume !(0 != ~p4~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:35,182 INFO L280 TraceCheckUtils]: 39: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:35,183 INFO L280 TraceCheckUtils]: 40: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:35,183 INFO L280 TraceCheckUtils]: 41: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:35,183 INFO L280 TraceCheckUtils]: 42: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-18 00:16:35,184 INFO L280 TraceCheckUtils]: 43: Hoare triple {5472#(= 0 main_~p4~0)} assume 0 != ~p4~0; {5469#false} is VALID [2020-07-18 00:16:35,184 INFO L280 TraceCheckUtils]: 44: Hoare triple {5469#false} assume 1 != ~lk4~0; {5469#false} is VALID [2020-07-18 00:16:35,184 INFO L280 TraceCheckUtils]: 45: Hoare triple {5469#false} assume !false; {5469#false} is VALID [2020-07-18 00:16:35,186 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-18 00:16:35,186 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:35,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105379956] [2020-07-18 00:16:35,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:35,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:35,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359413847] [2020-07-18 00:16:35,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 00:16:35,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:35,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:35,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:35,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:35,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:35,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:35,237 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 3 states. [2020-07-18 00:16:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:36,319 INFO L93 Difference]: Finished difference Result 739 states and 956 transitions. [2020-07-18 00:16:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:36,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 00:16:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:16:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-18 00:16:36,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-18 00:16:36,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:36,574 INFO L225 Difference]: With dead ends: 739 [2020-07-18 00:16:36,574 INFO L226 Difference]: Without dead ends: 493 [2020-07-18 00:16:36,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 00:16:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-07-18 00:16:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2020-07-18 00:16:37,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:37,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand 491 states. [2020-07-18 00:16:37,466 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand 491 states. [2020-07-18 00:16:37,466 INFO L87 Difference]: Start difference. First operand 493 states. Second operand 491 states. [2020-07-18 00:16:37,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:37,484 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-18 00:16:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-18 00:16:37,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:37,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:37,486 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 493 states. [2020-07-18 00:16:37,486 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 493 states. [2020-07-18 00:16:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:37,506 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-18 00:16:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-18 00:16:37,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:37,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:37,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:37,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 00:16:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2020-07-18 00:16:37,526 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 46 [2020-07-18 00:16:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:37,527 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2020-07-18 00:16:37,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:37,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 618 transitions. [2020-07-18 00:16:38,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2020-07-18 00:16:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-18 00:16:38,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:38,205 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] [2020-07-18 00:16:38,205 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:16:38,206 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:38,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:38,206 INFO L82 PathProgramCache]: Analyzing trace with hash 338056749, now seen corresponding path program 1 times [2020-07-18 00:16:38,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:38,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1339251619] [2020-07-18 00:16:38,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:38,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-18 00:16:38,263 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-18 00:16:38,263 INFO L263 TraceCheckUtils]: 0: Hoare triple {8921#true} call ULTIMATE.init(); {8921#true} is VALID [2020-07-18 00:16:38,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-18 00:16:38,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-18 00:16:38,264 INFO L263 TraceCheckUtils]: 3: Hoare triple {8921#true} call #t~ret6 := main(); {8921#true} is VALID [2020-07-18 00:16:38,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {8921#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8921#true} is VALID [2020-07-18 00:16:38,264 INFO L280 TraceCheckUtils]: 5: Hoare triple {8921#true} ~p1~0 := #t~nondet0; {8921#true} is VALID [2020-07-18 00:16:38,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {8921#true} havoc #t~nondet0; {8921#true} is VALID [2020-07-18 00:16:38,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {8921#true} havoc ~lk1~0; {8921#true} is VALID [2020-07-18 00:16:38,265 INFO L280 TraceCheckUtils]: 8: Hoare triple {8921#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8921#true} is VALID [2020-07-18 00:16:38,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {8921#true} ~p2~0 := #t~nondet1; {8921#true} is VALID [2020-07-18 00:16:38,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {8921#true} havoc #t~nondet1; {8921#true} is VALID [2020-07-18 00:16:38,268 INFO L280 TraceCheckUtils]: 11: Hoare triple {8921#true} havoc ~lk2~0; {8921#true} is VALID [2020-07-18 00:16:38,268 INFO L280 TraceCheckUtils]: 12: Hoare triple {8921#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8921#true} is VALID [2020-07-18 00:16:38,268 INFO L280 TraceCheckUtils]: 13: Hoare triple {8921#true} ~p3~0 := #t~nondet2; {8921#true} is VALID [2020-07-18 00:16:38,269 INFO L280 TraceCheckUtils]: 14: Hoare triple {8921#true} havoc #t~nondet2; {8921#true} is VALID [2020-07-18 00:16:38,270 INFO L280 TraceCheckUtils]: 15: Hoare triple {8921#true} havoc ~lk3~0; {8921#true} is VALID [2020-07-18 00:16:38,270 INFO L280 TraceCheckUtils]: 16: Hoare triple {8921#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8921#true} is VALID [2020-07-18 00:16:38,271 INFO L280 TraceCheckUtils]: 17: Hoare triple {8921#true} ~p4~0 := #t~nondet3; {8921#true} is VALID [2020-07-18 00:16:38,271 INFO L280 TraceCheckUtils]: 18: Hoare triple {8921#true} havoc #t~nondet3; {8921#true} is VALID [2020-07-18 00:16:38,271 INFO L280 TraceCheckUtils]: 19: Hoare triple {8921#true} havoc ~lk4~0; {8921#true} is VALID [2020-07-18 00:16:38,271 INFO L280 TraceCheckUtils]: 20: Hoare triple {8921#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8921#true} is VALID [2020-07-18 00:16:38,272 INFO L280 TraceCheckUtils]: 21: Hoare triple {8921#true} ~p5~0 := #t~nondet4; {8921#true} is VALID [2020-07-18 00:16:38,273 INFO L280 TraceCheckUtils]: 22: Hoare triple {8921#true} havoc #t~nondet4; {8921#true} is VALID [2020-07-18 00:16:38,277 INFO L280 TraceCheckUtils]: 23: Hoare triple {8921#true} havoc ~lk5~0; {8921#true} is VALID [2020-07-18 00:16:38,277 INFO L280 TraceCheckUtils]: 24: Hoare triple {8921#true} havoc ~cond~0; {8921#true} is VALID [2020-07-18 00:16:38,277 INFO L280 TraceCheckUtils]: 25: Hoare triple {8921#true} assume !false; {8921#true} is VALID [2020-07-18 00:16:38,278 INFO L280 TraceCheckUtils]: 26: Hoare triple {8921#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8921#true} is VALID [2020-07-18 00:16:38,282 INFO L280 TraceCheckUtils]: 27: Hoare triple {8921#true} ~cond~0 := #t~nondet5; {8921#true} is VALID [2020-07-18 00:16:38,283 INFO L280 TraceCheckUtils]: 28: Hoare triple {8921#true} havoc #t~nondet5; {8921#true} is VALID [2020-07-18 00:16:38,283 INFO L280 TraceCheckUtils]: 29: Hoare triple {8921#true} assume !(0 == ~cond~0); {8921#true} is VALID [2020-07-18 00:16:38,283 INFO L280 TraceCheckUtils]: 30: Hoare triple {8921#true} ~lk1~0 := 0; {8921#true} is VALID [2020-07-18 00:16:38,284 INFO L280 TraceCheckUtils]: 31: Hoare triple {8921#true} ~lk2~0 := 0; {8921#true} is VALID [2020-07-18 00:16:38,284 INFO L280 TraceCheckUtils]: 32: Hoare triple {8921#true} ~lk3~0 := 0; {8921#true} is VALID [2020-07-18 00:16:38,284 INFO L280 TraceCheckUtils]: 33: Hoare triple {8921#true} ~lk4~0 := 0; {8921#true} is VALID [2020-07-18 00:16:38,285 INFO L280 TraceCheckUtils]: 34: Hoare triple {8921#true} ~lk5~0 := 0; {8921#true} is VALID [2020-07-18 00:16:38,285 INFO L280 TraceCheckUtils]: 35: Hoare triple {8921#true} assume !(0 != ~p1~0); {8921#true} is VALID [2020-07-18 00:16:38,286 INFO L280 TraceCheckUtils]: 36: Hoare triple {8921#true} assume !(0 != ~p2~0); {8921#true} is VALID [2020-07-18 00:16:38,286 INFO L280 TraceCheckUtils]: 37: Hoare triple {8921#true} assume 0 != ~p3~0; {8921#true} is VALID [2020-07-18 00:16:38,291 INFO L280 TraceCheckUtils]: 38: Hoare triple {8921#true} ~lk3~0 := 1; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:38,292 INFO L280 TraceCheckUtils]: 39: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:38,293 INFO L280 TraceCheckUtils]: 40: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:38,293 INFO L280 TraceCheckUtils]: 41: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:38,294 INFO L280 TraceCheckUtils]: 42: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:38,295 INFO L280 TraceCheckUtils]: 43: Hoare triple {8925#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:16:38,296 INFO L280 TraceCheckUtils]: 44: Hoare triple {8925#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {8922#false} is VALID [2020-07-18 00:16:38,296 INFO L280 TraceCheckUtils]: 45: Hoare triple {8922#false} assume !false; {8922#false} is VALID [2020-07-18 00:16:38,297 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-18 00:16:38,298 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:38,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1339251619] [2020-07-18 00:16:38,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:38,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:38,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083794680] [2020-07-18 00:16:38,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 00:16:38,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:38,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:38,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:38,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:38,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:38,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:38,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:38,339 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand 3 states. [2020-07-18 00:16:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:39,579 INFO L93 Difference]: Finished difference Result 599 states and 748 transitions. [2020-07-18 00:16:39,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:39,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-18 00:16:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-18 00:16:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-18 00:16:39,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2020-07-18 00:16:39,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:39,714 INFO L225 Difference]: With dead ends: 599 [2020-07-18 00:16:39,715 INFO L226 Difference]: Without dead ends: 597 [2020-07-18 00:16:39,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 00:16:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-07-18 00:16:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 491. [2020-07-18 00:16:40,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:40,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand 491 states. [2020-07-18 00:16:40,636 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand 491 states. [2020-07-18 00:16:40,636 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 491 states. [2020-07-18 00:16:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:40,662 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-18 00:16:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-18 00:16:40,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:40,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:40,664 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 597 states. [2020-07-18 00:16:40,664 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 597 states. [2020-07-18 00:16:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:40,691 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-18 00:16:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-18 00:16:40,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:40,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:40,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:40,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 00:16:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2020-07-18 00:16:40,713 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 46 [2020-07-18 00:16:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:40,714 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2020-07-18 00:16:40,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:40,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 610 transitions. [2020-07-18 00:16:41,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2020-07-18 00:16:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 00:16:41,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:41,471 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] [2020-07-18 00:16:41,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:16:41,471 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -144915038, now seen corresponding path program 1 times [2020-07-18 00:16:41,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:41,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352744250] [2020-07-18 00:16:41,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:41,526 INFO L280 TraceCheckUtils]: 0: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-18 00:16:41,527 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-18 00:16:41,527 INFO L263 TraceCheckUtils]: 0: Hoare triple {12302#true} call ULTIMATE.init(); {12302#true} is VALID [2020-07-18 00:16:41,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-18 00:16:41,527 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-18 00:16:41,527 INFO L263 TraceCheckUtils]: 3: Hoare triple {12302#true} call #t~ret6 := main(); {12302#true} is VALID [2020-07-18 00:16:41,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {12302#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12302#true} is VALID [2020-07-18 00:16:41,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {12302#true} ~p1~0 := #t~nondet0; {12302#true} is VALID [2020-07-18 00:16:41,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {12302#true} havoc #t~nondet0; {12302#true} is VALID [2020-07-18 00:16:41,528 INFO L280 TraceCheckUtils]: 7: Hoare triple {12302#true} havoc ~lk1~0; {12302#true} is VALID [2020-07-18 00:16:41,528 INFO L280 TraceCheckUtils]: 8: Hoare triple {12302#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12302#true} is VALID [2020-07-18 00:16:41,528 INFO L280 TraceCheckUtils]: 9: Hoare triple {12302#true} ~p2~0 := #t~nondet1; {12302#true} is VALID [2020-07-18 00:16:41,529 INFO L280 TraceCheckUtils]: 10: Hoare triple {12302#true} havoc #t~nondet1; {12302#true} is VALID [2020-07-18 00:16:41,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {12302#true} havoc ~lk2~0; {12302#true} is VALID [2020-07-18 00:16:41,529 INFO L280 TraceCheckUtils]: 12: Hoare triple {12302#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {12302#true} is VALID [2020-07-18 00:16:41,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {12302#true} ~p3~0 := #t~nondet2; {12302#true} is VALID [2020-07-18 00:16:41,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {12302#true} havoc #t~nondet2; {12302#true} is VALID [2020-07-18 00:16:41,529 INFO L280 TraceCheckUtils]: 15: Hoare triple {12302#true} havoc ~lk3~0; {12302#true} is VALID [2020-07-18 00:16:41,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {12302#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {12302#true} is VALID [2020-07-18 00:16:41,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {12302#true} ~p4~0 := #t~nondet3; {12302#true} is VALID [2020-07-18 00:16:41,530 INFO L280 TraceCheckUtils]: 18: Hoare triple {12302#true} havoc #t~nondet3; {12302#true} is VALID [2020-07-18 00:16:41,530 INFO L280 TraceCheckUtils]: 19: Hoare triple {12302#true} havoc ~lk4~0; {12302#true} is VALID [2020-07-18 00:16:41,530 INFO L280 TraceCheckUtils]: 20: Hoare triple {12302#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12302#true} is VALID [2020-07-18 00:16:41,531 INFO L280 TraceCheckUtils]: 21: Hoare triple {12302#true} ~p5~0 := #t~nondet4; {12302#true} is VALID [2020-07-18 00:16:41,531 INFO L280 TraceCheckUtils]: 22: Hoare triple {12302#true} havoc #t~nondet4; {12302#true} is VALID [2020-07-18 00:16:41,531 INFO L280 TraceCheckUtils]: 23: Hoare triple {12302#true} havoc ~lk5~0; {12302#true} is VALID [2020-07-18 00:16:41,531 INFO L280 TraceCheckUtils]: 24: Hoare triple {12302#true} havoc ~cond~0; {12302#true} is VALID [2020-07-18 00:16:41,532 INFO L280 TraceCheckUtils]: 25: Hoare triple {12302#true} assume !false; {12302#true} is VALID [2020-07-18 00:16:41,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {12302#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12302#true} is VALID [2020-07-18 00:16:41,532 INFO L280 TraceCheckUtils]: 27: Hoare triple {12302#true} ~cond~0 := #t~nondet5; {12302#true} is VALID [2020-07-18 00:16:41,532 INFO L280 TraceCheckUtils]: 28: Hoare triple {12302#true} havoc #t~nondet5; {12302#true} is VALID [2020-07-18 00:16:41,533 INFO L280 TraceCheckUtils]: 29: Hoare triple {12302#true} assume !(0 == ~cond~0); {12302#true} is VALID [2020-07-18 00:16:41,533 INFO L280 TraceCheckUtils]: 30: Hoare triple {12302#true} ~lk1~0 := 0; {12302#true} is VALID [2020-07-18 00:16:41,533 INFO L280 TraceCheckUtils]: 31: Hoare triple {12302#true} ~lk2~0 := 0; {12302#true} is VALID [2020-07-18 00:16:41,533 INFO L280 TraceCheckUtils]: 32: Hoare triple {12302#true} ~lk3~0 := 0; {12302#true} is VALID [2020-07-18 00:16:41,533 INFO L280 TraceCheckUtils]: 33: Hoare triple {12302#true} ~lk4~0 := 0; {12302#true} is VALID [2020-07-18 00:16:41,533 INFO L280 TraceCheckUtils]: 34: Hoare triple {12302#true} ~lk5~0 := 0; {12302#true} is VALID [2020-07-18 00:16:41,534 INFO L280 TraceCheckUtils]: 35: Hoare triple {12302#true} assume !(0 != ~p1~0); {12302#true} is VALID [2020-07-18 00:16:41,534 INFO L280 TraceCheckUtils]: 36: Hoare triple {12302#true} assume !(0 != ~p2~0); {12302#true} is VALID [2020-07-18 00:16:41,534 INFO L280 TraceCheckUtils]: 37: Hoare triple {12302#true} assume !(0 != ~p3~0); {12302#true} is VALID [2020-07-18 00:16:41,534 INFO L280 TraceCheckUtils]: 38: Hoare triple {12302#true} assume 0 != ~p4~0; {12302#true} is VALID [2020-07-18 00:16:41,535 INFO L280 TraceCheckUtils]: 39: Hoare triple {12302#true} ~lk4~0 := 1; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:41,535 INFO L280 TraceCheckUtils]: 40: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:41,535 INFO L280 TraceCheckUtils]: 41: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:41,536 INFO L280 TraceCheckUtils]: 42: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:41,536 INFO L280 TraceCheckUtils]: 43: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:41,537 INFO L280 TraceCheckUtils]: 44: Hoare triple {12306#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:16:41,537 INFO L280 TraceCheckUtils]: 45: Hoare triple {12306#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {12303#false} is VALID [2020-07-18 00:16:41,537 INFO L280 TraceCheckUtils]: 46: Hoare triple {12303#false} assume !false; {12303#false} is VALID [2020-07-18 00:16:41,538 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-18 00:16:41,539 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:41,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352744250] [2020-07-18 00:16:41,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:41,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:41,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170725426] [2020-07-18 00:16:41,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 00:16:41,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:41,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:41,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:41,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:41,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:41,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:41,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:41,589 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 3 states. [2020-07-18 00:16:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:42,798 INFO L93 Difference]: Finished difference Result 591 states and 724 transitions. [2020-07-18 00:16:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:42,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 00:16:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-18 00:16:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-18 00:16:42,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-18 00:16:42,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:42,933 INFO L225 Difference]: With dead ends: 591 [2020-07-18 00:16:42,933 INFO L226 Difference]: Without dead ends: 589 [2020-07-18 00:16:42,934 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 00:16:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-07-18 00:16:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 491. [2020-07-18 00:16:43,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:43,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand 491 states. [2020-07-18 00:16:43,847 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand 491 states. [2020-07-18 00:16:43,848 INFO L87 Difference]: Start difference. First operand 589 states. Second operand 491 states. [2020-07-18 00:16:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:43,870 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-18 00:16:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-18 00:16:43,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:43,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:43,872 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 589 states. [2020-07-18 00:16:43,872 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 589 states. [2020-07-18 00:16:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:43,889 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-18 00:16:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-18 00:16:43,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:43,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:43,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:43,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 00:16:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 602 transitions. [2020-07-18 00:16:43,906 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 602 transitions. Word has length 47 [2020-07-18 00:16:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:43,907 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 602 transitions. [2020-07-18 00:16:43,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:43,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 602 transitions. [2020-07-18 00:16:44,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:44,683 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 602 transitions. [2020-07-18 00:16:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-18 00:16:44,684 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:44,685 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] [2020-07-18 00:16:44,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:16:44,686 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash -351776260, now seen corresponding path program 1 times [2020-07-18 00:16:44,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:44,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491625247] [2020-07-18 00:16:44,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:44,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-18 00:16:44,749 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-18 00:16:44,749 INFO L263 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2020-07-18 00:16:44,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-18 00:16:44,750 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-18 00:16:44,751 INFO L263 TraceCheckUtils]: 3: Hoare triple {15651#true} call #t~ret6 := main(); {15651#true} is VALID [2020-07-18 00:16:44,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {15651#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {15651#true} is VALID [2020-07-18 00:16:44,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {15651#true} ~p1~0 := #t~nondet0; {15651#true} is VALID [2020-07-18 00:16:44,752 INFO L280 TraceCheckUtils]: 6: Hoare triple {15651#true} havoc #t~nondet0; {15651#true} is VALID [2020-07-18 00:16:44,752 INFO L280 TraceCheckUtils]: 7: Hoare triple {15651#true} havoc ~lk1~0; {15651#true} is VALID [2020-07-18 00:16:44,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {15651#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {15651#true} is VALID [2020-07-18 00:16:44,753 INFO L280 TraceCheckUtils]: 9: Hoare triple {15651#true} ~p2~0 := #t~nondet1; {15651#true} is VALID [2020-07-18 00:16:44,753 INFO L280 TraceCheckUtils]: 10: Hoare triple {15651#true} havoc #t~nondet1; {15651#true} is VALID [2020-07-18 00:16:44,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {15651#true} havoc ~lk2~0; {15651#true} is VALID [2020-07-18 00:16:44,753 INFO L280 TraceCheckUtils]: 12: Hoare triple {15651#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15651#true} is VALID [2020-07-18 00:16:44,759 INFO L280 TraceCheckUtils]: 13: Hoare triple {15651#true} ~p3~0 := #t~nondet2; {15651#true} is VALID [2020-07-18 00:16:44,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {15651#true} havoc #t~nondet2; {15651#true} is VALID [2020-07-18 00:16:44,759 INFO L280 TraceCheckUtils]: 15: Hoare triple {15651#true} havoc ~lk3~0; {15651#true} is VALID [2020-07-18 00:16:44,760 INFO L280 TraceCheckUtils]: 16: Hoare triple {15651#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {15651#true} is VALID [2020-07-18 00:16:44,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {15651#true} ~p4~0 := #t~nondet3; {15651#true} is VALID [2020-07-18 00:16:44,760 INFO L280 TraceCheckUtils]: 18: Hoare triple {15651#true} havoc #t~nondet3; {15651#true} is VALID [2020-07-18 00:16:44,760 INFO L280 TraceCheckUtils]: 19: Hoare triple {15651#true} havoc ~lk4~0; {15651#true} is VALID [2020-07-18 00:16:44,760 INFO L280 TraceCheckUtils]: 20: Hoare triple {15651#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {15651#true} is VALID [2020-07-18 00:16:44,761 INFO L280 TraceCheckUtils]: 21: Hoare triple {15651#true} ~p5~0 := #t~nondet4; {15651#true} is VALID [2020-07-18 00:16:44,761 INFO L280 TraceCheckUtils]: 22: Hoare triple {15651#true} havoc #t~nondet4; {15651#true} is VALID [2020-07-18 00:16:44,761 INFO L280 TraceCheckUtils]: 23: Hoare triple {15651#true} havoc ~lk5~0; {15651#true} is VALID [2020-07-18 00:16:44,761 INFO L280 TraceCheckUtils]: 24: Hoare triple {15651#true} havoc ~cond~0; {15651#true} is VALID [2020-07-18 00:16:44,761 INFO L280 TraceCheckUtils]: 25: Hoare triple {15651#true} assume !false; {15651#true} is VALID [2020-07-18 00:16:44,762 INFO L280 TraceCheckUtils]: 26: Hoare triple {15651#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15651#true} is VALID [2020-07-18 00:16:44,762 INFO L280 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond~0 := #t~nondet5; {15651#true} is VALID [2020-07-18 00:16:44,762 INFO L280 TraceCheckUtils]: 28: Hoare triple {15651#true} havoc #t~nondet5; {15651#true} is VALID [2020-07-18 00:16:44,762 INFO L280 TraceCheckUtils]: 29: Hoare triple {15651#true} assume !(0 == ~cond~0); {15651#true} is VALID [2020-07-18 00:16:44,763 INFO L280 TraceCheckUtils]: 30: Hoare triple {15651#true} ~lk1~0 := 0; {15651#true} is VALID [2020-07-18 00:16:44,763 INFO L280 TraceCheckUtils]: 31: Hoare triple {15651#true} ~lk2~0 := 0; {15651#true} is VALID [2020-07-18 00:16:44,763 INFO L280 TraceCheckUtils]: 32: Hoare triple {15651#true} ~lk3~0 := 0; {15651#true} is VALID [2020-07-18 00:16:44,769 INFO L280 TraceCheckUtils]: 33: Hoare triple {15651#true} ~lk4~0 := 0; {15651#true} is VALID [2020-07-18 00:16:44,769 INFO L280 TraceCheckUtils]: 34: Hoare triple {15651#true} ~lk5~0 := 0; {15651#true} is VALID [2020-07-18 00:16:44,769 INFO L280 TraceCheckUtils]: 35: Hoare triple {15651#true} assume !(0 != ~p1~0); {15651#true} is VALID [2020-07-18 00:16:44,769 INFO L280 TraceCheckUtils]: 36: Hoare triple {15651#true} assume !(0 != ~p2~0); {15651#true} is VALID [2020-07-18 00:16:44,770 INFO L280 TraceCheckUtils]: 37: Hoare triple {15651#true} assume !(0 != ~p3~0); {15651#true} is VALID [2020-07-18 00:16:44,770 INFO L280 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 != ~p4~0); {15651#true} is VALID [2020-07-18 00:16:44,775 INFO L280 TraceCheckUtils]: 39: Hoare triple {15651#true} assume !(0 != ~p5~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 00:16:44,776 INFO L280 TraceCheckUtils]: 40: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 00:16:44,777 INFO L280 TraceCheckUtils]: 41: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 00:16:44,778 INFO L280 TraceCheckUtils]: 42: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 00:16:44,778 INFO L280 TraceCheckUtils]: 43: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-18 00:16:44,779 INFO L280 TraceCheckUtils]: 44: Hoare triple {15655#(= 0 main_~p5~0)} assume 0 != ~p5~0; {15652#false} is VALID [2020-07-18 00:16:44,779 INFO L280 TraceCheckUtils]: 45: Hoare triple {15652#false} assume 1 != ~lk5~0; {15652#false} is VALID [2020-07-18 00:16:44,779 INFO L280 TraceCheckUtils]: 46: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2020-07-18 00:16:44,781 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-18 00:16:44,782 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:44,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491625247] [2020-07-18 00:16:44,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:44,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:44,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776176545] [2020-07-18 00:16:44,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 00:16:44,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:44,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:44,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:44,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:44,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:44,833 INFO L87 Difference]: Start difference. First operand 491 states and 602 transitions. Second operand 3 states. [2020-07-18 00:16:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:47,094 INFO L93 Difference]: Finished difference Result 1373 states and 1691 transitions. [2020-07-18 00:16:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:47,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-18 00:16:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-18 00:16:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-18 00:16:47,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-18 00:16:47,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:47,268 INFO L225 Difference]: With dead ends: 1373 [2020-07-18 00:16:47,268 INFO L226 Difference]: Without dead ends: 491 [2020-07-18 00:16:47,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-18 00:16:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-07-18 00:16:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2020-07-18 00:16:48,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:48,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand 491 states. [2020-07-18 00:16:48,203 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-18 00:16:48,203 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-18 00:16:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:48,218 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-18 00:16:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-18 00:16:48,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:48,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:48,220 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-18 00:16:48,220 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-18 00:16:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:48,235 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-18 00:16:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-18 00:16:48,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:48,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:48,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:48,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-18 00:16:48,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 570 transitions. [2020-07-18 00:16:48,249 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 570 transitions. Word has length 47 [2020-07-18 00:16:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:48,250 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 570 transitions. [2020-07-18 00:16:48,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:48,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 570 transitions. [2020-07-18 00:16:48,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-18 00:16:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 00:16:48,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:48,985 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] [2020-07-18 00:16:48,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:16:48,985 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2062829121, now seen corresponding path program 1 times [2020-07-18 00:16:48,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:48,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2040140313] [2020-07-18 00:16:48,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:49,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-18 00:16:49,033 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-18 00:16:49,033 INFO L263 TraceCheckUtils]: 0: Hoare triple {20368#true} call ULTIMATE.init(); {20368#true} is VALID [2020-07-18 00:16:49,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-18 00:16:49,033 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-18 00:16:49,033 INFO L263 TraceCheckUtils]: 3: Hoare triple {20368#true} call #t~ret6 := main(); {20368#true} is VALID [2020-07-18 00:16:49,034 INFO L280 TraceCheckUtils]: 4: Hoare triple {20368#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {20368#true} is VALID [2020-07-18 00:16:49,034 INFO L280 TraceCheckUtils]: 5: Hoare triple {20368#true} ~p1~0 := #t~nondet0; {20368#true} is VALID [2020-07-18 00:16:49,034 INFO L280 TraceCheckUtils]: 6: Hoare triple {20368#true} havoc #t~nondet0; {20368#true} is VALID [2020-07-18 00:16:49,034 INFO L280 TraceCheckUtils]: 7: Hoare triple {20368#true} havoc ~lk1~0; {20368#true} is VALID [2020-07-18 00:16:49,034 INFO L280 TraceCheckUtils]: 8: Hoare triple {20368#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20368#true} is VALID [2020-07-18 00:16:49,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {20368#true} ~p2~0 := #t~nondet1; {20368#true} is VALID [2020-07-18 00:16:49,035 INFO L280 TraceCheckUtils]: 10: Hoare triple {20368#true} havoc #t~nondet1; {20368#true} is VALID [2020-07-18 00:16:49,035 INFO L280 TraceCheckUtils]: 11: Hoare triple {20368#true} havoc ~lk2~0; {20368#true} is VALID [2020-07-18 00:16:49,035 INFO L280 TraceCheckUtils]: 12: Hoare triple {20368#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20368#true} is VALID [2020-07-18 00:16:49,035 INFO L280 TraceCheckUtils]: 13: Hoare triple {20368#true} ~p3~0 := #t~nondet2; {20368#true} is VALID [2020-07-18 00:16:49,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {20368#true} havoc #t~nondet2; {20368#true} is VALID [2020-07-18 00:16:49,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {20368#true} havoc ~lk3~0; {20368#true} is VALID [2020-07-18 00:16:49,036 INFO L280 TraceCheckUtils]: 16: Hoare triple {20368#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {20368#true} is VALID [2020-07-18 00:16:49,036 INFO L280 TraceCheckUtils]: 17: Hoare triple {20368#true} ~p4~0 := #t~nondet3; {20368#true} is VALID [2020-07-18 00:16:49,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {20368#true} havoc #t~nondet3; {20368#true} is VALID [2020-07-18 00:16:49,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {20368#true} havoc ~lk4~0; {20368#true} is VALID [2020-07-18 00:16:49,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {20368#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {20368#true} is VALID [2020-07-18 00:16:49,036 INFO L280 TraceCheckUtils]: 21: Hoare triple {20368#true} ~p5~0 := #t~nondet4; {20368#true} is VALID [2020-07-18 00:16:49,037 INFO L280 TraceCheckUtils]: 22: Hoare triple {20368#true} havoc #t~nondet4; {20368#true} is VALID [2020-07-18 00:16:49,037 INFO L280 TraceCheckUtils]: 23: Hoare triple {20368#true} havoc ~lk5~0; {20368#true} is VALID [2020-07-18 00:16:49,037 INFO L280 TraceCheckUtils]: 24: Hoare triple {20368#true} havoc ~cond~0; {20368#true} is VALID [2020-07-18 00:16:49,037 INFO L280 TraceCheckUtils]: 25: Hoare triple {20368#true} assume !false; {20368#true} is VALID [2020-07-18 00:16:49,037 INFO L280 TraceCheckUtils]: 26: Hoare triple {20368#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20368#true} is VALID [2020-07-18 00:16:49,037 INFO L280 TraceCheckUtils]: 27: Hoare triple {20368#true} ~cond~0 := #t~nondet5; {20368#true} is VALID [2020-07-18 00:16:49,037 INFO L280 TraceCheckUtils]: 28: Hoare triple {20368#true} havoc #t~nondet5; {20368#true} is VALID [2020-07-18 00:16:49,038 INFO L280 TraceCheckUtils]: 29: Hoare triple {20368#true} assume !(0 == ~cond~0); {20368#true} is VALID [2020-07-18 00:16:49,038 INFO L280 TraceCheckUtils]: 30: Hoare triple {20368#true} ~lk1~0 := 0; {20368#true} is VALID [2020-07-18 00:16:49,038 INFO L280 TraceCheckUtils]: 31: Hoare triple {20368#true} ~lk2~0 := 0; {20368#true} is VALID [2020-07-18 00:16:49,038 INFO L280 TraceCheckUtils]: 32: Hoare triple {20368#true} ~lk3~0 := 0; {20368#true} is VALID [2020-07-18 00:16:49,038 INFO L280 TraceCheckUtils]: 33: Hoare triple {20368#true} ~lk4~0 := 0; {20368#true} is VALID [2020-07-18 00:16:49,038 INFO L280 TraceCheckUtils]: 34: Hoare triple {20368#true} ~lk5~0 := 0; {20368#true} is VALID [2020-07-18 00:16:49,038 INFO L280 TraceCheckUtils]: 35: Hoare triple {20368#true} assume !(0 != ~p1~0); {20368#true} is VALID [2020-07-18 00:16:49,039 INFO L280 TraceCheckUtils]: 36: Hoare triple {20368#true} assume !(0 != ~p2~0); {20368#true} is VALID [2020-07-18 00:16:49,039 INFO L280 TraceCheckUtils]: 37: Hoare triple {20368#true} assume !(0 != ~p3~0); {20368#true} is VALID [2020-07-18 00:16:49,039 INFO L280 TraceCheckUtils]: 38: Hoare triple {20368#true} assume !(0 != ~p4~0); {20368#true} is VALID [2020-07-18 00:16:49,039 INFO L280 TraceCheckUtils]: 39: Hoare triple {20368#true} assume 0 != ~p5~0; {20368#true} is VALID [2020-07-18 00:16:49,039 INFO L280 TraceCheckUtils]: 40: Hoare triple {20368#true} ~lk5~0 := 1; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:16:49,040 INFO L280 TraceCheckUtils]: 41: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:16:49,040 INFO L280 TraceCheckUtils]: 42: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:16:49,041 INFO L280 TraceCheckUtils]: 43: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:16:49,041 INFO L280 TraceCheckUtils]: 44: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:16:49,042 INFO L280 TraceCheckUtils]: 45: Hoare triple {20372#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:16:49,042 INFO L280 TraceCheckUtils]: 46: Hoare triple {20372#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {20369#false} is VALID [2020-07-18 00:16:49,042 INFO L280 TraceCheckUtils]: 47: Hoare triple {20369#false} assume !false; {20369#false} is VALID [2020-07-18 00:16:49,043 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-18 00:16:49,044 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:49,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2040140313] [2020-07-18 00:16:49,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:49,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:49,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368403231] [2020-07-18 00:16:49,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-18 00:16:49,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:49,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:49,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:49,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:49,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:49,093 INFO L87 Difference]: Start difference. First operand 491 states and 570 transitions. Second operand 3 states. [2020-07-18 00:16:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:50,134 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-18 00:16:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:50,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-18 00:16:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-18 00:16:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-18 00:16:50,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-18 00:16:50,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:50,203 INFO L225 Difference]: With dead ends: 491 [2020-07-18 00:16:50,203 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:16:50,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-18 00:16:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:16:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:16:50,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:50,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:16:50,205 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:16:50,205 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:16:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:50,205 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:16:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:16:50,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:50,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:50,206 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:16:50,206 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:16:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:50,206 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:16:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:16:50,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:50,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:50,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:50,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:16:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:16:50,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-18 00:16:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:50,207 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:16:50,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:50,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:16:50,208 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-18 00:16:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:16:50,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:50,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:16:50,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:16:50,999 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:16:51,140 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:16:51,518 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:16:51,796 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:16:51,971 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:16:52,352 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:16:52,470 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:16:52,471 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:16:52,471 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:16:52,471 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:16:52,471 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:16:52,471 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:16:52,471 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 93) the Hoare annotation is: true [2020-07-18 00:16:52,471 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-18 00:16:52,471 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 00:16:52,472 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk4~0)) (.cse2 (= 0 main_~p5~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-18 00:16:52,473 INFO L264 CegarLoopResult]: At program point L53-1(lines 24 88) 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-18 00:16:52,473 INFO L264 CegarLoopResult]: At program point L78-1(lines 24 88) the Hoare annotation is: (or (= 0 main_~p5~0) (= 1 main_~lk5~0)) [2020-07-18 00:16:52,473 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 00:16:52,473 INFO L264 CegarLoopResult]: At program point L45-1(lines 24 88) 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-18 00:16:52,474 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 00:16:52,474 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 00:16:52,474 INFO L264 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk4~0)) (.cse2 (= 0 main_~p5~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-18 00:16:52,474 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-18 00:16:52,474 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-18 00:16:52,474 INFO L264 CegarLoopResult]: At program point L54(line 54) 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-18 00:16:52,475 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk4~0))) (or (and (= 1 main_~lk5~0) .cse0) (and (= 0 main_~p5~0) .cse0))) [2020-07-18 00:16:52,475 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:16:52,475 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 00:16:52,475 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 93) the Hoare annotation is: true [2020-07-18 00:16:52,475 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) the Hoare annotation is: false [2020-07-18 00:16:52,476 INFO L264 CegarLoopResult]: At program point L63-1(lines 24 88) the Hoare annotation is: (let ((.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse6 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse4) (and .cse0 .cse6 .cse1 .cse5) (and .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse6 .cse1 .cse3) (and .cse0 .cse6 .cse5 .cse4) (and .cse2 .cse7 .cse5 .cse4) (and .cse6 .cse7 .cse3 .cse4) (and .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse7 .cse5) (and .cse6 .cse7 .cse5 .cse4) (and .cse6 .cse1 .cse7 .cse3) (and .cse0 .cse6 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5) (and .cse6 .cse1 .cse7 .cse5))) [2020-07-18 00:16:52,476 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-07-18 00:16:52,476 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 00:16:52,476 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk4~0))) (or (and (= 1 main_~lk5~0) .cse0) (and (= 0 main_~p5~0) .cse0))) [2020-07-18 00:16:52,476 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 00:16:52,476 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 00:16:52,476 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk3~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse7 .cse4) (and .cse0 .cse2 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse5 .cse1 .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse2 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8))) [2020-07-18 00:16:52,477 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-18 00:16:52,477 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-07-18 00:16:52,477 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:16:52,477 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 00:16:52,477 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 00:16:52,477 INFO L264 CegarLoopResult]: At program point L73-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse3 .cse2))) [2020-07-18 00:16:52,477 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 00:16:52,477 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk2~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p2~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse7 .cse4) (and .cse0 .cse2 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse2 .cse6 .cse7 .cse4 .cse8) (and .cse5 .cse1 .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse4 .cse8) (and .cse2 .cse6 .cse3 .cse4 .cse8) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse4 .cse8))) [2020-07-18 00:16:52,478 INFO L264 CegarLoopResult]: At program point L57-1(lines 24 88) 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 .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (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 .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (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-18 00:16:52,478 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:16:52,478 INFO L264 CegarLoopResult]: At program point L49-1(lines 24 88) the Hoare annotation is: (let ((.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p1~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 .cse2) (and .cse3 .cse0 .cse5) (and .cse4 .cse1 .cse2))) [2020-07-18 00:16:52,478 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse1 .cse2 .cse4))) [2020-07-18 00:16:52,478 INFO L271 CegarLoopResult]: At program point L41(lines 41 43) the Hoare annotation is: true [2020-07-18 00:16:52,478 INFO L264 CegarLoopResult]: At program point L41-2(lines 24 88) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:16:52,478 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L264 CegarLoopResult]: At program point L58(line 58) 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 .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 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L264 CegarLoopResult]: At program point L50(line 50) 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-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L264 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3) (and .cse1 .cse2 .cse4))) [2020-07-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 00:16:52,479 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 00:16:52,480 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: false [2020-07-18 00:16:52,480 INFO L271 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: true [2020-07-18 00:16:52,480 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-18 00:16:52,480 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-07-18 00:16:52,480 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 00:16:52,480 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 00:16:52,480 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 00:16:52,480 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 00:16:52,480 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-18 00:16:52,480 INFO L264 CegarLoopResult]: At program point L68-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= 0 main_~p4~0)) (.cse4 (= 0 main_~p5~0)) (.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse0 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse1 .cse4) (and .cse1 .cse2 .cse5) (and .cse3 .cse2 .cse5))) [2020-07-18 00:16:52,530 INFO L163 areAnnotationChecker]: CFG has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:16:52,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:16:52 BoogieIcfgContainer [2020-07-18 00:16:52,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:16:52,546 INFO L168 Benchmark]: Toolchain (without parser) took 24982.90 ms. Allocated memory was 146.3 MB in the beginning and 426.8 MB in the end (delta: 280.5 MB). Free memory was 104.5 MB in the beginning and 152.9 MB in the end (delta: -48.4 MB). Peak memory consumption was 232.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:16:52,547 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:16:52,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.87 ms. Allocated memory is still 146.3 MB. Free memory was 104.3 MB in the beginning and 93.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:16:52,553 INFO L168 Benchmark]: Boogie Preprocessor took 121.33 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.9 MB in the beginning and 182.6 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:16:52,554 INFO L168 Benchmark]: RCFGBuilder took 569.01 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 154.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:16:52,555 INFO L168 Benchmark]: TraceAbstraction took 24011.22 ms. Allocated memory was 203.4 MB in the beginning and 426.8 MB in the end (delta: 223.3 MB). Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 225.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:16:52,565 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.27 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.87 ms. Allocated memory is still 146.3 MB. Free memory was 104.3 MB in the beginning and 93.9 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.33 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.9 MB in the beginning and 182.6 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 569.01 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 154.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24011.22 ms. Allocated memory was 203.4 MB in the beginning and 426.8 MB in the end (delta: 223.3 MB). Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 225.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: 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, 68 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 956 SDtfs, 332 SDslu, 668 SDs, 0 SdLazy, 49 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 956 NumberOfFragments, 2378 HoareAnnotationTreeSize, 68 FomulaSimplifications, 9164 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.5s 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...