/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:16:54,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:16:54,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:16:54,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:16:54,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:16:54,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:16:54,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:16:54,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:16:54,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:16:54,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:16:54,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:16:54,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:16:54,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:16:54,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:16:54,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:16:54,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:16:54,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:16:54,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:16:54,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:16:54,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:16:55,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:16:55,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:16:55,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:16:55,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:16:55,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:16:55,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:16:55,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:16:55,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:16:55,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:16:55,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:16:55,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:16:55,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:16:55,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:16:55,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:16:55,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:16:55,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:16:55,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:16:55,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:16:55,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:16:55,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:16:55,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:16:55,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:16:55,051 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:16:55,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:16:55,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:16:55,054 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:16:55,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:16:55,055 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:16:55,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:16:55,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:16:55,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:16:55,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:16:55,057 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:16:55,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:16:55,058 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:16:55,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:16:55,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:16:55,059 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:16:55,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:16:55,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:16:55,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:16:55,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:16:55,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:16:55,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:16:55,060 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:16:55,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:16:55,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:16:55,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:16:55,420 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:16:55,421 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:16:55,422 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-07-18 00:16:55,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f893183/efb8038e39964caf801c18e656f764af/FLAGb6e45c326 [2020-07-18 00:16:56,040 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:16:56,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-07-18 00:16:56,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f893183/efb8038e39964caf801c18e656f764af/FLAGb6e45c326 [2020-07-18 00:16:56,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83f893183/efb8038e39964caf801c18e656f764af [2020-07-18 00:16:56,391 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:16:56,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:16:56,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:16:56,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:16:56,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:16:56,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69fe8523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56, skipping insertion in model container [2020-07-18 00:16:56,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:16:56,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:16:56,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:16:56,640 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:16:56,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:16:56,683 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:16:56,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56 WrapperNode [2020-07-18 00:16:56,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:16:56,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:16:56,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:16:56,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:16:56,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... [2020-07-18 00:16:56,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:16:56,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:16:56,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:16:56,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:16:56,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:16:56,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:16:56,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:16:56,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:16:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:16:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:16:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:16:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:16:56,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:16:57,460 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:16:57,460 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:16:57,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:16:57 BoogieIcfgContainer [2020-07-18 00:16:57,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:16:57,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:16:57,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:16:57,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:16:57,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:16:56" (1/3) ... [2020-07-18 00:16:57,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290250ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:16:57, skipping insertion in model container [2020-07-18 00:16:57,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:16:56" (2/3) ... [2020-07-18 00:16:57,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290250ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:16:57, skipping insertion in model container [2020-07-18 00:16:57,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:16:57" (3/3) ... [2020-07-18 00:16:57,475 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-07-18 00:16:57,483 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:16:57,491 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:16:57,506 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:16:57,529 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:16:57,530 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:16:57,530 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:16:57,530 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:16:57,531 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:16:57,531 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:16:57,531 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:16:57,531 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:16:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-18 00:16:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 00:16:57,566 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:57,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:57,568 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:57,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-07-18 00:16:57,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:57,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917774735] [2020-07-18 00:16:57,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:57,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-18 00:16:57,829 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-18 00:16:57,832 INFO L263 TraceCheckUtils]: 0: Hoare triple {91#true} call ULTIMATE.init(); {91#true} is VALID [2020-07-18 00:16:57,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#true} assume true; {91#true} is VALID [2020-07-18 00:16:57,833 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {91#true} {91#true} #199#return; {91#true} is VALID [2020-07-18 00:16:57,834 INFO L263 TraceCheckUtils]: 3: Hoare triple {91#true} call #t~ret8 := main(); {91#true} is VALID [2020-07-18 00:16:57,835 INFO L280 TraceCheckUtils]: 4: Hoare triple {91#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,835 INFO L280 TraceCheckUtils]: 5: Hoare triple {91#true} ~p1~0 := #t~nondet0; {91#true} is VALID [2020-07-18 00:16:57,836 INFO L280 TraceCheckUtils]: 6: Hoare triple {91#true} havoc #t~nondet0; {91#true} is VALID [2020-07-18 00:16:57,836 INFO L280 TraceCheckUtils]: 7: Hoare triple {91#true} havoc ~lk1~0; {91#true} is VALID [2020-07-18 00:16:57,836 INFO L280 TraceCheckUtils]: 8: Hoare triple {91#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,837 INFO L280 TraceCheckUtils]: 9: Hoare triple {91#true} ~p2~0 := #t~nondet1; {91#true} is VALID [2020-07-18 00:16:57,837 INFO L280 TraceCheckUtils]: 10: Hoare triple {91#true} havoc #t~nondet1; {91#true} is VALID [2020-07-18 00:16:57,838 INFO L280 TraceCheckUtils]: 11: Hoare triple {91#true} havoc ~lk2~0; {91#true} is VALID [2020-07-18 00:16:57,838 INFO L280 TraceCheckUtils]: 12: Hoare triple {91#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,839 INFO L280 TraceCheckUtils]: 13: Hoare triple {91#true} ~p3~0 := #t~nondet2; {91#true} is VALID [2020-07-18 00:16:57,839 INFO L280 TraceCheckUtils]: 14: Hoare triple {91#true} havoc #t~nondet2; {91#true} is VALID [2020-07-18 00:16:57,840 INFO L280 TraceCheckUtils]: 15: Hoare triple {91#true} havoc ~lk3~0; {91#true} is VALID [2020-07-18 00:16:57,840 INFO L280 TraceCheckUtils]: 16: Hoare triple {91#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,841 INFO L280 TraceCheckUtils]: 17: Hoare triple {91#true} ~p4~0 := #t~nondet3; {91#true} is VALID [2020-07-18 00:16:57,841 INFO L280 TraceCheckUtils]: 18: Hoare triple {91#true} havoc #t~nondet3; {91#true} is VALID [2020-07-18 00:16:57,841 INFO L280 TraceCheckUtils]: 19: Hoare triple {91#true} havoc ~lk4~0; {91#true} is VALID [2020-07-18 00:16:57,842 INFO L280 TraceCheckUtils]: 20: Hoare triple {91#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {91#true} ~p5~0 := #t~nondet4; {91#true} is VALID [2020-07-18 00:16:57,843 INFO L280 TraceCheckUtils]: 22: Hoare triple {91#true} havoc #t~nondet4; {91#true} is VALID [2020-07-18 00:16:57,843 INFO L280 TraceCheckUtils]: 23: Hoare triple {91#true} havoc ~lk5~0; {91#true} is VALID [2020-07-18 00:16:57,844 INFO L280 TraceCheckUtils]: 24: Hoare triple {91#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,844 INFO L280 TraceCheckUtils]: 25: Hoare triple {91#true} ~p6~0 := #t~nondet5; {91#true} is VALID [2020-07-18 00:16:57,845 INFO L280 TraceCheckUtils]: 26: Hoare triple {91#true} havoc #t~nondet5; {91#true} is VALID [2020-07-18 00:16:57,845 INFO L280 TraceCheckUtils]: 27: Hoare triple {91#true} havoc ~lk6~0; {91#true} is VALID [2020-07-18 00:16:57,846 INFO L280 TraceCheckUtils]: 28: Hoare triple {91#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,846 INFO L280 TraceCheckUtils]: 29: Hoare triple {91#true} ~p7~0 := #t~nondet6; {91#true} is VALID [2020-07-18 00:16:57,846 INFO L280 TraceCheckUtils]: 30: Hoare triple {91#true} havoc #t~nondet6; {91#true} is VALID [2020-07-18 00:16:57,847 INFO L280 TraceCheckUtils]: 31: Hoare triple {91#true} havoc ~lk7~0; {91#true} is VALID [2020-07-18 00:16:57,847 INFO L280 TraceCheckUtils]: 32: Hoare triple {91#true} havoc ~cond~0; {91#true} is VALID [2020-07-18 00:16:57,848 INFO L280 TraceCheckUtils]: 33: Hoare triple {91#true} assume !false; {91#true} is VALID [2020-07-18 00:16:57,848 INFO L280 TraceCheckUtils]: 34: Hoare triple {91#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {91#true} is VALID [2020-07-18 00:16:57,849 INFO L280 TraceCheckUtils]: 35: Hoare triple {91#true} ~cond~0 := #t~nondet7; {91#true} is VALID [2020-07-18 00:16:57,849 INFO L280 TraceCheckUtils]: 36: Hoare triple {91#true} havoc #t~nondet7; {91#true} is VALID [2020-07-18 00:16:57,850 INFO L280 TraceCheckUtils]: 37: Hoare triple {91#true} assume !(0 == ~cond~0); {91#true} is VALID [2020-07-18 00:16:57,850 INFO L280 TraceCheckUtils]: 38: Hoare triple {91#true} ~lk1~0 := 0; {91#true} is VALID [2020-07-18 00:16:57,851 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#true} ~lk2~0 := 0; {91#true} is VALID [2020-07-18 00:16:57,851 INFO L280 TraceCheckUtils]: 40: Hoare triple {91#true} ~lk3~0 := 0; {91#true} is VALID [2020-07-18 00:16:57,852 INFO L280 TraceCheckUtils]: 41: Hoare triple {91#true} ~lk4~0 := 0; {91#true} is VALID [2020-07-18 00:16:57,852 INFO L280 TraceCheckUtils]: 42: Hoare triple {91#true} ~lk5~0 := 0; {91#true} is VALID [2020-07-18 00:16:57,852 INFO L280 TraceCheckUtils]: 43: Hoare triple {91#true} ~lk6~0 := 0; {91#true} is VALID [2020-07-18 00:16:57,853 INFO L280 TraceCheckUtils]: 44: Hoare triple {91#true} ~lk7~0 := 0; {91#true} is VALID [2020-07-18 00:16:57,856 INFO L280 TraceCheckUtils]: 45: Hoare triple {91#true} assume !(0 != ~p1~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:57,858 INFO L280 TraceCheckUtils]: 46: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p2~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:57,860 INFO L280 TraceCheckUtils]: 47: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p3~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:57,863 INFO L280 TraceCheckUtils]: 48: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p4~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:57,865 INFO L280 TraceCheckUtils]: 49: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p5~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:57,866 INFO L280 TraceCheckUtils]: 50: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p6~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:57,867 INFO L280 TraceCheckUtils]: 51: Hoare triple {95#(= 0 main_~p1~0)} assume !(0 != ~p7~0); {95#(= 0 main_~p1~0)} is VALID [2020-07-18 00:16:57,868 INFO L280 TraceCheckUtils]: 52: Hoare triple {95#(= 0 main_~p1~0)} assume 0 != ~p1~0; {92#false} is VALID [2020-07-18 00:16:57,869 INFO L280 TraceCheckUtils]: 53: Hoare triple {92#false} assume 1 != ~lk1~0; {92#false} is VALID [2020-07-18 00:16:57,870 INFO L280 TraceCheckUtils]: 54: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-18 00:16:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:57,883 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:57,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [917774735] [2020-07-18 00:16:57,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:57,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:57,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370564316] [2020-07-18 00:16:57,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 00:16:57,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:57,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:57,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:57,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:57,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:58,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:58,014 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-18 00:16:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:58,519 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-07-18 00:16:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:58,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-18 00:16:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-18 00:16:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2020-07-18 00:16:58,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2020-07-18 00:16:58,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:58,903 INFO L225 Difference]: With dead ends: 191 [2020-07-18 00:16:58,903 INFO L226 Difference]: Without dead ends: 128 [2020-07-18 00:16:58,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-18 00:16:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-07-18 00:16:59,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:16:59,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 126 states. [2020-07-18 00:16:59,066 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 126 states. [2020-07-18 00:16:59,067 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 126 states. [2020-07-18 00:16:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:59,081 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-18 00:16:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-18 00:16:59,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:59,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:59,084 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 128 states. [2020-07-18 00:16:59,084 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 128 states. [2020-07-18 00:16:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:59,097 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2020-07-18 00:16:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2020-07-18 00:16:59,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:16:59,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:16:59,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:16:59,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:16:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-18 00:16:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-07-18 00:16:59,110 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-07-18 00:16:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:16:59,111 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-07-18 00:16:59,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:16:59,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 164 transitions. [2020-07-18 00:16:59,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-07-18 00:16:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 00:16:59,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:16:59,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:16:59,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:16:59,317 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:16:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:16:59,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-07-18 00:16:59,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:16:59,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [419286884] [2020-07-18 00:16:59,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:16:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:16:59,427 INFO L280 TraceCheckUtils]: 0: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-18 00:16:59,427 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-18 00:16:59,428 INFO L263 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {988#true} is VALID [2020-07-18 00:16:59,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {988#true} assume true; {988#true} is VALID [2020-07-18 00:16:59,428 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {988#true} {988#true} #199#return; {988#true} is VALID [2020-07-18 00:16:59,429 INFO L263 TraceCheckUtils]: 3: Hoare triple {988#true} call #t~ret8 := main(); {988#true} is VALID [2020-07-18 00:16:59,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {988#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,429 INFO L280 TraceCheckUtils]: 5: Hoare triple {988#true} ~p1~0 := #t~nondet0; {988#true} is VALID [2020-07-18 00:16:59,429 INFO L280 TraceCheckUtils]: 6: Hoare triple {988#true} havoc #t~nondet0; {988#true} is VALID [2020-07-18 00:16:59,430 INFO L280 TraceCheckUtils]: 7: Hoare triple {988#true} havoc ~lk1~0; {988#true} is VALID [2020-07-18 00:16:59,430 INFO L280 TraceCheckUtils]: 8: Hoare triple {988#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,433 INFO L280 TraceCheckUtils]: 9: Hoare triple {988#true} ~p2~0 := #t~nondet1; {988#true} is VALID [2020-07-18 00:16:59,433 INFO L280 TraceCheckUtils]: 10: Hoare triple {988#true} havoc #t~nondet1; {988#true} is VALID [2020-07-18 00:16:59,434 INFO L280 TraceCheckUtils]: 11: Hoare triple {988#true} havoc ~lk2~0; {988#true} is VALID [2020-07-18 00:16:59,434 INFO L280 TraceCheckUtils]: 12: Hoare triple {988#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,434 INFO L280 TraceCheckUtils]: 13: Hoare triple {988#true} ~p3~0 := #t~nondet2; {988#true} is VALID [2020-07-18 00:16:59,435 INFO L280 TraceCheckUtils]: 14: Hoare triple {988#true} havoc #t~nondet2; {988#true} is VALID [2020-07-18 00:16:59,435 INFO L280 TraceCheckUtils]: 15: Hoare triple {988#true} havoc ~lk3~0; {988#true} is VALID [2020-07-18 00:16:59,436 INFO L280 TraceCheckUtils]: 16: Hoare triple {988#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,436 INFO L280 TraceCheckUtils]: 17: Hoare triple {988#true} ~p4~0 := #t~nondet3; {988#true} is VALID [2020-07-18 00:16:59,436 INFO L280 TraceCheckUtils]: 18: Hoare triple {988#true} havoc #t~nondet3; {988#true} is VALID [2020-07-18 00:16:59,437 INFO L280 TraceCheckUtils]: 19: Hoare triple {988#true} havoc ~lk4~0; {988#true} is VALID [2020-07-18 00:16:59,437 INFO L280 TraceCheckUtils]: 20: Hoare triple {988#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,437 INFO L280 TraceCheckUtils]: 21: Hoare triple {988#true} ~p5~0 := #t~nondet4; {988#true} is VALID [2020-07-18 00:16:59,438 INFO L280 TraceCheckUtils]: 22: Hoare triple {988#true} havoc #t~nondet4; {988#true} is VALID [2020-07-18 00:16:59,438 INFO L280 TraceCheckUtils]: 23: Hoare triple {988#true} havoc ~lk5~0; {988#true} is VALID [2020-07-18 00:16:59,438 INFO L280 TraceCheckUtils]: 24: Hoare triple {988#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,438 INFO L280 TraceCheckUtils]: 25: Hoare triple {988#true} ~p6~0 := #t~nondet5; {988#true} is VALID [2020-07-18 00:16:59,440 INFO L280 TraceCheckUtils]: 26: Hoare triple {988#true} havoc #t~nondet5; {988#true} is VALID [2020-07-18 00:16:59,440 INFO L280 TraceCheckUtils]: 27: Hoare triple {988#true} havoc ~lk6~0; {988#true} is VALID [2020-07-18 00:16:59,441 INFO L280 TraceCheckUtils]: 28: Hoare triple {988#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,441 INFO L280 TraceCheckUtils]: 29: Hoare triple {988#true} ~p7~0 := #t~nondet6; {988#true} is VALID [2020-07-18 00:16:59,441 INFO L280 TraceCheckUtils]: 30: Hoare triple {988#true} havoc #t~nondet6; {988#true} is VALID [2020-07-18 00:16:59,442 INFO L280 TraceCheckUtils]: 31: Hoare triple {988#true} havoc ~lk7~0; {988#true} is VALID [2020-07-18 00:16:59,442 INFO L280 TraceCheckUtils]: 32: Hoare triple {988#true} havoc ~cond~0; {988#true} is VALID [2020-07-18 00:16:59,442 INFO L280 TraceCheckUtils]: 33: Hoare triple {988#true} assume !false; {988#true} is VALID [2020-07-18 00:16:59,442 INFO L280 TraceCheckUtils]: 34: Hoare triple {988#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {988#true} is VALID [2020-07-18 00:16:59,443 INFO L280 TraceCheckUtils]: 35: Hoare triple {988#true} ~cond~0 := #t~nondet7; {988#true} is VALID [2020-07-18 00:16:59,443 INFO L280 TraceCheckUtils]: 36: Hoare triple {988#true} havoc #t~nondet7; {988#true} is VALID [2020-07-18 00:16:59,443 INFO L280 TraceCheckUtils]: 37: Hoare triple {988#true} assume !(0 == ~cond~0); {988#true} is VALID [2020-07-18 00:16:59,444 INFO L280 TraceCheckUtils]: 38: Hoare triple {988#true} ~lk1~0 := 0; {988#true} is VALID [2020-07-18 00:16:59,444 INFO L280 TraceCheckUtils]: 39: Hoare triple {988#true} ~lk2~0 := 0; {988#true} is VALID [2020-07-18 00:16:59,444 INFO L280 TraceCheckUtils]: 40: Hoare triple {988#true} ~lk3~0 := 0; {988#true} is VALID [2020-07-18 00:16:59,445 INFO L280 TraceCheckUtils]: 41: Hoare triple {988#true} ~lk4~0 := 0; {988#true} is VALID [2020-07-18 00:16:59,445 INFO L280 TraceCheckUtils]: 42: Hoare triple {988#true} ~lk5~0 := 0; {988#true} is VALID [2020-07-18 00:16:59,445 INFO L280 TraceCheckUtils]: 43: Hoare triple {988#true} ~lk6~0 := 0; {988#true} is VALID [2020-07-18 00:16:59,446 INFO L280 TraceCheckUtils]: 44: Hoare triple {988#true} ~lk7~0 := 0; {988#true} is VALID [2020-07-18 00:16:59,446 INFO L280 TraceCheckUtils]: 45: Hoare triple {988#true} assume 0 != ~p1~0; {988#true} is VALID [2020-07-18 00:16:59,447 INFO L280 TraceCheckUtils]: 46: Hoare triple {988#true} ~lk1~0 := 1; {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,448 INFO L280 TraceCheckUtils]: 47: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p2~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,449 INFO L280 TraceCheckUtils]: 48: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p3~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,450 INFO L280 TraceCheckUtils]: 49: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p4~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,450 INFO L280 TraceCheckUtils]: 50: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p5~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,451 INFO L280 TraceCheckUtils]: 51: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p6~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,452 INFO L280 TraceCheckUtils]: 52: Hoare triple {992#(= 1 main_~lk1~0)} assume !(0 != ~p7~0); {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,453 INFO L280 TraceCheckUtils]: 53: Hoare triple {992#(= 1 main_~lk1~0)} assume 0 != ~p1~0; {992#(= 1 main_~lk1~0)} is VALID [2020-07-18 00:16:59,454 INFO L280 TraceCheckUtils]: 54: Hoare triple {992#(= 1 main_~lk1~0)} assume 1 != ~lk1~0; {989#false} is VALID [2020-07-18 00:16:59,454 INFO L280 TraceCheckUtils]: 55: Hoare triple {989#false} assume !false; {989#false} is VALID [2020-07-18 00:16:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:16:59,458 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:16:59,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [419286884] [2020-07-18 00:16:59,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:16:59,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:16:59,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660786729] [2020-07-18 00:16:59,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 00:16:59,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:16:59,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:16:59,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:16:59,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:16:59,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:16:59,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:16:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:16:59,517 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-07-18 00:16:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:16:59,852 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-07-18 00:16:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:16:59,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 00:16:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:16:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-18 00:16:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:16:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-18 00:16:59,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2020-07-18 00:17:00,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:00,021 INFO L225 Difference]: With dead ends: 154 [2020-07-18 00:17:00,021 INFO L226 Difference]: Without dead ends: 152 [2020-07-18 00:17:00,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-18 00:17:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-07-18 00:17:00,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:00,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 126 states. [2020-07-18 00:17:00,184 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 126 states. [2020-07-18 00:17:00,184 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 126 states. [2020-07-18 00:17:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:00,199 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-18 00:17:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-18 00:17:00,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:00,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:00,201 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 152 states. [2020-07-18 00:17:00,207 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 152 states. [2020-07-18 00:17:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:00,217 INFO L93 Difference]: Finished difference Result 152 states and 200 transitions. [2020-07-18 00:17:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 200 transitions. [2020-07-18 00:17:00,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:00,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:00,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:00,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-18 00:17:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-07-18 00:17:00,239 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-07-18 00:17:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:00,240 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-07-18 00:17:00,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:00,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 126 states and 163 transitions. [2020-07-18 00:17:00,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-07-18 00:17:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-18 00:17:00,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:00,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:00,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:17:00,434 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-07-18 00:17:00,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:00,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967100817] [2020-07-18 00:17:00,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:00,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-18 00:17:00,490 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-18 00:17:00,491 INFO L263 TraceCheckUtils]: 0: Hoare triple {1859#true} call ULTIMATE.init(); {1859#true} is VALID [2020-07-18 00:17:00,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {1859#true} assume true; {1859#true} is VALID [2020-07-18 00:17:00,491 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1859#true} {1859#true} #199#return; {1859#true} is VALID [2020-07-18 00:17:00,492 INFO L263 TraceCheckUtils]: 3: Hoare triple {1859#true} call #t~ret8 := main(); {1859#true} is VALID [2020-07-18 00:17:00,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {1859#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,492 INFO L280 TraceCheckUtils]: 5: Hoare triple {1859#true} ~p1~0 := #t~nondet0; {1859#true} is VALID [2020-07-18 00:17:00,492 INFO L280 TraceCheckUtils]: 6: Hoare triple {1859#true} havoc #t~nondet0; {1859#true} is VALID [2020-07-18 00:17:00,493 INFO L280 TraceCheckUtils]: 7: Hoare triple {1859#true} havoc ~lk1~0; {1859#true} is VALID [2020-07-18 00:17:00,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {1859#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,493 INFO L280 TraceCheckUtils]: 9: Hoare triple {1859#true} ~p2~0 := #t~nondet1; {1859#true} is VALID [2020-07-18 00:17:00,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {1859#true} havoc #t~nondet1; {1859#true} is VALID [2020-07-18 00:17:00,494 INFO L280 TraceCheckUtils]: 11: Hoare triple {1859#true} havoc ~lk2~0; {1859#true} is VALID [2020-07-18 00:17:00,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {1859#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,495 INFO L280 TraceCheckUtils]: 13: Hoare triple {1859#true} ~p3~0 := #t~nondet2; {1859#true} is VALID [2020-07-18 00:17:00,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {1859#true} havoc #t~nondet2; {1859#true} is VALID [2020-07-18 00:17:00,495 INFO L280 TraceCheckUtils]: 15: Hoare triple {1859#true} havoc ~lk3~0; {1859#true} is VALID [2020-07-18 00:17:00,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {1859#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {1859#true} ~p4~0 := #t~nondet3; {1859#true} is VALID [2020-07-18 00:17:00,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {1859#true} havoc #t~nondet3; {1859#true} is VALID [2020-07-18 00:17:00,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {1859#true} havoc ~lk4~0; {1859#true} is VALID [2020-07-18 00:17:00,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {1859#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,497 INFO L280 TraceCheckUtils]: 21: Hoare triple {1859#true} ~p5~0 := #t~nondet4; {1859#true} is VALID [2020-07-18 00:17:00,497 INFO L280 TraceCheckUtils]: 22: Hoare triple {1859#true} havoc #t~nondet4; {1859#true} is VALID [2020-07-18 00:17:00,497 INFO L280 TraceCheckUtils]: 23: Hoare triple {1859#true} havoc ~lk5~0; {1859#true} is VALID [2020-07-18 00:17:00,498 INFO L280 TraceCheckUtils]: 24: Hoare triple {1859#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {1859#true} ~p6~0 := #t~nondet5; {1859#true} is VALID [2020-07-18 00:17:00,498 INFO L280 TraceCheckUtils]: 26: Hoare triple {1859#true} havoc #t~nondet5; {1859#true} is VALID [2020-07-18 00:17:00,499 INFO L280 TraceCheckUtils]: 27: Hoare triple {1859#true} havoc ~lk6~0; {1859#true} is VALID [2020-07-18 00:17:00,499 INFO L280 TraceCheckUtils]: 28: Hoare triple {1859#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,499 INFO L280 TraceCheckUtils]: 29: Hoare triple {1859#true} ~p7~0 := #t~nondet6; {1859#true} is VALID [2020-07-18 00:17:00,499 INFO L280 TraceCheckUtils]: 30: Hoare triple {1859#true} havoc #t~nondet6; {1859#true} is VALID [2020-07-18 00:17:00,500 INFO L280 TraceCheckUtils]: 31: Hoare triple {1859#true} havoc ~lk7~0; {1859#true} is VALID [2020-07-18 00:17:00,500 INFO L280 TraceCheckUtils]: 32: Hoare triple {1859#true} havoc ~cond~0; {1859#true} is VALID [2020-07-18 00:17:00,500 INFO L280 TraceCheckUtils]: 33: Hoare triple {1859#true} assume !false; {1859#true} is VALID [2020-07-18 00:17:00,500 INFO L280 TraceCheckUtils]: 34: Hoare triple {1859#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1859#true} is VALID [2020-07-18 00:17:00,501 INFO L280 TraceCheckUtils]: 35: Hoare triple {1859#true} ~cond~0 := #t~nondet7; {1859#true} is VALID [2020-07-18 00:17:00,501 INFO L280 TraceCheckUtils]: 36: Hoare triple {1859#true} havoc #t~nondet7; {1859#true} is VALID [2020-07-18 00:17:00,501 INFO L280 TraceCheckUtils]: 37: Hoare triple {1859#true} assume !(0 == ~cond~0); {1859#true} is VALID [2020-07-18 00:17:00,501 INFO L280 TraceCheckUtils]: 38: Hoare triple {1859#true} ~lk1~0 := 0; {1859#true} is VALID [2020-07-18 00:17:00,502 INFO L280 TraceCheckUtils]: 39: Hoare triple {1859#true} ~lk2~0 := 0; {1859#true} is VALID [2020-07-18 00:17:00,502 INFO L280 TraceCheckUtils]: 40: Hoare triple {1859#true} ~lk3~0 := 0; {1859#true} is VALID [2020-07-18 00:17:00,502 INFO L280 TraceCheckUtils]: 41: Hoare triple {1859#true} ~lk4~0 := 0; {1859#true} is VALID [2020-07-18 00:17:00,502 INFO L280 TraceCheckUtils]: 42: Hoare triple {1859#true} ~lk5~0 := 0; {1859#true} is VALID [2020-07-18 00:17:00,503 INFO L280 TraceCheckUtils]: 43: Hoare triple {1859#true} ~lk6~0 := 0; {1859#true} is VALID [2020-07-18 00:17:00,503 INFO L280 TraceCheckUtils]: 44: Hoare triple {1859#true} ~lk7~0 := 0; {1859#true} is VALID [2020-07-18 00:17:00,503 INFO L280 TraceCheckUtils]: 45: Hoare triple {1859#true} assume !(0 != ~p1~0); {1859#true} is VALID [2020-07-18 00:17:00,505 INFO L280 TraceCheckUtils]: 46: Hoare triple {1859#true} assume !(0 != ~p2~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:00,506 INFO L280 TraceCheckUtils]: 47: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p3~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:00,506 INFO L280 TraceCheckUtils]: 48: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p4~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:00,507 INFO L280 TraceCheckUtils]: 49: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p5~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:00,508 INFO L280 TraceCheckUtils]: 50: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p6~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:00,509 INFO L280 TraceCheckUtils]: 51: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p7~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:00,509 INFO L280 TraceCheckUtils]: 52: Hoare triple {1863#(= 0 main_~p2~0)} assume !(0 != ~p1~0); {1863#(= 0 main_~p2~0)} is VALID [2020-07-18 00:17:00,510 INFO L280 TraceCheckUtils]: 53: Hoare triple {1863#(= 0 main_~p2~0)} assume 0 != ~p2~0; {1860#false} is VALID [2020-07-18 00:17:00,510 INFO L280 TraceCheckUtils]: 54: Hoare triple {1860#false} assume 1 != ~lk2~0; {1860#false} is VALID [2020-07-18 00:17:00,511 INFO L280 TraceCheckUtils]: 55: Hoare triple {1860#false} assume !false; {1860#false} is VALID [2020-07-18 00:17:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:00,515 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:00,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967100817] [2020-07-18 00:17:00,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:00,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:00,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523314502] [2020-07-18 00:17:00,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 00:17:00,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:00,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:00,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:00,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:00,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:00,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:00,566 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-07-18 00:17:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:01,045 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-07-18 00:17:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:01,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-18 00:17:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-18 00:17:01,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2020-07-18 00:17:01,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2020-07-18 00:17:01,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:01,290 INFO L225 Difference]: With dead ends: 306 [2020-07-18 00:17:01,290 INFO L226 Difference]: Without dead ends: 213 [2020-07-18 00:17:01,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-18 00:17:01,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-07-18 00:17:01,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:01,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 211 states. [2020-07-18 00:17:01,516 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 211 states. [2020-07-18 00:17:01,517 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 211 states. [2020-07-18 00:17:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:01,526 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-18 00:17:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-18 00:17:01,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:01,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:01,527 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 213 states. [2020-07-18 00:17:01,527 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 213 states. [2020-07-18 00:17:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:01,536 INFO L93 Difference]: Finished difference Result 213 states and 281 transitions. [2020-07-18 00:17:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 281 transitions. [2020-07-18 00:17:01,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:01,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:01,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:01,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:01,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-18 00:17:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-07-18 00:17:01,546 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-07-18 00:17:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:01,546 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-07-18 00:17:01,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:01,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 280 transitions. [2020-07-18 00:17:01,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-07-18 00:17:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 00:17:01,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:01,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:01,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:17:01,893 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-07-18 00:17:01,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:01,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1256140842] [2020-07-18 00:17:01,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:01,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-18 00:17:01,970 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-18 00:17:01,971 INFO L263 TraceCheckUtils]: 0: Hoare triple {3326#true} call ULTIMATE.init(); {3326#true} is VALID [2020-07-18 00:17:01,971 INFO L280 TraceCheckUtils]: 1: Hoare triple {3326#true} assume true; {3326#true} is VALID [2020-07-18 00:17:01,971 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3326#true} {3326#true} #199#return; {3326#true} is VALID [2020-07-18 00:17:01,971 INFO L263 TraceCheckUtils]: 3: Hoare triple {3326#true} call #t~ret8 := main(); {3326#true} is VALID [2020-07-18 00:17:01,972 INFO L280 TraceCheckUtils]: 4: Hoare triple {3326#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,972 INFO L280 TraceCheckUtils]: 5: Hoare triple {3326#true} ~p1~0 := #t~nondet0; {3326#true} is VALID [2020-07-18 00:17:01,972 INFO L280 TraceCheckUtils]: 6: Hoare triple {3326#true} havoc #t~nondet0; {3326#true} is VALID [2020-07-18 00:17:01,972 INFO L280 TraceCheckUtils]: 7: Hoare triple {3326#true} havoc ~lk1~0; {3326#true} is VALID [2020-07-18 00:17:01,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {3326#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {3326#true} ~p2~0 := #t~nondet1; {3326#true} is VALID [2020-07-18 00:17:01,973 INFO L280 TraceCheckUtils]: 10: Hoare triple {3326#true} havoc #t~nondet1; {3326#true} is VALID [2020-07-18 00:17:01,973 INFO L280 TraceCheckUtils]: 11: Hoare triple {3326#true} havoc ~lk2~0; {3326#true} is VALID [2020-07-18 00:17:01,974 INFO L280 TraceCheckUtils]: 12: Hoare triple {3326#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,974 INFO L280 TraceCheckUtils]: 13: Hoare triple {3326#true} ~p3~0 := #t~nondet2; {3326#true} is VALID [2020-07-18 00:17:01,974 INFO L280 TraceCheckUtils]: 14: Hoare triple {3326#true} havoc #t~nondet2; {3326#true} is VALID [2020-07-18 00:17:01,975 INFO L280 TraceCheckUtils]: 15: Hoare triple {3326#true} havoc ~lk3~0; {3326#true} is VALID [2020-07-18 00:17:01,975 INFO L280 TraceCheckUtils]: 16: Hoare triple {3326#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,975 INFO L280 TraceCheckUtils]: 17: Hoare triple {3326#true} ~p4~0 := #t~nondet3; {3326#true} is VALID [2020-07-18 00:17:01,976 INFO L280 TraceCheckUtils]: 18: Hoare triple {3326#true} havoc #t~nondet3; {3326#true} is VALID [2020-07-18 00:17:01,976 INFO L280 TraceCheckUtils]: 19: Hoare triple {3326#true} havoc ~lk4~0; {3326#true} is VALID [2020-07-18 00:17:01,976 INFO L280 TraceCheckUtils]: 20: Hoare triple {3326#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,976 INFO L280 TraceCheckUtils]: 21: Hoare triple {3326#true} ~p5~0 := #t~nondet4; {3326#true} is VALID [2020-07-18 00:17:01,977 INFO L280 TraceCheckUtils]: 22: Hoare triple {3326#true} havoc #t~nondet4; {3326#true} is VALID [2020-07-18 00:17:01,977 INFO L280 TraceCheckUtils]: 23: Hoare triple {3326#true} havoc ~lk5~0; {3326#true} is VALID [2020-07-18 00:17:01,977 INFO L280 TraceCheckUtils]: 24: Hoare triple {3326#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,977 INFO L280 TraceCheckUtils]: 25: Hoare triple {3326#true} ~p6~0 := #t~nondet5; {3326#true} is VALID [2020-07-18 00:17:01,977 INFO L280 TraceCheckUtils]: 26: Hoare triple {3326#true} havoc #t~nondet5; {3326#true} is VALID [2020-07-18 00:17:01,978 INFO L280 TraceCheckUtils]: 27: Hoare triple {3326#true} havoc ~lk6~0; {3326#true} is VALID [2020-07-18 00:17:01,978 INFO L280 TraceCheckUtils]: 28: Hoare triple {3326#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,978 INFO L280 TraceCheckUtils]: 29: Hoare triple {3326#true} ~p7~0 := #t~nondet6; {3326#true} is VALID [2020-07-18 00:17:01,979 INFO L280 TraceCheckUtils]: 30: Hoare triple {3326#true} havoc #t~nondet6; {3326#true} is VALID [2020-07-18 00:17:01,979 INFO L280 TraceCheckUtils]: 31: Hoare triple {3326#true} havoc ~lk7~0; {3326#true} is VALID [2020-07-18 00:17:01,979 INFO L280 TraceCheckUtils]: 32: Hoare triple {3326#true} havoc ~cond~0; {3326#true} is VALID [2020-07-18 00:17:01,979 INFO L280 TraceCheckUtils]: 33: Hoare triple {3326#true} assume !false; {3326#true} is VALID [2020-07-18 00:17:01,980 INFO L280 TraceCheckUtils]: 34: Hoare triple {3326#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3326#true} is VALID [2020-07-18 00:17:01,980 INFO L280 TraceCheckUtils]: 35: Hoare triple {3326#true} ~cond~0 := #t~nondet7; {3326#true} is VALID [2020-07-18 00:17:01,980 INFO L280 TraceCheckUtils]: 36: Hoare triple {3326#true} havoc #t~nondet7; {3326#true} is VALID [2020-07-18 00:17:01,980 INFO L280 TraceCheckUtils]: 37: Hoare triple {3326#true} assume !(0 == ~cond~0); {3326#true} is VALID [2020-07-18 00:17:01,981 INFO L280 TraceCheckUtils]: 38: Hoare triple {3326#true} ~lk1~0 := 0; {3326#true} is VALID [2020-07-18 00:17:01,981 INFO L280 TraceCheckUtils]: 39: Hoare triple {3326#true} ~lk2~0 := 0; {3326#true} is VALID [2020-07-18 00:17:01,981 INFO L280 TraceCheckUtils]: 40: Hoare triple {3326#true} ~lk3~0 := 0; {3326#true} is VALID [2020-07-18 00:17:01,981 INFO L280 TraceCheckUtils]: 41: Hoare triple {3326#true} ~lk4~0 := 0; {3326#true} is VALID [2020-07-18 00:17:01,982 INFO L280 TraceCheckUtils]: 42: Hoare triple {3326#true} ~lk5~0 := 0; {3326#true} is VALID [2020-07-18 00:17:01,982 INFO L280 TraceCheckUtils]: 43: Hoare triple {3326#true} ~lk6~0 := 0; {3326#true} is VALID [2020-07-18 00:17:01,982 INFO L280 TraceCheckUtils]: 44: Hoare triple {3326#true} ~lk7~0 := 0; {3326#true} is VALID [2020-07-18 00:17:01,982 INFO L280 TraceCheckUtils]: 45: Hoare triple {3326#true} assume !(0 != ~p1~0); {3326#true} is VALID [2020-07-18 00:17:01,982 INFO L280 TraceCheckUtils]: 46: Hoare triple {3326#true} assume 0 != ~p2~0; {3326#true} is VALID [2020-07-18 00:17:01,983 INFO L280 TraceCheckUtils]: 47: Hoare triple {3326#true} ~lk2~0 := 1; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,984 INFO L280 TraceCheckUtils]: 48: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p3~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,986 INFO L280 TraceCheckUtils]: 49: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p4~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,987 INFO L280 TraceCheckUtils]: 50: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p5~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,988 INFO L280 TraceCheckUtils]: 51: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p6~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,988 INFO L280 TraceCheckUtils]: 52: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p7~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,988 INFO L280 TraceCheckUtils]: 53: Hoare triple {3330#(= 1 main_~lk2~0)} assume !(0 != ~p1~0); {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,989 INFO L280 TraceCheckUtils]: 54: Hoare triple {3330#(= 1 main_~lk2~0)} assume 0 != ~p2~0; {3330#(= 1 main_~lk2~0)} is VALID [2020-07-18 00:17:01,989 INFO L280 TraceCheckUtils]: 55: Hoare triple {3330#(= 1 main_~lk2~0)} assume 1 != ~lk2~0; {3327#false} is VALID [2020-07-18 00:17:01,989 INFO L280 TraceCheckUtils]: 56: Hoare triple {3327#false} assume !false; {3327#false} is VALID [2020-07-18 00:17:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:01,992 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:01,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1256140842] [2020-07-18 00:17:01,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:01,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:01,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724216635] [2020-07-18 00:17:01,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 00:17:01,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:01,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:02,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:02,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:02,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:02,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:02,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:02,049 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-07-18 00:17:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:02,514 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-07-18 00:17:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:02,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 00:17:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-18 00:17:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2020-07-18 00:17:02,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2020-07-18 00:17:02,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:02,675 INFO L225 Difference]: With dead ends: 259 [2020-07-18 00:17:02,675 INFO L226 Difference]: Without dead ends: 257 [2020-07-18 00:17:02,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-18 00:17:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-07-18 00:17:02,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:02,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand 211 states. [2020-07-18 00:17:02,950 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand 211 states. [2020-07-18 00:17:02,950 INFO L87 Difference]: Start difference. First operand 257 states. Second operand 211 states. [2020-07-18 00:17:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:02,960 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-18 00:17:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-18 00:17:02,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:02,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:02,962 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand 257 states. [2020-07-18 00:17:02,962 INFO L87 Difference]: Start difference. First operand 211 states. Second operand 257 states. [2020-07-18 00:17:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:02,972 INFO L93 Difference]: Finished difference Result 257 states and 343 transitions. [2020-07-18 00:17:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2020-07-18 00:17:02,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:02,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:02,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:02,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-18 00:17:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-07-18 00:17:02,981 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-07-18 00:17:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:02,982 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-07-18 00:17:02,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:02,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 211 states and 278 transitions. [2020-07-18 00:17:03,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-07-18 00:17:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 00:17:03,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:03,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:03,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:17:03,276 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:03,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-07-18 00:17:03,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:03,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2119179033] [2020-07-18 00:17:03,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:03,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-18 00:17:03,339 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-18 00:17:03,339 INFO L263 TraceCheckUtils]: 0: Hoare triple {4787#true} call ULTIMATE.init(); {4787#true} is VALID [2020-07-18 00:17:03,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {4787#true} assume true; {4787#true} is VALID [2020-07-18 00:17:03,340 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4787#true} {4787#true} #199#return; {4787#true} is VALID [2020-07-18 00:17:03,340 INFO L263 TraceCheckUtils]: 3: Hoare triple {4787#true} call #t~ret8 := main(); {4787#true} is VALID [2020-07-18 00:17:03,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {4787#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,340 INFO L280 TraceCheckUtils]: 5: Hoare triple {4787#true} ~p1~0 := #t~nondet0; {4787#true} is VALID [2020-07-18 00:17:03,340 INFO L280 TraceCheckUtils]: 6: Hoare triple {4787#true} havoc #t~nondet0; {4787#true} is VALID [2020-07-18 00:17:03,340 INFO L280 TraceCheckUtils]: 7: Hoare triple {4787#true} havoc ~lk1~0; {4787#true} is VALID [2020-07-18 00:17:03,341 INFO L280 TraceCheckUtils]: 8: Hoare triple {4787#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,341 INFO L280 TraceCheckUtils]: 9: Hoare triple {4787#true} ~p2~0 := #t~nondet1; {4787#true} is VALID [2020-07-18 00:17:03,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {4787#true} havoc #t~nondet1; {4787#true} is VALID [2020-07-18 00:17:03,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {4787#true} havoc ~lk2~0; {4787#true} is VALID [2020-07-18 00:17:03,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {4787#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {4787#true} ~p3~0 := #t~nondet2; {4787#true} is VALID [2020-07-18 00:17:03,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {4787#true} havoc #t~nondet2; {4787#true} is VALID [2020-07-18 00:17:03,342 INFO L280 TraceCheckUtils]: 15: Hoare triple {4787#true} havoc ~lk3~0; {4787#true} is VALID [2020-07-18 00:17:03,342 INFO L280 TraceCheckUtils]: 16: Hoare triple {4787#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,342 INFO L280 TraceCheckUtils]: 17: Hoare triple {4787#true} ~p4~0 := #t~nondet3; {4787#true} is VALID [2020-07-18 00:17:03,343 INFO L280 TraceCheckUtils]: 18: Hoare triple {4787#true} havoc #t~nondet3; {4787#true} is VALID [2020-07-18 00:17:03,343 INFO L280 TraceCheckUtils]: 19: Hoare triple {4787#true} havoc ~lk4~0; {4787#true} is VALID [2020-07-18 00:17:03,343 INFO L280 TraceCheckUtils]: 20: Hoare triple {4787#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,343 INFO L280 TraceCheckUtils]: 21: Hoare triple {4787#true} ~p5~0 := #t~nondet4; {4787#true} is VALID [2020-07-18 00:17:03,344 INFO L280 TraceCheckUtils]: 22: Hoare triple {4787#true} havoc #t~nondet4; {4787#true} is VALID [2020-07-18 00:17:03,344 INFO L280 TraceCheckUtils]: 23: Hoare triple {4787#true} havoc ~lk5~0; {4787#true} is VALID [2020-07-18 00:17:03,344 INFO L280 TraceCheckUtils]: 24: Hoare triple {4787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,344 INFO L280 TraceCheckUtils]: 25: Hoare triple {4787#true} ~p6~0 := #t~nondet5; {4787#true} is VALID [2020-07-18 00:17:03,345 INFO L280 TraceCheckUtils]: 26: Hoare triple {4787#true} havoc #t~nondet5; {4787#true} is VALID [2020-07-18 00:17:03,345 INFO L280 TraceCheckUtils]: 27: Hoare triple {4787#true} havoc ~lk6~0; {4787#true} is VALID [2020-07-18 00:17:03,345 INFO L280 TraceCheckUtils]: 28: Hoare triple {4787#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,345 INFO L280 TraceCheckUtils]: 29: Hoare triple {4787#true} ~p7~0 := #t~nondet6; {4787#true} is VALID [2020-07-18 00:17:03,346 INFO L280 TraceCheckUtils]: 30: Hoare triple {4787#true} havoc #t~nondet6; {4787#true} is VALID [2020-07-18 00:17:03,346 INFO L280 TraceCheckUtils]: 31: Hoare triple {4787#true} havoc ~lk7~0; {4787#true} is VALID [2020-07-18 00:17:03,346 INFO L280 TraceCheckUtils]: 32: Hoare triple {4787#true} havoc ~cond~0; {4787#true} is VALID [2020-07-18 00:17:03,346 INFO L280 TraceCheckUtils]: 33: Hoare triple {4787#true} assume !false; {4787#true} is VALID [2020-07-18 00:17:03,347 INFO L280 TraceCheckUtils]: 34: Hoare triple {4787#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4787#true} is VALID [2020-07-18 00:17:03,347 INFO L280 TraceCheckUtils]: 35: Hoare triple {4787#true} ~cond~0 := #t~nondet7; {4787#true} is VALID [2020-07-18 00:17:03,347 INFO L280 TraceCheckUtils]: 36: Hoare triple {4787#true} havoc #t~nondet7; {4787#true} is VALID [2020-07-18 00:17:03,348 INFO L280 TraceCheckUtils]: 37: Hoare triple {4787#true} assume !(0 == ~cond~0); {4787#true} is VALID [2020-07-18 00:17:03,348 INFO L280 TraceCheckUtils]: 38: Hoare triple {4787#true} ~lk1~0 := 0; {4787#true} is VALID [2020-07-18 00:17:03,348 INFO L280 TraceCheckUtils]: 39: Hoare triple {4787#true} ~lk2~0 := 0; {4787#true} is VALID [2020-07-18 00:17:03,348 INFO L280 TraceCheckUtils]: 40: Hoare triple {4787#true} ~lk3~0 := 0; {4787#true} is VALID [2020-07-18 00:17:03,348 INFO L280 TraceCheckUtils]: 41: Hoare triple {4787#true} ~lk4~0 := 0; {4787#true} is VALID [2020-07-18 00:17:03,349 INFO L280 TraceCheckUtils]: 42: Hoare triple {4787#true} ~lk5~0 := 0; {4787#true} is VALID [2020-07-18 00:17:03,349 INFO L280 TraceCheckUtils]: 43: Hoare triple {4787#true} ~lk6~0 := 0; {4787#true} is VALID [2020-07-18 00:17:03,349 INFO L280 TraceCheckUtils]: 44: Hoare triple {4787#true} ~lk7~0 := 0; {4787#true} is VALID [2020-07-18 00:17:03,349 INFO L280 TraceCheckUtils]: 45: Hoare triple {4787#true} assume !(0 != ~p1~0); {4787#true} is VALID [2020-07-18 00:17:03,350 INFO L280 TraceCheckUtils]: 46: Hoare triple {4787#true} assume !(0 != ~p2~0); {4787#true} is VALID [2020-07-18 00:17:03,350 INFO L280 TraceCheckUtils]: 47: Hoare triple {4787#true} assume !(0 != ~p3~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:03,351 INFO L280 TraceCheckUtils]: 48: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p4~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:03,351 INFO L280 TraceCheckUtils]: 49: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p5~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:03,352 INFO L280 TraceCheckUtils]: 50: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p6~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:03,352 INFO L280 TraceCheckUtils]: 51: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p7~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:03,352 INFO L280 TraceCheckUtils]: 52: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p1~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:03,353 INFO L280 TraceCheckUtils]: 53: Hoare triple {4791#(= 0 main_~p3~0)} assume !(0 != ~p2~0); {4791#(= 0 main_~p3~0)} is VALID [2020-07-18 00:17:03,354 INFO L280 TraceCheckUtils]: 54: Hoare triple {4791#(= 0 main_~p3~0)} assume 0 != ~p3~0; {4788#false} is VALID [2020-07-18 00:17:03,354 INFO L280 TraceCheckUtils]: 55: Hoare triple {4788#false} assume 1 != ~lk3~0; {4788#false} is VALID [2020-07-18 00:17:03,354 INFO L280 TraceCheckUtils]: 56: Hoare triple {4788#false} assume !false; {4788#false} is VALID [2020-07-18 00:17:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:03,356 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:03,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2119179033] [2020-07-18 00:17:03,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:03,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:03,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114988466] [2020-07-18 00:17:03,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 00:17:03,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:03,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:03,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:03,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:03,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:03,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:03,420 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-07-18 00:17:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:04,224 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-07-18 00:17:04,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:04,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-18 00:17:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-18 00:17:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-18 00:17:04,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2020-07-18 00:17:04,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:04,454 INFO L225 Difference]: With dead ends: 555 [2020-07-18 00:17:04,454 INFO L226 Difference]: Without dead ends: 377 [2020-07-18 00:17:04,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-07-18 00:17:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-07-18 00:17:05,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:05,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand 375 states. [2020-07-18 00:17:05,012 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand 375 states. [2020-07-18 00:17:05,012 INFO L87 Difference]: Start difference. First operand 377 states. Second operand 375 states. [2020-07-18 00:17:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:05,029 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-18 00:17:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-18 00:17:05,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:05,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:05,031 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 377 states. [2020-07-18 00:17:05,031 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 377 states. [2020-07-18 00:17:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:05,046 INFO L93 Difference]: Finished difference Result 377 states and 499 transitions. [2020-07-18 00:17:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2020-07-18 00:17:05,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:05,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:05,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:05,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-18 00:17:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-07-18 00:17:05,064 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-07-18 00:17:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:05,064 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-07-18 00:17:05,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:05,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 498 transitions. [2020-07-18 00:17:05,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-07-18 00:17:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 00:17:05,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:05,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:05,626 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:17:05,627 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-07-18 00:17:05,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:05,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112291783] [2020-07-18 00:17:05,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:05,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-18 00:17:05,687 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-18 00:17:05,687 INFO L263 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7408#true} is VALID [2020-07-18 00:17:05,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID [2020-07-18 00:17:05,688 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #199#return; {7408#true} is VALID [2020-07-18 00:17:05,688 INFO L263 TraceCheckUtils]: 3: Hoare triple {7408#true} call #t~ret8 := main(); {7408#true} is VALID [2020-07-18 00:17:05,688 INFO L280 TraceCheckUtils]: 4: Hoare triple {7408#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,688 INFO L280 TraceCheckUtils]: 5: Hoare triple {7408#true} ~p1~0 := #t~nondet0; {7408#true} is VALID [2020-07-18 00:17:05,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {7408#true} havoc #t~nondet0; {7408#true} is VALID [2020-07-18 00:17:05,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {7408#true} havoc ~lk1~0; {7408#true} is VALID [2020-07-18 00:17:05,689 INFO L280 TraceCheckUtils]: 8: Hoare triple {7408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {7408#true} ~p2~0 := #t~nondet1; {7408#true} is VALID [2020-07-18 00:17:05,689 INFO L280 TraceCheckUtils]: 10: Hoare triple {7408#true} havoc #t~nondet1; {7408#true} is VALID [2020-07-18 00:17:05,689 INFO L280 TraceCheckUtils]: 11: Hoare triple {7408#true} havoc ~lk2~0; {7408#true} is VALID [2020-07-18 00:17:05,690 INFO L280 TraceCheckUtils]: 12: Hoare triple {7408#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,690 INFO L280 TraceCheckUtils]: 13: Hoare triple {7408#true} ~p3~0 := #t~nondet2; {7408#true} is VALID [2020-07-18 00:17:05,690 INFO L280 TraceCheckUtils]: 14: Hoare triple {7408#true} havoc #t~nondet2; {7408#true} is VALID [2020-07-18 00:17:05,690 INFO L280 TraceCheckUtils]: 15: Hoare triple {7408#true} havoc ~lk3~0; {7408#true} is VALID [2020-07-18 00:17:05,691 INFO L280 TraceCheckUtils]: 16: Hoare triple {7408#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,691 INFO L280 TraceCheckUtils]: 17: Hoare triple {7408#true} ~p4~0 := #t~nondet3; {7408#true} is VALID [2020-07-18 00:17:05,691 INFO L280 TraceCheckUtils]: 18: Hoare triple {7408#true} havoc #t~nondet3; {7408#true} is VALID [2020-07-18 00:17:05,691 INFO L280 TraceCheckUtils]: 19: Hoare triple {7408#true} havoc ~lk4~0; {7408#true} is VALID [2020-07-18 00:17:05,692 INFO L280 TraceCheckUtils]: 20: Hoare triple {7408#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,692 INFO L280 TraceCheckUtils]: 21: Hoare triple {7408#true} ~p5~0 := #t~nondet4; {7408#true} is VALID [2020-07-18 00:17:05,692 INFO L280 TraceCheckUtils]: 22: Hoare triple {7408#true} havoc #t~nondet4; {7408#true} is VALID [2020-07-18 00:17:05,692 INFO L280 TraceCheckUtils]: 23: Hoare triple {7408#true} havoc ~lk5~0; {7408#true} is VALID [2020-07-18 00:17:05,693 INFO L280 TraceCheckUtils]: 24: Hoare triple {7408#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,693 INFO L280 TraceCheckUtils]: 25: Hoare triple {7408#true} ~p6~0 := #t~nondet5; {7408#true} is VALID [2020-07-18 00:17:05,693 INFO L280 TraceCheckUtils]: 26: Hoare triple {7408#true} havoc #t~nondet5; {7408#true} is VALID [2020-07-18 00:17:05,693 INFO L280 TraceCheckUtils]: 27: Hoare triple {7408#true} havoc ~lk6~0; {7408#true} is VALID [2020-07-18 00:17:05,694 INFO L280 TraceCheckUtils]: 28: Hoare triple {7408#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,694 INFO L280 TraceCheckUtils]: 29: Hoare triple {7408#true} ~p7~0 := #t~nondet6; {7408#true} is VALID [2020-07-18 00:17:05,694 INFO L280 TraceCheckUtils]: 30: Hoare triple {7408#true} havoc #t~nondet6; {7408#true} is VALID [2020-07-18 00:17:05,694 INFO L280 TraceCheckUtils]: 31: Hoare triple {7408#true} havoc ~lk7~0; {7408#true} is VALID [2020-07-18 00:17:05,695 INFO L280 TraceCheckUtils]: 32: Hoare triple {7408#true} havoc ~cond~0; {7408#true} is VALID [2020-07-18 00:17:05,695 INFO L280 TraceCheckUtils]: 33: Hoare triple {7408#true} assume !false; {7408#true} is VALID [2020-07-18 00:17:05,695 INFO L280 TraceCheckUtils]: 34: Hoare triple {7408#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {7408#true} is VALID [2020-07-18 00:17:05,695 INFO L280 TraceCheckUtils]: 35: Hoare triple {7408#true} ~cond~0 := #t~nondet7; {7408#true} is VALID [2020-07-18 00:17:05,696 INFO L280 TraceCheckUtils]: 36: Hoare triple {7408#true} havoc #t~nondet7; {7408#true} is VALID [2020-07-18 00:17:05,696 INFO L280 TraceCheckUtils]: 37: Hoare triple {7408#true} assume !(0 == ~cond~0); {7408#true} is VALID [2020-07-18 00:17:05,696 INFO L280 TraceCheckUtils]: 38: Hoare triple {7408#true} ~lk1~0 := 0; {7408#true} is VALID [2020-07-18 00:17:05,696 INFO L280 TraceCheckUtils]: 39: Hoare triple {7408#true} ~lk2~0 := 0; {7408#true} is VALID [2020-07-18 00:17:05,697 INFO L280 TraceCheckUtils]: 40: Hoare triple {7408#true} ~lk3~0 := 0; {7408#true} is VALID [2020-07-18 00:17:05,697 INFO L280 TraceCheckUtils]: 41: Hoare triple {7408#true} ~lk4~0 := 0; {7408#true} is VALID [2020-07-18 00:17:05,697 INFO L280 TraceCheckUtils]: 42: Hoare triple {7408#true} ~lk5~0 := 0; {7408#true} is VALID [2020-07-18 00:17:05,697 INFO L280 TraceCheckUtils]: 43: Hoare triple {7408#true} ~lk6~0 := 0; {7408#true} is VALID [2020-07-18 00:17:05,698 INFO L280 TraceCheckUtils]: 44: Hoare triple {7408#true} ~lk7~0 := 0; {7408#true} is VALID [2020-07-18 00:17:05,698 INFO L280 TraceCheckUtils]: 45: Hoare triple {7408#true} assume !(0 != ~p1~0); {7408#true} is VALID [2020-07-18 00:17:05,698 INFO L280 TraceCheckUtils]: 46: Hoare triple {7408#true} assume !(0 != ~p2~0); {7408#true} is VALID [2020-07-18 00:17:05,700 INFO L280 TraceCheckUtils]: 47: Hoare triple {7408#true} assume 0 != ~p3~0; {7408#true} is VALID [2020-07-18 00:17:05,703 INFO L280 TraceCheckUtils]: 48: Hoare triple {7408#true} ~lk3~0 := 1; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,704 INFO L280 TraceCheckUtils]: 49: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p4~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,704 INFO L280 TraceCheckUtils]: 50: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p5~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,705 INFO L280 TraceCheckUtils]: 51: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p6~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,706 INFO L280 TraceCheckUtils]: 52: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p7~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,707 INFO L280 TraceCheckUtils]: 53: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p1~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,708 INFO L280 TraceCheckUtils]: 54: Hoare triple {7412#(= 1 main_~lk3~0)} assume !(0 != ~p2~0); {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,708 INFO L280 TraceCheckUtils]: 55: Hoare triple {7412#(= 1 main_~lk3~0)} assume 0 != ~p3~0; {7412#(= 1 main_~lk3~0)} is VALID [2020-07-18 00:17:05,709 INFO L280 TraceCheckUtils]: 56: Hoare triple {7412#(= 1 main_~lk3~0)} assume 1 != ~lk3~0; {7409#false} is VALID [2020-07-18 00:17:05,709 INFO L280 TraceCheckUtils]: 57: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2020-07-18 00:17:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:05,713 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:05,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112291783] [2020-07-18 00:17:05,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:05,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:05,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832658392] [2020-07-18 00:17:05,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 00:17:05,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:05,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:05,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:05,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:05,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:05,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:05,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:05,780 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-07-18 00:17:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:06,737 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-07-18 00:17:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:06,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 00:17:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-18 00:17:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2020-07-18 00:17:06,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2020-07-18 00:17:06,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:06,934 INFO L225 Difference]: With dead ends: 459 [2020-07-18 00:17:06,935 INFO L226 Difference]: Without dead ends: 457 [2020-07-18 00:17:06,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:06,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-07-18 00:17:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-07-18 00:17:07,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:07,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand 375 states. [2020-07-18 00:17:07,558 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand 375 states. [2020-07-18 00:17:07,558 INFO L87 Difference]: Start difference. First operand 457 states. Second operand 375 states. [2020-07-18 00:17:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:07,577 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-18 00:17:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-18 00:17:07,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:07,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:07,579 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand 457 states. [2020-07-18 00:17:07,579 INFO L87 Difference]: Start difference. First operand 375 states. Second operand 457 states. [2020-07-18 00:17:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:07,596 INFO L93 Difference]: Finished difference Result 457 states and 607 transitions. [2020-07-18 00:17:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 607 transitions. [2020-07-18 00:17:07,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:07,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:07,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:07,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-18 00:17:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-07-18 00:17:07,610 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-07-18 00:17:07,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:07,610 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-07-18 00:17:07,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:07,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 375 states and 494 transitions. [2020-07-18 00:17:08,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-07-18 00:17:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 00:17:08,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:08,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:08,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:17:08,221 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:08,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:08,222 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-07-18 00:17:08,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:08,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1530933224] [2020-07-18 00:17:08,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:08,285 INFO L280 TraceCheckUtils]: 0: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-18 00:17:08,285 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-18 00:17:08,286 INFO L263 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2020-07-18 00:17:08,286 INFO L280 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2020-07-18 00:17:08,286 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #199#return; {9997#true} is VALID [2020-07-18 00:17:08,286 INFO L263 TraceCheckUtils]: 3: Hoare triple {9997#true} call #t~ret8 := main(); {9997#true} is VALID [2020-07-18 00:17:08,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {9997#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,287 INFO L280 TraceCheckUtils]: 5: Hoare triple {9997#true} ~p1~0 := #t~nondet0; {9997#true} is VALID [2020-07-18 00:17:08,287 INFO L280 TraceCheckUtils]: 6: Hoare triple {9997#true} havoc #t~nondet0; {9997#true} is VALID [2020-07-18 00:17:08,287 INFO L280 TraceCheckUtils]: 7: Hoare triple {9997#true} havoc ~lk1~0; {9997#true} is VALID [2020-07-18 00:17:08,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {9997#true} ~p2~0 := #t~nondet1; {9997#true} is VALID [2020-07-18 00:17:08,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {9997#true} havoc #t~nondet1; {9997#true} is VALID [2020-07-18 00:17:08,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {9997#true} havoc ~lk2~0; {9997#true} is VALID [2020-07-18 00:17:08,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {9997#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {9997#true} ~p3~0 := #t~nondet2; {9997#true} is VALID [2020-07-18 00:17:08,288 INFO L280 TraceCheckUtils]: 14: Hoare triple {9997#true} havoc #t~nondet2; {9997#true} is VALID [2020-07-18 00:17:08,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {9997#true} havoc ~lk3~0; {9997#true} is VALID [2020-07-18 00:17:08,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {9997#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {9997#true} ~p4~0 := #t~nondet3; {9997#true} is VALID [2020-07-18 00:17:08,289 INFO L280 TraceCheckUtils]: 18: Hoare triple {9997#true} havoc #t~nondet3; {9997#true} is VALID [2020-07-18 00:17:08,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {9997#true} havoc ~lk4~0; {9997#true} is VALID [2020-07-18 00:17:08,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {9997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,289 INFO L280 TraceCheckUtils]: 21: Hoare triple {9997#true} ~p5~0 := #t~nondet4; {9997#true} is VALID [2020-07-18 00:17:08,289 INFO L280 TraceCheckUtils]: 22: Hoare triple {9997#true} havoc #t~nondet4; {9997#true} is VALID [2020-07-18 00:17:08,289 INFO L280 TraceCheckUtils]: 23: Hoare triple {9997#true} havoc ~lk5~0; {9997#true} is VALID [2020-07-18 00:17:08,290 INFO L280 TraceCheckUtils]: 24: Hoare triple {9997#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,290 INFO L280 TraceCheckUtils]: 25: Hoare triple {9997#true} ~p6~0 := #t~nondet5; {9997#true} is VALID [2020-07-18 00:17:08,290 INFO L280 TraceCheckUtils]: 26: Hoare triple {9997#true} havoc #t~nondet5; {9997#true} is VALID [2020-07-18 00:17:08,290 INFO L280 TraceCheckUtils]: 27: Hoare triple {9997#true} havoc ~lk6~0; {9997#true} is VALID [2020-07-18 00:17:08,290 INFO L280 TraceCheckUtils]: 28: Hoare triple {9997#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,290 INFO L280 TraceCheckUtils]: 29: Hoare triple {9997#true} ~p7~0 := #t~nondet6; {9997#true} is VALID [2020-07-18 00:17:08,292 INFO L280 TraceCheckUtils]: 30: Hoare triple {9997#true} havoc #t~nondet6; {9997#true} is VALID [2020-07-18 00:17:08,292 INFO L280 TraceCheckUtils]: 31: Hoare triple {9997#true} havoc ~lk7~0; {9997#true} is VALID [2020-07-18 00:17:08,293 INFO L280 TraceCheckUtils]: 32: Hoare triple {9997#true} havoc ~cond~0; {9997#true} is VALID [2020-07-18 00:17:08,293 INFO L280 TraceCheckUtils]: 33: Hoare triple {9997#true} assume !false; {9997#true} is VALID [2020-07-18 00:17:08,293 INFO L280 TraceCheckUtils]: 34: Hoare triple {9997#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {9997#true} is VALID [2020-07-18 00:17:08,293 INFO L280 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond~0 := #t~nondet7; {9997#true} is VALID [2020-07-18 00:17:08,294 INFO L280 TraceCheckUtils]: 36: Hoare triple {9997#true} havoc #t~nondet7; {9997#true} is VALID [2020-07-18 00:17:08,294 INFO L280 TraceCheckUtils]: 37: Hoare triple {9997#true} assume !(0 == ~cond~0); {9997#true} is VALID [2020-07-18 00:17:08,294 INFO L280 TraceCheckUtils]: 38: Hoare triple {9997#true} ~lk1~0 := 0; {9997#true} is VALID [2020-07-18 00:17:08,294 INFO L280 TraceCheckUtils]: 39: Hoare triple {9997#true} ~lk2~0 := 0; {9997#true} is VALID [2020-07-18 00:17:08,294 INFO L280 TraceCheckUtils]: 40: Hoare triple {9997#true} ~lk3~0 := 0; {9997#true} is VALID [2020-07-18 00:17:08,295 INFO L280 TraceCheckUtils]: 41: Hoare triple {9997#true} ~lk4~0 := 0; {9997#true} is VALID [2020-07-18 00:17:08,295 INFO L280 TraceCheckUtils]: 42: Hoare triple {9997#true} ~lk5~0 := 0; {9997#true} is VALID [2020-07-18 00:17:08,295 INFO L280 TraceCheckUtils]: 43: Hoare triple {9997#true} ~lk6~0 := 0; {9997#true} is VALID [2020-07-18 00:17:08,295 INFO L280 TraceCheckUtils]: 44: Hoare triple {9997#true} ~lk7~0 := 0; {9997#true} is VALID [2020-07-18 00:17:08,296 INFO L280 TraceCheckUtils]: 45: Hoare triple {9997#true} assume !(0 != ~p1~0); {9997#true} is VALID [2020-07-18 00:17:08,296 INFO L280 TraceCheckUtils]: 46: Hoare triple {9997#true} assume !(0 != ~p2~0); {9997#true} is VALID [2020-07-18 00:17:08,296 INFO L280 TraceCheckUtils]: 47: Hoare triple {9997#true} assume !(0 != ~p3~0); {9997#true} is VALID [2020-07-18 00:17:08,296 INFO L280 TraceCheckUtils]: 48: Hoare triple {9997#true} assume !(0 != ~p4~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:08,297 INFO L280 TraceCheckUtils]: 49: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p5~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:08,297 INFO L280 TraceCheckUtils]: 50: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p6~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:08,298 INFO L280 TraceCheckUtils]: 51: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p7~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:08,298 INFO L280 TraceCheckUtils]: 52: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p1~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:08,298 INFO L280 TraceCheckUtils]: 53: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p2~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:08,299 INFO L280 TraceCheckUtils]: 54: Hoare triple {10001#(= 0 main_~p4~0)} assume !(0 != ~p3~0); {10001#(= 0 main_~p4~0)} is VALID [2020-07-18 00:17:08,299 INFO L280 TraceCheckUtils]: 55: Hoare triple {10001#(= 0 main_~p4~0)} assume 0 != ~p4~0; {9998#false} is VALID [2020-07-18 00:17:08,300 INFO L280 TraceCheckUtils]: 56: Hoare triple {9998#false} assume 1 != ~lk4~0; {9998#false} is VALID [2020-07-18 00:17:08,300 INFO L280 TraceCheckUtils]: 57: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2020-07-18 00:17:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:08,302 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:08,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1530933224] [2020-07-18 00:17:08,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:08,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:08,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349948108] [2020-07-18 00:17:08,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 00:17:08,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:08,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:08,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:08,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:08,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:08,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:08,357 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-07-18 00:17:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:09,986 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-07-18 00:17:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:09,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-18 00:17:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-18 00:17:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2020-07-18 00:17:09,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2020-07-18 00:17:10,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:10,257 INFO L225 Difference]: With dead ends: 1035 [2020-07-18 00:17:10,258 INFO L226 Difference]: Without dead ends: 693 [2020-07-18 00:17:10,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-18 00:17:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-07-18 00:17:11,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:11,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 693 states. Second operand 691 states. [2020-07-18 00:17:11,466 INFO L74 IsIncluded]: Start isIncluded. First operand 693 states. Second operand 691 states. [2020-07-18 00:17:11,466 INFO L87 Difference]: Start difference. First operand 693 states. Second operand 691 states. [2020-07-18 00:17:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:11,505 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-18 00:17:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-18 00:17:11,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:11,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:11,507 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 693 states. [2020-07-18 00:17:11,507 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 693 states. [2020-07-18 00:17:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:11,540 INFO L93 Difference]: Finished difference Result 693 states and 907 transitions. [2020-07-18 00:17:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 907 transitions. [2020-07-18 00:17:11,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:11,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:11,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:11,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-18 00:17:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-07-18 00:17:11,575 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-07-18 00:17:11,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:11,576 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-07-18 00:17:11,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:11,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 906 transitions. [2020-07-18 00:17:12,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 906 edges. 906 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-07-18 00:17:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 00:17:12,722 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:12,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:12,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:17:12,723 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-07-18 00:17:12,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:12,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005550680] [2020-07-18 00:17:12,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:12,763 INFO L280 TraceCheckUtils]: 0: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-18 00:17:12,763 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-18 00:17:12,764 INFO L263 TraceCheckUtils]: 0: Hoare triple {14842#true} call ULTIMATE.init(); {14842#true} is VALID [2020-07-18 00:17:12,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {14842#true} assume true; {14842#true} is VALID [2020-07-18 00:17:12,764 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {14842#true} {14842#true} #199#return; {14842#true} is VALID [2020-07-18 00:17:12,764 INFO L263 TraceCheckUtils]: 3: Hoare triple {14842#true} call #t~ret8 := main(); {14842#true} is VALID [2020-07-18 00:17:12,765 INFO L280 TraceCheckUtils]: 4: Hoare triple {14842#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,765 INFO L280 TraceCheckUtils]: 5: Hoare triple {14842#true} ~p1~0 := #t~nondet0; {14842#true} is VALID [2020-07-18 00:17:12,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {14842#true} havoc #t~nondet0; {14842#true} is VALID [2020-07-18 00:17:12,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {14842#true} havoc ~lk1~0; {14842#true} is VALID [2020-07-18 00:17:12,765 INFO L280 TraceCheckUtils]: 8: Hoare triple {14842#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,766 INFO L280 TraceCheckUtils]: 9: Hoare triple {14842#true} ~p2~0 := #t~nondet1; {14842#true} is VALID [2020-07-18 00:17:12,766 INFO L280 TraceCheckUtils]: 10: Hoare triple {14842#true} havoc #t~nondet1; {14842#true} is VALID [2020-07-18 00:17:12,766 INFO L280 TraceCheckUtils]: 11: Hoare triple {14842#true} havoc ~lk2~0; {14842#true} is VALID [2020-07-18 00:17:12,767 INFO L280 TraceCheckUtils]: 12: Hoare triple {14842#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,767 INFO L280 TraceCheckUtils]: 13: Hoare triple {14842#true} ~p3~0 := #t~nondet2; {14842#true} is VALID [2020-07-18 00:17:12,768 INFO L280 TraceCheckUtils]: 14: Hoare triple {14842#true} havoc #t~nondet2; {14842#true} is VALID [2020-07-18 00:17:12,768 INFO L280 TraceCheckUtils]: 15: Hoare triple {14842#true} havoc ~lk3~0; {14842#true} is VALID [2020-07-18 00:17:12,768 INFO L280 TraceCheckUtils]: 16: Hoare triple {14842#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,768 INFO L280 TraceCheckUtils]: 17: Hoare triple {14842#true} ~p4~0 := #t~nondet3; {14842#true} is VALID [2020-07-18 00:17:12,768 INFO L280 TraceCheckUtils]: 18: Hoare triple {14842#true} havoc #t~nondet3; {14842#true} is VALID [2020-07-18 00:17:12,769 INFO L280 TraceCheckUtils]: 19: Hoare triple {14842#true} havoc ~lk4~0; {14842#true} is VALID [2020-07-18 00:17:12,769 INFO L280 TraceCheckUtils]: 20: Hoare triple {14842#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,769 INFO L280 TraceCheckUtils]: 21: Hoare triple {14842#true} ~p5~0 := #t~nondet4; {14842#true} is VALID [2020-07-18 00:17:12,769 INFO L280 TraceCheckUtils]: 22: Hoare triple {14842#true} havoc #t~nondet4; {14842#true} is VALID [2020-07-18 00:17:12,770 INFO L280 TraceCheckUtils]: 23: Hoare triple {14842#true} havoc ~lk5~0; {14842#true} is VALID [2020-07-18 00:17:12,770 INFO L280 TraceCheckUtils]: 24: Hoare triple {14842#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,770 INFO L280 TraceCheckUtils]: 25: Hoare triple {14842#true} ~p6~0 := #t~nondet5; {14842#true} is VALID [2020-07-18 00:17:12,771 INFO L280 TraceCheckUtils]: 26: Hoare triple {14842#true} havoc #t~nondet5; {14842#true} is VALID [2020-07-18 00:17:12,771 INFO L280 TraceCheckUtils]: 27: Hoare triple {14842#true} havoc ~lk6~0; {14842#true} is VALID [2020-07-18 00:17:12,771 INFO L280 TraceCheckUtils]: 28: Hoare triple {14842#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,771 INFO L280 TraceCheckUtils]: 29: Hoare triple {14842#true} ~p7~0 := #t~nondet6; {14842#true} is VALID [2020-07-18 00:17:12,771 INFO L280 TraceCheckUtils]: 30: Hoare triple {14842#true} havoc #t~nondet6; {14842#true} is VALID [2020-07-18 00:17:12,772 INFO L280 TraceCheckUtils]: 31: Hoare triple {14842#true} havoc ~lk7~0; {14842#true} is VALID [2020-07-18 00:17:12,772 INFO L280 TraceCheckUtils]: 32: Hoare triple {14842#true} havoc ~cond~0; {14842#true} is VALID [2020-07-18 00:17:12,772 INFO L280 TraceCheckUtils]: 33: Hoare triple {14842#true} assume !false; {14842#true} is VALID [2020-07-18 00:17:12,772 INFO L280 TraceCheckUtils]: 34: Hoare triple {14842#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {14842#true} is VALID [2020-07-18 00:17:12,772 INFO L280 TraceCheckUtils]: 35: Hoare triple {14842#true} ~cond~0 := #t~nondet7; {14842#true} is VALID [2020-07-18 00:17:12,773 INFO L280 TraceCheckUtils]: 36: Hoare triple {14842#true} havoc #t~nondet7; {14842#true} is VALID [2020-07-18 00:17:12,773 INFO L280 TraceCheckUtils]: 37: Hoare triple {14842#true} assume !(0 == ~cond~0); {14842#true} is VALID [2020-07-18 00:17:12,773 INFO L280 TraceCheckUtils]: 38: Hoare triple {14842#true} ~lk1~0 := 0; {14842#true} is VALID [2020-07-18 00:17:12,773 INFO L280 TraceCheckUtils]: 39: Hoare triple {14842#true} ~lk2~0 := 0; {14842#true} is VALID [2020-07-18 00:17:12,774 INFO L280 TraceCheckUtils]: 40: Hoare triple {14842#true} ~lk3~0 := 0; {14842#true} is VALID [2020-07-18 00:17:12,774 INFO L280 TraceCheckUtils]: 41: Hoare triple {14842#true} ~lk4~0 := 0; {14842#true} is VALID [2020-07-18 00:17:12,774 INFO L280 TraceCheckUtils]: 42: Hoare triple {14842#true} ~lk5~0 := 0; {14842#true} is VALID [2020-07-18 00:17:12,774 INFO L280 TraceCheckUtils]: 43: Hoare triple {14842#true} ~lk6~0 := 0; {14842#true} is VALID [2020-07-18 00:17:12,774 INFO L280 TraceCheckUtils]: 44: Hoare triple {14842#true} ~lk7~0 := 0; {14842#true} is VALID [2020-07-18 00:17:12,775 INFO L280 TraceCheckUtils]: 45: Hoare triple {14842#true} assume !(0 != ~p1~0); {14842#true} is VALID [2020-07-18 00:17:12,775 INFO L280 TraceCheckUtils]: 46: Hoare triple {14842#true} assume !(0 != ~p2~0); {14842#true} is VALID [2020-07-18 00:17:12,775 INFO L280 TraceCheckUtils]: 47: Hoare triple {14842#true} assume !(0 != ~p3~0); {14842#true} is VALID [2020-07-18 00:17:12,775 INFO L280 TraceCheckUtils]: 48: Hoare triple {14842#true} assume 0 != ~p4~0; {14842#true} is VALID [2020-07-18 00:17:12,776 INFO L280 TraceCheckUtils]: 49: Hoare triple {14842#true} ~lk4~0 := 1; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,777 INFO L280 TraceCheckUtils]: 50: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p5~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,777 INFO L280 TraceCheckUtils]: 51: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p6~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,780 INFO L280 TraceCheckUtils]: 52: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p7~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,784 INFO L280 TraceCheckUtils]: 53: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p1~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,784 INFO L280 TraceCheckUtils]: 54: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p2~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,785 INFO L280 TraceCheckUtils]: 55: Hoare triple {14846#(= 1 main_~lk4~0)} assume !(0 != ~p3~0); {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,786 INFO L280 TraceCheckUtils]: 56: Hoare triple {14846#(= 1 main_~lk4~0)} assume 0 != ~p4~0; {14846#(= 1 main_~lk4~0)} is VALID [2020-07-18 00:17:12,786 INFO L280 TraceCheckUtils]: 57: Hoare triple {14846#(= 1 main_~lk4~0)} assume 1 != ~lk4~0; {14843#false} is VALID [2020-07-18 00:17:12,786 INFO L280 TraceCheckUtils]: 58: Hoare triple {14843#false} assume !false; {14843#false} is VALID [2020-07-18 00:17:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:12,789 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:12,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005550680] [2020-07-18 00:17:12,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:12,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:12,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437499331] [2020-07-18 00:17:12,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 00:17:12,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:12,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:12,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:12,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:12,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:12,839 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-07-18 00:17:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:14,630 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-07-18 00:17:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:14,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 00:17:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:14,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-18 00:17:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2020-07-18 00:17:14,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2020-07-18 00:17:14,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:14,873 INFO L225 Difference]: With dead ends: 839 [2020-07-18 00:17:14,873 INFO L226 Difference]: Without dead ends: 837 [2020-07-18 00:17:14,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-07-18 00:17:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-07-18 00:17:16,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:16,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 837 states. Second operand 691 states. [2020-07-18 00:17:16,229 INFO L74 IsIncluded]: Start isIncluded. First operand 837 states. Second operand 691 states. [2020-07-18 00:17:16,229 INFO L87 Difference]: Start difference. First operand 837 states. Second operand 691 states. [2020-07-18 00:17:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:16,269 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-18 00:17:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-18 00:17:16,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:16,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:16,272 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand 837 states. [2020-07-18 00:17:16,272 INFO L87 Difference]: Start difference. First operand 691 states. Second operand 837 states. [2020-07-18 00:17:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:16,310 INFO L93 Difference]: Finished difference Result 837 states and 1091 transitions. [2020-07-18 00:17:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1091 transitions. [2020-07-18 00:17:16,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:16,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:16,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:16,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-18 00:17:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-07-18 00:17:16,343 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-07-18 00:17:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:16,344 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-07-18 00:17:16,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:16,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 691 states and 898 transitions. [2020-07-18 00:17:17,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 898 edges. 898 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-07-18 00:17:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 00:17:17,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:17,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:17,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:17:17,547 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-07-18 00:17:17,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:17,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627990090] [2020-07-18 00:17:17,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:17,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-18 00:17:17,663 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-18 00:17:17,664 INFO L263 TraceCheckUtils]: 0: Hoare triple {19583#true} call ULTIMATE.init(); {19583#true} is VALID [2020-07-18 00:17:17,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {19583#true} assume true; {19583#true} is VALID [2020-07-18 00:17:17,664 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19583#true} {19583#true} #199#return; {19583#true} is VALID [2020-07-18 00:17:17,665 INFO L263 TraceCheckUtils]: 3: Hoare triple {19583#true} call #t~ret8 := main(); {19583#true} is VALID [2020-07-18 00:17:17,665 INFO L280 TraceCheckUtils]: 4: Hoare triple {19583#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,665 INFO L280 TraceCheckUtils]: 5: Hoare triple {19583#true} ~p1~0 := #t~nondet0; {19583#true} is VALID [2020-07-18 00:17:17,666 INFO L280 TraceCheckUtils]: 6: Hoare triple {19583#true} havoc #t~nondet0; {19583#true} is VALID [2020-07-18 00:17:17,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {19583#true} havoc ~lk1~0; {19583#true} is VALID [2020-07-18 00:17:17,667 INFO L280 TraceCheckUtils]: 8: Hoare triple {19583#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,667 INFO L280 TraceCheckUtils]: 9: Hoare triple {19583#true} ~p2~0 := #t~nondet1; {19583#true} is VALID [2020-07-18 00:17:17,667 INFO L280 TraceCheckUtils]: 10: Hoare triple {19583#true} havoc #t~nondet1; {19583#true} is VALID [2020-07-18 00:17:17,668 INFO L280 TraceCheckUtils]: 11: Hoare triple {19583#true} havoc ~lk2~0; {19583#true} is VALID [2020-07-18 00:17:17,668 INFO L280 TraceCheckUtils]: 12: Hoare triple {19583#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,668 INFO L280 TraceCheckUtils]: 13: Hoare triple {19583#true} ~p3~0 := #t~nondet2; {19583#true} is VALID [2020-07-18 00:17:17,669 INFO L280 TraceCheckUtils]: 14: Hoare triple {19583#true} havoc #t~nondet2; {19583#true} is VALID [2020-07-18 00:17:17,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {19583#true} havoc ~lk3~0; {19583#true} is VALID [2020-07-18 00:17:17,670 INFO L280 TraceCheckUtils]: 16: Hoare triple {19583#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {19583#true} ~p4~0 := #t~nondet3; {19583#true} is VALID [2020-07-18 00:17:17,670 INFO L280 TraceCheckUtils]: 18: Hoare triple {19583#true} havoc #t~nondet3; {19583#true} is VALID [2020-07-18 00:17:17,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {19583#true} havoc ~lk4~0; {19583#true} is VALID [2020-07-18 00:17:17,671 INFO L280 TraceCheckUtils]: 20: Hoare triple {19583#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {19583#true} ~p5~0 := #t~nondet4; {19583#true} is VALID [2020-07-18 00:17:17,672 INFO L280 TraceCheckUtils]: 22: Hoare triple {19583#true} havoc #t~nondet4; {19583#true} is VALID [2020-07-18 00:17:17,672 INFO L280 TraceCheckUtils]: 23: Hoare triple {19583#true} havoc ~lk5~0; {19583#true} is VALID [2020-07-18 00:17:17,672 INFO L280 TraceCheckUtils]: 24: Hoare triple {19583#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,673 INFO L280 TraceCheckUtils]: 25: Hoare triple {19583#true} ~p6~0 := #t~nondet5; {19583#true} is VALID [2020-07-18 00:17:17,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {19583#true} havoc #t~nondet5; {19583#true} is VALID [2020-07-18 00:17:17,673 INFO L280 TraceCheckUtils]: 27: Hoare triple {19583#true} havoc ~lk6~0; {19583#true} is VALID [2020-07-18 00:17:17,674 INFO L280 TraceCheckUtils]: 28: Hoare triple {19583#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,674 INFO L280 TraceCheckUtils]: 29: Hoare triple {19583#true} ~p7~0 := #t~nondet6; {19583#true} is VALID [2020-07-18 00:17:17,674 INFO L280 TraceCheckUtils]: 30: Hoare triple {19583#true} havoc #t~nondet6; {19583#true} is VALID [2020-07-18 00:17:17,675 INFO L280 TraceCheckUtils]: 31: Hoare triple {19583#true} havoc ~lk7~0; {19583#true} is VALID [2020-07-18 00:17:17,675 INFO L280 TraceCheckUtils]: 32: Hoare triple {19583#true} havoc ~cond~0; {19583#true} is VALID [2020-07-18 00:17:17,675 INFO L280 TraceCheckUtils]: 33: Hoare triple {19583#true} assume !false; {19583#true} is VALID [2020-07-18 00:17:17,676 INFO L280 TraceCheckUtils]: 34: Hoare triple {19583#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {19583#true} is VALID [2020-07-18 00:17:17,676 INFO L280 TraceCheckUtils]: 35: Hoare triple {19583#true} ~cond~0 := #t~nondet7; {19583#true} is VALID [2020-07-18 00:17:17,681 INFO L280 TraceCheckUtils]: 36: Hoare triple {19583#true} havoc #t~nondet7; {19583#true} is VALID [2020-07-18 00:17:17,682 INFO L280 TraceCheckUtils]: 37: Hoare triple {19583#true} assume !(0 == ~cond~0); {19583#true} is VALID [2020-07-18 00:17:17,682 INFO L280 TraceCheckUtils]: 38: Hoare triple {19583#true} ~lk1~0 := 0; {19583#true} is VALID [2020-07-18 00:17:17,682 INFO L280 TraceCheckUtils]: 39: Hoare triple {19583#true} ~lk2~0 := 0; {19583#true} is VALID [2020-07-18 00:17:17,682 INFO L280 TraceCheckUtils]: 40: Hoare triple {19583#true} ~lk3~0 := 0; {19583#true} is VALID [2020-07-18 00:17:17,683 INFO L280 TraceCheckUtils]: 41: Hoare triple {19583#true} ~lk4~0 := 0; {19583#true} is VALID [2020-07-18 00:17:17,683 INFO L280 TraceCheckUtils]: 42: Hoare triple {19583#true} ~lk5~0 := 0; {19583#true} is VALID [2020-07-18 00:17:17,686 INFO L280 TraceCheckUtils]: 43: Hoare triple {19583#true} ~lk6~0 := 0; {19583#true} is VALID [2020-07-18 00:17:17,687 INFO L280 TraceCheckUtils]: 44: Hoare triple {19583#true} ~lk7~0 := 0; {19583#true} is VALID [2020-07-18 00:17:17,687 INFO L280 TraceCheckUtils]: 45: Hoare triple {19583#true} assume !(0 != ~p1~0); {19583#true} is VALID [2020-07-18 00:17:17,687 INFO L280 TraceCheckUtils]: 46: Hoare triple {19583#true} assume !(0 != ~p2~0); {19583#true} is VALID [2020-07-18 00:17:17,687 INFO L280 TraceCheckUtils]: 47: Hoare triple {19583#true} assume !(0 != ~p3~0); {19583#true} is VALID [2020-07-18 00:17:17,688 INFO L280 TraceCheckUtils]: 48: Hoare triple {19583#true} assume !(0 != ~p4~0); {19583#true} is VALID [2020-07-18 00:17:17,700 INFO L280 TraceCheckUtils]: 49: Hoare triple {19583#true} assume !(0 != ~p5~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:17,710 INFO L280 TraceCheckUtils]: 50: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p6~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:17,716 INFO L280 TraceCheckUtils]: 51: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p7~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:17,717 INFO L280 TraceCheckUtils]: 52: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p1~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:17,719 INFO L280 TraceCheckUtils]: 53: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p2~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:17,720 INFO L280 TraceCheckUtils]: 54: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p3~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:17,721 INFO L280 TraceCheckUtils]: 55: Hoare triple {19587#(= 0 main_~p5~0)} assume !(0 != ~p4~0); {19587#(= 0 main_~p5~0)} is VALID [2020-07-18 00:17:17,722 INFO L280 TraceCheckUtils]: 56: Hoare triple {19587#(= 0 main_~p5~0)} assume 0 != ~p5~0; {19584#false} is VALID [2020-07-18 00:17:17,722 INFO L280 TraceCheckUtils]: 57: Hoare triple {19584#false} assume 1 != ~lk5~0; {19584#false} is VALID [2020-07-18 00:17:17,722 INFO L280 TraceCheckUtils]: 58: Hoare triple {19584#false} assume !false; {19584#false} is VALID [2020-07-18 00:17:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:17,725 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:17,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [627990090] [2020-07-18 00:17:17,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:17,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:17,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518548467] [2020-07-18 00:17:17,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 00:17:17,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:17,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:17,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:17,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:17,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:17,808 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-07-18 00:17:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:21,221 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-07-18 00:17:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:21,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-18 00:17:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-18 00:17:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2020-07-18 00:17:21,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2020-07-18 00:17:21,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:21,526 INFO L225 Difference]: With dead ends: 1959 [2020-07-18 00:17:21,526 INFO L226 Difference]: Without dead ends: 1301 [2020-07-18 00:17:21,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-07-18 00:17:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-07-18 00:17:24,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:24,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1301 states. Second operand 1299 states. [2020-07-18 00:17:24,376 INFO L74 IsIncluded]: Start isIncluded. First operand 1301 states. Second operand 1299 states. [2020-07-18 00:17:24,376 INFO L87 Difference]: Start difference. First operand 1301 states. Second operand 1299 states. [2020-07-18 00:17:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:24,434 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-18 00:17:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-18 00:17:24,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:24,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:24,437 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1301 states. [2020-07-18 00:17:24,437 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1301 states. [2020-07-18 00:17:24,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:24,522 INFO L93 Difference]: Finished difference Result 1301 states and 1667 transitions. [2020-07-18 00:17:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1667 transitions. [2020-07-18 00:17:24,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:24,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:24,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:24,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-18 00:17:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-07-18 00:17:24,587 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-07-18 00:17:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:24,588 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-07-18 00:17:24,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:24,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1666 transitions. [2020-07-18 00:17:26,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1666 edges. 1666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-07-18 00:17:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-18 00:17:26,737 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:26,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:26,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:17:26,738 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:26,739 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-07-18 00:17:26,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:26,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1879626899] [2020-07-18 00:17:26,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:26,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-18 00:17:26,795 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-18 00:17:26,795 INFO L263 TraceCheckUtils]: 0: Hoare triple {28708#true} call ULTIMATE.init(); {28708#true} is VALID [2020-07-18 00:17:26,795 INFO L280 TraceCheckUtils]: 1: Hoare triple {28708#true} assume true; {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {28708#true} {28708#true} #199#return; {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L263 TraceCheckUtils]: 3: Hoare triple {28708#true} call #t~ret8 := main(); {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L280 TraceCheckUtils]: 4: Hoare triple {28708#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L280 TraceCheckUtils]: 5: Hoare triple {28708#true} ~p1~0 := #t~nondet0; {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {28708#true} havoc #t~nondet0; {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L280 TraceCheckUtils]: 7: Hoare triple {28708#true} havoc ~lk1~0; {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L280 TraceCheckUtils]: 8: Hoare triple {28708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {28708#true} ~p2~0 := #t~nondet1; {28708#true} is VALID [2020-07-18 00:17:26,797 INFO L280 TraceCheckUtils]: 10: Hoare triple {28708#true} havoc #t~nondet1; {28708#true} is VALID [2020-07-18 00:17:26,797 INFO L280 TraceCheckUtils]: 11: Hoare triple {28708#true} havoc ~lk2~0; {28708#true} is VALID [2020-07-18 00:17:26,797 INFO L280 TraceCheckUtils]: 12: Hoare triple {28708#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {28708#true} ~p3~0 := #t~nondet2; {28708#true} is VALID [2020-07-18 00:17:26,797 INFO L280 TraceCheckUtils]: 14: Hoare triple {28708#true} havoc #t~nondet2; {28708#true} is VALID [2020-07-18 00:17:26,797 INFO L280 TraceCheckUtils]: 15: Hoare triple {28708#true} havoc ~lk3~0; {28708#true} is VALID [2020-07-18 00:17:26,797 INFO L280 TraceCheckUtils]: 16: Hoare triple {28708#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,798 INFO L280 TraceCheckUtils]: 17: Hoare triple {28708#true} ~p4~0 := #t~nondet3; {28708#true} is VALID [2020-07-18 00:17:26,798 INFO L280 TraceCheckUtils]: 18: Hoare triple {28708#true} havoc #t~nondet3; {28708#true} is VALID [2020-07-18 00:17:26,798 INFO L280 TraceCheckUtils]: 19: Hoare triple {28708#true} havoc ~lk4~0; {28708#true} is VALID [2020-07-18 00:17:26,798 INFO L280 TraceCheckUtils]: 20: Hoare triple {28708#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,798 INFO L280 TraceCheckUtils]: 21: Hoare triple {28708#true} ~p5~0 := #t~nondet4; {28708#true} is VALID [2020-07-18 00:17:26,798 INFO L280 TraceCheckUtils]: 22: Hoare triple {28708#true} havoc #t~nondet4; {28708#true} is VALID [2020-07-18 00:17:26,799 INFO L280 TraceCheckUtils]: 23: Hoare triple {28708#true} havoc ~lk5~0; {28708#true} is VALID [2020-07-18 00:17:26,799 INFO L280 TraceCheckUtils]: 24: Hoare triple {28708#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {28708#true} ~p6~0 := #t~nondet5; {28708#true} is VALID [2020-07-18 00:17:26,799 INFO L280 TraceCheckUtils]: 26: Hoare triple {28708#true} havoc #t~nondet5; {28708#true} is VALID [2020-07-18 00:17:26,799 INFO L280 TraceCheckUtils]: 27: Hoare triple {28708#true} havoc ~lk6~0; {28708#true} is VALID [2020-07-18 00:17:26,800 INFO L280 TraceCheckUtils]: 28: Hoare triple {28708#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,800 INFO L280 TraceCheckUtils]: 29: Hoare triple {28708#true} ~p7~0 := #t~nondet6; {28708#true} is VALID [2020-07-18 00:17:26,800 INFO L280 TraceCheckUtils]: 30: Hoare triple {28708#true} havoc #t~nondet6; {28708#true} is VALID [2020-07-18 00:17:26,800 INFO L280 TraceCheckUtils]: 31: Hoare triple {28708#true} havoc ~lk7~0; {28708#true} is VALID [2020-07-18 00:17:26,800 INFO L280 TraceCheckUtils]: 32: Hoare triple {28708#true} havoc ~cond~0; {28708#true} is VALID [2020-07-18 00:17:26,801 INFO L280 TraceCheckUtils]: 33: Hoare triple {28708#true} assume !false; {28708#true} is VALID [2020-07-18 00:17:26,801 INFO L280 TraceCheckUtils]: 34: Hoare triple {28708#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {28708#true} is VALID [2020-07-18 00:17:26,801 INFO L280 TraceCheckUtils]: 35: Hoare triple {28708#true} ~cond~0 := #t~nondet7; {28708#true} is VALID [2020-07-18 00:17:26,801 INFO L280 TraceCheckUtils]: 36: Hoare triple {28708#true} havoc #t~nondet7; {28708#true} is VALID [2020-07-18 00:17:26,801 INFO L280 TraceCheckUtils]: 37: Hoare triple {28708#true} assume !(0 == ~cond~0); {28708#true} is VALID [2020-07-18 00:17:26,802 INFO L280 TraceCheckUtils]: 38: Hoare triple {28708#true} ~lk1~0 := 0; {28708#true} is VALID [2020-07-18 00:17:26,802 INFO L280 TraceCheckUtils]: 39: Hoare triple {28708#true} ~lk2~0 := 0; {28708#true} is VALID [2020-07-18 00:17:26,802 INFO L280 TraceCheckUtils]: 40: Hoare triple {28708#true} ~lk3~0 := 0; {28708#true} is VALID [2020-07-18 00:17:26,802 INFO L280 TraceCheckUtils]: 41: Hoare triple {28708#true} ~lk4~0 := 0; {28708#true} is VALID [2020-07-18 00:17:26,802 INFO L280 TraceCheckUtils]: 42: Hoare triple {28708#true} ~lk5~0 := 0; {28708#true} is VALID [2020-07-18 00:17:26,802 INFO L280 TraceCheckUtils]: 43: Hoare triple {28708#true} ~lk6~0 := 0; {28708#true} is VALID [2020-07-18 00:17:26,803 INFO L280 TraceCheckUtils]: 44: Hoare triple {28708#true} ~lk7~0 := 0; {28708#true} is VALID [2020-07-18 00:17:26,803 INFO L280 TraceCheckUtils]: 45: Hoare triple {28708#true} assume !(0 != ~p1~0); {28708#true} is VALID [2020-07-18 00:17:26,803 INFO L280 TraceCheckUtils]: 46: Hoare triple {28708#true} assume !(0 != ~p2~0); {28708#true} is VALID [2020-07-18 00:17:26,803 INFO L280 TraceCheckUtils]: 47: Hoare triple {28708#true} assume !(0 != ~p3~0); {28708#true} is VALID [2020-07-18 00:17:26,803 INFO L280 TraceCheckUtils]: 48: Hoare triple {28708#true} assume !(0 != ~p4~0); {28708#true} is VALID [2020-07-18 00:17:26,804 INFO L280 TraceCheckUtils]: 49: Hoare triple {28708#true} assume 0 != ~p5~0; {28708#true} is VALID [2020-07-18 00:17:26,804 INFO L280 TraceCheckUtils]: 50: Hoare triple {28708#true} ~lk5~0 := 1; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,805 INFO L280 TraceCheckUtils]: 51: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p6~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,806 INFO L280 TraceCheckUtils]: 52: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p7~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,807 INFO L280 TraceCheckUtils]: 53: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p1~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,807 INFO L280 TraceCheckUtils]: 54: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p2~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,808 INFO L280 TraceCheckUtils]: 55: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p3~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,808 INFO L280 TraceCheckUtils]: 56: Hoare triple {28712#(= 1 main_~lk5~0)} assume !(0 != ~p4~0); {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,809 INFO L280 TraceCheckUtils]: 57: Hoare triple {28712#(= 1 main_~lk5~0)} assume 0 != ~p5~0; {28712#(= 1 main_~lk5~0)} is VALID [2020-07-18 00:17:26,809 INFO L280 TraceCheckUtils]: 58: Hoare triple {28712#(= 1 main_~lk5~0)} assume 1 != ~lk5~0; {28709#false} is VALID [2020-07-18 00:17:26,810 INFO L280 TraceCheckUtils]: 59: Hoare triple {28709#false} assume !false; {28709#false} is VALID [2020-07-18 00:17:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:26,812 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:26,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1879626899] [2020-07-18 00:17:26,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:26,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:26,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618733139] [2020-07-18 00:17:26,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 00:17:26,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:26,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:26,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:26,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:26,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:26,876 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-07-18 00:17:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:30,647 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-07-18 00:17:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:30,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 00:17:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-18 00:17:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2020-07-18 00:17:30,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2020-07-18 00:17:30,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:30,878 INFO L225 Difference]: With dead ends: 1559 [2020-07-18 00:17:30,878 INFO L226 Difference]: Without dead ends: 1557 [2020-07-18 00:17:30,879 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-07-18 00:17:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-07-18 00:17:34,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:34,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1557 states. Second operand 1299 states. [2020-07-18 00:17:34,004 INFO L74 IsIncluded]: Start isIncluded. First operand 1557 states. Second operand 1299 states. [2020-07-18 00:17:34,004 INFO L87 Difference]: Start difference. First operand 1557 states. Second operand 1299 states. [2020-07-18 00:17:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:34,090 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-18 00:17:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-18 00:17:34,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:34,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:34,093 INFO L74 IsIncluded]: Start isIncluded. First operand 1299 states. Second operand 1557 states. [2020-07-18 00:17:34,093 INFO L87 Difference]: Start difference. First operand 1299 states. Second operand 1557 states. [2020-07-18 00:17:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:34,182 INFO L93 Difference]: Finished difference Result 1557 states and 1971 transitions. [2020-07-18 00:17:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1971 transitions. [2020-07-18 00:17:34,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:34,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:34,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:34,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-18 00:17:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-07-18 00:17:34,237 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-07-18 00:17:34,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:34,237 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-07-18 00:17:34,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:34,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 1299 states and 1650 transitions. [2020-07-18 00:17:36,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1650 edges. 1650 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-07-18 00:17:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-18 00:17:36,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:36,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:36,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:17:36,445 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:36,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-07-18 00:17:36,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:36,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254976913] [2020-07-18 00:17:36,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:36,486 INFO L280 TraceCheckUtils]: 0: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-18 00:17:36,486 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-18 00:17:36,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {37545#true} call ULTIMATE.init(); {37545#true} is VALID [2020-07-18 00:17:36,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {37545#true} assume true; {37545#true} is VALID [2020-07-18 00:17:36,487 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {37545#true} {37545#true} #199#return; {37545#true} is VALID [2020-07-18 00:17:36,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {37545#true} call #t~ret8 := main(); {37545#true} is VALID [2020-07-18 00:17:36,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {37545#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {37545#true} ~p1~0 := #t~nondet0; {37545#true} is VALID [2020-07-18 00:17:36,488 INFO L280 TraceCheckUtils]: 6: Hoare triple {37545#true} havoc #t~nondet0; {37545#true} is VALID [2020-07-18 00:17:36,488 INFO L280 TraceCheckUtils]: 7: Hoare triple {37545#true} havoc ~lk1~0; {37545#true} is VALID [2020-07-18 00:17:36,488 INFO L280 TraceCheckUtils]: 8: Hoare triple {37545#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {37545#true} ~p2~0 := #t~nondet1; {37545#true} is VALID [2020-07-18 00:17:36,489 INFO L280 TraceCheckUtils]: 10: Hoare triple {37545#true} havoc #t~nondet1; {37545#true} is VALID [2020-07-18 00:17:36,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {37545#true} havoc ~lk2~0; {37545#true} is VALID [2020-07-18 00:17:36,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {37545#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,489 INFO L280 TraceCheckUtils]: 13: Hoare triple {37545#true} ~p3~0 := #t~nondet2; {37545#true} is VALID [2020-07-18 00:17:36,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {37545#true} havoc #t~nondet2; {37545#true} is VALID [2020-07-18 00:17:36,490 INFO L280 TraceCheckUtils]: 15: Hoare triple {37545#true} havoc ~lk3~0; {37545#true} is VALID [2020-07-18 00:17:36,490 INFO L280 TraceCheckUtils]: 16: Hoare triple {37545#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,490 INFO L280 TraceCheckUtils]: 17: Hoare triple {37545#true} ~p4~0 := #t~nondet3; {37545#true} is VALID [2020-07-18 00:17:36,490 INFO L280 TraceCheckUtils]: 18: Hoare triple {37545#true} havoc #t~nondet3; {37545#true} is VALID [2020-07-18 00:17:36,491 INFO L280 TraceCheckUtils]: 19: Hoare triple {37545#true} havoc ~lk4~0; {37545#true} is VALID [2020-07-18 00:17:36,491 INFO L280 TraceCheckUtils]: 20: Hoare triple {37545#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,491 INFO L280 TraceCheckUtils]: 21: Hoare triple {37545#true} ~p5~0 := #t~nondet4; {37545#true} is VALID [2020-07-18 00:17:36,491 INFO L280 TraceCheckUtils]: 22: Hoare triple {37545#true} havoc #t~nondet4; {37545#true} is VALID [2020-07-18 00:17:36,491 INFO L280 TraceCheckUtils]: 23: Hoare triple {37545#true} havoc ~lk5~0; {37545#true} is VALID [2020-07-18 00:17:36,492 INFO L280 TraceCheckUtils]: 24: Hoare triple {37545#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,492 INFO L280 TraceCheckUtils]: 25: Hoare triple {37545#true} ~p6~0 := #t~nondet5; {37545#true} is VALID [2020-07-18 00:17:36,492 INFO L280 TraceCheckUtils]: 26: Hoare triple {37545#true} havoc #t~nondet5; {37545#true} is VALID [2020-07-18 00:17:36,492 INFO L280 TraceCheckUtils]: 27: Hoare triple {37545#true} havoc ~lk6~0; {37545#true} is VALID [2020-07-18 00:17:36,492 INFO L280 TraceCheckUtils]: 28: Hoare triple {37545#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,493 INFO L280 TraceCheckUtils]: 29: Hoare triple {37545#true} ~p7~0 := #t~nondet6; {37545#true} is VALID [2020-07-18 00:17:36,493 INFO L280 TraceCheckUtils]: 30: Hoare triple {37545#true} havoc #t~nondet6; {37545#true} is VALID [2020-07-18 00:17:36,493 INFO L280 TraceCheckUtils]: 31: Hoare triple {37545#true} havoc ~lk7~0; {37545#true} is VALID [2020-07-18 00:17:36,493 INFO L280 TraceCheckUtils]: 32: Hoare triple {37545#true} havoc ~cond~0; {37545#true} is VALID [2020-07-18 00:17:36,493 INFO L280 TraceCheckUtils]: 33: Hoare triple {37545#true} assume !false; {37545#true} is VALID [2020-07-18 00:17:36,494 INFO L280 TraceCheckUtils]: 34: Hoare triple {37545#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {37545#true} is VALID [2020-07-18 00:17:36,494 INFO L280 TraceCheckUtils]: 35: Hoare triple {37545#true} ~cond~0 := #t~nondet7; {37545#true} is VALID [2020-07-18 00:17:36,494 INFO L280 TraceCheckUtils]: 36: Hoare triple {37545#true} havoc #t~nondet7; {37545#true} is VALID [2020-07-18 00:17:36,494 INFO L280 TraceCheckUtils]: 37: Hoare triple {37545#true} assume !(0 == ~cond~0); {37545#true} is VALID [2020-07-18 00:17:36,494 INFO L280 TraceCheckUtils]: 38: Hoare triple {37545#true} ~lk1~0 := 0; {37545#true} is VALID [2020-07-18 00:17:36,495 INFO L280 TraceCheckUtils]: 39: Hoare triple {37545#true} ~lk2~0 := 0; {37545#true} is VALID [2020-07-18 00:17:36,495 INFO L280 TraceCheckUtils]: 40: Hoare triple {37545#true} ~lk3~0 := 0; {37545#true} is VALID [2020-07-18 00:17:36,495 INFO L280 TraceCheckUtils]: 41: Hoare triple {37545#true} ~lk4~0 := 0; {37545#true} is VALID [2020-07-18 00:17:36,495 INFO L280 TraceCheckUtils]: 42: Hoare triple {37545#true} ~lk5~0 := 0; {37545#true} is VALID [2020-07-18 00:17:36,495 INFO L280 TraceCheckUtils]: 43: Hoare triple {37545#true} ~lk6~0 := 0; {37545#true} is VALID [2020-07-18 00:17:36,496 INFO L280 TraceCheckUtils]: 44: Hoare triple {37545#true} ~lk7~0 := 0; {37545#true} is VALID [2020-07-18 00:17:36,496 INFO L280 TraceCheckUtils]: 45: Hoare triple {37545#true} assume !(0 != ~p1~0); {37545#true} is VALID [2020-07-18 00:17:36,496 INFO L280 TraceCheckUtils]: 46: Hoare triple {37545#true} assume !(0 != ~p2~0); {37545#true} is VALID [2020-07-18 00:17:36,496 INFO L280 TraceCheckUtils]: 47: Hoare triple {37545#true} assume !(0 != ~p3~0); {37545#true} is VALID [2020-07-18 00:17:36,497 INFO L280 TraceCheckUtils]: 48: Hoare triple {37545#true} assume !(0 != ~p4~0); {37545#true} is VALID [2020-07-18 00:17:36,497 INFO L280 TraceCheckUtils]: 49: Hoare triple {37545#true} assume !(0 != ~p5~0); {37545#true} is VALID [2020-07-18 00:17:36,497 INFO L280 TraceCheckUtils]: 50: Hoare triple {37545#true} assume !(0 != ~p6~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:36,498 INFO L280 TraceCheckUtils]: 51: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p7~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:36,499 INFO L280 TraceCheckUtils]: 52: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p1~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:36,500 INFO L280 TraceCheckUtils]: 53: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p2~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:36,500 INFO L280 TraceCheckUtils]: 54: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p3~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:36,501 INFO L280 TraceCheckUtils]: 55: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p4~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:36,502 INFO L280 TraceCheckUtils]: 56: Hoare triple {37549#(= 0 main_~p6~0)} assume !(0 != ~p5~0); {37549#(= 0 main_~p6~0)} is VALID [2020-07-18 00:17:36,503 INFO L280 TraceCheckUtils]: 57: Hoare triple {37549#(= 0 main_~p6~0)} assume 0 != ~p6~0; {37546#false} is VALID [2020-07-18 00:17:36,503 INFO L280 TraceCheckUtils]: 58: Hoare triple {37546#false} assume 1 != ~lk6~0; {37546#false} is VALID [2020-07-18 00:17:36,503 INFO L280 TraceCheckUtils]: 59: Hoare triple {37546#false} assume !false; {37546#false} is VALID [2020-07-18 00:17:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:36,506 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:36,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254976913] [2020-07-18 00:17:36,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:36,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:36,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439649126] [2020-07-18 00:17:36,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 00:17:36,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:36,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:36,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:36,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:36,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:36,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:36,585 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-07-18 00:17:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:43,897 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-07-18 00:17:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:17:43,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-18 00:17:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:17:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 00:17:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:17:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 00:17:43,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-18 00:17:44,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:44,324 INFO L225 Difference]: With dead ends: 3735 [2020-07-18 00:17:44,324 INFO L226 Difference]: Without dead ends: 2469 [2020-07-18 00:17:44,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-07-18 00:17:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-07-18 00:17:50,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:17:50,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2469 states. Second operand 2467 states. [2020-07-18 00:17:50,844 INFO L74 IsIncluded]: Start isIncluded. First operand 2469 states. Second operand 2467 states. [2020-07-18 00:17:50,845 INFO L87 Difference]: Start difference. First operand 2469 states. Second operand 2467 states. [2020-07-18 00:17:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:51,021 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-18 00:17:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-18 00:17:51,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:51,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:51,024 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2469 states. [2020-07-18 00:17:51,024 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2469 states. [2020-07-18 00:17:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:17:51,213 INFO L93 Difference]: Finished difference Result 2469 states and 3075 transitions. [2020-07-18 00:17:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3075 transitions. [2020-07-18 00:17:51,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:17:51,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:17:51,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:17:51,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:17:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-18 00:17:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-07-18 00:17:51,387 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-07-18 00:17:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:17:51,387 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-07-18 00:17:51,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:17:51,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 3074 transitions. [2020-07-18 00:17:55,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3074 edges. 3074 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-07-18 00:17:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 00:17:55,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:17:55,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:17:55,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:17:55,547 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:17:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:17:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-07-18 00:17:55,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:17:55,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [333584058] [2020-07-18 00:17:55,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:17:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:17:55,615 INFO L280 TraceCheckUtils]: 0: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-18 00:17:55,615 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-18 00:17:55,615 INFO L263 TraceCheckUtils]: 0: Hoare triple {54894#true} call ULTIMATE.init(); {54894#true} is VALID [2020-07-18 00:17:55,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {54894#true} assume true; {54894#true} is VALID [2020-07-18 00:17:55,616 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54894#true} {54894#true} #199#return; {54894#true} is VALID [2020-07-18 00:17:55,616 INFO L263 TraceCheckUtils]: 3: Hoare triple {54894#true} call #t~ret8 := main(); {54894#true} is VALID [2020-07-18 00:17:55,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {54894#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,616 INFO L280 TraceCheckUtils]: 5: Hoare triple {54894#true} ~p1~0 := #t~nondet0; {54894#true} is VALID [2020-07-18 00:17:55,617 INFO L280 TraceCheckUtils]: 6: Hoare triple {54894#true} havoc #t~nondet0; {54894#true} is VALID [2020-07-18 00:17:55,617 INFO L280 TraceCheckUtils]: 7: Hoare triple {54894#true} havoc ~lk1~0; {54894#true} is VALID [2020-07-18 00:17:55,617 INFO L280 TraceCheckUtils]: 8: Hoare triple {54894#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,617 INFO L280 TraceCheckUtils]: 9: Hoare triple {54894#true} ~p2~0 := #t~nondet1; {54894#true} is VALID [2020-07-18 00:17:55,617 INFO L280 TraceCheckUtils]: 10: Hoare triple {54894#true} havoc #t~nondet1; {54894#true} is VALID [2020-07-18 00:17:55,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {54894#true} havoc ~lk2~0; {54894#true} is VALID [2020-07-18 00:17:55,618 INFO L280 TraceCheckUtils]: 12: Hoare triple {54894#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,618 INFO L280 TraceCheckUtils]: 13: Hoare triple {54894#true} ~p3~0 := #t~nondet2; {54894#true} is VALID [2020-07-18 00:17:55,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {54894#true} havoc #t~nondet2; {54894#true} is VALID [2020-07-18 00:17:55,619 INFO L280 TraceCheckUtils]: 15: Hoare triple {54894#true} havoc ~lk3~0; {54894#true} is VALID [2020-07-18 00:17:55,619 INFO L280 TraceCheckUtils]: 16: Hoare triple {54894#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,620 INFO L280 TraceCheckUtils]: 17: Hoare triple {54894#true} ~p4~0 := #t~nondet3; {54894#true} is VALID [2020-07-18 00:17:55,620 INFO L280 TraceCheckUtils]: 18: Hoare triple {54894#true} havoc #t~nondet3; {54894#true} is VALID [2020-07-18 00:17:55,620 INFO L280 TraceCheckUtils]: 19: Hoare triple {54894#true} havoc ~lk4~0; {54894#true} is VALID [2020-07-18 00:17:55,620 INFO L280 TraceCheckUtils]: 20: Hoare triple {54894#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,620 INFO L280 TraceCheckUtils]: 21: Hoare triple {54894#true} ~p5~0 := #t~nondet4; {54894#true} is VALID [2020-07-18 00:17:55,621 INFO L280 TraceCheckUtils]: 22: Hoare triple {54894#true} havoc #t~nondet4; {54894#true} is VALID [2020-07-18 00:17:55,621 INFO L280 TraceCheckUtils]: 23: Hoare triple {54894#true} havoc ~lk5~0; {54894#true} is VALID [2020-07-18 00:17:55,621 INFO L280 TraceCheckUtils]: 24: Hoare triple {54894#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,621 INFO L280 TraceCheckUtils]: 25: Hoare triple {54894#true} ~p6~0 := #t~nondet5; {54894#true} is VALID [2020-07-18 00:17:55,621 INFO L280 TraceCheckUtils]: 26: Hoare triple {54894#true} havoc #t~nondet5; {54894#true} is VALID [2020-07-18 00:17:55,622 INFO L280 TraceCheckUtils]: 27: Hoare triple {54894#true} havoc ~lk6~0; {54894#true} is VALID [2020-07-18 00:17:55,622 INFO L280 TraceCheckUtils]: 28: Hoare triple {54894#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,622 INFO L280 TraceCheckUtils]: 29: Hoare triple {54894#true} ~p7~0 := #t~nondet6; {54894#true} is VALID [2020-07-18 00:17:55,622 INFO L280 TraceCheckUtils]: 30: Hoare triple {54894#true} havoc #t~nondet6; {54894#true} is VALID [2020-07-18 00:17:55,622 INFO L280 TraceCheckUtils]: 31: Hoare triple {54894#true} havoc ~lk7~0; {54894#true} is VALID [2020-07-18 00:17:55,623 INFO L280 TraceCheckUtils]: 32: Hoare triple {54894#true} havoc ~cond~0; {54894#true} is VALID [2020-07-18 00:17:55,623 INFO L280 TraceCheckUtils]: 33: Hoare triple {54894#true} assume !false; {54894#true} is VALID [2020-07-18 00:17:55,623 INFO L280 TraceCheckUtils]: 34: Hoare triple {54894#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {54894#true} is VALID [2020-07-18 00:17:55,623 INFO L280 TraceCheckUtils]: 35: Hoare triple {54894#true} ~cond~0 := #t~nondet7; {54894#true} is VALID [2020-07-18 00:17:55,623 INFO L280 TraceCheckUtils]: 36: Hoare triple {54894#true} havoc #t~nondet7; {54894#true} is VALID [2020-07-18 00:17:55,624 INFO L280 TraceCheckUtils]: 37: Hoare triple {54894#true} assume !(0 == ~cond~0); {54894#true} is VALID [2020-07-18 00:17:55,624 INFO L280 TraceCheckUtils]: 38: Hoare triple {54894#true} ~lk1~0 := 0; {54894#true} is VALID [2020-07-18 00:17:55,624 INFO L280 TraceCheckUtils]: 39: Hoare triple {54894#true} ~lk2~0 := 0; {54894#true} is VALID [2020-07-18 00:17:55,624 INFO L280 TraceCheckUtils]: 40: Hoare triple {54894#true} ~lk3~0 := 0; {54894#true} is VALID [2020-07-18 00:17:55,624 INFO L280 TraceCheckUtils]: 41: Hoare triple {54894#true} ~lk4~0 := 0; {54894#true} is VALID [2020-07-18 00:17:55,624 INFO L280 TraceCheckUtils]: 42: Hoare triple {54894#true} ~lk5~0 := 0; {54894#true} is VALID [2020-07-18 00:17:55,625 INFO L280 TraceCheckUtils]: 43: Hoare triple {54894#true} ~lk6~0 := 0; {54894#true} is VALID [2020-07-18 00:17:55,625 INFO L280 TraceCheckUtils]: 44: Hoare triple {54894#true} ~lk7~0 := 0; {54894#true} is VALID [2020-07-18 00:17:55,625 INFO L280 TraceCheckUtils]: 45: Hoare triple {54894#true} assume !(0 != ~p1~0); {54894#true} is VALID [2020-07-18 00:17:55,625 INFO L280 TraceCheckUtils]: 46: Hoare triple {54894#true} assume !(0 != ~p2~0); {54894#true} is VALID [2020-07-18 00:17:55,625 INFO L280 TraceCheckUtils]: 47: Hoare triple {54894#true} assume !(0 != ~p3~0); {54894#true} is VALID [2020-07-18 00:17:55,626 INFO L280 TraceCheckUtils]: 48: Hoare triple {54894#true} assume !(0 != ~p4~0); {54894#true} is VALID [2020-07-18 00:17:55,626 INFO L280 TraceCheckUtils]: 49: Hoare triple {54894#true} assume !(0 != ~p5~0); {54894#true} is VALID [2020-07-18 00:17:55,626 INFO L280 TraceCheckUtils]: 50: Hoare triple {54894#true} assume !(0 != ~p6~0); {54894#true} is VALID [2020-07-18 00:17:55,627 INFO L280 TraceCheckUtils]: 51: Hoare triple {54894#true} assume !(0 != ~p7~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 00:17:55,628 INFO L280 TraceCheckUtils]: 52: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p1~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 00:17:55,628 INFO L280 TraceCheckUtils]: 53: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p2~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 00:17:55,629 INFO L280 TraceCheckUtils]: 54: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p3~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 00:17:55,629 INFO L280 TraceCheckUtils]: 55: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p4~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 00:17:55,630 INFO L280 TraceCheckUtils]: 56: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p5~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 00:17:55,631 INFO L280 TraceCheckUtils]: 57: Hoare triple {54898#(= 0 main_~p7~0)} assume !(0 != ~p6~0); {54898#(= 0 main_~p7~0)} is VALID [2020-07-18 00:17:55,631 INFO L280 TraceCheckUtils]: 58: Hoare triple {54898#(= 0 main_~p7~0)} assume 0 != ~p7~0; {54895#false} is VALID [2020-07-18 00:17:55,632 INFO L280 TraceCheckUtils]: 59: Hoare triple {54895#false} assume 1 != ~lk7~0; {54895#false} is VALID [2020-07-18 00:17:55,632 INFO L280 TraceCheckUtils]: 60: Hoare triple {54895#false} assume !false; {54895#false} is VALID [2020-07-18 00:17:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:17:55,635 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:17:55,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [333584058] [2020-07-18 00:17:55,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:17:55,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:17:55,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912374795] [2020-07-18 00:17:55,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 00:17:55,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:17:55,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:17:55,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:17:55,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:17:55,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:17:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:17:55,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:17:55,685 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-07-18 00:18:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:11,660 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-07-18 00:18:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:18:11,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 00:18:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:18:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 00:18:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2020-07-18 00:18:11,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2020-07-18 00:18:11,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:12,372 INFO L225 Difference]: With dead ends: 7143 [2020-07-18 00:18:12,372 INFO L226 Difference]: Without dead ends: 3637 [2020-07-18 00:18:12,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:18:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-07-18 00:18:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-07-18 00:18:22,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:18:22,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3637 states. Second operand 3635 states. [2020-07-18 00:18:22,572 INFO L74 IsIncluded]: Start isIncluded. First operand 3637 states. Second operand 3635 states. [2020-07-18 00:18:22,572 INFO L87 Difference]: Start difference. First operand 3637 states. Second operand 3635 states. [2020-07-18 00:18:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:22,992 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-18 00:18:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-18 00:18:22,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:22,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:22,996 INFO L74 IsIncluded]: Start isIncluded. First operand 3635 states. Second operand 3637 states. [2020-07-18 00:18:22,996 INFO L87 Difference]: Start difference. First operand 3635 states. Second operand 3637 states. [2020-07-18 00:18:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:23,425 INFO L93 Difference]: Finished difference Result 3637 states and 4371 transitions. [2020-07-18 00:18:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4371 transitions. [2020-07-18 00:18:23,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:23,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:23,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:18:23,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:18:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-07-18 00:18:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-07-18 00:18:23,884 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-07-18 00:18:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:18:23,885 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-07-18 00:18:23,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:18:23,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3635 states and 4370 transitions. [2020-07-18 00:18:29,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4370 edges. 4370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-07-18 00:18:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 00:18:29,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:18:29,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:18:29,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 00:18:29,850 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:18:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:18:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-07-18 00:18:29,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:18:29,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980940195] [2020-07-18 00:18:29,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:18:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:29,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-18 00:18:29,908 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-18 00:18:29,908 INFO L263 TraceCheckUtils]: 0: Hoare triple {83731#true} call ULTIMATE.init(); {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {83731#true} assume true; {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {83731#true} {83731#true} #199#return; {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L263 TraceCheckUtils]: 3: Hoare triple {83731#true} call #t~ret8 := main(); {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {83731#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L280 TraceCheckUtils]: 5: Hoare triple {83731#true} ~p1~0 := #t~nondet0; {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L280 TraceCheckUtils]: 6: Hoare triple {83731#true} havoc #t~nondet0; {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {83731#true} havoc ~lk1~0; {83731#true} is VALID [2020-07-18 00:18:29,909 INFO L280 TraceCheckUtils]: 8: Hoare triple {83731#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {83731#true} ~p2~0 := #t~nondet1; {83731#true} is VALID [2020-07-18 00:18:29,910 INFO L280 TraceCheckUtils]: 10: Hoare triple {83731#true} havoc #t~nondet1; {83731#true} is VALID [2020-07-18 00:18:29,910 INFO L280 TraceCheckUtils]: 11: Hoare triple {83731#true} havoc ~lk2~0; {83731#true} is VALID [2020-07-18 00:18:29,910 INFO L280 TraceCheckUtils]: 12: Hoare triple {83731#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,910 INFO L280 TraceCheckUtils]: 13: Hoare triple {83731#true} ~p3~0 := #t~nondet2; {83731#true} is VALID [2020-07-18 00:18:29,910 INFO L280 TraceCheckUtils]: 14: Hoare triple {83731#true} havoc #t~nondet2; {83731#true} is VALID [2020-07-18 00:18:29,910 INFO L280 TraceCheckUtils]: 15: Hoare triple {83731#true} havoc ~lk3~0; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 16: Hoare triple {83731#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 17: Hoare triple {83731#true} ~p4~0 := #t~nondet3; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 18: Hoare triple {83731#true} havoc #t~nondet3; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 19: Hoare triple {83731#true} havoc ~lk4~0; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 20: Hoare triple {83731#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 21: Hoare triple {83731#true} ~p5~0 := #t~nondet4; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 22: Hoare triple {83731#true} havoc #t~nondet4; {83731#true} is VALID [2020-07-18 00:18:29,911 INFO L280 TraceCheckUtils]: 23: Hoare triple {83731#true} havoc ~lk5~0; {83731#true} is VALID [2020-07-18 00:18:29,912 INFO L280 TraceCheckUtils]: 24: Hoare triple {83731#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,912 INFO L280 TraceCheckUtils]: 25: Hoare triple {83731#true} ~p6~0 := #t~nondet5; {83731#true} is VALID [2020-07-18 00:18:29,912 INFO L280 TraceCheckUtils]: 26: Hoare triple {83731#true} havoc #t~nondet5; {83731#true} is VALID [2020-07-18 00:18:29,912 INFO L280 TraceCheckUtils]: 27: Hoare triple {83731#true} havoc ~lk6~0; {83731#true} is VALID [2020-07-18 00:18:29,912 INFO L280 TraceCheckUtils]: 28: Hoare triple {83731#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,912 INFO L280 TraceCheckUtils]: 29: Hoare triple {83731#true} ~p7~0 := #t~nondet6; {83731#true} is VALID [2020-07-18 00:18:29,912 INFO L280 TraceCheckUtils]: 30: Hoare triple {83731#true} havoc #t~nondet6; {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 31: Hoare triple {83731#true} havoc ~lk7~0; {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 32: Hoare triple {83731#true} havoc ~cond~0; {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 33: Hoare triple {83731#true} assume !false; {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 34: Hoare triple {83731#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 35: Hoare triple {83731#true} ~cond~0 := #t~nondet7; {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 36: Hoare triple {83731#true} havoc #t~nondet7; {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 37: Hoare triple {83731#true} assume !(0 == ~cond~0); {83731#true} is VALID [2020-07-18 00:18:29,913 INFO L280 TraceCheckUtils]: 38: Hoare triple {83731#true} ~lk1~0 := 0; {83731#true} is VALID [2020-07-18 00:18:29,914 INFO L280 TraceCheckUtils]: 39: Hoare triple {83731#true} ~lk2~0 := 0; {83731#true} is VALID [2020-07-18 00:18:29,914 INFO L280 TraceCheckUtils]: 40: Hoare triple {83731#true} ~lk3~0 := 0; {83731#true} is VALID [2020-07-18 00:18:29,914 INFO L280 TraceCheckUtils]: 41: Hoare triple {83731#true} ~lk4~0 := 0; {83731#true} is VALID [2020-07-18 00:18:29,914 INFO L280 TraceCheckUtils]: 42: Hoare triple {83731#true} ~lk5~0 := 0; {83731#true} is VALID [2020-07-18 00:18:29,914 INFO L280 TraceCheckUtils]: 43: Hoare triple {83731#true} ~lk6~0 := 0; {83731#true} is VALID [2020-07-18 00:18:29,914 INFO L280 TraceCheckUtils]: 44: Hoare triple {83731#true} ~lk7~0 := 0; {83731#true} is VALID [2020-07-18 00:18:29,914 INFO L280 TraceCheckUtils]: 45: Hoare triple {83731#true} assume !(0 != ~p1~0); {83731#true} is VALID [2020-07-18 00:18:29,915 INFO L280 TraceCheckUtils]: 46: Hoare triple {83731#true} assume !(0 != ~p2~0); {83731#true} is VALID [2020-07-18 00:18:29,915 INFO L280 TraceCheckUtils]: 47: Hoare triple {83731#true} assume !(0 != ~p3~0); {83731#true} is VALID [2020-07-18 00:18:29,915 INFO L280 TraceCheckUtils]: 48: Hoare triple {83731#true} assume !(0 != ~p4~0); {83731#true} is VALID [2020-07-18 00:18:29,915 INFO L280 TraceCheckUtils]: 49: Hoare triple {83731#true} assume !(0 != ~p5~0); {83731#true} is VALID [2020-07-18 00:18:29,915 INFO L280 TraceCheckUtils]: 50: Hoare triple {83731#true} assume 0 != ~p6~0; {83731#true} is VALID [2020-07-18 00:18:29,916 INFO L280 TraceCheckUtils]: 51: Hoare triple {83731#true} ~lk6~0 := 1; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,916 INFO L280 TraceCheckUtils]: 52: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p7~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,917 INFO L280 TraceCheckUtils]: 53: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p1~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,917 INFO L280 TraceCheckUtils]: 54: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p2~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,917 INFO L280 TraceCheckUtils]: 55: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p3~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,918 INFO L280 TraceCheckUtils]: 56: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p4~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,918 INFO L280 TraceCheckUtils]: 57: Hoare triple {83735#(= 1 main_~lk6~0)} assume !(0 != ~p5~0); {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,919 INFO L280 TraceCheckUtils]: 58: Hoare triple {83735#(= 1 main_~lk6~0)} assume 0 != ~p6~0; {83735#(= 1 main_~lk6~0)} is VALID [2020-07-18 00:18:29,919 INFO L280 TraceCheckUtils]: 59: Hoare triple {83735#(= 1 main_~lk6~0)} assume 1 != ~lk6~0; {83732#false} is VALID [2020-07-18 00:18:29,919 INFO L280 TraceCheckUtils]: 60: Hoare triple {83732#false} assume !false; {83732#false} is VALID [2020-07-18 00:18:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:18:29,922 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:18:29,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980940195] [2020-07-18 00:18:29,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:18:29,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:18:29,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56347317] [2020-07-18 00:18:29,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 00:18:29,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:18:29,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:18:29,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:29,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:18:29,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:18:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:18:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:18:29,976 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-07-18 00:18:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:42,808 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-07-18 00:18:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:18:42,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-18 00:18:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:18:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-18 00:18:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:18:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2020-07-18 00:18:42,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2020-07-18 00:18:42,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:43,245 INFO L225 Difference]: With dead ends: 4087 [2020-07-18 00:18:43,245 INFO L226 Difference]: Without dead ends: 2917 [2020-07-18 00:18:43,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:18:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-07-18 00:18:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-07-18 00:18:50,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:18:50,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2917 states. Second operand 2467 states. [2020-07-18 00:18:50,710 INFO L74 IsIncluded]: Start isIncluded. First operand 2917 states. Second operand 2467 states. [2020-07-18 00:18:50,710 INFO L87 Difference]: Start difference. First operand 2917 states. Second operand 2467 states. [2020-07-18 00:18:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:50,945 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-18 00:18:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-18 00:18:50,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:50,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:50,949 INFO L74 IsIncluded]: Start isIncluded. First operand 2467 states. Second operand 2917 states. [2020-07-18 00:18:50,949 INFO L87 Difference]: Start difference. First operand 2467 states. Second operand 2917 states. [2020-07-18 00:18:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:18:51,188 INFO L93 Difference]: Finished difference Result 2917 states and 3395 transitions. [2020-07-18 00:18:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 3395 transitions. [2020-07-18 00:18:51,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:18:51,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:18:51,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:18:51,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:18:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-18 00:18:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-07-18 00:18:51,392 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-07-18 00:18:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:18:51,393 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-07-18 00:18:51,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:18:51,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2467 states and 2914 transitions. [2020-07-18 00:18:55,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2914 edges. 2914 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-07-18 00:18:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 00:18:55,533 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:18:55,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:18:55,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 00:18:55,534 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:18:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:18:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-07-18 00:18:55,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:18:55,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902374799] [2020-07-18 00:18:55,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:18:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:18:55,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-18 00:18:55,587 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-18 00:18:55,588 INFO L263 TraceCheckUtils]: 0: Hoare triple {102680#true} call ULTIMATE.init(); {102680#true} is VALID [2020-07-18 00:18:55,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {102680#true} assume true; {102680#true} is VALID [2020-07-18 00:18:55,588 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {102680#true} {102680#true} #199#return; {102680#true} is VALID [2020-07-18 00:18:55,588 INFO L263 TraceCheckUtils]: 3: Hoare triple {102680#true} call #t~ret8 := main(); {102680#true} is VALID [2020-07-18 00:18:55,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {102680#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {102680#true} ~p1~0 := #t~nondet0; {102680#true} is VALID [2020-07-18 00:18:55,589 INFO L280 TraceCheckUtils]: 6: Hoare triple {102680#true} havoc #t~nondet0; {102680#true} is VALID [2020-07-18 00:18:55,589 INFO L280 TraceCheckUtils]: 7: Hoare triple {102680#true} havoc ~lk1~0; {102680#true} is VALID [2020-07-18 00:18:55,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {102680#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {102680#true} ~p2~0 := #t~nondet1; {102680#true} is VALID [2020-07-18 00:18:55,590 INFO L280 TraceCheckUtils]: 10: Hoare triple {102680#true} havoc #t~nondet1; {102680#true} is VALID [2020-07-18 00:18:55,590 INFO L280 TraceCheckUtils]: 11: Hoare triple {102680#true} havoc ~lk2~0; {102680#true} is VALID [2020-07-18 00:18:55,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {102680#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,591 INFO L280 TraceCheckUtils]: 13: Hoare triple {102680#true} ~p3~0 := #t~nondet2; {102680#true} is VALID [2020-07-18 00:18:55,591 INFO L280 TraceCheckUtils]: 14: Hoare triple {102680#true} havoc #t~nondet2; {102680#true} is VALID [2020-07-18 00:18:55,591 INFO L280 TraceCheckUtils]: 15: Hoare triple {102680#true} havoc ~lk3~0; {102680#true} is VALID [2020-07-18 00:18:55,592 INFO L280 TraceCheckUtils]: 16: Hoare triple {102680#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,592 INFO L280 TraceCheckUtils]: 17: Hoare triple {102680#true} ~p4~0 := #t~nondet3; {102680#true} is VALID [2020-07-18 00:18:55,592 INFO L280 TraceCheckUtils]: 18: Hoare triple {102680#true} havoc #t~nondet3; {102680#true} is VALID [2020-07-18 00:18:55,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {102680#true} havoc ~lk4~0; {102680#true} is VALID [2020-07-18 00:18:55,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {102680#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,593 INFO L280 TraceCheckUtils]: 21: Hoare triple {102680#true} ~p5~0 := #t~nondet4; {102680#true} is VALID [2020-07-18 00:18:55,593 INFO L280 TraceCheckUtils]: 22: Hoare triple {102680#true} havoc #t~nondet4; {102680#true} is VALID [2020-07-18 00:18:55,593 INFO L280 TraceCheckUtils]: 23: Hoare triple {102680#true} havoc ~lk5~0; {102680#true} is VALID [2020-07-18 00:18:55,593 INFO L280 TraceCheckUtils]: 24: Hoare triple {102680#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,594 INFO L280 TraceCheckUtils]: 25: Hoare triple {102680#true} ~p6~0 := #t~nondet5; {102680#true} is VALID [2020-07-18 00:18:55,594 INFO L280 TraceCheckUtils]: 26: Hoare triple {102680#true} havoc #t~nondet5; {102680#true} is VALID [2020-07-18 00:18:55,594 INFO L280 TraceCheckUtils]: 27: Hoare triple {102680#true} havoc ~lk6~0; {102680#true} is VALID [2020-07-18 00:18:55,594 INFO L280 TraceCheckUtils]: 28: Hoare triple {102680#true} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,595 INFO L280 TraceCheckUtils]: 29: Hoare triple {102680#true} ~p7~0 := #t~nondet6; {102680#true} is VALID [2020-07-18 00:18:55,595 INFO L280 TraceCheckUtils]: 30: Hoare triple {102680#true} havoc #t~nondet6; {102680#true} is VALID [2020-07-18 00:18:55,595 INFO L280 TraceCheckUtils]: 31: Hoare triple {102680#true} havoc ~lk7~0; {102680#true} is VALID [2020-07-18 00:18:55,595 INFO L280 TraceCheckUtils]: 32: Hoare triple {102680#true} havoc ~cond~0; {102680#true} is VALID [2020-07-18 00:18:55,596 INFO L280 TraceCheckUtils]: 33: Hoare triple {102680#true} assume !false; {102680#true} is VALID [2020-07-18 00:18:55,596 INFO L280 TraceCheckUtils]: 34: Hoare triple {102680#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {102680#true} is VALID [2020-07-18 00:18:55,596 INFO L280 TraceCheckUtils]: 35: Hoare triple {102680#true} ~cond~0 := #t~nondet7; {102680#true} is VALID [2020-07-18 00:18:55,596 INFO L280 TraceCheckUtils]: 36: Hoare triple {102680#true} havoc #t~nondet7; {102680#true} is VALID [2020-07-18 00:18:55,596 INFO L280 TraceCheckUtils]: 37: Hoare triple {102680#true} assume !(0 == ~cond~0); {102680#true} is VALID [2020-07-18 00:18:55,597 INFO L280 TraceCheckUtils]: 38: Hoare triple {102680#true} ~lk1~0 := 0; {102680#true} is VALID [2020-07-18 00:18:55,597 INFO L280 TraceCheckUtils]: 39: Hoare triple {102680#true} ~lk2~0 := 0; {102680#true} is VALID [2020-07-18 00:18:55,597 INFO L280 TraceCheckUtils]: 40: Hoare triple {102680#true} ~lk3~0 := 0; {102680#true} is VALID [2020-07-18 00:18:55,597 INFO L280 TraceCheckUtils]: 41: Hoare triple {102680#true} ~lk4~0 := 0; {102680#true} is VALID [2020-07-18 00:18:55,598 INFO L280 TraceCheckUtils]: 42: Hoare triple {102680#true} ~lk5~0 := 0; {102680#true} is VALID [2020-07-18 00:18:55,598 INFO L280 TraceCheckUtils]: 43: Hoare triple {102680#true} ~lk6~0 := 0; {102680#true} is VALID [2020-07-18 00:18:55,598 INFO L280 TraceCheckUtils]: 44: Hoare triple {102680#true} ~lk7~0 := 0; {102680#true} is VALID [2020-07-18 00:18:55,598 INFO L280 TraceCheckUtils]: 45: Hoare triple {102680#true} assume !(0 != ~p1~0); {102680#true} is VALID [2020-07-18 00:18:55,599 INFO L280 TraceCheckUtils]: 46: Hoare triple {102680#true} assume !(0 != ~p2~0); {102680#true} is VALID [2020-07-18 00:18:55,599 INFO L280 TraceCheckUtils]: 47: Hoare triple {102680#true} assume !(0 != ~p3~0); {102680#true} is VALID [2020-07-18 00:18:55,599 INFO L280 TraceCheckUtils]: 48: Hoare triple {102680#true} assume !(0 != ~p4~0); {102680#true} is VALID [2020-07-18 00:18:55,599 INFO L280 TraceCheckUtils]: 49: Hoare triple {102680#true} assume !(0 != ~p5~0); {102680#true} is VALID [2020-07-18 00:18:55,599 INFO L280 TraceCheckUtils]: 50: Hoare triple {102680#true} assume !(0 != ~p6~0); {102680#true} is VALID [2020-07-18 00:18:55,600 INFO L280 TraceCheckUtils]: 51: Hoare triple {102680#true} assume 0 != ~p7~0; {102680#true} is VALID [2020-07-18 00:18:55,601 INFO L280 TraceCheckUtils]: 52: Hoare triple {102680#true} ~lk7~0 := 1; {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,604 INFO L280 TraceCheckUtils]: 53: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,605 INFO L280 TraceCheckUtils]: 54: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,605 INFO L280 TraceCheckUtils]: 55: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,606 INFO L280 TraceCheckUtils]: 56: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,607 INFO L280 TraceCheckUtils]: 57: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,607 INFO L280 TraceCheckUtils]: 58: Hoare triple {102684#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,608 INFO L280 TraceCheckUtils]: 59: Hoare triple {102684#(= main_~lk7~0 1)} assume 0 != ~p7~0; {102684#(= main_~lk7~0 1)} is VALID [2020-07-18 00:18:55,609 INFO L280 TraceCheckUtils]: 60: Hoare triple {102684#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {102681#false} is VALID [2020-07-18 00:18:55,609 INFO L280 TraceCheckUtils]: 61: Hoare triple {102681#false} assume !false; {102681#false} is VALID [2020-07-18 00:18:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:18:55,615 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:18:55,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902374799] [2020-07-18 00:18:55,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:18:55,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:18:55,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766219099] [2020-07-18 00:18:55,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 00:18:55,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:18:55,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:18:55,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:18:55,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:18:55,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:18:55,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:18:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:18:55,681 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-07-18 00:19:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:04,069 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-07-18 00:19:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:19:04,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-18 00:19:04,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:19:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:19:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-18 00:19:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:19:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2020-07-18 00:19:04,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2020-07-18 00:19:04,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:04,161 INFO L225 Difference]: With dead ends: 2467 [2020-07-18 00:19:04,161 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:19:04,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:19:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:19:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:19:04,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:19:04,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:19:04,168 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:19:04,168 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:19:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:04,168 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:19:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:19:04,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:04,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:04,169 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:19:04,169 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:19:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:19:04,169 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:19:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:19:04,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:04,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:19:04,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:19:04,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:19:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:19:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:19:04,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-07-18 00:19:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:19:04,171 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:19:04,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:19:04,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:19:04,171 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:19:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:19:04,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:19:04,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 00:19:04,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:19:04,326 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:19:04,600 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 35 [2020-07-18 00:19:04,791 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-07-18 00:19:05,101 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-07-18 00:19:05,565 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-07-18 00:19:06,073 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-07-18 00:19:06,281 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-07-18 00:19:06,407 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 00:19:06,849 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 00:19:06,972 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 55 [2020-07-18 00:19:07,294 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-07-18 00:19:07,459 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-07-18 00:19:08,617 WARN L193 SmtUtils]: Spent 977.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:19:09,036 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 00:19:09,267 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:19:09,790 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-18 00:19:10,828 WARN L193 SmtUtils]: Spent 960.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:19:11,003 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:19:11,175 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:19:11,618 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:19:12,577 WARN L193 SmtUtils]: Spent 939.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-18 00:19:13,687 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 00:19:13,872 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-18 00:19:16,617 WARN L193 SmtUtils]: Spent 2.73 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-18 00:19:16,975 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:19:17,328 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-18 00:19:17,692 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-18 00:19:18,788 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-18 00:19:18,805 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:19:18,805 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:19:18,805 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:19:18,805 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:19:18,805 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:19:18,805 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:19:18,807 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse2 .cse7 .cse8) (and .cse6 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2 .cse4 .cse7) (and .cse6 .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse7 .cse8))) [2020-07-18 00:19:18,807 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-18 00:19:18,807 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-07-18 00:19:18,807 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-18 00:19:18,807 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 00:19:18,808 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 00:19:18,808 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-18 00:19:18,808 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse6 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse9 .cse5 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse5 .cse6 .cse3 .cse8) (and .cse1 .cse5 .cse4 .cse7 .cse8) (and .cse5 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse0 .cse1 .cse3 .cse8) (and .cse1 .cse5 .cse2 .cse4 .cse7) (and .cse9 .cse1 .cse5 .cse2 .cse7) (and .cse9 .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse1 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse9 .cse1 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse9 .cse0 .cse2 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse5 .cse2 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse7) (and .cse9 .cse0 .cse6 .cse3 .cse8) (and .cse9 .cse1 .cse5 .cse3 .cse8) (and .cse1 .cse5 .cse3 .cse4 .cse8) (and .cse9 .cse0 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse7 .cse8) (and .cse5 .cse6 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse9 .cse0 .cse6 .cse7 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8))) [2020-07-18 00:19:18,808 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-07-18 00:19:18,809 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-07-18 00:19:18,809 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 00:19:18,809 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 00:19:18,809 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-18 00:19:18,809 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 00:19:18,809 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-18 00:19:18,809 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-07-18 00:19:18,810 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse9 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-18 00:19:18,810 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 00:19:18,810 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-18 00:19:18,810 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-18 00:19:18,810 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-18 00:19:18,810 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-07-18 00:19:18,810 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 00:19:18,810 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-07-18 00:19:18,811 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-18 00:19:18,811 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-07-18 00:19:18,811 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse4 .cse1) (and .cse5 .cse4 .cse1) (and .cse3 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse0 .cse2) (and .cse5 .cse1 .cse2))) [2020-07-18 00:19:18,812 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-18 00:19:18,812 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-07-18 00:19:18,812 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse9 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-18 00:19:18,812 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 00:19:18,812 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-18 00:19:18,813 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-18 00:19:18,813 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-18 00:19:18,813 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-18 00:19:18,813 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-07-18 00:19:18,813 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 00:19:18,813 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 00:19:18,813 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-18 00:19:18,814 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 00:19:18,814 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-18 00:19:18,814 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-07-18 00:19:18,814 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-18 00:19:18,814 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:19:18,815 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 0 main_~p3~0)) (.cse6 (= 1 main_~lk7~0)) (.cse7 (= 0 main_~p4~0)) (.cse11 (= 0 main_~p2~0)) (.cse9 (= 0 main_~p6~0)) (.cse10 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse11 .cse9 .cse10) (and .cse1 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse11 .cse8 .cse4 .cse5) (and .cse3 .cse6 .cse8 .cse9 .cse10 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse11 .cse10 .cse5) (and .cse3 .cse6 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse7 .cse4 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse5) (and .cse2 .cse6 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse4) (and .cse1 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse9) (and .cse2 .cse6 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse11 .cse8 .cse10 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse10) (and .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse4) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 .cse6 .cse11 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse5) (and .cse2 .cse6 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse11 .cse4 .cse9 .cse5) (and .cse1 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse4) (and .cse1 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse5) (and .cse1 .cse3 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse10 .cse5) (and .cse6 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse6 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse4 .cse9 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse11 .cse8 .cse10 .cse5) (and .cse6 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse10) (and .cse2 .cse6 .cse7 .cse11 .cse9 .cse10))) [2020-07-18 00:19:18,815 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:19:18,815 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-18 00:19:18,816 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-18 00:19:18,816 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= 0 main_~p7~0) (= 1 main_~lk7~0)) [2020-07-18 00:19:18,816 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 00:19:18,816 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-18 00:19:18,816 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-07-18 00:19:18,816 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 00:19:18,817 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-18 00:19:18,817 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-18 00:19:18,818 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-18 00:19:18,818 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:19:18,818 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-18 00:19:18,818 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-07-18 00:19:18,818 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse4 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p5~0)) (.cse2 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse3) (and .cse6 .cse2 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse6 .cse4 .cse2 .cse7) (and .cse5 .cse0 .cse7 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse0 .cse4 .cse1) (and .cse5 .cse0 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse7) (and .cse5 .cse6 .cse4 .cse1) (and .cse6 .cse4 .cse1 .cse2))) [2020-07-18 00:19:18,819 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-18 00:19:18,819 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-18 00:19:18,820 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-18 00:19:18,821 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse5 (= 0 main_~p1~0)) (.cse13 (= 0 main_~p7~0)) (.cse9 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse11 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse11) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse5 .cse12) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse5 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse6 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse11) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse11) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse9 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse13 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse6 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse8 .cse9 .cse0 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse5) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse6 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse11) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse5 .cse6 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse0 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12))) [2020-07-18 00:19:18,821 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-18 00:19:18,821 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-18 00:19:18,822 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-18 00:19:18,822 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) 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 .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-18 00:19:18,822 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk6~0)) (.cse5 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse2 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse3 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse3) (and .cse5 .cse1 .cse2 .cse4 .cse7) (and .cse6 .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse3 .cse4 .cse8) (and .cse6 .cse5 .cse2 .cse7 .cse8))) [2020-07-18 00:19:18,823 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-18 00:19:18,823 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-07-18 00:19:18,823 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-07-18 00:19:18,823 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 00:19:18,823 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 00:19:18,823 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-18 00:19:18,824 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 00:19:18,824 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse11 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p5~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-18 00:19:18,825 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-18 00:19:18,825 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-18 00:19:18,825 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-18 00:19:18,825 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p7~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2020-07-18 00:19:18,825 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-18 00:19:18,953 INFO L163 areAnnotationChecker]: CFG has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:19:18,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:19:18 BoogieIcfgContainer [2020-07-18 00:19:18,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:19:18,966 INFO L168 Benchmark]: Toolchain (without parser) took 142574.63 ms. Allocated memory was 144.7 MB in the beginning and 839.4 MB in the end (delta: 694.7 MB). Free memory was 103.2 MB in the beginning and 459.6 MB in the end (delta: -356.4 MB). Peak memory consumption was 338.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:18,967 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:19:18,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.61 ms. Allocated memory is still 144.7 MB. Free memory was 103.0 MB in the beginning and 92.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:18,968 INFO L168 Benchmark]: Boogie Preprocessor took 144.96 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 92.3 MB in the beginning and 181.7 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:18,969 INFO L168 Benchmark]: RCFGBuilder took 635.83 ms. Allocated memory is still 202.9 MB. Free memory was 181.1 MB in the beginning and 148.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:18,969 INFO L168 Benchmark]: TraceAbstraction took 141496.81 ms. Allocated memory was 202.9 MB in the beginning and 839.4 MB in the end (delta: 636.5 MB). Free memory was 147.9 MB in the beginning and 459.6 MB in the end (delta: -311.7 MB). Peak memory consumption was 324.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:19:18,972 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.30 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.61 ms. Allocated memory is still 144.7 MB. Free memory was 103.0 MB in the beginning and 92.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.96 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 92.3 MB in the beginning and 181.7 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 635.83 ms. Allocated memory is still 202.9 MB. Free memory was 181.1 MB in the beginning and 148.5 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141496.81 ms. Allocated memory was 202.9 MB in the beginning and 839.4 MB in the end (delta: 636.5 MB). Free memory was 147.9 MB in the beginning and 459.6 MB in the end (delta: -311.7 MB). Peak memory consumption was 324.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 126.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 62.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1813 SDtfs, 648 SDslu, 1281 SDs, 0 SdLazy, 69 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 38.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.9s 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...