/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-46f3038-m [2020-07-08 16:17:14,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 16:17:14,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 16:17:14,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 16:17:14,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 16:17:14,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 16:17:14,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 16:17:14,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 16:17:14,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 16:17:14,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 16:17:14,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 16:17:14,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 16:17:14,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 16:17:14,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 16:17:14,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 16:17:14,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 16:17:14,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 16:17:14,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 16:17:14,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 16:17:14,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 16:17:14,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 16:17:14,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 16:17:14,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 16:17:14,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 16:17:14,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 16:17:14,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 16:17:14,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 16:17:14,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 16:17:14,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 16:17:14,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 16:17:14,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 16:17:14,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 16:17:14,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 16:17:14,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 16:17:14,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 16:17:14,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 16:17:14,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 16:17:14,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 16:17:14,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 16:17:14,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 16:17:14,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 16:17:14,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 16:17:14,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 16:17:14,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 16:17:14,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 16:17:14,607 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 16:17:14,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 16:17:14,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 16:17:14,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 16:17:14,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 16:17:14,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 16:17:14,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 16:17:14,608 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 16:17:14,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 16:17:14,609 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 16:17:14,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 16:17:14,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 16:17:14,609 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 16:17:14,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 16:17:14,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 16:17:14,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 16:17:14,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 16:17:14,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 16:17:14,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 16:17:14,610 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 16:17:14,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 16:17:14,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 16:17:14,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 16:17:14,921 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 16:17:14,922 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 16:17:14,923 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-08 16:17:14,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66774c2e0/d6f56c0305c943379667328e45f4c6eb/FLAG4b838631c [2020-07-08 16:17:15,446 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 16:17:15,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-07-08 16:17:15,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66774c2e0/d6f56c0305c943379667328e45f4c6eb/FLAG4b838631c [2020-07-08 16:17:15,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66774c2e0/d6f56c0305c943379667328e45f4c6eb [2020-07-08 16:17:15,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 16:17:15,785 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 16:17:15,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 16:17:15,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 16:17:15,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 16:17:15,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:17:15" (1/1) ... [2020-07-08 16:17:15,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c11b393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:15, skipping insertion in model container [2020-07-08 16:17:15,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 04:17:15" (1/1) ... [2020-07-08 16:17:15,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 16:17:15,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 16:17:15,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:17:16,003 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 16:17:16,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 16:17:16,040 INFO L208 MainTranslator]: Completed translation [2020-07-08 16:17:16,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16 WrapperNode [2020-07-08 16:17:16,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 16:17:16,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 16:17:16,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 16:17:16,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 16:17:16,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (1/1) ... [2020-07-08 16:17:16,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (1/1) ... [2020-07-08 16:17:16,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (1/1) ... [2020-07-08 16:17:16,056 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (1/1) ... [2020-07-08 16:17:16,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (1/1) ... [2020-07-08 16:17:16,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (1/1) ... [2020-07-08 16:17:16,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (1/1) ... [2020-07-08 16:17:16,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 16:17:16,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 16:17:16,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 16:17:16,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 16:17:16,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (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-08 16:17:16,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 16:17:16,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 16:17:16,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 16:17:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 16:17:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 16:17:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 16:17:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 16:17:16,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 16:17:16,738 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 16:17:16,738 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 16:17:16,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:17:16 BoogieIcfgContainer [2020-07-08 16:17:16,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 16:17:16,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 16:17:16,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 16:17:16,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 16:17:16,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 04:17:15" (1/3) ... [2020-07-08 16:17:16,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ea2c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:17:16, skipping insertion in model container [2020-07-08 16:17:16,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 04:17:16" (2/3) ... [2020-07-08 16:17:16,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ea2c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 04:17:16, skipping insertion in model container [2020-07-08 16:17:16,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 04:17:16" (3/3) ... [2020-07-08 16:17:16,751 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-07-08 16:17:16,762 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 16:17:16,770 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 16:17:16,781 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 16:17:16,802 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 16:17:16,802 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 16:17:16,803 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 16:17:16,803 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 16:17:16,803 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 16:17:16,803 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 16:17:16,803 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 16:17:16,803 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 16:17:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-07-08 16:17:16,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 16:17:16,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:16,829 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-08 16:17:16,830 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:16,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569836, now seen corresponding path program 1 times [2020-07-08 16:17:16,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:16,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1707399087] [2020-07-08 16:17:16,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:17,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-08 16:17:17,063 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-08 16:17:17,065 INFO L263 TraceCheckUtils]: 0: Hoare triple {71#true} call ULTIMATE.init(); {71#true} is VALID [2020-07-08 16:17:17,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#true} assume true; {71#true} is VALID [2020-07-08 16:17:17,066 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {71#true} {71#true} #151#return; {71#true} is VALID [2020-07-08 16:17:17,067 INFO L263 TraceCheckUtils]: 3: Hoare triple {71#true} call #t~ret6 := main(); {71#true} is VALID [2020-07-08 16:17:17,067 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {71#true} is VALID [2020-07-08 16:17:17,068 INFO L280 TraceCheckUtils]: 5: Hoare triple {71#true} ~p1~0 := #t~nondet0; {71#true} is VALID [2020-07-08 16:17:17,068 INFO L280 TraceCheckUtils]: 6: Hoare triple {71#true} havoc #t~nondet0; {71#true} is VALID [2020-07-08 16:17:17,069 INFO L280 TraceCheckUtils]: 7: Hoare triple {71#true} havoc ~lk1~0; {71#true} is VALID [2020-07-08 16:17:17,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {71#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {71#true} is VALID [2020-07-08 16:17:17,069 INFO L280 TraceCheckUtils]: 9: Hoare triple {71#true} ~p2~0 := #t~nondet1; {71#true} is VALID [2020-07-08 16:17:17,070 INFO L280 TraceCheckUtils]: 10: Hoare triple {71#true} havoc #t~nondet1; {71#true} is VALID [2020-07-08 16:17:17,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {71#true} havoc ~lk2~0; {71#true} is VALID [2020-07-08 16:17:17,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {71#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {71#true} is VALID [2020-07-08 16:17:17,071 INFO L280 TraceCheckUtils]: 13: Hoare triple {71#true} ~p3~0 := #t~nondet2; {71#true} is VALID [2020-07-08 16:17:17,072 INFO L280 TraceCheckUtils]: 14: Hoare triple {71#true} havoc #t~nondet2; {71#true} is VALID [2020-07-08 16:17:17,072 INFO L280 TraceCheckUtils]: 15: Hoare triple {71#true} havoc ~lk3~0; {71#true} is VALID [2020-07-08 16:17:17,072 INFO L280 TraceCheckUtils]: 16: Hoare triple {71#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {71#true} is VALID [2020-07-08 16:17:17,073 INFO L280 TraceCheckUtils]: 17: Hoare triple {71#true} ~p4~0 := #t~nondet3; {71#true} is VALID [2020-07-08 16:17:17,073 INFO L280 TraceCheckUtils]: 18: Hoare triple {71#true} havoc #t~nondet3; {71#true} is VALID [2020-07-08 16:17:17,074 INFO L280 TraceCheckUtils]: 19: Hoare triple {71#true} havoc ~lk4~0; {71#true} is VALID [2020-07-08 16:17:17,074 INFO L280 TraceCheckUtils]: 20: Hoare triple {71#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {71#true} is VALID [2020-07-08 16:17:17,075 INFO L280 TraceCheckUtils]: 21: Hoare triple {71#true} ~p5~0 := #t~nondet4; {71#true} is VALID [2020-07-08 16:17:17,075 INFO L280 TraceCheckUtils]: 22: Hoare triple {71#true} havoc #t~nondet4; {71#true} is VALID [2020-07-08 16:17:17,076 INFO L280 TraceCheckUtils]: 23: Hoare triple {71#true} havoc ~lk5~0; {71#true} is VALID [2020-07-08 16:17:17,076 INFO L280 TraceCheckUtils]: 24: Hoare triple {71#true} havoc ~cond~0; {71#true} is VALID [2020-07-08 16:17:17,076 INFO L280 TraceCheckUtils]: 25: Hoare triple {71#true} assume !false; {71#true} is VALID [2020-07-08 16:17:17,077 INFO L280 TraceCheckUtils]: 26: Hoare triple {71#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {71#true} is VALID [2020-07-08 16:17:17,077 INFO L280 TraceCheckUtils]: 27: Hoare triple {71#true} ~cond~0 := #t~nondet5; {71#true} is VALID [2020-07-08 16:17:17,078 INFO L280 TraceCheckUtils]: 28: Hoare triple {71#true} havoc #t~nondet5; {71#true} is VALID [2020-07-08 16:17:17,078 INFO L280 TraceCheckUtils]: 29: Hoare triple {71#true} assume !(0 == ~cond~0); {71#true} is VALID [2020-07-08 16:17:17,079 INFO L280 TraceCheckUtils]: 30: Hoare triple {71#true} ~lk1~0 := 0; {71#true} is VALID [2020-07-08 16:17:17,079 INFO L280 TraceCheckUtils]: 31: Hoare triple {71#true} ~lk2~0 := 0; {71#true} is VALID [2020-07-08 16:17:17,079 INFO L280 TraceCheckUtils]: 32: Hoare triple {71#true} ~lk3~0 := 0; {71#true} is VALID [2020-07-08 16:17:17,080 INFO L280 TraceCheckUtils]: 33: Hoare triple {71#true} ~lk4~0 := 0; {71#true} is VALID [2020-07-08 16:17:17,080 INFO L280 TraceCheckUtils]: 34: Hoare triple {71#true} ~lk5~0 := 0; {71#true} is VALID [2020-07-08 16:17:17,084 INFO L280 TraceCheckUtils]: 35: Hoare triple {71#true} assume !(0 != ~p1~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:17,086 INFO L280 TraceCheckUtils]: 36: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:17,087 INFO L280 TraceCheckUtils]: 37: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:17,088 INFO L280 TraceCheckUtils]: 38: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:17,089 INFO L280 TraceCheckUtils]: 39: Hoare triple {75#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {75#(= 0 main_~p1~0)} is VALID [2020-07-08 16:17:17,090 INFO L280 TraceCheckUtils]: 40: Hoare triple {75#(= 0 main_~p1~0)} assume 0 != ~p1~0; {72#false} is VALID [2020-07-08 16:17:17,090 INFO L280 TraceCheckUtils]: 41: Hoare triple {72#false} assume 1 != ~lk1~0; {72#false} is VALID [2020-07-08 16:17:17,091 INFO L280 TraceCheckUtils]: 42: Hoare triple {72#false} assume !false; {72#false} is VALID [2020-07-08 16:17:17,097 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-08 16:17:17,098 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:17,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1707399087] [2020-07-08 16:17:17,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:17,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882388325] [2020-07-08 16:17:17,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-08 16:17:17,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:17,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:17,200 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-08 16:17:17,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:17,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:17,213 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-07-08 16:17:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:17,559 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2020-07-08 16:17:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:17,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-07-08 16:17:17,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:17,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-08 16:17:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2020-07-08 16:17:17,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2020-07-08 16:17:17,831 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-08 16:17:17,848 INFO L225 Difference]: With dead ends: 147 [2020-07-08 16:17:17,848 INFO L226 Difference]: Without dead ends: 96 [2020-07-08 16:17:17,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-08 16:17:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-07-08 16:17:17,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:17,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2020-07-08 16:17:17,956 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2020-07-08 16:17:17,956 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2020-07-08 16:17:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:17,965 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-08 16:17:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-08 16:17:17,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:17,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:17,967 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2020-07-08 16:17:17,967 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2020-07-08 16:17:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:17,976 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-07-08 16:17:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2020-07-08 16:17:17,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:17,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:17,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:17,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-08 16:17:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-07-08 16:17:17,987 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2020-07-08 16:17:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:17,987 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-07-08 16:17:17,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:17,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 120 transitions. [2020-07-08 16:17:18,122 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-08 16:17:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-07-08 16:17:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 16:17:18,125 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:18,125 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-08 16:17:18,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 16:17:18,126 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:18,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:18,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1252462105, now seen corresponding path program 1 times [2020-07-08 16:17:18,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:18,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [822083030] [2020-07-08 16:17:18,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:18,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-08 16:17:18,183 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-08 16:17:18,183 INFO L263 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2020-07-08 16:17:18,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {752#true} assume true; {752#true} is VALID [2020-07-08 16:17:18,184 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {752#true} {752#true} #151#return; {752#true} is VALID [2020-07-08 16:17:18,184 INFO L263 TraceCheckUtils]: 3: Hoare triple {752#true} call #t~ret6 := main(); {752#true} is VALID [2020-07-08 16:17:18,184 INFO L280 TraceCheckUtils]: 4: Hoare triple {752#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {752#true} is VALID [2020-07-08 16:17:18,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#true} ~p1~0 := #t~nondet0; {752#true} is VALID [2020-07-08 16:17:18,185 INFO L280 TraceCheckUtils]: 6: Hoare triple {752#true} havoc #t~nondet0; {752#true} is VALID [2020-07-08 16:17:18,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {752#true} havoc ~lk1~0; {752#true} is VALID [2020-07-08 16:17:18,185 INFO L280 TraceCheckUtils]: 8: Hoare triple {752#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {752#true} is VALID [2020-07-08 16:17:18,186 INFO L280 TraceCheckUtils]: 9: Hoare triple {752#true} ~p2~0 := #t~nondet1; {752#true} is VALID [2020-07-08 16:17:18,186 INFO L280 TraceCheckUtils]: 10: Hoare triple {752#true} havoc #t~nondet1; {752#true} is VALID [2020-07-08 16:17:18,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {752#true} havoc ~lk2~0; {752#true} is VALID [2020-07-08 16:17:18,187 INFO L280 TraceCheckUtils]: 12: Hoare triple {752#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {752#true} is VALID [2020-07-08 16:17:18,187 INFO L280 TraceCheckUtils]: 13: Hoare triple {752#true} ~p3~0 := #t~nondet2; {752#true} is VALID [2020-07-08 16:17:18,187 INFO L280 TraceCheckUtils]: 14: Hoare triple {752#true} havoc #t~nondet2; {752#true} is VALID [2020-07-08 16:17:18,188 INFO L280 TraceCheckUtils]: 15: Hoare triple {752#true} havoc ~lk3~0; {752#true} is VALID [2020-07-08 16:17:18,188 INFO L280 TraceCheckUtils]: 16: Hoare triple {752#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {752#true} is VALID [2020-07-08 16:17:18,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {752#true} ~p4~0 := #t~nondet3; {752#true} is VALID [2020-07-08 16:17:18,189 INFO L280 TraceCheckUtils]: 18: Hoare triple {752#true} havoc #t~nondet3; {752#true} is VALID [2020-07-08 16:17:18,189 INFO L280 TraceCheckUtils]: 19: Hoare triple {752#true} havoc ~lk4~0; {752#true} is VALID [2020-07-08 16:17:18,189 INFO L280 TraceCheckUtils]: 20: Hoare triple {752#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {752#true} is VALID [2020-07-08 16:17:18,190 INFO L280 TraceCheckUtils]: 21: Hoare triple {752#true} ~p5~0 := #t~nondet4; {752#true} is VALID [2020-07-08 16:17:18,190 INFO L280 TraceCheckUtils]: 22: Hoare triple {752#true} havoc #t~nondet4; {752#true} is VALID [2020-07-08 16:17:18,190 INFO L280 TraceCheckUtils]: 23: Hoare triple {752#true} havoc ~lk5~0; {752#true} is VALID [2020-07-08 16:17:18,191 INFO L280 TraceCheckUtils]: 24: Hoare triple {752#true} havoc ~cond~0; {752#true} is VALID [2020-07-08 16:17:18,191 INFO L280 TraceCheckUtils]: 25: Hoare triple {752#true} assume !false; {752#true} is VALID [2020-07-08 16:17:18,191 INFO L280 TraceCheckUtils]: 26: Hoare triple {752#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {752#true} is VALID [2020-07-08 16:17:18,191 INFO L280 TraceCheckUtils]: 27: Hoare triple {752#true} ~cond~0 := #t~nondet5; {752#true} is VALID [2020-07-08 16:17:18,192 INFO L280 TraceCheckUtils]: 28: Hoare triple {752#true} havoc #t~nondet5; {752#true} is VALID [2020-07-08 16:17:18,192 INFO L280 TraceCheckUtils]: 29: Hoare triple {752#true} assume !(0 == ~cond~0); {752#true} is VALID [2020-07-08 16:17:18,192 INFO L280 TraceCheckUtils]: 30: Hoare triple {752#true} ~lk1~0 := 0; {752#true} is VALID [2020-07-08 16:17:18,193 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#true} ~lk2~0 := 0; {752#true} is VALID [2020-07-08 16:17:18,193 INFO L280 TraceCheckUtils]: 32: Hoare triple {752#true} ~lk3~0 := 0; {752#true} is VALID [2020-07-08 16:17:18,193 INFO L280 TraceCheckUtils]: 33: Hoare triple {752#true} ~lk4~0 := 0; {752#true} is VALID [2020-07-08 16:17:18,194 INFO L280 TraceCheckUtils]: 34: Hoare triple {752#true} ~lk5~0 := 0; {752#true} is VALID [2020-07-08 16:17:18,194 INFO L280 TraceCheckUtils]: 35: Hoare triple {752#true} assume 0 != ~p1~0; {752#true} is VALID [2020-07-08 16:17:18,195 INFO L280 TraceCheckUtils]: 36: Hoare triple {752#true} ~lk1~0 := 1; {756#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:18,196 INFO L280 TraceCheckUtils]: 37: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:18,196 INFO L280 TraceCheckUtils]: 38: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:18,197 INFO L280 TraceCheckUtils]: 39: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:18,198 INFO L280 TraceCheckUtils]: 40: Hoare triple {756#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {756#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:18,198 INFO L280 TraceCheckUtils]: 41: Hoare triple {756#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {756#(= 1 main_~lk1~0)} is VALID [2020-07-08 16:17:18,199 INFO L280 TraceCheckUtils]: 42: Hoare triple {756#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {753#false} is VALID [2020-07-08 16:17:18,199 INFO L280 TraceCheckUtils]: 43: Hoare triple {753#false} assume !false; {753#false} is VALID [2020-07-08 16:17:18,202 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-08 16:17:18,202 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:18,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [822083030] [2020-07-08 16:17:18,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:18,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:18,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971960544] [2020-07-08 16:17:18,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-08 16:17:18,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:18,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:18,252 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-08 16:17:18,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:18,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:18,253 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 3 states. [2020-07-08 16:17:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:18,554 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2020-07-08 16:17:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:18,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-08 16:17:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-08 16:17:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2020-07-08 16:17:18,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2020-07-08 16:17:18,674 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-08 16:17:18,679 INFO L225 Difference]: With dead ends: 116 [2020-07-08 16:17:18,680 INFO L226 Difference]: Without dead ends: 114 [2020-07-08 16:17:18,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-08 16:17:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-07-08 16:17:18,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:18,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 94 states. [2020-07-08 16:17:18,781 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 94 states. [2020-07-08 16:17:18,781 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 94 states. [2020-07-08 16:17:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:18,788 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-08 16:17:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-08 16:17:18,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:18,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:18,790 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 114 states. [2020-07-08 16:17:18,790 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 114 states. [2020-07-08 16:17:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:18,797 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2020-07-08 16:17:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2020-07-08 16:17:18,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:18,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:18,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:18,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-08 16:17:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-07-08 16:17:18,804 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 44 [2020-07-08 16:17:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:18,804 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-07-08 16:17:18,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:18,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 119 transitions. [2020-07-08 16:17:18,932 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-08 16:17:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-07-08 16:17:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 16:17:18,934 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:18,934 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-08 16:17:18,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 16:17:18,934 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash 755286414, now seen corresponding path program 1 times [2020-07-08 16:17:18,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:18,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681448788] [2020-07-08 16:17:18,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:18,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-08 16:17:18,982 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-08 16:17:18,983 INFO L263 TraceCheckUtils]: 0: Hoare triple {1407#true} call ULTIMATE.init(); {1407#true} is VALID [2020-07-08 16:17:18,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2020-07-08 16:17:18,983 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1407#true} #151#return; {1407#true} is VALID [2020-07-08 16:17:18,984 INFO L263 TraceCheckUtils]: 3: Hoare triple {1407#true} call #t~ret6 := main(); {1407#true} is VALID [2020-07-08 16:17:18,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {1407#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1407#true} is VALID [2020-07-08 16:17:18,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {1407#true} ~p1~0 := #t~nondet0; {1407#true} is VALID [2020-07-08 16:17:18,985 INFO L280 TraceCheckUtils]: 6: Hoare triple {1407#true} havoc #t~nondet0; {1407#true} is VALID [2020-07-08 16:17:18,985 INFO L280 TraceCheckUtils]: 7: Hoare triple {1407#true} havoc ~lk1~0; {1407#true} is VALID [2020-07-08 16:17:18,985 INFO L280 TraceCheckUtils]: 8: Hoare triple {1407#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1407#true} is VALID [2020-07-08 16:17:18,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {1407#true} ~p2~0 := #t~nondet1; {1407#true} is VALID [2020-07-08 16:17:18,986 INFO L280 TraceCheckUtils]: 10: Hoare triple {1407#true} havoc #t~nondet1; {1407#true} is VALID [2020-07-08 16:17:18,986 INFO L280 TraceCheckUtils]: 11: Hoare triple {1407#true} havoc ~lk2~0; {1407#true} is VALID [2020-07-08 16:17:18,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {1407#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1407#true} is VALID [2020-07-08 16:17:18,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {1407#true} ~p3~0 := #t~nondet2; {1407#true} is VALID [2020-07-08 16:17:18,987 INFO L280 TraceCheckUtils]: 14: Hoare triple {1407#true} havoc #t~nondet2; {1407#true} is VALID [2020-07-08 16:17:18,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {1407#true} havoc ~lk3~0; {1407#true} is VALID [2020-07-08 16:17:18,988 INFO L280 TraceCheckUtils]: 16: Hoare triple {1407#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1407#true} is VALID [2020-07-08 16:17:18,988 INFO L280 TraceCheckUtils]: 17: Hoare triple {1407#true} ~p4~0 := #t~nondet3; {1407#true} is VALID [2020-07-08 16:17:18,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {1407#true} havoc #t~nondet3; {1407#true} is VALID [2020-07-08 16:17:18,988 INFO L280 TraceCheckUtils]: 19: Hoare triple {1407#true} havoc ~lk4~0; {1407#true} is VALID [2020-07-08 16:17:18,989 INFO L280 TraceCheckUtils]: 20: Hoare triple {1407#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1407#true} is VALID [2020-07-08 16:17:18,989 INFO L280 TraceCheckUtils]: 21: Hoare triple {1407#true} ~p5~0 := #t~nondet4; {1407#true} is VALID [2020-07-08 16:17:18,989 INFO L280 TraceCheckUtils]: 22: Hoare triple {1407#true} havoc #t~nondet4; {1407#true} is VALID [2020-07-08 16:17:18,990 INFO L280 TraceCheckUtils]: 23: Hoare triple {1407#true} havoc ~lk5~0; {1407#true} is VALID [2020-07-08 16:17:18,990 INFO L280 TraceCheckUtils]: 24: Hoare triple {1407#true} havoc ~cond~0; {1407#true} is VALID [2020-07-08 16:17:18,990 INFO L280 TraceCheckUtils]: 25: Hoare triple {1407#true} assume !false; {1407#true} is VALID [2020-07-08 16:17:18,991 INFO L280 TraceCheckUtils]: 26: Hoare triple {1407#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1407#true} is VALID [2020-07-08 16:17:18,991 INFO L280 TraceCheckUtils]: 27: Hoare triple {1407#true} ~cond~0 := #t~nondet5; {1407#true} is VALID [2020-07-08 16:17:18,991 INFO L280 TraceCheckUtils]: 28: Hoare triple {1407#true} havoc #t~nondet5; {1407#true} is VALID [2020-07-08 16:17:18,992 INFO L280 TraceCheckUtils]: 29: Hoare triple {1407#true} assume !(0 == ~cond~0); {1407#true} is VALID [2020-07-08 16:17:18,992 INFO L280 TraceCheckUtils]: 30: Hoare triple {1407#true} ~lk1~0 := 0; {1407#true} is VALID [2020-07-08 16:17:18,992 INFO L280 TraceCheckUtils]: 31: Hoare triple {1407#true} ~lk2~0 := 0; {1407#true} is VALID [2020-07-08 16:17:18,992 INFO L280 TraceCheckUtils]: 32: Hoare triple {1407#true} ~lk3~0 := 0; {1407#true} is VALID [2020-07-08 16:17:18,993 INFO L280 TraceCheckUtils]: 33: Hoare triple {1407#true} ~lk4~0 := 0; {1407#true} is VALID [2020-07-08 16:17:18,993 INFO L280 TraceCheckUtils]: 34: Hoare triple {1407#true} ~lk5~0 := 0; {1407#true} is VALID [2020-07-08 16:17:18,993 INFO L280 TraceCheckUtils]: 35: Hoare triple {1407#true} assume !(0 != ~p1~0); {1407#true} is VALID [2020-07-08 16:17:18,994 INFO L280 TraceCheckUtils]: 36: Hoare triple {1407#true} assume !(0 != ~p2~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:19,002 INFO L280 TraceCheckUtils]: 37: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:19,003 INFO L280 TraceCheckUtils]: 38: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:19,003 INFO L280 TraceCheckUtils]: 39: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:19,004 INFO L280 TraceCheckUtils]: 40: Hoare triple {1411#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1411#(= 0 main_~p2~0)} is VALID [2020-07-08 16:17:19,005 INFO L280 TraceCheckUtils]: 41: Hoare triple {1411#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1408#false} is VALID [2020-07-08 16:17:19,005 INFO L280 TraceCheckUtils]: 42: Hoare triple {1408#false} assume 1 != ~lk2~0; {1408#false} is VALID [2020-07-08 16:17:19,005 INFO L280 TraceCheckUtils]: 43: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2020-07-08 16:17:19,008 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-08 16:17:19,008 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:19,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681448788] [2020-07-08 16:17:19,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:19,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:19,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475144068] [2020-07-08 16:17:19,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-08 16:17:19,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:19,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:19,050 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-08 16:17:19,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:19,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:19,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:19,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:19,051 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2020-07-08 16:17:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:19,411 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2020-07-08 16:17:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:19,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-07-08 16:17:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-08 16:17:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2020-07-08 16:17:19,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2020-07-08 16:17:19,576 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-08 16:17:19,584 INFO L225 Difference]: With dead ends: 226 [2020-07-08 16:17:19,584 INFO L226 Difference]: Without dead ends: 157 [2020-07-08 16:17:19,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-07-08 16:17:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-07-08 16:17:19,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:19,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 155 states. [2020-07-08 16:17:19,767 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 155 states. [2020-07-08 16:17:19,767 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 155 states. [2020-07-08 16:17:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:19,780 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-08 16:17:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-08 16:17:19,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:19,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:19,781 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 157 states. [2020-07-08 16:17:19,782 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 157 states. [2020-07-08 16:17:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:19,797 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2020-07-08 16:17:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 201 transitions. [2020-07-08 16:17:19,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:19,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:19,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:19,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-08 16:17:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2020-07-08 16:17:19,810 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 44 [2020-07-08 16:17:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:19,810 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2020-07-08 16:17:19,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:19,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 200 transitions. [2020-07-08 16:17:20,041 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-08 16:17:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2020-07-08 16:17:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-08 16:17:20,042 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:20,042 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-08 16:17:20,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 16:17:20,042 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1863120818, now seen corresponding path program 1 times [2020-07-08 16:17:20,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:20,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400816647] [2020-07-08 16:17:20,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:20,112 INFO L280 TraceCheckUtils]: 0: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-08 16:17:20,112 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-08 16:17:20,113 INFO L263 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2020-07-08 16:17:20,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {2490#true} assume true; {2490#true} is VALID [2020-07-08 16:17:20,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2490#true} {2490#true} #151#return; {2490#true} is VALID [2020-07-08 16:17:20,114 INFO L263 TraceCheckUtils]: 3: Hoare triple {2490#true} call #t~ret6 := main(); {2490#true} is VALID [2020-07-08 16:17:20,114 INFO L280 TraceCheckUtils]: 4: Hoare triple {2490#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2490#true} is VALID [2020-07-08 16:17:20,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {2490#true} ~p1~0 := #t~nondet0; {2490#true} is VALID [2020-07-08 16:17:20,114 INFO L280 TraceCheckUtils]: 6: Hoare triple {2490#true} havoc #t~nondet0; {2490#true} is VALID [2020-07-08 16:17:20,115 INFO L280 TraceCheckUtils]: 7: Hoare triple {2490#true} havoc ~lk1~0; {2490#true} is VALID [2020-07-08 16:17:20,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {2490#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2490#true} is VALID [2020-07-08 16:17:20,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {2490#true} ~p2~0 := #t~nondet1; {2490#true} is VALID [2020-07-08 16:17:20,116 INFO L280 TraceCheckUtils]: 10: Hoare triple {2490#true} havoc #t~nondet1; {2490#true} is VALID [2020-07-08 16:17:20,116 INFO L280 TraceCheckUtils]: 11: Hoare triple {2490#true} havoc ~lk2~0; {2490#true} is VALID [2020-07-08 16:17:20,116 INFO L280 TraceCheckUtils]: 12: Hoare triple {2490#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2490#true} is VALID [2020-07-08 16:17:20,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {2490#true} ~p3~0 := #t~nondet2; {2490#true} is VALID [2020-07-08 16:17:20,117 INFO L280 TraceCheckUtils]: 14: Hoare triple {2490#true} havoc #t~nondet2; {2490#true} is VALID [2020-07-08 16:17:20,117 INFO L280 TraceCheckUtils]: 15: Hoare triple {2490#true} havoc ~lk3~0; {2490#true} is VALID [2020-07-08 16:17:20,125 INFO L280 TraceCheckUtils]: 16: Hoare triple {2490#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2490#true} is VALID [2020-07-08 16:17:20,126 INFO L280 TraceCheckUtils]: 17: Hoare triple {2490#true} ~p4~0 := #t~nondet3; {2490#true} is VALID [2020-07-08 16:17:20,126 INFO L280 TraceCheckUtils]: 18: Hoare triple {2490#true} havoc #t~nondet3; {2490#true} is VALID [2020-07-08 16:17:20,126 INFO L280 TraceCheckUtils]: 19: Hoare triple {2490#true} havoc ~lk4~0; {2490#true} is VALID [2020-07-08 16:17:20,126 INFO L280 TraceCheckUtils]: 20: Hoare triple {2490#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2490#true} is VALID [2020-07-08 16:17:20,126 INFO L280 TraceCheckUtils]: 21: Hoare triple {2490#true} ~p5~0 := #t~nondet4; {2490#true} is VALID [2020-07-08 16:17:20,127 INFO L280 TraceCheckUtils]: 22: Hoare triple {2490#true} havoc #t~nondet4; {2490#true} is VALID [2020-07-08 16:17:20,127 INFO L280 TraceCheckUtils]: 23: Hoare triple {2490#true} havoc ~lk5~0; {2490#true} is VALID [2020-07-08 16:17:20,127 INFO L280 TraceCheckUtils]: 24: Hoare triple {2490#true} havoc ~cond~0; {2490#true} is VALID [2020-07-08 16:17:20,127 INFO L280 TraceCheckUtils]: 25: Hoare triple {2490#true} assume !false; {2490#true} is VALID [2020-07-08 16:17:20,127 INFO L280 TraceCheckUtils]: 26: Hoare triple {2490#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2490#true} is VALID [2020-07-08 16:17:20,128 INFO L280 TraceCheckUtils]: 27: Hoare triple {2490#true} ~cond~0 := #t~nondet5; {2490#true} is VALID [2020-07-08 16:17:20,128 INFO L280 TraceCheckUtils]: 28: Hoare triple {2490#true} havoc #t~nondet5; {2490#true} is VALID [2020-07-08 16:17:20,128 INFO L280 TraceCheckUtils]: 29: Hoare triple {2490#true} assume !(0 == ~cond~0); {2490#true} is VALID [2020-07-08 16:17:20,129 INFO L280 TraceCheckUtils]: 30: Hoare triple {2490#true} ~lk1~0 := 0; {2490#true} is VALID [2020-07-08 16:17:20,130 INFO L280 TraceCheckUtils]: 31: Hoare triple {2490#true} ~lk2~0 := 0; {2490#true} is VALID [2020-07-08 16:17:20,130 INFO L280 TraceCheckUtils]: 32: Hoare triple {2490#true} ~lk3~0 := 0; {2490#true} is VALID [2020-07-08 16:17:20,130 INFO L280 TraceCheckUtils]: 33: Hoare triple {2490#true} ~lk4~0 := 0; {2490#true} is VALID [2020-07-08 16:17:20,130 INFO L280 TraceCheckUtils]: 34: Hoare triple {2490#true} ~lk5~0 := 0; {2490#true} is VALID [2020-07-08 16:17:20,131 INFO L280 TraceCheckUtils]: 35: Hoare triple {2490#true} assume !(0 != ~p1~0); {2490#true} is VALID [2020-07-08 16:17:20,131 INFO L280 TraceCheckUtils]: 36: Hoare triple {2490#true} assume 0 != ~p2~0; {2490#true} is VALID [2020-07-08 16:17:20,137 INFO L280 TraceCheckUtils]: 37: Hoare triple {2490#true} ~lk2~0 := 1; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:20,138 INFO L280 TraceCheckUtils]: 38: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:20,139 INFO L280 TraceCheckUtils]: 39: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:20,139 INFO L280 TraceCheckUtils]: 40: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:20,140 INFO L280 TraceCheckUtils]: 41: Hoare triple {2494#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {2494#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:20,146 INFO L280 TraceCheckUtils]: 42: Hoare triple {2494#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {2494#(= 1 main_~lk2~0)} is VALID [2020-07-08 16:17:20,147 INFO L280 TraceCheckUtils]: 43: Hoare triple {2494#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {2491#false} is VALID [2020-07-08 16:17:20,147 INFO L280 TraceCheckUtils]: 44: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2020-07-08 16:17:20,149 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-08 16:17:20,149 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:20,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400816647] [2020-07-08 16:17:20,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:20,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:20,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339503] [2020-07-08 16:17:20,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-08 16:17:20,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:20,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:20,204 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-08 16:17:20,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:20,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:20,205 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 3 states. [2020-07-08 16:17:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:20,559 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2020-07-08 16:17:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:20,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-08 16:17:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-08 16:17:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-08 16:17:20,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2020-07-08 16:17:20,664 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-08 16:17:20,668 INFO L225 Difference]: With dead ends: 191 [2020-07-08 16:17:20,668 INFO L226 Difference]: Without dead ends: 189 [2020-07-08 16:17:20,669 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-08 16:17:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2020-07-08 16:17:20,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:20,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 155 states. [2020-07-08 16:17:20,835 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 155 states. [2020-07-08 16:17:20,836 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 155 states. [2020-07-08 16:17:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:20,843 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-08 16:17:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-08 16:17:20,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:20,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:20,845 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 189 states. [2020-07-08 16:17:20,845 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 189 states. [2020-07-08 16:17:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:20,855 INFO L93 Difference]: Finished difference Result 189 states and 243 transitions. [2020-07-08 16:17:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2020-07-08 16:17:20,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:20,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:20,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:20,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-07-08 16:17:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2020-07-08 16:17:20,863 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2020-07-08 16:17:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:20,864 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2020-07-08 16:17:20,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:20,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 155 states and 198 transitions. [2020-07-08 16:17:21,107 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-08 16:17:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2020-07-08 16:17:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-08 16:17:21,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:21,108 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-08 16:17:21,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 16:17:21,109 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:21,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1939288392, now seen corresponding path program 1 times [2020-07-08 16:17:21,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:21,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1595511186] [2020-07-08 16:17:21,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:21,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-08 16:17:21,151 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-08 16:17:21,152 INFO L263 TraceCheckUtils]: 0: Hoare triple {3567#true} call ULTIMATE.init(); {3567#true} is VALID [2020-07-08 16:17:21,152 INFO L280 TraceCheckUtils]: 1: Hoare triple {3567#true} assume true; {3567#true} is VALID [2020-07-08 16:17:21,152 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3567#true} {3567#true} #151#return; {3567#true} is VALID [2020-07-08 16:17:21,153 INFO L263 TraceCheckUtils]: 3: Hoare triple {3567#true} call #t~ret6 := main(); {3567#true} is VALID [2020-07-08 16:17:21,153 INFO L280 TraceCheckUtils]: 4: Hoare triple {3567#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3567#true} is VALID [2020-07-08 16:17:21,153 INFO L280 TraceCheckUtils]: 5: Hoare triple {3567#true} ~p1~0 := #t~nondet0; {3567#true} is VALID [2020-07-08 16:17:21,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {3567#true} havoc #t~nondet0; {3567#true} is VALID [2020-07-08 16:17:21,154 INFO L280 TraceCheckUtils]: 7: Hoare triple {3567#true} havoc ~lk1~0; {3567#true} is VALID [2020-07-08 16:17:21,154 INFO L280 TraceCheckUtils]: 8: Hoare triple {3567#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3567#true} is VALID [2020-07-08 16:17:21,155 INFO L280 TraceCheckUtils]: 9: Hoare triple {3567#true} ~p2~0 := #t~nondet1; {3567#true} is VALID [2020-07-08 16:17:21,155 INFO L280 TraceCheckUtils]: 10: Hoare triple {3567#true} havoc #t~nondet1; {3567#true} is VALID [2020-07-08 16:17:21,155 INFO L280 TraceCheckUtils]: 11: Hoare triple {3567#true} havoc ~lk2~0; {3567#true} is VALID [2020-07-08 16:17:21,155 INFO L280 TraceCheckUtils]: 12: Hoare triple {3567#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3567#true} is VALID [2020-07-08 16:17:21,156 INFO L280 TraceCheckUtils]: 13: Hoare triple {3567#true} ~p3~0 := #t~nondet2; {3567#true} is VALID [2020-07-08 16:17:21,156 INFO L280 TraceCheckUtils]: 14: Hoare triple {3567#true} havoc #t~nondet2; {3567#true} is VALID [2020-07-08 16:17:21,156 INFO L280 TraceCheckUtils]: 15: Hoare triple {3567#true} havoc ~lk3~0; {3567#true} is VALID [2020-07-08 16:17:21,157 INFO L280 TraceCheckUtils]: 16: Hoare triple {3567#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3567#true} is VALID [2020-07-08 16:17:21,157 INFO L280 TraceCheckUtils]: 17: Hoare triple {3567#true} ~p4~0 := #t~nondet3; {3567#true} is VALID [2020-07-08 16:17:21,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {3567#true} havoc #t~nondet3; {3567#true} is VALID [2020-07-08 16:17:21,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {3567#true} havoc ~lk4~0; {3567#true} is VALID [2020-07-08 16:17:21,158 INFO L280 TraceCheckUtils]: 20: Hoare triple {3567#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3567#true} is VALID [2020-07-08 16:17:21,158 INFO L280 TraceCheckUtils]: 21: Hoare triple {3567#true} ~p5~0 := #t~nondet4; {3567#true} is VALID [2020-07-08 16:17:21,158 INFO L280 TraceCheckUtils]: 22: Hoare triple {3567#true} havoc #t~nondet4; {3567#true} is VALID [2020-07-08 16:17:21,159 INFO L280 TraceCheckUtils]: 23: Hoare triple {3567#true} havoc ~lk5~0; {3567#true} is VALID [2020-07-08 16:17:21,159 INFO L280 TraceCheckUtils]: 24: Hoare triple {3567#true} havoc ~cond~0; {3567#true} is VALID [2020-07-08 16:17:21,159 INFO L280 TraceCheckUtils]: 25: Hoare triple {3567#true} assume !false; {3567#true} is VALID [2020-07-08 16:17:21,160 INFO L280 TraceCheckUtils]: 26: Hoare triple {3567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3567#true} is VALID [2020-07-08 16:17:21,160 INFO L280 TraceCheckUtils]: 27: Hoare triple {3567#true} ~cond~0 := #t~nondet5; {3567#true} is VALID [2020-07-08 16:17:21,160 INFO L280 TraceCheckUtils]: 28: Hoare triple {3567#true} havoc #t~nondet5; {3567#true} is VALID [2020-07-08 16:17:21,161 INFO L280 TraceCheckUtils]: 29: Hoare triple {3567#true} assume !(0 == ~cond~0); {3567#true} is VALID [2020-07-08 16:17:21,161 INFO L280 TraceCheckUtils]: 30: Hoare triple {3567#true} ~lk1~0 := 0; {3567#true} is VALID [2020-07-08 16:17:21,161 INFO L280 TraceCheckUtils]: 31: Hoare triple {3567#true} ~lk2~0 := 0; {3567#true} is VALID [2020-07-08 16:17:21,162 INFO L280 TraceCheckUtils]: 32: Hoare triple {3567#true} ~lk3~0 := 0; {3567#true} is VALID [2020-07-08 16:17:21,162 INFO L280 TraceCheckUtils]: 33: Hoare triple {3567#true} ~lk4~0 := 0; {3567#true} is VALID [2020-07-08 16:17:21,162 INFO L280 TraceCheckUtils]: 34: Hoare triple {3567#true} ~lk5~0 := 0; {3567#true} is VALID [2020-07-08 16:17:21,162 INFO L280 TraceCheckUtils]: 35: Hoare triple {3567#true} assume !(0 != ~p1~0); {3567#true} is VALID [2020-07-08 16:17:21,163 INFO L280 TraceCheckUtils]: 36: Hoare triple {3567#true} assume !(0 != ~p2~0); {3567#true} is VALID [2020-07-08 16:17:21,164 INFO L280 TraceCheckUtils]: 37: Hoare triple {3567#true} assume !(0 != ~p3~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:21,164 INFO L280 TraceCheckUtils]: 38: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:21,165 INFO L280 TraceCheckUtils]: 39: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:21,166 INFO L280 TraceCheckUtils]: 40: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:21,166 INFO L280 TraceCheckUtils]: 41: Hoare triple {3571#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {3571#(= 0 main_~p3~0)} is VALID [2020-07-08 16:17:21,167 INFO L280 TraceCheckUtils]: 42: Hoare triple {3571#(= 0 main_~p3~0)} assume 0 != ~p3~0; {3568#false} is VALID [2020-07-08 16:17:21,176 INFO L280 TraceCheckUtils]: 43: Hoare triple {3568#false} assume 1 != ~lk3~0; {3568#false} is VALID [2020-07-08 16:17:21,176 INFO L280 TraceCheckUtils]: 44: Hoare triple {3568#false} assume !false; {3568#false} is VALID [2020-07-08 16:17:21,177 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-08 16:17:21,178 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:21,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1595511186] [2020-07-08 16:17:21,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:21,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:21,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738688885] [2020-07-08 16:17:21,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-08 16:17:21,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:21,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:21,226 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-08 16:17:21,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:21,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:21,228 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 3 states. [2020-07-08 16:17:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:21,756 INFO L93 Difference]: Finished difference Result 403 states and 528 transitions. [2020-07-08 16:17:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:21,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-07-08 16:17:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 16:17:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 16:17:21,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-08 16:17:21,907 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-08 16:17:21,914 INFO L225 Difference]: With dead ends: 403 [2020-07-08 16:17:21,914 INFO L226 Difference]: Without dead ends: 273 [2020-07-08 16:17:21,916 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-07-08 16:17:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2020-07-08 16:17:22,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:22,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand 271 states. [2020-07-08 16:17:22,316 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand 271 states. [2020-07-08 16:17:22,317 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 271 states. [2020-07-08 16:17:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:22,327 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-08 16:17:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-08 16:17:22,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:22,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:22,328 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 273 states. [2020-07-08 16:17:22,328 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 273 states. [2020-07-08 16:17:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:22,339 INFO L93 Difference]: Finished difference Result 273 states and 347 transitions. [2020-07-08 16:17:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2020-07-08 16:17:22,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:22,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:22,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:22,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-07-08 16:17:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2020-07-08 16:17:22,351 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 45 [2020-07-08 16:17:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:22,352 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2020-07-08 16:17:22,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:22,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 271 states and 346 transitions. [2020-07-08 16:17:22,743 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-08 16:17:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2020-07-08 16:17:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 16:17:22,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:22,745 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-08 16:17:22,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 16:17:22,746 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash -11355582, now seen corresponding path program 1 times [2020-07-08 16:17:22,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:22,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348678251] [2020-07-08 16:17:22,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:22,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-08 16:17:22,808 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-08 16:17:22,808 INFO L263 TraceCheckUtils]: 0: Hoare triple {5468#true} call ULTIMATE.init(); {5468#true} is VALID [2020-07-08 16:17:22,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {5468#true} assume true; {5468#true} is VALID [2020-07-08 16:17:22,809 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5468#true} {5468#true} #151#return; {5468#true} is VALID [2020-07-08 16:17:22,809 INFO L263 TraceCheckUtils]: 3: Hoare triple {5468#true} call #t~ret6 := main(); {5468#true} is VALID [2020-07-08 16:17:22,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {5468#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {5468#true} is VALID [2020-07-08 16:17:22,809 INFO L280 TraceCheckUtils]: 5: Hoare triple {5468#true} ~p1~0 := #t~nondet0; {5468#true} is VALID [2020-07-08 16:17:22,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {5468#true} havoc #t~nondet0; {5468#true} is VALID [2020-07-08 16:17:22,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {5468#true} havoc ~lk1~0; {5468#true} is VALID [2020-07-08 16:17:22,810 INFO L280 TraceCheckUtils]: 8: Hoare triple {5468#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5468#true} is VALID [2020-07-08 16:17:22,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {5468#true} ~p2~0 := #t~nondet1; {5468#true} is VALID [2020-07-08 16:17:22,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {5468#true} havoc #t~nondet1; {5468#true} is VALID [2020-07-08 16:17:22,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {5468#true} havoc ~lk2~0; {5468#true} is VALID [2020-07-08 16:17:22,811 INFO L280 TraceCheckUtils]: 12: Hoare triple {5468#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {5468#true} is VALID [2020-07-08 16:17:22,811 INFO L280 TraceCheckUtils]: 13: Hoare triple {5468#true} ~p3~0 := #t~nondet2; {5468#true} is VALID [2020-07-08 16:17:22,811 INFO L280 TraceCheckUtils]: 14: Hoare triple {5468#true} havoc #t~nondet2; {5468#true} is VALID [2020-07-08 16:17:22,812 INFO L280 TraceCheckUtils]: 15: Hoare triple {5468#true} havoc ~lk3~0; {5468#true} is VALID [2020-07-08 16:17:22,812 INFO L280 TraceCheckUtils]: 16: Hoare triple {5468#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5468#true} is VALID [2020-07-08 16:17:22,812 INFO L280 TraceCheckUtils]: 17: Hoare triple {5468#true} ~p4~0 := #t~nondet3; {5468#true} is VALID [2020-07-08 16:17:22,812 INFO L280 TraceCheckUtils]: 18: Hoare triple {5468#true} havoc #t~nondet3; {5468#true} is VALID [2020-07-08 16:17:22,812 INFO L280 TraceCheckUtils]: 19: Hoare triple {5468#true} havoc ~lk4~0; {5468#true} is VALID [2020-07-08 16:17:22,813 INFO L280 TraceCheckUtils]: 20: Hoare triple {5468#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {5468#true} is VALID [2020-07-08 16:17:22,813 INFO L280 TraceCheckUtils]: 21: Hoare triple {5468#true} ~p5~0 := #t~nondet4; {5468#true} is VALID [2020-07-08 16:17:22,813 INFO L280 TraceCheckUtils]: 22: Hoare triple {5468#true} havoc #t~nondet4; {5468#true} is VALID [2020-07-08 16:17:22,813 INFO L280 TraceCheckUtils]: 23: Hoare triple {5468#true} havoc ~lk5~0; {5468#true} is VALID [2020-07-08 16:17:22,814 INFO L280 TraceCheckUtils]: 24: Hoare triple {5468#true} havoc ~cond~0; {5468#true} is VALID [2020-07-08 16:17:22,814 INFO L280 TraceCheckUtils]: 25: Hoare triple {5468#true} assume !false; {5468#true} is VALID [2020-07-08 16:17:22,814 INFO L280 TraceCheckUtils]: 26: Hoare triple {5468#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {5468#true} is VALID [2020-07-08 16:17:22,814 INFO L280 TraceCheckUtils]: 27: Hoare triple {5468#true} ~cond~0 := #t~nondet5; {5468#true} is VALID [2020-07-08 16:17:22,815 INFO L280 TraceCheckUtils]: 28: Hoare triple {5468#true} havoc #t~nondet5; {5468#true} is VALID [2020-07-08 16:17:22,815 INFO L280 TraceCheckUtils]: 29: Hoare triple {5468#true} assume !(0 == ~cond~0); {5468#true} is VALID [2020-07-08 16:17:22,815 INFO L280 TraceCheckUtils]: 30: Hoare triple {5468#true} ~lk1~0 := 0; {5468#true} is VALID [2020-07-08 16:17:22,815 INFO L280 TraceCheckUtils]: 31: Hoare triple {5468#true} ~lk2~0 := 0; {5468#true} is VALID [2020-07-08 16:17:22,816 INFO L280 TraceCheckUtils]: 32: Hoare triple {5468#true} ~lk3~0 := 0; {5468#true} is VALID [2020-07-08 16:17:22,816 INFO L280 TraceCheckUtils]: 33: Hoare triple {5468#true} ~lk4~0 := 0; {5468#true} is VALID [2020-07-08 16:17:22,816 INFO L280 TraceCheckUtils]: 34: Hoare triple {5468#true} ~lk5~0 := 0; {5468#true} is VALID [2020-07-08 16:17:22,816 INFO L280 TraceCheckUtils]: 35: Hoare triple {5468#true} assume !(0 != ~p1~0); {5468#true} is VALID [2020-07-08 16:17:22,817 INFO L280 TraceCheckUtils]: 36: Hoare triple {5468#true} assume !(0 != ~p2~0); {5468#true} is VALID [2020-07-08 16:17:22,817 INFO L280 TraceCheckUtils]: 37: Hoare triple {5468#true} assume !(0 != ~p3~0); {5468#true} is VALID [2020-07-08 16:17:22,819 INFO L280 TraceCheckUtils]: 38: Hoare triple {5468#true} assume !(0 != ~p4~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:22,820 INFO L280 TraceCheckUtils]: 39: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:22,821 INFO L280 TraceCheckUtils]: 40: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:22,822 INFO L280 TraceCheckUtils]: 41: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:22,822 INFO L280 TraceCheckUtils]: 42: Hoare triple {5472#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {5472#(= 0 main_~p4~0)} is VALID [2020-07-08 16:17:22,823 INFO L280 TraceCheckUtils]: 43: Hoare triple {5472#(= 0 main_~p4~0)} assume 0 != ~p4~0; {5469#false} is VALID [2020-07-08 16:17:22,823 INFO L280 TraceCheckUtils]: 44: Hoare triple {5469#false} assume 1 != ~lk4~0; {5469#false} is VALID [2020-07-08 16:17:22,823 INFO L280 TraceCheckUtils]: 45: Hoare triple {5469#false} assume !false; {5469#false} is VALID [2020-07-08 16:17:22,825 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-08 16:17:22,825 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:22,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348678251] [2020-07-08 16:17:22,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:22,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:22,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690122564] [2020-07-08 16:17:22,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-08 16:17:22,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:22,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:22,872 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-08 16:17:22,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:22,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:22,873 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 3 states. [2020-07-08 16:17:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:23,894 INFO L93 Difference]: Finished difference Result 739 states and 956 transitions. [2020-07-08 16:17:23,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:23,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-08 16:17:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 16:17:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2020-07-08 16:17:23,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2020-07-08 16:17:24,079 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-08 16:17:24,097 INFO L225 Difference]: With dead ends: 739 [2020-07-08 16:17:24,097 INFO L226 Difference]: Without dead ends: 493 [2020-07-08 16:17:24,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-07-08 16:17:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2020-07-08 16:17:24,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:24,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 493 states. Second operand 491 states. [2020-07-08 16:17:24,819 INFO L74 IsIncluded]: Start isIncluded. First operand 493 states. Second operand 491 states. [2020-07-08 16:17:24,819 INFO L87 Difference]: Start difference. First operand 493 states. Second operand 491 states. [2020-07-08 16:17:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:24,837 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-08 16:17:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-08 16:17:24,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:24,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:24,839 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 493 states. [2020-07-08 16:17:24,840 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 493 states. [2020-07-08 16:17:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:24,858 INFO L93 Difference]: Finished difference Result 493 states and 619 transitions. [2020-07-08 16:17:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 619 transitions. [2020-07-08 16:17:24,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:24,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:24,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:24,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-08 16:17:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2020-07-08 16:17:24,878 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 46 [2020-07-08 16:17:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:24,878 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2020-07-08 16:17:24,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:24,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 618 transitions. [2020-07-08 16:17:25,576 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-08 16:17:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2020-07-08 16:17:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-08 16:17:25,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:25,577 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-08 16:17:25,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 16:17:25,577 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:25,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:25,578 INFO L82 PathProgramCache]: Analyzing trace with hash 338056749, now seen corresponding path program 1 times [2020-07-08 16:17:25,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:25,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1557094121] [2020-07-08 16:17:25,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:25,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-08 16:17:25,612 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-08 16:17:25,612 INFO L263 TraceCheckUtils]: 0: Hoare triple {8921#true} call ULTIMATE.init(); {8921#true} is VALID [2020-07-08 16:17:25,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {8921#true} assume true; {8921#true} is VALID [2020-07-08 16:17:25,612 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8921#true} {8921#true} #151#return; {8921#true} is VALID [2020-07-08 16:17:25,613 INFO L263 TraceCheckUtils]: 3: Hoare triple {8921#true} call #t~ret6 := main(); {8921#true} is VALID [2020-07-08 16:17:25,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {8921#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {8921#true} is VALID [2020-07-08 16:17:25,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {8921#true} ~p1~0 := #t~nondet0; {8921#true} is VALID [2020-07-08 16:17:25,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {8921#true} havoc #t~nondet0; {8921#true} is VALID [2020-07-08 16:17:25,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {8921#true} havoc ~lk1~0; {8921#true} is VALID [2020-07-08 16:17:25,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {8921#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8921#true} is VALID [2020-07-08 16:17:25,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {8921#true} ~p2~0 := #t~nondet1; {8921#true} is VALID [2020-07-08 16:17:25,614 INFO L280 TraceCheckUtils]: 10: Hoare triple {8921#true} havoc #t~nondet1; {8921#true} is VALID [2020-07-08 16:17:25,615 INFO L280 TraceCheckUtils]: 11: Hoare triple {8921#true} havoc ~lk2~0; {8921#true} is VALID [2020-07-08 16:17:25,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {8921#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {8921#true} is VALID [2020-07-08 16:17:25,615 INFO L280 TraceCheckUtils]: 13: Hoare triple {8921#true} ~p3~0 := #t~nondet2; {8921#true} is VALID [2020-07-08 16:17:25,615 INFO L280 TraceCheckUtils]: 14: Hoare triple {8921#true} havoc #t~nondet2; {8921#true} is VALID [2020-07-08 16:17:25,615 INFO L280 TraceCheckUtils]: 15: Hoare triple {8921#true} havoc ~lk3~0; {8921#true} is VALID [2020-07-08 16:17:25,616 INFO L280 TraceCheckUtils]: 16: Hoare triple {8921#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8921#true} is VALID [2020-07-08 16:17:25,616 INFO L280 TraceCheckUtils]: 17: Hoare triple {8921#true} ~p4~0 := #t~nondet3; {8921#true} is VALID [2020-07-08 16:17:25,616 INFO L280 TraceCheckUtils]: 18: Hoare triple {8921#true} havoc #t~nondet3; {8921#true} is VALID [2020-07-08 16:17:25,616 INFO L280 TraceCheckUtils]: 19: Hoare triple {8921#true} havoc ~lk4~0; {8921#true} is VALID [2020-07-08 16:17:25,617 INFO L280 TraceCheckUtils]: 20: Hoare triple {8921#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {8921#true} is VALID [2020-07-08 16:17:25,617 INFO L280 TraceCheckUtils]: 21: Hoare triple {8921#true} ~p5~0 := #t~nondet4; {8921#true} is VALID [2020-07-08 16:17:25,617 INFO L280 TraceCheckUtils]: 22: Hoare triple {8921#true} havoc #t~nondet4; {8921#true} is VALID [2020-07-08 16:17:25,617 INFO L280 TraceCheckUtils]: 23: Hoare triple {8921#true} havoc ~lk5~0; {8921#true} is VALID [2020-07-08 16:17:25,618 INFO L280 TraceCheckUtils]: 24: Hoare triple {8921#true} havoc ~cond~0; {8921#true} is VALID [2020-07-08 16:17:25,618 INFO L280 TraceCheckUtils]: 25: Hoare triple {8921#true} assume !false; {8921#true} is VALID [2020-07-08 16:17:25,618 INFO L280 TraceCheckUtils]: 26: Hoare triple {8921#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {8921#true} is VALID [2020-07-08 16:17:25,618 INFO L280 TraceCheckUtils]: 27: Hoare triple {8921#true} ~cond~0 := #t~nondet5; {8921#true} is VALID [2020-07-08 16:17:25,618 INFO L280 TraceCheckUtils]: 28: Hoare triple {8921#true} havoc #t~nondet5; {8921#true} is VALID [2020-07-08 16:17:25,619 INFO L280 TraceCheckUtils]: 29: Hoare triple {8921#true} assume !(0 == ~cond~0); {8921#true} is VALID [2020-07-08 16:17:25,619 INFO L280 TraceCheckUtils]: 30: Hoare triple {8921#true} ~lk1~0 := 0; {8921#true} is VALID [2020-07-08 16:17:25,619 INFO L280 TraceCheckUtils]: 31: Hoare triple {8921#true} ~lk2~0 := 0; {8921#true} is VALID [2020-07-08 16:17:25,619 INFO L280 TraceCheckUtils]: 32: Hoare triple {8921#true} ~lk3~0 := 0; {8921#true} is VALID [2020-07-08 16:17:25,620 INFO L280 TraceCheckUtils]: 33: Hoare triple {8921#true} ~lk4~0 := 0; {8921#true} is VALID [2020-07-08 16:17:25,620 INFO L280 TraceCheckUtils]: 34: Hoare triple {8921#true} ~lk5~0 := 0; {8921#true} is VALID [2020-07-08 16:17:25,620 INFO L280 TraceCheckUtils]: 35: Hoare triple {8921#true} assume !(0 != ~p1~0); {8921#true} is VALID [2020-07-08 16:17:25,620 INFO L280 TraceCheckUtils]: 36: Hoare triple {8921#true} assume !(0 != ~p2~0); {8921#true} is VALID [2020-07-08 16:17:25,621 INFO L280 TraceCheckUtils]: 37: Hoare triple {8921#true} assume 0 != ~p3~0; {8921#true} is VALID [2020-07-08 16:17:25,621 INFO L280 TraceCheckUtils]: 38: Hoare triple {8921#true} ~lk3~0 := 1; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:25,622 INFO L280 TraceCheckUtils]: 39: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:25,622 INFO L280 TraceCheckUtils]: 40: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:25,623 INFO L280 TraceCheckUtils]: 41: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:25,624 INFO L280 TraceCheckUtils]: 42: Hoare triple {8925#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {8925#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:25,624 INFO L280 TraceCheckUtils]: 43: Hoare triple {8925#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {8925#(= 1 main_~lk3~0)} is VALID [2020-07-08 16:17:25,625 INFO L280 TraceCheckUtils]: 44: Hoare triple {8925#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {8922#false} is VALID [2020-07-08 16:17:25,625 INFO L280 TraceCheckUtils]: 45: Hoare triple {8922#false} assume !false; {8922#false} is VALID [2020-07-08 16:17:25,626 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-08 16:17:25,626 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:25,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1557094121] [2020-07-08 16:17:25,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:25,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:25,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653863605] [2020-07-08 16:17:25,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-08 16:17:25,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:25,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:25,667 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-08 16:17:25,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:25,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:25,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:25,669 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand 3 states. [2020-07-08 16:17:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:26,783 INFO L93 Difference]: Finished difference Result 599 states and 748 transitions. [2020-07-08 16:17:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:26,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-07-08 16:17:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-08 16:17:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2020-07-08 16:17:26,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2020-07-08 16:17:26,881 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-08 16:17:26,903 INFO L225 Difference]: With dead ends: 599 [2020-07-08 16:17:26,904 INFO L226 Difference]: Without dead ends: 597 [2020-07-08 16:17:26,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-07-08 16:17:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 491. [2020-07-08 16:17:27,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:27,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 597 states. Second operand 491 states. [2020-07-08 16:17:27,737 INFO L74 IsIncluded]: Start isIncluded. First operand 597 states. Second operand 491 states. [2020-07-08 16:17:27,738 INFO L87 Difference]: Start difference. First operand 597 states. Second operand 491 states. [2020-07-08 16:17:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:27,760 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-08 16:17:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-08 16:17:27,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:27,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:27,763 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 597 states. [2020-07-08 16:17:27,763 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 597 states. [2020-07-08 16:17:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:27,786 INFO L93 Difference]: Finished difference Result 597 states and 739 transitions. [2020-07-08 16:17:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 739 transitions. [2020-07-08 16:17:27,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:27,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:27,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:27,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-08 16:17:27,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2020-07-08 16:17:27,805 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 46 [2020-07-08 16:17:27,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:27,805 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2020-07-08 16:17:27,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:27,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 610 transitions. [2020-07-08 16:17:28,402 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-08 16:17:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2020-07-08 16:17:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-08 16:17:28,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:28,404 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-08 16:17:28,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 16:17:28,404 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash -144915038, now seen corresponding path program 1 times [2020-07-08 16:17:28,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:28,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [494581489] [2020-07-08 16:17:28,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:28,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-08 16:17:28,479 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-08 16:17:28,480 INFO L263 TraceCheckUtils]: 0: Hoare triple {12302#true} call ULTIMATE.init(); {12302#true} is VALID [2020-07-08 16:17:28,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {12302#true} assume true; {12302#true} is VALID [2020-07-08 16:17:28,480 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {12302#true} {12302#true} #151#return; {12302#true} is VALID [2020-07-08 16:17:28,480 INFO L263 TraceCheckUtils]: 3: Hoare triple {12302#true} call #t~ret6 := main(); {12302#true} is VALID [2020-07-08 16:17:28,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {12302#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {12302#true} is VALID [2020-07-08 16:17:28,481 INFO L280 TraceCheckUtils]: 5: Hoare triple {12302#true} ~p1~0 := #t~nondet0; {12302#true} is VALID [2020-07-08 16:17:28,481 INFO L280 TraceCheckUtils]: 6: Hoare triple {12302#true} havoc #t~nondet0; {12302#true} is VALID [2020-07-08 16:17:28,481 INFO L280 TraceCheckUtils]: 7: Hoare triple {12302#true} havoc ~lk1~0; {12302#true} is VALID [2020-07-08 16:17:28,482 INFO L280 TraceCheckUtils]: 8: Hoare triple {12302#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12302#true} is VALID [2020-07-08 16:17:28,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {12302#true} ~p2~0 := #t~nondet1; {12302#true} is VALID [2020-07-08 16:17:28,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {12302#true} havoc #t~nondet1; {12302#true} is VALID [2020-07-08 16:17:28,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {12302#true} havoc ~lk2~0; {12302#true} is VALID [2020-07-08 16:17:28,483 INFO L280 TraceCheckUtils]: 12: Hoare triple {12302#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {12302#true} is VALID [2020-07-08 16:17:28,483 INFO L280 TraceCheckUtils]: 13: Hoare triple {12302#true} ~p3~0 := #t~nondet2; {12302#true} is VALID [2020-07-08 16:17:28,483 INFO L280 TraceCheckUtils]: 14: Hoare triple {12302#true} havoc #t~nondet2; {12302#true} is VALID [2020-07-08 16:17:28,484 INFO L280 TraceCheckUtils]: 15: Hoare triple {12302#true} havoc ~lk3~0; {12302#true} is VALID [2020-07-08 16:17:28,484 INFO L280 TraceCheckUtils]: 16: Hoare triple {12302#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {12302#true} is VALID [2020-07-08 16:17:28,484 INFO L280 TraceCheckUtils]: 17: Hoare triple {12302#true} ~p4~0 := #t~nondet3; {12302#true} is VALID [2020-07-08 16:17:28,484 INFO L280 TraceCheckUtils]: 18: Hoare triple {12302#true} havoc #t~nondet3; {12302#true} is VALID [2020-07-08 16:17:28,485 INFO L280 TraceCheckUtils]: 19: Hoare triple {12302#true} havoc ~lk4~0; {12302#true} is VALID [2020-07-08 16:17:28,485 INFO L280 TraceCheckUtils]: 20: Hoare triple {12302#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {12302#true} is VALID [2020-07-08 16:17:28,485 INFO L280 TraceCheckUtils]: 21: Hoare triple {12302#true} ~p5~0 := #t~nondet4; {12302#true} is VALID [2020-07-08 16:17:28,486 INFO L280 TraceCheckUtils]: 22: Hoare triple {12302#true} havoc #t~nondet4; {12302#true} is VALID [2020-07-08 16:17:28,486 INFO L280 TraceCheckUtils]: 23: Hoare triple {12302#true} havoc ~lk5~0; {12302#true} is VALID [2020-07-08 16:17:28,487 INFO L280 TraceCheckUtils]: 24: Hoare triple {12302#true} havoc ~cond~0; {12302#true} is VALID [2020-07-08 16:17:28,487 INFO L280 TraceCheckUtils]: 25: Hoare triple {12302#true} assume !false; {12302#true} is VALID [2020-07-08 16:17:28,488 INFO L280 TraceCheckUtils]: 26: Hoare triple {12302#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {12302#true} is VALID [2020-07-08 16:17:28,488 INFO L280 TraceCheckUtils]: 27: Hoare triple {12302#true} ~cond~0 := #t~nondet5; {12302#true} is VALID [2020-07-08 16:17:28,488 INFO L280 TraceCheckUtils]: 28: Hoare triple {12302#true} havoc #t~nondet5; {12302#true} is VALID [2020-07-08 16:17:28,488 INFO L280 TraceCheckUtils]: 29: Hoare triple {12302#true} assume !(0 == ~cond~0); {12302#true} is VALID [2020-07-08 16:17:28,489 INFO L280 TraceCheckUtils]: 30: Hoare triple {12302#true} ~lk1~0 := 0; {12302#true} is VALID [2020-07-08 16:17:28,489 INFO L280 TraceCheckUtils]: 31: Hoare triple {12302#true} ~lk2~0 := 0; {12302#true} is VALID [2020-07-08 16:17:28,489 INFO L280 TraceCheckUtils]: 32: Hoare triple {12302#true} ~lk3~0 := 0; {12302#true} is VALID [2020-07-08 16:17:28,490 INFO L280 TraceCheckUtils]: 33: Hoare triple {12302#true} ~lk4~0 := 0; {12302#true} is VALID [2020-07-08 16:17:28,490 INFO L280 TraceCheckUtils]: 34: Hoare triple {12302#true} ~lk5~0 := 0; {12302#true} is VALID [2020-07-08 16:17:28,490 INFO L280 TraceCheckUtils]: 35: Hoare triple {12302#true} assume !(0 != ~p1~0); {12302#true} is VALID [2020-07-08 16:17:28,491 INFO L280 TraceCheckUtils]: 36: Hoare triple {12302#true} assume !(0 != ~p2~0); {12302#true} is VALID [2020-07-08 16:17:28,491 INFO L280 TraceCheckUtils]: 37: Hoare triple {12302#true} assume !(0 != ~p3~0); {12302#true} is VALID [2020-07-08 16:17:28,491 INFO L280 TraceCheckUtils]: 38: Hoare triple {12302#true} assume 0 != ~p4~0; {12302#true} is VALID [2020-07-08 16:17:28,493 INFO L280 TraceCheckUtils]: 39: Hoare triple {12302#true} ~lk4~0 := 1; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:28,493 INFO L280 TraceCheckUtils]: 40: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:28,494 INFO L280 TraceCheckUtils]: 41: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:28,495 INFO L280 TraceCheckUtils]: 42: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:28,495 INFO L280 TraceCheckUtils]: 43: Hoare triple {12306#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {12306#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:28,496 INFO L280 TraceCheckUtils]: 44: Hoare triple {12306#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {12306#(= 1 main_~lk4~0)} is VALID [2020-07-08 16:17:28,497 INFO L280 TraceCheckUtils]: 45: Hoare triple {12306#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {12303#false} is VALID [2020-07-08 16:17:28,497 INFO L280 TraceCheckUtils]: 46: Hoare triple {12303#false} assume !false; {12303#false} is VALID [2020-07-08 16:17:28,499 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-08 16:17:28,500 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:28,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [494581489] [2020-07-08 16:17:28,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:28,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:28,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045326482] [2020-07-08 16:17:28,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-08 16:17:28,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:28,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:28,540 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-08 16:17:28,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:28,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:28,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:28,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:28,542 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 3 states. [2020-07-08 16:17:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:29,616 INFO L93 Difference]: Finished difference Result 591 states and 724 transitions. [2020-07-08 16:17:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:29,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-08 16:17:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-08 16:17:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-08 16:17:29,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-08 16:17:29,711 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-08 16:17:29,737 INFO L225 Difference]: With dead ends: 591 [2020-07-08 16:17:29,737 INFO L226 Difference]: Without dead ends: 589 [2020-07-08 16:17:29,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:29,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-07-08 16:17:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 491. [2020-07-08 16:17:30,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:30,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand 491 states. [2020-07-08 16:17:30,650 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand 491 states. [2020-07-08 16:17:30,650 INFO L87 Difference]: Start difference. First operand 589 states. Second operand 491 states. [2020-07-08 16:17:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:30,675 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-08 16:17:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-08 16:17:30,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:30,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:30,677 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 589 states. [2020-07-08 16:17:30,677 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 589 states. [2020-07-08 16:17:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:30,698 INFO L93 Difference]: Finished difference Result 589 states and 715 transitions. [2020-07-08 16:17:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 715 transitions. [2020-07-08 16:17:30,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:30,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:30,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:30,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:30,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-08 16:17:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 602 transitions. [2020-07-08 16:17:30,717 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 602 transitions. Word has length 47 [2020-07-08 16:17:30,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:30,718 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 602 transitions. [2020-07-08 16:17:30,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:30,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 602 transitions. [2020-07-08 16:17:31,370 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-08 16:17:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 602 transitions. [2020-07-08 16:17:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-08 16:17:31,371 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:31,372 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-08 16:17:31,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 16:17:31,374 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash -351776260, now seen corresponding path program 1 times [2020-07-08 16:17:31,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:31,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [943809242] [2020-07-08 16:17:31,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:31,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-08 16:17:31,415 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-08 16:17:31,416 INFO L263 TraceCheckUtils]: 0: Hoare triple {15651#true} call ULTIMATE.init(); {15651#true} is VALID [2020-07-08 16:17:31,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {15651#true} assume true; {15651#true} is VALID [2020-07-08 16:17:31,416 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {15651#true} {15651#true} #151#return; {15651#true} is VALID [2020-07-08 16:17:31,416 INFO L263 TraceCheckUtils]: 3: Hoare triple {15651#true} call #t~ret6 := main(); {15651#true} is VALID [2020-07-08 16:17:31,417 INFO L280 TraceCheckUtils]: 4: Hoare triple {15651#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {15651#true} is VALID [2020-07-08 16:17:31,417 INFO L280 TraceCheckUtils]: 5: Hoare triple {15651#true} ~p1~0 := #t~nondet0; {15651#true} is VALID [2020-07-08 16:17:31,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {15651#true} havoc #t~nondet0; {15651#true} is VALID [2020-07-08 16:17:31,417 INFO L280 TraceCheckUtils]: 7: Hoare triple {15651#true} havoc ~lk1~0; {15651#true} is VALID [2020-07-08 16:17:31,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {15651#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {15651#true} is VALID [2020-07-08 16:17:31,418 INFO L280 TraceCheckUtils]: 9: Hoare triple {15651#true} ~p2~0 := #t~nondet1; {15651#true} is VALID [2020-07-08 16:17:31,418 INFO L280 TraceCheckUtils]: 10: Hoare triple {15651#true} havoc #t~nondet1; {15651#true} is VALID [2020-07-08 16:17:31,418 INFO L280 TraceCheckUtils]: 11: Hoare triple {15651#true} havoc ~lk2~0; {15651#true} is VALID [2020-07-08 16:17:31,419 INFO L280 TraceCheckUtils]: 12: Hoare triple {15651#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {15651#true} is VALID [2020-07-08 16:17:31,419 INFO L280 TraceCheckUtils]: 13: Hoare triple {15651#true} ~p3~0 := #t~nondet2; {15651#true} is VALID [2020-07-08 16:17:31,419 INFO L280 TraceCheckUtils]: 14: Hoare triple {15651#true} havoc #t~nondet2; {15651#true} is VALID [2020-07-08 16:17:31,419 INFO L280 TraceCheckUtils]: 15: Hoare triple {15651#true} havoc ~lk3~0; {15651#true} is VALID [2020-07-08 16:17:31,419 INFO L280 TraceCheckUtils]: 16: Hoare triple {15651#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {15651#true} is VALID [2020-07-08 16:17:31,420 INFO L280 TraceCheckUtils]: 17: Hoare triple {15651#true} ~p4~0 := #t~nondet3; {15651#true} is VALID [2020-07-08 16:17:31,420 INFO L280 TraceCheckUtils]: 18: Hoare triple {15651#true} havoc #t~nondet3; {15651#true} is VALID [2020-07-08 16:17:31,420 INFO L280 TraceCheckUtils]: 19: Hoare triple {15651#true} havoc ~lk4~0; {15651#true} is VALID [2020-07-08 16:17:31,420 INFO L280 TraceCheckUtils]: 20: Hoare triple {15651#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {15651#true} is VALID [2020-07-08 16:17:31,420 INFO L280 TraceCheckUtils]: 21: Hoare triple {15651#true} ~p5~0 := #t~nondet4; {15651#true} is VALID [2020-07-08 16:17:31,420 INFO L280 TraceCheckUtils]: 22: Hoare triple {15651#true} havoc #t~nondet4; {15651#true} is VALID [2020-07-08 16:17:31,421 INFO L280 TraceCheckUtils]: 23: Hoare triple {15651#true} havoc ~lk5~0; {15651#true} is VALID [2020-07-08 16:17:31,421 INFO L280 TraceCheckUtils]: 24: Hoare triple {15651#true} havoc ~cond~0; {15651#true} is VALID [2020-07-08 16:17:31,421 INFO L280 TraceCheckUtils]: 25: Hoare triple {15651#true} assume !false; {15651#true} is VALID [2020-07-08 16:17:31,421 INFO L280 TraceCheckUtils]: 26: Hoare triple {15651#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {15651#true} is VALID [2020-07-08 16:17:31,422 INFO L280 TraceCheckUtils]: 27: Hoare triple {15651#true} ~cond~0 := #t~nondet5; {15651#true} is VALID [2020-07-08 16:17:31,422 INFO L280 TraceCheckUtils]: 28: Hoare triple {15651#true} havoc #t~nondet5; {15651#true} is VALID [2020-07-08 16:17:31,422 INFO L280 TraceCheckUtils]: 29: Hoare triple {15651#true} assume !(0 == ~cond~0); {15651#true} is VALID [2020-07-08 16:17:31,422 INFO L280 TraceCheckUtils]: 30: Hoare triple {15651#true} ~lk1~0 := 0; {15651#true} is VALID [2020-07-08 16:17:31,422 INFO L280 TraceCheckUtils]: 31: Hoare triple {15651#true} ~lk2~0 := 0; {15651#true} is VALID [2020-07-08 16:17:31,423 INFO L280 TraceCheckUtils]: 32: Hoare triple {15651#true} ~lk3~0 := 0; {15651#true} is VALID [2020-07-08 16:17:31,423 INFO L280 TraceCheckUtils]: 33: Hoare triple {15651#true} ~lk4~0 := 0; {15651#true} is VALID [2020-07-08 16:17:31,423 INFO L280 TraceCheckUtils]: 34: Hoare triple {15651#true} ~lk5~0 := 0; {15651#true} is VALID [2020-07-08 16:17:31,423 INFO L280 TraceCheckUtils]: 35: Hoare triple {15651#true} assume !(0 != ~p1~0); {15651#true} is VALID [2020-07-08 16:17:31,424 INFO L280 TraceCheckUtils]: 36: Hoare triple {15651#true} assume !(0 != ~p2~0); {15651#true} is VALID [2020-07-08 16:17:31,424 INFO L280 TraceCheckUtils]: 37: Hoare triple {15651#true} assume !(0 != ~p3~0); {15651#true} is VALID [2020-07-08 16:17:31,424 INFO L280 TraceCheckUtils]: 38: Hoare triple {15651#true} assume !(0 != ~p4~0); {15651#true} is VALID [2020-07-08 16:17:31,426 INFO L280 TraceCheckUtils]: 39: Hoare triple {15651#true} assume !(0 != ~p5~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:31,428 INFO L280 TraceCheckUtils]: 40: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:31,430 INFO L280 TraceCheckUtils]: 41: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:31,431 INFO L280 TraceCheckUtils]: 42: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:31,434 INFO L280 TraceCheckUtils]: 43: Hoare triple {15655#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {15655#(= 0 main_~p5~0)} is VALID [2020-07-08 16:17:31,434 INFO L280 TraceCheckUtils]: 44: Hoare triple {15655#(= 0 main_~p5~0)} assume 0 != ~p5~0; {15652#false} is VALID [2020-07-08 16:17:31,435 INFO L280 TraceCheckUtils]: 45: Hoare triple {15652#false} assume 1 != ~lk5~0; {15652#false} is VALID [2020-07-08 16:17:31,435 INFO L280 TraceCheckUtils]: 46: Hoare triple {15652#false} assume !false; {15652#false} is VALID [2020-07-08 16:17:31,436 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-08 16:17:31,436 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:31,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [943809242] [2020-07-08 16:17:31,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:31,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:31,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480349107] [2020-07-08 16:17:31,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-08 16:17:31,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:31,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:31,479 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-08 16:17:31,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:31,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:31,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:31,480 INFO L87 Difference]: Start difference. First operand 491 states and 602 transitions. Second operand 3 states. [2020-07-08 16:17:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:33,646 INFO L93 Difference]: Finished difference Result 1373 states and 1691 transitions. [2020-07-08 16:17:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:33,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-07-08 16:17:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:33,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-08 16:17:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2020-07-08 16:17:33,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2020-07-08 16:17:33,792 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-08 16:17:33,807 INFO L225 Difference]: With dead ends: 1373 [2020-07-08 16:17:33,808 INFO L226 Difference]: Without dead ends: 491 [2020-07-08 16:17:33,810 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-07-08 16:17:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2020-07-08 16:17:34,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:34,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand 491 states. [2020-07-08 16:17:34,697 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-08 16:17:34,697 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-08 16:17:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:34,709 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-08 16:17:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-08 16:17:34,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:34,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:34,710 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 491 states. [2020-07-08 16:17:34,710 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 491 states. [2020-07-08 16:17:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:34,725 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-08 16:17:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-08 16:17:34,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:34,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:34,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:34,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:34,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-08 16:17:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 570 transitions. [2020-07-08 16:17:34,737 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 570 transitions. Word has length 47 [2020-07-08 16:17:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:34,737 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 570 transitions. [2020-07-08 16:17:34,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:34,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 491 states and 570 transitions. [2020-07-08 16:17:35,448 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-08 16:17:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-07-08 16:17:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 16:17:35,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 16:17:35,450 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-08 16:17:35,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 16:17:35,451 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 16:17:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 16:17:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2062829121, now seen corresponding path program 1 times [2020-07-08 16:17:35,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 16:17:35,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286062633] [2020-07-08 16:17:35,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 16:17:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 16:17:35,502 INFO L280 TraceCheckUtils]: 0: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-08 16:17:35,503 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-08 16:17:35,503 INFO L263 TraceCheckUtils]: 0: Hoare triple {20368#true} call ULTIMATE.init(); {20368#true} is VALID [2020-07-08 16:17:35,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {20368#true} assume true; {20368#true} is VALID [2020-07-08 16:17:35,504 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {20368#true} {20368#true} #151#return; {20368#true} is VALID [2020-07-08 16:17:35,504 INFO L263 TraceCheckUtils]: 3: Hoare triple {20368#true} call #t~ret6 := main(); {20368#true} is VALID [2020-07-08 16:17:35,504 INFO L280 TraceCheckUtils]: 4: Hoare triple {20368#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {20368#true} is VALID [2020-07-08 16:17:35,504 INFO L280 TraceCheckUtils]: 5: Hoare triple {20368#true} ~p1~0 := #t~nondet0; {20368#true} is VALID [2020-07-08 16:17:35,505 INFO L280 TraceCheckUtils]: 6: Hoare triple {20368#true} havoc #t~nondet0; {20368#true} is VALID [2020-07-08 16:17:35,505 INFO L280 TraceCheckUtils]: 7: Hoare triple {20368#true} havoc ~lk1~0; {20368#true} is VALID [2020-07-08 16:17:35,505 INFO L280 TraceCheckUtils]: 8: Hoare triple {20368#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20368#true} is VALID [2020-07-08 16:17:35,505 INFO L280 TraceCheckUtils]: 9: Hoare triple {20368#true} ~p2~0 := #t~nondet1; {20368#true} is VALID [2020-07-08 16:17:35,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {20368#true} havoc #t~nondet1; {20368#true} is VALID [2020-07-08 16:17:35,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {20368#true} havoc ~lk2~0; {20368#true} is VALID [2020-07-08 16:17:35,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {20368#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {20368#true} is VALID [2020-07-08 16:17:35,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {20368#true} ~p3~0 := #t~nondet2; {20368#true} is VALID [2020-07-08 16:17:35,509 INFO L280 TraceCheckUtils]: 14: Hoare triple {20368#true} havoc #t~nondet2; {20368#true} is VALID [2020-07-08 16:17:35,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {20368#true} havoc ~lk3~0; {20368#true} is VALID [2020-07-08 16:17:35,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {20368#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {20368#true} is VALID [2020-07-08 16:17:35,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {20368#true} ~p4~0 := #t~nondet3; {20368#true} is VALID [2020-07-08 16:17:35,510 INFO L280 TraceCheckUtils]: 18: Hoare triple {20368#true} havoc #t~nondet3; {20368#true} is VALID [2020-07-08 16:17:35,510 INFO L280 TraceCheckUtils]: 19: Hoare triple {20368#true} havoc ~lk4~0; {20368#true} is VALID [2020-07-08 16:17:35,510 INFO L280 TraceCheckUtils]: 20: Hoare triple {20368#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {20368#true} is VALID [2020-07-08 16:17:35,511 INFO L280 TraceCheckUtils]: 21: Hoare triple {20368#true} ~p5~0 := #t~nondet4; {20368#true} is VALID [2020-07-08 16:17:35,511 INFO L280 TraceCheckUtils]: 22: Hoare triple {20368#true} havoc #t~nondet4; {20368#true} is VALID [2020-07-08 16:17:35,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {20368#true} havoc ~lk5~0; {20368#true} is VALID [2020-07-08 16:17:35,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {20368#true} havoc ~cond~0; {20368#true} is VALID [2020-07-08 16:17:35,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {20368#true} assume !false; {20368#true} is VALID [2020-07-08 16:17:35,514 INFO L280 TraceCheckUtils]: 26: Hoare triple {20368#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {20368#true} is VALID [2020-07-08 16:17:35,514 INFO L280 TraceCheckUtils]: 27: Hoare triple {20368#true} ~cond~0 := #t~nondet5; {20368#true} is VALID [2020-07-08 16:17:35,514 INFO L280 TraceCheckUtils]: 28: Hoare triple {20368#true} havoc #t~nondet5; {20368#true} is VALID [2020-07-08 16:17:35,514 INFO L280 TraceCheckUtils]: 29: Hoare triple {20368#true} assume !(0 == ~cond~0); {20368#true} is VALID [2020-07-08 16:17:35,515 INFO L280 TraceCheckUtils]: 30: Hoare triple {20368#true} ~lk1~0 := 0; {20368#true} is VALID [2020-07-08 16:17:35,515 INFO L280 TraceCheckUtils]: 31: Hoare triple {20368#true} ~lk2~0 := 0; {20368#true} is VALID [2020-07-08 16:17:35,515 INFO L280 TraceCheckUtils]: 32: Hoare triple {20368#true} ~lk3~0 := 0; {20368#true} is VALID [2020-07-08 16:17:35,515 INFO L280 TraceCheckUtils]: 33: Hoare triple {20368#true} ~lk4~0 := 0; {20368#true} is VALID [2020-07-08 16:17:35,516 INFO L280 TraceCheckUtils]: 34: Hoare triple {20368#true} ~lk5~0 := 0; {20368#true} is VALID [2020-07-08 16:17:35,516 INFO L280 TraceCheckUtils]: 35: Hoare triple {20368#true} assume !(0 != ~p1~0); {20368#true} is VALID [2020-07-08 16:17:35,516 INFO L280 TraceCheckUtils]: 36: Hoare triple {20368#true} assume !(0 != ~p2~0); {20368#true} is VALID [2020-07-08 16:17:35,517 INFO L280 TraceCheckUtils]: 37: Hoare triple {20368#true} assume !(0 != ~p3~0); {20368#true} is VALID [2020-07-08 16:17:35,517 INFO L280 TraceCheckUtils]: 38: Hoare triple {20368#true} assume !(0 != ~p4~0); {20368#true} is VALID [2020-07-08 16:17:35,518 INFO L280 TraceCheckUtils]: 39: Hoare triple {20368#true} assume 0 != ~p5~0; {20368#true} is VALID [2020-07-08 16:17:35,518 INFO L280 TraceCheckUtils]: 40: Hoare triple {20368#true} ~lk5~0 := 1; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:35,519 INFO L280 TraceCheckUtils]: 41: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:35,520 INFO L280 TraceCheckUtils]: 42: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:35,521 INFO L280 TraceCheckUtils]: 43: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:35,521 INFO L280 TraceCheckUtils]: 44: Hoare triple {20372#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {20372#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:35,522 INFO L280 TraceCheckUtils]: 45: Hoare triple {20372#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {20372#(= 1 main_~lk5~0)} is VALID [2020-07-08 16:17:35,522 INFO L280 TraceCheckUtils]: 46: Hoare triple {20372#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {20369#false} is VALID [2020-07-08 16:17:35,523 INFO L280 TraceCheckUtils]: 47: Hoare triple {20369#false} assume !false; {20369#false} is VALID [2020-07-08 16:17:35,525 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-08 16:17:35,526 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 16:17:35,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286062633] [2020-07-08 16:17:35,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 16:17:35,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 16:17:35,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708466262] [2020-07-08 16:17:35,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-08 16:17:35,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 16:17:35,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 16:17:35,607 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-08 16:17:35,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 16:17:35,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 16:17:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 16:17:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:35,609 INFO L87 Difference]: Start difference. First operand 491 states and 570 transitions. Second operand 3 states. [2020-07-08 16:17:36,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:36,658 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-07-08 16:17:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 16:17:36,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-07-08 16:17:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 16:17:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-08 16:17:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 16:17:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2020-07-08 16:17:36,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2020-07-08 16:17:36,724 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-08 16:17:36,725 INFO L225 Difference]: With dead ends: 491 [2020-07-08 16:17:36,725 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 16:17:36,727 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 16:17:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 16:17:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 16:17:36,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 16:17:36,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 16:17:36,728 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:17:36,728 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:17:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:36,728 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:17:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:17:36,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:36,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:36,728 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 16:17:36,728 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 16:17:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 16:17:36,729 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 16:17:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:17:36,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:36,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 16:17:36,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 16:17:36,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 16:17:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 16:17:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 16:17:36,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-08 16:17:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 16:17:36,730 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 16:17:36,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 16:17:36,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 16:17:36,730 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-08 16:17:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 16:17:36,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 16:17:36,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 16:17:36,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 16:17:37,370 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-08 16:17:37,504 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 16:17:37,894 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 16:17:38,162 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-08 16:17:38,328 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-08 16:17:38,711 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-08 16:17:38,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 16:17:38,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 16:17:38,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 16:17:38,826 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 16:17:38,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 16:17:38,826 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 16:17:38,827 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 93) the Hoare annotation is: true [2020-07-08 16:17:38,827 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-08 16:17:38,827 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-08 16:17:38,827 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-08 16:17:38,828 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-08 16:17:38,828 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-08 16:17:38,828 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-08 16:17:38,828 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-08 16:17:38,828 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-08 16:17:38,829 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-08 16:17:38,829 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-08 16:17:38,829 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-08 16:17:38,829 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-08 16:17:38,829 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-08 16:17:38,830 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-08 16:17:38,830 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-08 16:17:38,830 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-08 16:17:38,830 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 93) the Hoare annotation is: true [2020-07-08 16:17:38,830 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) the Hoare annotation is: false [2020-07-08 16:17:38,830 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-08 16:17:38,831 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-07-08 16:17:38,831 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-08 16:17:38,831 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-08 16:17:38,831 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-08 16:17:38,831 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-08 16:17:38,831 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-08 16:17:38,832 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-08 16:17:38,832 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-07-08 16:17:38,832 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-08 16:17:38,832 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-08 16:17:38,832 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-08 16:17:38,832 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-08 16:17:38,832 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-08 16:17:38,832 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-08 16:17:38,833 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-08 16:17:38,833 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 16:17:38,833 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-08 16:17:38,833 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-08 16:17:38,833 INFO L271 CegarLoopResult]: At program point L41(lines 41 43) the Hoare annotation is: true [2020-07-08 16:17:38,833 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-08 16:17:38,833 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-08 16:17:38,834 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-08 16:17:38,834 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-08 16:17:38,834 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-07-08 16:17:38,834 INFO L271 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-07-08 16:17:38,834 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-08 16:17:38,834 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-07-08 16:17:38,834 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-08 16:17:38,834 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: false [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (= 1 main_~lk5~0) [2020-07-08 16:17:38,835 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-08 16:17:38,835 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-08 16:17:38,836 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-08 16:17:38,876 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-08 16:17:38,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 04:17:38 BoogieIcfgContainer [2020-07-08 16:17:38,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 16:17:38,888 INFO L168 Benchmark]: Toolchain (without parser) took 23103.75 ms. Allocated memory was 136.3 MB in the beginning and 454.0 MB in the end (delta: 317.7 MB). Free memory was 101.6 MB in the beginning and 235.2 MB in the end (delta: -133.7 MB). Peak memory consumption was 184.0 MB. Max. memory is 7.1 GB. [2020-07-08 16:17:38,889 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 16:17:38,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.20 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 91.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 16:17:38,890 INFO L168 Benchmark]: Boogie Preprocessor took 114.95 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 178.4 MB in the end (delta: -87.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2020-07-08 16:17:38,891 INFO L168 Benchmark]: RCFGBuilder took 587.02 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 151.4 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2020-07-08 16:17:38,892 INFO L168 Benchmark]: TraceAbstraction took 22142.05 ms. Allocated memory was 199.8 MB in the beginning and 454.0 MB in the end (delta: 254.3 MB). Free memory was 151.4 MB in the beginning and 235.2 MB in the end (delta: -83.9 MB). Peak memory consumption was 170.4 MB. Max. memory is 7.1 GB. [2020-07-08 16:17:38,896 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.18 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.20 ms. Allocated memory is still 136.3 MB. Free memory was 101.1 MB in the beginning and 91.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.95 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 91.2 MB in the beginning and 178.4 MB in the end (delta: -87.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 587.02 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 151.4 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22142.05 ms. Allocated memory was 199.8 MB in the beginning and 454.0 MB in the end (delta: 254.3 MB). Free memory was 151.4 MB in the beginning and 235.2 MB in the end (delta: -83.9 MB). Peak memory consumption was 170.4 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: 19.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, 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, 50 GetRequests, 40 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: 4.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 956 NumberOfFragments, 2378 HoareAnnotationTreeSize, 68 FomulaSimplifications, 9164 FormulaSimplificationTreeSizeReduction, 0.4s 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...