java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:43:02,634 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:43:02,636 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:43:02,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:43:02,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:43:02,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:43:02,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:43:02,653 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:43:02,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:43:02,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:43:02,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:43:02,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:43:02,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:43:02,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:43:02,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:43:02,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:43:02,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:43:02,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:43:02,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:43:02,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:43:02,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:43:02,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:43:02,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:43:02,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:43:02,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:43:02,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:43:02,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:43:02,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:43:02,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:43:02,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:43:02,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:43:02,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:43:02,678 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:43:02,678 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:43:02,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:43:02,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:43:02,681 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:43:02,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:43:02,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:43:02,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:43:02,699 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:43:02,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:43:02,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:43:02,700 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:43:02,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:43:02,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:43:02,701 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:43:02,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:43:02,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:43:02,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:43:02,702 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:43:02,702 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:43:02,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:43:02,702 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:43:02,702 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:43:02,703 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:43:02,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:43:02,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:43:02,703 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:43:02,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:43:02,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:43:02,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:43:02,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:43:02,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:43:02,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:43:02,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:43:02,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:43:02,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:43:02,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:43:02,774 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:43:02,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:43:02,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:43:02,778 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:43:02,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:43:02,832 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a5f6d12/5f87dba7c2dd4612b5d38eab4c1f92c8/FLAGa791d55af [2018-11-23 12:43:03,269 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:43:03,270 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:43:03,278 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a5f6d12/5f87dba7c2dd4612b5d38eab4c1f92c8/FLAGa791d55af [2018-11-23 12:43:03,638 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a5f6d12/5f87dba7c2dd4612b5d38eab4c1f92c8 [2018-11-23 12:43:03,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:43:03,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:43:03,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:03,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:43:03,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:43:03,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:03" (1/1) ... [2018-11-23 12:43:03,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f612feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:03, skipping insertion in model container [2018-11-23 12:43:03,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:03" (1/1) ... [2018-11-23 12:43:03,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:43:03,701 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:43:03,927 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:03,932 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:43:03,986 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:04,002 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:43:04,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04 WrapperNode [2018-11-23 12:43:04,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:04,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:04,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:43:04,003 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:43:04,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:04,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:43:04,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:43:04,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:43:04,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (1/1) ... [2018-11-23 12:43:04,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:43:04,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:43:04,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:43:04,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:43:04,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (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 [2018-11-23 12:43:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:43:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:43:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:43:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:43:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:43:04,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:43:04,992 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:43:04,993 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:43:04,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:04 BoogieIcfgContainer [2018-11-23 12:43:04,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:43:04,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:43:04,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:43:04,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:43:05,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:43:03" (1/3) ... [2018-11-23 12:43:05,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191e3a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:43:05, skipping insertion in model container [2018-11-23 12:43:05,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:04" (2/3) ... [2018-11-23 12:43:05,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191e3a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:43:05, skipping insertion in model container [2018-11-23 12:43:05,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:04" (3/3) ... [2018-11-23 12:43:05,006 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:43:05,017 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:43:05,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:43:05,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:43:05,086 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:43:05,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:43:05,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:43:05,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:43:05,088 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:43:05,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:43:05,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:43:05,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:43:05,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:43:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 12:43:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:43:05,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:05,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:05,124 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:05,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-11-23 12:43:05,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:05,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:05,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:05,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:05,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:05,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-23 12:43:05,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:43:05,404 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #180#return; {44#true} is VALID [2018-11-23 12:43:05,404 INFO L256 TraceCheckUtils]: 3: Hoare triple {44#true} call #t~ret10 := main(); {44#true} is VALID [2018-11-23 12:43:05,405 INFO L273 TraceCheckUtils]: 4: Hoare triple {44#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {44#true} is VALID [2018-11-23 12:43:05,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {44#true} is VALID [2018-11-23 12:43:05,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {44#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {44#true} is VALID [2018-11-23 12:43:05,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#true} assume 0 != ~p1~0;~lk1~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,410 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#(= main_~lk1~0 1)} assume 0 != ~p1~0; {46#(= main_~lk1~0 1)} is VALID [2018-11-23 12:43:05,419 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {45#false} is VALID [2018-11-23 12:43:05,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-23 12:43:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:05,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:05,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:05,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:05,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:05,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:05,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:05,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:05,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:05,522 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-11-23 12:43:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,916 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-11-23 12:43:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:05,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:43:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:43:05,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 12:43:06,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:06,631 INFO L225 Difference]: With dead ends: 81 [2018-11-23 12:43:06,631 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:43:06,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:43:06,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-23 12:43:06,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:06,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 46 states. [2018-11-23 12:43:06,678 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 46 states. [2018-11-23 12:43:06,678 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 46 states. [2018-11-23 12:43:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,689 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2018-11-23 12:43:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2018-11-23 12:43:06,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:06,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:06,691 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 66 states. [2018-11-23 12:43:06,691 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 66 states. [2018-11-23 12:43:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,699 INFO L93 Difference]: Finished difference Result 66 states and 116 transitions. [2018-11-23 12:43:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 116 transitions. [2018-11-23 12:43:06,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:06,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:06,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:06,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:43:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-11-23 12:43:06,706 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-11-23 12:43:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:06,707 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-11-23 12:43:06,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-11-23 12:43:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:43:06,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:06,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:06,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:06,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-11-23 12:43:06,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:06,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:06,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:06,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:06,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2018-11-23 12:43:06,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2018-11-23 12:43:06,802 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #180#return; {326#true} is VALID [2018-11-23 12:43:06,802 INFO L256 TraceCheckUtils]: 3: Hoare triple {326#true} call #t~ret10 := main(); {326#true} is VALID [2018-11-23 12:43:06,803 INFO L273 TraceCheckUtils]: 4: Hoare triple {326#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {326#true} is VALID [2018-11-23 12:43:06,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {326#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {326#true} is VALID [2018-11-23 12:43:06,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {326#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {326#true} is VALID [2018-11-23 12:43:06,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {326#true} assume !(0 != ~p1~0); {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {328#(= main_~p1~0 0)} assume !(0 != ~p8~0); {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {328#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:06,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {328#(= main_~p1~0 0)} assume 0 != ~p1~0; {327#false} is VALID [2018-11-23 12:43:06,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {327#false} assume 1 != ~lk1~0; {327#false} is VALID [2018-11-23 12:43:06,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {327#false} assume !false; {327#false} is VALID [2018-11-23 12:43:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:06,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:06,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:06,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:06,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:06,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:06,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:06,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:06,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:06,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:06,902 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-11-23 12:43:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,276 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-11-23 12:43:07,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:07,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 12:43:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-23 12:43:07,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2018-11-23 12:43:07,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:07,642 INFO L225 Difference]: With dead ends: 107 [2018-11-23 12:43:07,643 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:43:07,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:43:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-23 12:43:07,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:07,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2018-11-23 12:43:07,671 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2018-11-23 12:43:07,671 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2018-11-23 12:43:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,676 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2018-11-23 12:43:07,676 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2018-11-23 12:43:07,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:07,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:07,677 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2018-11-23 12:43:07,678 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2018-11-23 12:43:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,683 INFO L93 Difference]: Finished difference Result 66 states and 114 transitions. [2018-11-23 12:43:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 114 transitions. [2018-11-23 12:43:07,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:07,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:07,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:07,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 12:43:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-11-23 12:43:07,689 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-11-23 12:43:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:07,689 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-11-23 12:43:07,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-11-23 12:43:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:43:07,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:07,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:07,691 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:07,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-11-23 12:43:07,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:07,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:07,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:07,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:07,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:07,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 12:43:07,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 12:43:07,785 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #180#return; {651#true} is VALID [2018-11-23 12:43:07,785 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret10 := main(); {651#true} is VALID [2018-11-23 12:43:07,785 INFO L273 TraceCheckUtils]: 4: Hoare triple {651#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {651#true} is VALID [2018-11-23 12:43:07,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {651#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {651#true} is VALID [2018-11-23 12:43:07,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {651#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {651#true} is VALID [2018-11-23 12:43:07,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {651#true} assume 0 != ~p1~0;~lk1~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {653#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {653#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {653#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {653#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {653#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {653#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {653#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {653#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {653#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:07,800 INFO L273 TraceCheckUtils]: 16: Hoare triple {653#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {652#false} is VALID [2018-11-23 12:43:07,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} assume 0 != ~p2~0; {652#false} is VALID [2018-11-23 12:43:07,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 1 != ~lk2~0; {652#false} is VALID [2018-11-23 12:43:07,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 12:43:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:07,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:07,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:07,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:07,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:07,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:07,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:07,827 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-11-23 12:43:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,006 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-11-23 12:43:08,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:08,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 12:43:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:08,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-23 12:43:08,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2018-11-23 12:43:08,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:08,243 INFO L225 Difference]: With dead ends: 99 [2018-11-23 12:43:08,244 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:43:08,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:43:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:43:08,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:08,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:43:08,266 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:43:08,266 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:43:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,269 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2018-11-23 12:43:08,269 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2018-11-23 12:43:08,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:08,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:08,271 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:43:08,271 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:43:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,275 INFO L93 Difference]: Finished difference Result 69 states and 116 transitions. [2018-11-23 12:43:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 116 transitions. [2018-11-23 12:43:08,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:08,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:08,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:08,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:43:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-11-23 12:43:08,281 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-11-23 12:43:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:08,281 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-11-23 12:43:08,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-11-23 12:43:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:43:08,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:08,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:08,283 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:08,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:08,283 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-11-23 12:43:08,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:08,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:08,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:08,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {979#true} is VALID [2018-11-23 12:43:08,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {979#true} assume true; {979#true} is VALID [2018-11-23 12:43:08,366 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {979#true} {979#true} #180#return; {979#true} is VALID [2018-11-23 12:43:08,366 INFO L256 TraceCheckUtils]: 3: Hoare triple {979#true} call #t~ret10 := main(); {979#true} is VALID [2018-11-23 12:43:08,367 INFO L273 TraceCheckUtils]: 4: Hoare triple {979#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {979#true} is VALID [2018-11-23 12:43:08,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {979#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {979#true} is VALID [2018-11-23 12:43:08,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {979#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {979#true} is VALID [2018-11-23 12:43:08,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {979#true} assume !(0 != ~p1~0); {979#true} is VALID [2018-11-23 12:43:08,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {979#true} assume 0 != ~p2~0;~lk2~0 := 1; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {981#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {981#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {981#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {981#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {981#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {981#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {981#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {981#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {981#(= main_~lk2~0 1)} assume 0 != ~p2~0; {981#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:08,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {981#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {980#false} is VALID [2018-11-23 12:43:08,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {980#false} assume !false; {980#false} is VALID [2018-11-23 12:43:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:08,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:08,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:08,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:08,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:08,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:08,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:08,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:08,418 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-11-23 12:43:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,634 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-11-23 12:43:08,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:08,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:43:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:43:08,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 12:43:08,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:08,760 INFO L225 Difference]: With dead ends: 124 [2018-11-23 12:43:08,760 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 12:43:08,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 12:43:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-11-23 12:43:08,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:08,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 88 states. [2018-11-23 12:43:08,794 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 88 states. [2018-11-23 12:43:08,794 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 88 states. [2018-11-23 12:43:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,800 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2018-11-23 12:43:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2018-11-23 12:43:08,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:08,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:08,802 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 122 states. [2018-11-23 12:43:08,802 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 122 states. [2018-11-23 12:43:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,808 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2018-11-23 12:43:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2018-11-23 12:43:08,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:08,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:08,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:08,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 12:43:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-11-23 12:43:08,813 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-11-23 12:43:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:08,814 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-11-23 12:43:08,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-11-23 12:43:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:43:08,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:08,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:08,816 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:08,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:08,816 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-11-23 12:43:08,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:08,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:08,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:08,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:08,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {1460#true} call ULTIMATE.init(); {1460#true} is VALID [2018-11-23 12:43:08,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {1460#true} assume true; {1460#true} is VALID [2018-11-23 12:43:08,880 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1460#true} {1460#true} #180#return; {1460#true} is VALID [2018-11-23 12:43:08,880 INFO L256 TraceCheckUtils]: 3: Hoare triple {1460#true} call #t~ret10 := main(); {1460#true} is VALID [2018-11-23 12:43:08,880 INFO L273 TraceCheckUtils]: 4: Hoare triple {1460#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {1460#true} is VALID [2018-11-23 12:43:08,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {1460#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {1460#true} is VALID [2018-11-23 12:43:08,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {1460#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {1460#true} is VALID [2018-11-23 12:43:08,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {1460#true} assume !(0 != ~p1~0); {1460#true} is VALID [2018-11-23 12:43:08,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {1460#true} assume !(0 != ~p2~0); {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {1462#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {1462#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {1462#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {1462#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {1462#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {1462#(= main_~p2~0 0)} assume !(0 != ~p8~0); {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {1462#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {1462#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1462#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:08,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {1462#(= main_~p2~0 0)} assume 0 != ~p2~0; {1461#false} is VALID [2018-11-23 12:43:08,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {1461#false} assume 1 != ~lk2~0; {1461#false} is VALID [2018-11-23 12:43:08,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {1461#false} assume !false; {1461#false} is VALID [2018-11-23 12:43:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:08,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:08,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:08,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:08,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:08,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:08,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:08,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:08,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:08,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:08,921 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-11-23 12:43:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,079 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-11-23 12:43:09,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:09,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 12:43:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 12:43:09,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2018-11-23 12:43:09,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:09,411 INFO L225 Difference]: With dead ends: 204 [2018-11-23 12:43:09,411 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 12:43:09,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 12:43:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-23 12:43:09,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:09,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-23 12:43:09,442 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-23 12:43:09,442 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-23 12:43:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,448 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2018-11-23 12:43:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2018-11-23 12:43:09,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:09,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:09,449 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-23 12:43:09,449 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-23 12:43:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,454 INFO L93 Difference]: Finished difference Result 124 states and 211 transitions. [2018-11-23 12:43:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2018-11-23 12:43:09,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:09,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:09,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:09,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 12:43:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-11-23 12:43:09,461 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-11-23 12:43:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:09,461 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-11-23 12:43:09,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-11-23 12:43:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:09,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:09,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:09,463 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:09,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-11-23 12:43:09,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:09,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:09,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:09,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:09,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {2063#true} call ULTIMATE.init(); {2063#true} is VALID [2018-11-23 12:43:09,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {2063#true} assume true; {2063#true} is VALID [2018-11-23 12:43:09,541 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2063#true} {2063#true} #180#return; {2063#true} is VALID [2018-11-23 12:43:09,541 INFO L256 TraceCheckUtils]: 3: Hoare triple {2063#true} call #t~ret10 := main(); {2063#true} is VALID [2018-11-23 12:43:09,541 INFO L273 TraceCheckUtils]: 4: Hoare triple {2063#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {2063#true} is VALID [2018-11-23 12:43:09,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {2063#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2063#true} is VALID [2018-11-23 12:43:09,542 INFO L273 TraceCheckUtils]: 6: Hoare triple {2063#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {2063#true} is VALID [2018-11-23 12:43:09,542 INFO L273 TraceCheckUtils]: 7: Hoare triple {2063#true} assume !(0 != ~p1~0); {2063#true} is VALID [2018-11-23 12:43:09,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {2063#true} assume 0 != ~p2~0;~lk2~0 := 1; {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {2065#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {2065#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {2065#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {2065#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {2065#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {2065#(not (= main_~p2~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {2065#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {2065#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:09,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {2065#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {2064#false} is VALID [2018-11-23 12:43:09,552 INFO L273 TraceCheckUtils]: 18: Hoare triple {2064#false} assume 0 != ~p3~0; {2064#false} is VALID [2018-11-23 12:43:09,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {2064#false} assume 1 != ~lk3~0; {2064#false} is VALID [2018-11-23 12:43:09,553 INFO L273 TraceCheckUtils]: 20: Hoare triple {2064#false} assume !false; {2064#false} is VALID [2018-11-23 12:43:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:09,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:09,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:09,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:09,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:09,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:09,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:09,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:09,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:09,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:09,585 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-11-23 12:43:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,870 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-11-23 12:43:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:09,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2018-11-23 12:43:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2018-11-23 12:43:09,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2018-11-23 12:43:10,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:10,182 INFO L225 Difference]: With dead ends: 183 [2018-11-23 12:43:10,182 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:43:10,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:43:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-23 12:43:10,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:10,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 124 states. [2018-11-23 12:43:10,220 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 124 states. [2018-11-23 12:43:10,220 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 124 states. [2018-11-23 12:43:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,225 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2018-11-23 12:43:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2018-11-23 12:43:10,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:10,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:10,226 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 126 states. [2018-11-23 12:43:10,226 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 126 states. [2018-11-23 12:43:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,231 INFO L93 Difference]: Finished difference Result 126 states and 211 transitions. [2018-11-23 12:43:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 211 transitions. [2018-11-23 12:43:10,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:10,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:10,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:10,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 12:43:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-11-23 12:43:10,237 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-11-23 12:43:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:10,237 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-11-23 12:43:10,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-11-23 12:43:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:10,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:10,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:10,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:10,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-11-23 12:43:10,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:10,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:10,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:10,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:10,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {2651#true} call ULTIMATE.init(); {2651#true} is VALID [2018-11-23 12:43:10,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {2651#true} assume true; {2651#true} is VALID [2018-11-23 12:43:10,321 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2651#true} {2651#true} #180#return; {2651#true} is VALID [2018-11-23 12:43:10,322 INFO L256 TraceCheckUtils]: 3: Hoare triple {2651#true} call #t~ret10 := main(); {2651#true} is VALID [2018-11-23 12:43:10,322 INFO L273 TraceCheckUtils]: 4: Hoare triple {2651#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {2651#true} is VALID [2018-11-23 12:43:10,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {2651#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {2651#true} is VALID [2018-11-23 12:43:10,323 INFO L273 TraceCheckUtils]: 6: Hoare triple {2651#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {2651#true} is VALID [2018-11-23 12:43:10,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {2651#true} assume !(0 != ~p1~0); {2651#true} is VALID [2018-11-23 12:43:10,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {2651#true} assume !(0 != ~p2~0); {2651#true} is VALID [2018-11-23 12:43:10,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {2651#true} assume 0 != ~p3~0;~lk3~0 := 1; {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {2653#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,338 INFO L273 TraceCheckUtils]: 11: Hoare triple {2653#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {2653#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {2653#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,339 INFO L273 TraceCheckUtils]: 14: Hoare triple {2653#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {2653#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {2653#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {2653#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {2653#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2653#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:10,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {2653#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2652#false} is VALID [2018-11-23 12:43:10,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {2652#false} assume !false; {2652#false} is VALID [2018-11-23 12:43:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:10,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:10,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:10,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:10,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:10,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:10,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:10,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:10,366 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-11-23 12:43:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,576 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-11-23 12:43:10,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:10,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:43:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 12:43:10,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 12:43:11,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:11,359 INFO L225 Difference]: With dead ends: 228 [2018-11-23 12:43:11,359 INFO L226 Difference]: Without dead ends: 226 [2018-11-23 12:43:11,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-23 12:43:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-11-23 12:43:11,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:11,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 168 states. [2018-11-23 12:43:11,690 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 168 states. [2018-11-23 12:43:11,690 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 168 states. [2018-11-23 12:43:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:11,709 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2018-11-23 12:43:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2018-11-23 12:43:11,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:11,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:11,711 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand 226 states. [2018-11-23 12:43:11,711 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 226 states. [2018-11-23 12:43:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:11,719 INFO L93 Difference]: Finished difference Result 226 states and 387 transitions. [2018-11-23 12:43:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 387 transitions. [2018-11-23 12:43:11,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:11,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:11,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:11,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 12:43:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-11-23 12:43:11,726 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-11-23 12:43:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:11,726 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-11-23 12:43:11,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-11-23 12:43:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:11,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:11,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:11,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:11,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:11,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-11-23 12:43:11,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:11,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:11,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:11,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {3530#true} call ULTIMATE.init(); {3530#true} is VALID [2018-11-23 12:43:11,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {3530#true} assume true; {3530#true} is VALID [2018-11-23 12:43:11,934 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3530#true} {3530#true} #180#return; {3530#true} is VALID [2018-11-23 12:43:11,934 INFO L256 TraceCheckUtils]: 3: Hoare triple {3530#true} call #t~ret10 := main(); {3530#true} is VALID [2018-11-23 12:43:11,934 INFO L273 TraceCheckUtils]: 4: Hoare triple {3530#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {3530#true} is VALID [2018-11-23 12:43:11,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {3530#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {3530#true} is VALID [2018-11-23 12:43:11,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {3530#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {3530#true} is VALID [2018-11-23 12:43:11,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {3530#true} assume !(0 != ~p1~0); {3530#true} is VALID [2018-11-23 12:43:11,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {3530#true} assume !(0 != ~p2~0); {3530#true} is VALID [2018-11-23 12:43:11,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {3530#true} assume !(0 != ~p3~0); {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {3532#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {3532#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,947 INFO L273 TraceCheckUtils]: 12: Hoare triple {3532#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {3532#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {3532#(= main_~p3~0 0)} assume !(0 != ~p8~0); {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {3532#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {3532#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {3532#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3532#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:11,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {3532#(= main_~p3~0 0)} assume 0 != ~p3~0; {3531#false} is VALID [2018-11-23 12:43:11,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {3531#false} assume 1 != ~lk3~0; {3531#false} is VALID [2018-11-23 12:43:11,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {3531#false} assume !false; {3531#false} is VALID [2018-11-23 12:43:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:11,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:11,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:11,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:11,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:11,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:11,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:11,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:11,987 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-11-23 12:43:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:12,201 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-11-23 12:43:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:12,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 12:43:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2018-11-23 12:43:12,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2018-11-23 12:43:12,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:12,614 INFO L225 Difference]: With dead ends: 392 [2018-11-23 12:43:12,614 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 12:43:12,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 12:43:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-11-23 12:43:12,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:12,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand 232 states. [2018-11-23 12:43:12,668 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 232 states. [2018-11-23 12:43:12,668 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 232 states. [2018-11-23 12:43:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:12,675 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2018-11-23 12:43:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2018-11-23 12:43:12,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:12,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:12,676 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 234 states. [2018-11-23 12:43:12,676 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 234 states. [2018-11-23 12:43:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:12,682 INFO L93 Difference]: Finished difference Result 234 states and 387 transitions. [2018-11-23 12:43:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 387 transitions. [2018-11-23 12:43:12,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:12,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:12,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:12,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 12:43:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-11-23 12:43:12,689 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-11-23 12:43:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:12,689 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-11-23 12:43:12,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-11-23 12:43:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:12,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:12,690 INFO L402 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] [2018-11-23 12:43:12,690 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:12,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-11-23 12:43:12,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:12,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:12,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:12,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:12,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:12,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {4661#true} call ULTIMATE.init(); {4661#true} is VALID [2018-11-23 12:43:12,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {4661#true} assume true; {4661#true} is VALID [2018-11-23 12:43:12,736 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4661#true} {4661#true} #180#return; {4661#true} is VALID [2018-11-23 12:43:12,737 INFO L256 TraceCheckUtils]: 3: Hoare triple {4661#true} call #t~ret10 := main(); {4661#true} is VALID [2018-11-23 12:43:12,737 INFO L273 TraceCheckUtils]: 4: Hoare triple {4661#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {4661#true} is VALID [2018-11-23 12:43:12,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {4661#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {4661#true} is VALID [2018-11-23 12:43:12,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {4661#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {4661#true} is VALID [2018-11-23 12:43:12,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {4661#true} assume !(0 != ~p1~0); {4661#true} is VALID [2018-11-23 12:43:12,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {4661#true} assume !(0 != ~p2~0); {4661#true} is VALID [2018-11-23 12:43:12,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {4661#true} assume 0 != ~p3~0;~lk3~0 := 1; {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,742 INFO L273 TraceCheckUtils]: 10: Hoare triple {4663#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {4663#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {4663#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {4663#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,746 INFO L273 TraceCheckUtils]: 14: Hoare triple {4663#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,756 INFO L273 TraceCheckUtils]: 15: Hoare triple {4663#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {4663#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,757 INFO L273 TraceCheckUtils]: 17: Hoare triple {4663#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4663#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:12,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {4663#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4662#false} is VALID [2018-11-23 12:43:12,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {4662#false} assume 0 != ~p4~0; {4662#false} is VALID [2018-11-23 12:43:12,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {4662#false} assume 1 != ~lk4~0; {4662#false} is VALID [2018-11-23 12:43:12,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {4662#false} assume !false; {4662#false} is VALID [2018-11-23 12:43:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:12,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:12,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:12,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:12,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:12,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:12,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:12,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:12,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:12,827 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-11-23 12:43:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,228 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-11-23 12:43:13,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:13,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:43:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 12:43:13,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 12:43:13,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:13,816 INFO L225 Difference]: With dead ends: 348 [2018-11-23 12:43:13,816 INFO L226 Difference]: Without dead ends: 238 [2018-11-23 12:43:13,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-23 12:43:13,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-11-23 12:43:13,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:13,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 236 states. [2018-11-23 12:43:13,899 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 236 states. [2018-11-23 12:43:13,899 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 236 states. [2018-11-23 12:43:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,905 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2018-11-23 12:43:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2018-11-23 12:43:13,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:13,907 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 238 states. [2018-11-23 12:43:13,907 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 238 states. [2018-11-23 12:43:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,913 INFO L93 Difference]: Finished difference Result 238 states and 387 transitions. [2018-11-23 12:43:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 387 transitions. [2018-11-23 12:43:13,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:13,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:13,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-23 12:43:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-11-23 12:43:13,919 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-11-23 12:43:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:13,920 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-11-23 12:43:13,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-11-23 12:43:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:13,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:13,921 INFO L402 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] [2018-11-23 12:43:13,921 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:13,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:13,922 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-11-23 12:43:13,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:13,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:13,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:14,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {5760#true} call ULTIMATE.init(); {5760#true} is VALID [2018-11-23 12:43:14,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {5760#true} assume true; {5760#true} is VALID [2018-11-23 12:43:14,133 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5760#true} {5760#true} #180#return; {5760#true} is VALID [2018-11-23 12:43:14,133 INFO L256 TraceCheckUtils]: 3: Hoare triple {5760#true} call #t~ret10 := main(); {5760#true} is VALID [2018-11-23 12:43:14,134 INFO L273 TraceCheckUtils]: 4: Hoare triple {5760#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {5760#true} is VALID [2018-11-23 12:43:14,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {5760#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {5760#true} is VALID [2018-11-23 12:43:14,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {5760#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {5760#true} is VALID [2018-11-23 12:43:14,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {5760#true} assume !(0 != ~p1~0); {5760#true} is VALID [2018-11-23 12:43:14,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {5760#true} assume !(0 != ~p2~0); {5760#true} is VALID [2018-11-23 12:43:14,135 INFO L273 TraceCheckUtils]: 9: Hoare triple {5760#true} assume !(0 != ~p3~0); {5760#true} is VALID [2018-11-23 12:43:14,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {5760#true} assume 0 != ~p4~0;~lk4~0 := 1; {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {5762#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {5762#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,186 INFO L273 TraceCheckUtils]: 13: Hoare triple {5762#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {5762#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,211 INFO L273 TraceCheckUtils]: 15: Hoare triple {5762#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {5762#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {5762#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {5762#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {5762#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5762#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:14,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {5762#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5761#false} is VALID [2018-11-23 12:43:14,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {5761#false} assume !false; {5761#false} is VALID [2018-11-23 12:43:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:14,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:14,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:14,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:14,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:14,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:14,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:14,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:14,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:14,335 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-11-23 12:43:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:14,559 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-11-23 12:43:14,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:14,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 12:43:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-23 12:43:14,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-23 12:43:15,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:15,297 INFO L225 Difference]: With dead ends: 428 [2018-11-23 12:43:15,297 INFO L226 Difference]: Without dead ends: 426 [2018-11-23 12:43:15,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-23 12:43:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-11-23 12:43:15,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:15,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand 328 states. [2018-11-23 12:43:15,417 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand 328 states. [2018-11-23 12:43:15,417 INFO L87 Difference]: Start difference. First operand 426 states. Second operand 328 states. [2018-11-23 12:43:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:15,431 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2018-11-23 12:43:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2018-11-23 12:43:15,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:15,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:15,433 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand 426 states. [2018-11-23 12:43:15,433 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 426 states. [2018-11-23 12:43:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:15,446 INFO L93 Difference]: Finished difference Result 426 states and 703 transitions. [2018-11-23 12:43:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 703 transitions. [2018-11-23 12:43:15,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:15,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:15,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:15,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 12:43:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-11-23 12:43:15,456 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-11-23 12:43:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:15,456 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-11-23 12:43:15,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-11-23 12:43:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:15,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:15,458 INFO L402 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] [2018-11-23 12:43:15,458 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:15,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:15,458 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-11-23 12:43:15,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:15,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:15,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:15,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:15,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {7411#true} call ULTIMATE.init(); {7411#true} is VALID [2018-11-23 12:43:15,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {7411#true} assume true; {7411#true} is VALID [2018-11-23 12:43:15,687 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7411#true} {7411#true} #180#return; {7411#true} is VALID [2018-11-23 12:43:15,687 INFO L256 TraceCheckUtils]: 3: Hoare triple {7411#true} call #t~ret10 := main(); {7411#true} is VALID [2018-11-23 12:43:15,687 INFO L273 TraceCheckUtils]: 4: Hoare triple {7411#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {7411#true} is VALID [2018-11-23 12:43:15,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {7411#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {7411#true} is VALID [2018-11-23 12:43:15,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {7411#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {7411#true} is VALID [2018-11-23 12:43:15,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {7411#true} assume !(0 != ~p1~0); {7411#true} is VALID [2018-11-23 12:43:15,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {7411#true} assume !(0 != ~p2~0); {7411#true} is VALID [2018-11-23 12:43:15,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {7411#true} assume !(0 != ~p3~0); {7411#true} is VALID [2018-11-23 12:43:15,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {7411#true} assume !(0 != ~p4~0); {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {7413#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {7413#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {7413#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {7413#(= main_~p4~0 0)} assume !(0 != ~p8~0); {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {7413#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,775 INFO L273 TraceCheckUtils]: 16: Hoare triple {7413#(= main_~p4~0 0)} assume !(0 != ~p1~0); {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {7413#(= main_~p4~0 0)} assume !(0 != ~p2~0); {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {7413#(= main_~p4~0 0)} assume !(0 != ~p3~0); {7413#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:15,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {7413#(= main_~p4~0 0)} assume 0 != ~p4~0; {7412#false} is VALID [2018-11-23 12:43:15,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {7412#false} assume 1 != ~lk4~0; {7412#false} is VALID [2018-11-23 12:43:15,814 INFO L273 TraceCheckUtils]: 21: Hoare triple {7412#false} assume !false; {7412#false} is VALID [2018-11-23 12:43:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:15,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:15,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:15,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:15,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:15,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:16,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:16,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:16,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:16,021 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-11-23 12:43:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:16,572 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-11-23 12:43:16,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:16,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-23 12:43:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-23 12:43:16,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2018-11-23 12:43:16,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:16,730 INFO L225 Difference]: With dead ends: 764 [2018-11-23 12:43:16,730 INFO L226 Difference]: Without dead ends: 450 [2018-11-23 12:43:16,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-23 12:43:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-11-23 12:43:16,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:16,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand 448 states. [2018-11-23 12:43:16,843 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand 448 states. [2018-11-23 12:43:16,843 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 448 states. [2018-11-23 12:43:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:16,857 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2018-11-23 12:43:16,857 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2018-11-23 12:43:16,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:16,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:16,858 INFO L74 IsIncluded]: Start isIncluded. First operand 448 states. Second operand 450 states. [2018-11-23 12:43:16,858 INFO L87 Difference]: Start difference. First operand 448 states. Second operand 450 states. [2018-11-23 12:43:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:16,871 INFO L93 Difference]: Finished difference Result 450 states and 711 transitions. [2018-11-23 12:43:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 711 transitions. [2018-11-23 12:43:16,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:16,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:16,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:16,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-23 12:43:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-11-23 12:43:16,884 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-11-23 12:43:16,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:16,885 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-11-23 12:43:16,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-11-23 12:43:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:16,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:16,886 INFO L402 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] [2018-11-23 12:43:16,886 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:16,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-11-23 12:43:16,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:16,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:16,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:16,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {9582#true} call ULTIMATE.init(); {9582#true} is VALID [2018-11-23 12:43:16,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {9582#true} assume true; {9582#true} is VALID [2018-11-23 12:43:16,972 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9582#true} {9582#true} #180#return; {9582#true} is VALID [2018-11-23 12:43:16,973 INFO L256 TraceCheckUtils]: 3: Hoare triple {9582#true} call #t~ret10 := main(); {9582#true} is VALID [2018-11-23 12:43:16,973 INFO L273 TraceCheckUtils]: 4: Hoare triple {9582#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {9582#true} is VALID [2018-11-23 12:43:16,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {9582#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {9582#true} is VALID [2018-11-23 12:43:16,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {9582#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {9582#true} is VALID [2018-11-23 12:43:16,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {9582#true} assume !(0 != ~p1~0); {9582#true} is VALID [2018-11-23 12:43:16,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {9582#true} assume !(0 != ~p2~0); {9582#true} is VALID [2018-11-23 12:43:16,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {9582#true} assume !(0 != ~p3~0); {9582#true} is VALID [2018-11-23 12:43:16,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {9582#true} assume 0 != ~p4~0;~lk4~0 := 1; {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {9584#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {9584#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {9584#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {9584#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {9584#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {9584#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {9584#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {9584#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {9584#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:16,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {9584#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {9583#false} is VALID [2018-11-23 12:43:16,978 INFO L273 TraceCheckUtils]: 20: Hoare triple {9583#false} assume 0 != ~p5~0; {9583#false} is VALID [2018-11-23 12:43:16,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {9583#false} assume 1 != ~lk5~0; {9583#false} is VALID [2018-11-23 12:43:16,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {9583#false} assume !false; {9583#false} is VALID [2018-11-23 12:43:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:16,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:16,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:16,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:16,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:16,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:16,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:16,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:16,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:16,997 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-11-23 12:43:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:17,381 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-11-23 12:43:17,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:17,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-23 12:43:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2018-11-23 12:43:17,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2018-11-23 12:43:17,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:17,528 INFO L225 Difference]: With dead ends: 672 [2018-11-23 12:43:17,529 INFO L226 Difference]: Without dead ends: 458 [2018-11-23 12:43:17,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-23 12:43:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-11-23 12:43:17,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:17,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 458 states. Second operand 456 states. [2018-11-23 12:43:17,682 INFO L74 IsIncluded]: Start isIncluded. First operand 458 states. Second operand 456 states. [2018-11-23 12:43:17,682 INFO L87 Difference]: Start difference. First operand 458 states. Second operand 456 states. [2018-11-23 12:43:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:17,695 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2018-11-23 12:43:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2018-11-23 12:43:17,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:17,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:17,696 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 458 states. [2018-11-23 12:43:17,697 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 458 states. [2018-11-23 12:43:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:17,709 INFO L93 Difference]: Finished difference Result 458 states and 711 transitions. [2018-11-23 12:43:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 711 transitions. [2018-11-23 12:43:17,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:17,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:17,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:17,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 12:43:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-11-23 12:43:17,721 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-11-23 12:43:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:17,722 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-11-23 12:43:17,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-11-23 12:43:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:17,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:17,723 INFO L402 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] [2018-11-23 12:43:17,723 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:17,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-11-23 12:43:17,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:17,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:17,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:17,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:17,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:17,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {11685#true} call ULTIMATE.init(); {11685#true} is VALID [2018-11-23 12:43:17,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {11685#true} assume true; {11685#true} is VALID [2018-11-23 12:43:17,817 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11685#true} {11685#true} #180#return; {11685#true} is VALID [2018-11-23 12:43:17,817 INFO L256 TraceCheckUtils]: 3: Hoare triple {11685#true} call #t~ret10 := main(); {11685#true} is VALID [2018-11-23 12:43:17,817 INFO L273 TraceCheckUtils]: 4: Hoare triple {11685#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {11685#true} is VALID [2018-11-23 12:43:17,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {11685#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {11685#true} is VALID [2018-11-23 12:43:17,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {11685#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {11685#true} is VALID [2018-11-23 12:43:17,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {11685#true} assume !(0 != ~p1~0); {11685#true} is VALID [2018-11-23 12:43:17,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {11685#true} assume !(0 != ~p2~0); {11685#true} is VALID [2018-11-23 12:43:17,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {11685#true} assume !(0 != ~p3~0); {11685#true} is VALID [2018-11-23 12:43:17,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {11685#true} assume !(0 != ~p4~0); {11685#true} is VALID [2018-11-23 12:43:17,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {11685#true} assume 0 != ~p5~0;~lk5~0 := 1; {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {11687#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {11687#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {11687#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {11687#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {11687#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,827 INFO L273 TraceCheckUtils]: 17: Hoare triple {11687#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {11687#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {11687#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {11687#(= main_~lk5~0 1)} assume 0 != ~p5~0; {11687#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:17,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {11687#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {11686#false} is VALID [2018-11-23 12:43:17,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {11686#false} assume !false; {11686#false} is VALID [2018-11-23 12:43:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:17,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:17,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:17,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:17,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:17,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:17,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:17,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:17,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:17,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:17,855 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-11-23 12:43:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:18,843 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-11-23 12:43:18,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:18,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:43:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:43:18,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 12:43:18,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:18,963 INFO L225 Difference]: With dead ends: 812 [2018-11-23 12:43:18,963 INFO L226 Difference]: Without dead ends: 810 [2018-11-23 12:43:18,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-23 12:43:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-11-23 12:43:19,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:19,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 810 states. Second operand 648 states. [2018-11-23 12:43:19,116 INFO L74 IsIncluded]: Start isIncluded. First operand 810 states. Second operand 648 states. [2018-11-23 12:43:19,116 INFO L87 Difference]: Start difference. First operand 810 states. Second operand 648 states. [2018-11-23 12:43:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:19,146 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2018-11-23 12:43:19,146 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2018-11-23 12:43:19,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:19,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:19,148 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand 810 states. [2018-11-23 12:43:19,148 INFO L87 Difference]: Start difference. First operand 648 states. Second operand 810 states. [2018-11-23 12:43:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:19,184 INFO L93 Difference]: Finished difference Result 810 states and 1271 transitions. [2018-11-23 12:43:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1271 transitions. [2018-11-23 12:43:19,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:19,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:19,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:19,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-23 12:43:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-11-23 12:43:19,210 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-11-23 12:43:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:19,210 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-11-23 12:43:19,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-11-23 12:43:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:19,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:19,212 INFO L402 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] [2018-11-23 12:43:19,212 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:19,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-11-23 12:43:19,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:19,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:19,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:19,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {14832#true} call ULTIMATE.init(); {14832#true} is VALID [2018-11-23 12:43:19,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {14832#true} assume true; {14832#true} is VALID [2018-11-23 12:43:19,337 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14832#true} {14832#true} #180#return; {14832#true} is VALID [2018-11-23 12:43:19,337 INFO L256 TraceCheckUtils]: 3: Hoare triple {14832#true} call #t~ret10 := main(); {14832#true} is VALID [2018-11-23 12:43:19,338 INFO L273 TraceCheckUtils]: 4: Hoare triple {14832#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {14832#true} is VALID [2018-11-23 12:43:19,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {14832#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {14832#true} is VALID [2018-11-23 12:43:19,338 INFO L273 TraceCheckUtils]: 6: Hoare triple {14832#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {14832#true} is VALID [2018-11-23 12:43:19,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {14832#true} assume !(0 != ~p1~0); {14832#true} is VALID [2018-11-23 12:43:19,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {14832#true} assume !(0 != ~p2~0); {14832#true} is VALID [2018-11-23 12:43:19,338 INFO L273 TraceCheckUtils]: 9: Hoare triple {14832#true} assume !(0 != ~p3~0); {14832#true} is VALID [2018-11-23 12:43:19,338 INFO L273 TraceCheckUtils]: 10: Hoare triple {14832#true} assume !(0 != ~p4~0); {14832#true} is VALID [2018-11-23 12:43:19,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {14832#true} assume !(0 != ~p5~0); {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,339 INFO L273 TraceCheckUtils]: 12: Hoare triple {14834#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {14834#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {14834#(= main_~p5~0 0)} assume !(0 != ~p8~0); {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {14834#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,343 INFO L273 TraceCheckUtils]: 16: Hoare triple {14834#(= main_~p5~0 0)} assume !(0 != ~p1~0); {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {14834#(= main_~p5~0 0)} assume !(0 != ~p2~0); {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {14834#(= main_~p5~0 0)} assume !(0 != ~p3~0); {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {14834#(= main_~p5~0 0)} assume !(0 != ~p4~0); {14834#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:19,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {14834#(= main_~p5~0 0)} assume 0 != ~p5~0; {14833#false} is VALID [2018-11-23 12:43:19,344 INFO L273 TraceCheckUtils]: 21: Hoare triple {14833#false} assume 1 != ~lk5~0; {14833#false} is VALID [2018-11-23 12:43:19,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {14833#false} assume !false; {14833#false} is VALID [2018-11-23 12:43:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:19,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:19,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:19,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:19,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:19,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:19,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:19,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:19,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:19,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:19,428 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-11-23 12:43:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:19,751 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-11-23 12:43:19,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:19,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2018-11-23 12:43:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2018-11-23 12:43:19,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2018-11-23 12:43:19,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:19,932 INFO L225 Difference]: With dead ends: 1500 [2018-11-23 12:43:19,932 INFO L226 Difference]: Without dead ends: 874 [2018-11-23 12:43:19,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-23 12:43:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-11-23 12:43:20,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:20,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 874 states. Second operand 872 states. [2018-11-23 12:43:20,436 INFO L74 IsIncluded]: Start isIncluded. First operand 874 states. Second operand 872 states. [2018-11-23 12:43:20,436 INFO L87 Difference]: Start difference. First operand 874 states. Second operand 872 states. [2018-11-23 12:43:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:20,467 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2018-11-23 12:43:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2018-11-23 12:43:20,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:20,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:20,469 INFO L74 IsIncluded]: Start isIncluded. First operand 872 states. Second operand 874 states. [2018-11-23 12:43:20,469 INFO L87 Difference]: Start difference. First operand 872 states. Second operand 874 states. [2018-11-23 12:43:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:20,508 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2018-11-23 12:43:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1303 transitions. [2018-11-23 12:43:20,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:20,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:20,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:20,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-23 12:43:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-11-23 12:43:20,545 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-11-23 12:43:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:20,545 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-11-23 12:43:20,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-11-23 12:43:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:20,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:20,547 INFO L402 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] [2018-11-23 12:43:20,547 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:20,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:20,547 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-11-23 12:43:20,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:20,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:20,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {19051#true} call ULTIMATE.init(); {19051#true} is VALID [2018-11-23 12:43:20,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {19051#true} assume true; {19051#true} is VALID [2018-11-23 12:43:20,778 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {19051#true} {19051#true} #180#return; {19051#true} is VALID [2018-11-23 12:43:20,778 INFO L256 TraceCheckUtils]: 3: Hoare triple {19051#true} call #t~ret10 := main(); {19051#true} is VALID [2018-11-23 12:43:20,778 INFO L273 TraceCheckUtils]: 4: Hoare triple {19051#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {19051#true} is VALID [2018-11-23 12:43:20,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {19051#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {19051#true} is VALID [2018-11-23 12:43:20,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {19051#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {19051#true} is VALID [2018-11-23 12:43:20,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {19051#true} assume !(0 != ~p1~0); {19051#true} is VALID [2018-11-23 12:43:20,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {19051#true} assume !(0 != ~p2~0); {19051#true} is VALID [2018-11-23 12:43:20,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {19051#true} assume !(0 != ~p3~0); {19051#true} is VALID [2018-11-23 12:43:20,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {19051#true} assume !(0 != ~p4~0); {19051#true} is VALID [2018-11-23 12:43:20,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {19051#true} assume 0 != ~p5~0;~lk5~0 := 1; {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {19053#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {19053#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {19053#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,842 INFO L273 TraceCheckUtils]: 15: Hoare triple {19053#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {19053#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {19053#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {19053#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {19053#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {19053#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:20,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {19053#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {19052#false} is VALID [2018-11-23 12:43:20,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {19052#false} assume 0 != ~p6~0; {19052#false} is VALID [2018-11-23 12:43:20,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {19052#false} assume 1 != ~lk6~0; {19052#false} is VALID [2018-11-23 12:43:20,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {19052#false} assume !false; {19052#false} is VALID [2018-11-23 12:43:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:20,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:20,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:20,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:20,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:20,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:21,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:21,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,072 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-11-23 12:43:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,480 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-11-23 12:43:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:21,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-23 12:43:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-23 12:43:21,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2018-11-23 12:43:21,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:21,678 INFO L225 Difference]: With dead ends: 1308 [2018-11-23 12:43:21,678 INFO L226 Difference]: Without dead ends: 890 [2018-11-23 12:43:21,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-11-23 12:43:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-11-23 12:43:22,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:22,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 890 states. Second operand 888 states. [2018-11-23 12:43:22,514 INFO L74 IsIncluded]: Start isIncluded. First operand 890 states. Second operand 888 states. [2018-11-23 12:43:22,515 INFO L87 Difference]: Start difference. First operand 890 states. Second operand 888 states. [2018-11-23 12:43:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,545 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2018-11-23 12:43:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2018-11-23 12:43:22,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:22,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:22,546 INFO L74 IsIncluded]: Start isIncluded. First operand 888 states. Second operand 890 states. [2018-11-23 12:43:22,546 INFO L87 Difference]: Start difference. First operand 888 states. Second operand 890 states. [2018-11-23 12:43:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:22,578 INFO L93 Difference]: Finished difference Result 890 states and 1303 transitions. [2018-11-23 12:43:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1303 transitions. [2018-11-23 12:43:22,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:22,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:22,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:22,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-23 12:43:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-11-23 12:43:22,607 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-11-23 12:43:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:22,608 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-11-23 12:43:22,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-11-23 12:43:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:22,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:22,610 INFO L402 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] [2018-11-23 12:43:22,610 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:22,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:22,610 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-11-23 12:43:22,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:22,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:22,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:22,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:22,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {23126#true} call ULTIMATE.init(); {23126#true} is VALID [2018-11-23 12:43:22,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {23126#true} assume true; {23126#true} is VALID [2018-11-23 12:43:22,685 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23126#true} {23126#true} #180#return; {23126#true} is VALID [2018-11-23 12:43:22,686 INFO L256 TraceCheckUtils]: 3: Hoare triple {23126#true} call #t~ret10 := main(); {23126#true} is VALID [2018-11-23 12:43:22,686 INFO L273 TraceCheckUtils]: 4: Hoare triple {23126#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {23126#true} is VALID [2018-11-23 12:43:22,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {23126#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {23126#true} is VALID [2018-11-23 12:43:22,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {23126#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {23126#true} is VALID [2018-11-23 12:43:22,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {23126#true} assume !(0 != ~p1~0); {23126#true} is VALID [2018-11-23 12:43:22,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {23126#true} assume !(0 != ~p2~0); {23126#true} is VALID [2018-11-23 12:43:22,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {23126#true} assume !(0 != ~p3~0); {23126#true} is VALID [2018-11-23 12:43:22,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {23126#true} assume !(0 != ~p4~0); {23126#true} is VALID [2018-11-23 12:43:22,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {23126#true} assume !(0 != ~p5~0); {23126#true} is VALID [2018-11-23 12:43:22,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {23126#true} assume 0 != ~p6~0;~lk6~0 := 1; {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,689 INFO L273 TraceCheckUtils]: 13: Hoare triple {23128#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {23128#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {23128#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,691 INFO L273 TraceCheckUtils]: 16: Hoare triple {23128#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {23128#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,693 INFO L273 TraceCheckUtils]: 18: Hoare triple {23128#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {23128#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {23128#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {23128#(= main_~lk6~0 1)} assume 0 != ~p6~0; {23128#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:22,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {23128#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {23127#false} is VALID [2018-11-23 12:43:22,696 INFO L273 TraceCheckUtils]: 23: Hoare triple {23127#false} assume !false; {23127#false} is VALID [2018-11-23 12:43:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:22,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:22,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:22,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:22,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:22,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:22,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:22,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:22,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:22,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:22,727 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-11-23 12:43:23,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:23,541 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-11-23 12:43:23,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:23,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:43:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:43:23,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 12:43:23,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:23,735 INFO L225 Difference]: With dead ends: 1548 [2018-11-23 12:43:23,735 INFO L226 Difference]: Without dead ends: 1546 [2018-11-23 12:43:23,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-23 12:43:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-11-23 12:43:24,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:24,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1288 states. [2018-11-23 12:43:24,062 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1288 states. [2018-11-23 12:43:24,062 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1288 states. [2018-11-23 12:43:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:24,139 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2018-11-23 12:43:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2018-11-23 12:43:24,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:24,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:24,141 INFO L74 IsIncluded]: Start isIncluded. First operand 1288 states. Second operand 1546 states. [2018-11-23 12:43:24,141 INFO L87 Difference]: Start difference. First operand 1288 states. Second operand 1546 states. [2018-11-23 12:43:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:24,230 INFO L93 Difference]: Finished difference Result 1546 states and 2279 transitions. [2018-11-23 12:43:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2279 transitions. [2018-11-23 12:43:24,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:24,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:24,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:24,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-11-23 12:43:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-11-23 12:43:24,285 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-11-23 12:43:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:24,285 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-11-23 12:43:24,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-11-23 12:43:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:24,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:24,286 INFO L402 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] [2018-11-23 12:43:24,286 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:24,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-11-23 12:43:24,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:24,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:24,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:24,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:24,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:24,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {29169#true} call ULTIMATE.init(); {29169#true} is VALID [2018-11-23 12:43:24,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {29169#true} assume true; {29169#true} is VALID [2018-11-23 12:43:24,350 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29169#true} {29169#true} #180#return; {29169#true} is VALID [2018-11-23 12:43:24,351 INFO L256 TraceCheckUtils]: 3: Hoare triple {29169#true} call #t~ret10 := main(); {29169#true} is VALID [2018-11-23 12:43:24,351 INFO L273 TraceCheckUtils]: 4: Hoare triple {29169#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {29169#true} is VALID [2018-11-23 12:43:24,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {29169#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {29169#true} is VALID [2018-11-23 12:43:24,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {29169#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {29169#true} is VALID [2018-11-23 12:43:24,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {29169#true} assume !(0 != ~p1~0); {29169#true} is VALID [2018-11-23 12:43:24,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {29169#true} assume !(0 != ~p2~0); {29169#true} is VALID [2018-11-23 12:43:24,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {29169#true} assume !(0 != ~p3~0); {29169#true} is VALID [2018-11-23 12:43:24,352 INFO L273 TraceCheckUtils]: 10: Hoare triple {29169#true} assume !(0 != ~p4~0); {29169#true} is VALID [2018-11-23 12:43:24,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {29169#true} assume !(0 != ~p5~0); {29169#true} is VALID [2018-11-23 12:43:24,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {29169#true} assume !(0 != ~p6~0); {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {29171#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {29171#(= main_~p6~0 0)} assume !(0 != ~p8~0); {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {29171#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {29171#(= main_~p6~0 0)} assume !(0 != ~p1~0); {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {29171#(= main_~p6~0 0)} assume !(0 != ~p2~0); {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {29171#(= main_~p6~0 0)} assume !(0 != ~p3~0); {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {29171#(= main_~p6~0 0)} assume !(0 != ~p4~0); {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {29171#(= main_~p6~0 0)} assume !(0 != ~p5~0); {29171#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:24,363 INFO L273 TraceCheckUtils]: 21: Hoare triple {29171#(= main_~p6~0 0)} assume 0 != ~p6~0; {29170#false} is VALID [2018-11-23 12:43:24,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {29170#false} assume 1 != ~lk6~0; {29170#false} is VALID [2018-11-23 12:43:24,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {29170#false} assume !false; {29170#false} is VALID [2018-11-23 12:43:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:24,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:24,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:24,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:24,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:24,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:24,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:24,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:24,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:24,390 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-11-23 12:43:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:25,430 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-11-23 12:43:25,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:25,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:43:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 12:43:25,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 12:43:25,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:25,719 INFO L225 Difference]: With dead ends: 2956 [2018-11-23 12:43:25,719 INFO L226 Difference]: Without dead ends: 1706 [2018-11-23 12:43:25,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-11-23 12:43:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-11-23 12:43:26,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:26,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1706 states. Second operand 1704 states. [2018-11-23 12:43:26,229 INFO L74 IsIncluded]: Start isIncluded. First operand 1706 states. Second operand 1704 states. [2018-11-23 12:43:26,229 INFO L87 Difference]: Start difference. First operand 1706 states. Second operand 1704 states. [2018-11-23 12:43:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:26,339 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2018-11-23 12:43:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2018-11-23 12:43:26,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:26,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:26,341 INFO L74 IsIncluded]: Start isIncluded. First operand 1704 states. Second operand 1706 states. [2018-11-23 12:43:26,341 INFO L87 Difference]: Start difference. First operand 1704 states. Second operand 1706 states. [2018-11-23 12:43:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:26,435 INFO L93 Difference]: Finished difference Result 1706 states and 2375 transitions. [2018-11-23 12:43:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2375 transitions. [2018-11-23 12:43:26,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:26,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:26,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:26,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-11-23 12:43:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-11-23 12:43:26,524 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-11-23 12:43:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:26,524 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-11-23 12:43:26,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-11-23 12:43:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:26,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:26,526 INFO L402 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] [2018-11-23 12:43:26,526 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:26,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:26,527 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-11-23 12:43:26,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:26,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:26,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:26,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:26,643 INFO L256 TraceCheckUtils]: 0: Hoare triple {37420#true} call ULTIMATE.init(); {37420#true} is VALID [2018-11-23 12:43:26,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {37420#true} assume true; {37420#true} is VALID [2018-11-23 12:43:26,643 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {37420#true} {37420#true} #180#return; {37420#true} is VALID [2018-11-23 12:43:26,643 INFO L256 TraceCheckUtils]: 3: Hoare triple {37420#true} call #t~ret10 := main(); {37420#true} is VALID [2018-11-23 12:43:26,644 INFO L273 TraceCheckUtils]: 4: Hoare triple {37420#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {37420#true} is VALID [2018-11-23 12:43:26,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {37420#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {37420#true} is VALID [2018-11-23 12:43:26,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {37420#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {37420#true} is VALID [2018-11-23 12:43:26,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {37420#true} assume !(0 != ~p1~0); {37420#true} is VALID [2018-11-23 12:43:26,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {37420#true} assume !(0 != ~p2~0); {37420#true} is VALID [2018-11-23 12:43:26,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {37420#true} assume !(0 != ~p3~0); {37420#true} is VALID [2018-11-23 12:43:26,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {37420#true} assume !(0 != ~p4~0); {37420#true} is VALID [2018-11-23 12:43:26,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {37420#true} assume !(0 != ~p5~0); {37420#true} is VALID [2018-11-23 12:43:26,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {37420#true} assume 0 != ~p6~0;~lk6~0 := 1; {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {37422#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {37422#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {37422#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {37422#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {37422#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {37422#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {37422#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {37422#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {37422#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:26,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {37422#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {37421#false} is VALID [2018-11-23 12:43:26,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {37421#false} assume 0 != ~p7~0; {37421#false} is VALID [2018-11-23 12:43:26,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {37421#false} assume 1 != ~lk7~0; {37421#false} is VALID [2018-11-23 12:43:26,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {37421#false} assume !false; {37421#false} is VALID [2018-11-23 12:43:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:26,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:26,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:26,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:26,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:26,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:26,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:26,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:26,686 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-11-23 12:43:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:27,708 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-11-23 12:43:27,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:27,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 12:43:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 12:43:27,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2018-11-23 12:43:27,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:27,990 INFO L225 Difference]: With dead ends: 2556 [2018-11-23 12:43:27,990 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 12:43:27,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:27,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 12:43:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-11-23 12:43:28,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:28,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1738 states. Second operand 1736 states. [2018-11-23 12:43:28,678 INFO L74 IsIncluded]: Start isIncluded. First operand 1738 states. Second operand 1736 states. [2018-11-23 12:43:28,679 INFO L87 Difference]: Start difference. First operand 1738 states. Second operand 1736 states. [2018-11-23 12:43:28,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:28,770 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2018-11-23 12:43:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2018-11-23 12:43:28,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:28,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:28,772 INFO L74 IsIncluded]: Start isIncluded. First operand 1736 states. Second operand 1738 states. [2018-11-23 12:43:28,772 INFO L87 Difference]: Start difference. First operand 1736 states. Second operand 1738 states. [2018-11-23 12:43:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:28,862 INFO L93 Difference]: Finished difference Result 1738 states and 2375 transitions. [2018-11-23 12:43:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2375 transitions. [2018-11-23 12:43:28,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:28,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:28,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:28,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-11-23 12:43:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-11-23 12:43:28,973 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-11-23 12:43:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:28,973 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-11-23 12:43:28,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-11-23 12:43:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:28,974 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:28,974 INFO L402 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] [2018-11-23 12:43:28,974 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:28,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:28,975 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-11-23 12:43:28,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:28,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:28,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:28,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:28,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:29,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {45367#true} call ULTIMATE.init(); {45367#true} is VALID [2018-11-23 12:43:29,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {45367#true} assume true; {45367#true} is VALID [2018-11-23 12:43:29,208 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {45367#true} {45367#true} #180#return; {45367#true} is VALID [2018-11-23 12:43:29,209 INFO L256 TraceCheckUtils]: 3: Hoare triple {45367#true} call #t~ret10 := main(); {45367#true} is VALID [2018-11-23 12:43:29,209 INFO L273 TraceCheckUtils]: 4: Hoare triple {45367#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {45367#true} is VALID [2018-11-23 12:43:29,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {45367#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {45367#true} is VALID [2018-11-23 12:43:29,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {45367#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {45367#true} is VALID [2018-11-23 12:43:29,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {45367#true} assume !(0 != ~p1~0); {45367#true} is VALID [2018-11-23 12:43:29,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {45367#true} assume !(0 != ~p2~0); {45367#true} is VALID [2018-11-23 12:43:29,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {45367#true} assume !(0 != ~p3~0); {45367#true} is VALID [2018-11-23 12:43:29,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {45367#true} assume !(0 != ~p4~0); {45367#true} is VALID [2018-11-23 12:43:29,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {45367#true} assume !(0 != ~p5~0); {45367#true} is VALID [2018-11-23 12:43:29,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {45367#true} assume !(0 != ~p6~0); {45367#true} is VALID [2018-11-23 12:43:29,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {45367#true} assume 0 != ~p7~0;~lk7~0 := 1; {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {45369#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {45369#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {45369#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {45369#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {45369#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {45369#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {45369#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {45369#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {45369#(= main_~lk7~0 1)} assume 0 != ~p7~0; {45369#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:29,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {45369#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {45368#false} is VALID [2018-11-23 12:43:29,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {45368#false} assume !false; {45368#false} is VALID [2018-11-23 12:43:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:29,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:29,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:29,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:29,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:29,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:29,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:29,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:29,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:29,244 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-11-23 12:43:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:31,395 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-11-23 12:43:31,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:31,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 12:43:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 12:43:31,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-23 12:43:31,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:31,818 INFO L225 Difference]: With dead ends: 2956 [2018-11-23 12:43:31,818 INFO L226 Difference]: Without dead ends: 2954 [2018-11-23 12:43:31,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-23 12:43:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-11-23 12:43:32,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:32,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2568 states. [2018-11-23 12:43:32,564 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2568 states. [2018-11-23 12:43:32,564 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2568 states. [2018-11-23 12:43:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:32,810 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2018-11-23 12:43:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2018-11-23 12:43:32,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:32,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:32,813 INFO L74 IsIncluded]: Start isIncluded. First operand 2568 states. Second operand 2954 states. [2018-11-23 12:43:32,813 INFO L87 Difference]: Start difference. First operand 2568 states. Second operand 2954 states. [2018-11-23 12:43:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:33,042 INFO L93 Difference]: Finished difference Result 2954 states and 4039 transitions. [2018-11-23 12:43:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4039 transitions. [2018-11-23 12:43:33,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:33,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:33,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:33,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-11-23 12:43:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-11-23 12:43:33,238 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-11-23 12:43:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:33,238 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-11-23 12:43:33,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-11-23 12:43:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:33,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:33,240 INFO L402 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] [2018-11-23 12:43:33,241 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:33,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-11-23 12:43:33,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:33,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:33,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {57010#true} call ULTIMATE.init(); {57010#true} is VALID [2018-11-23 12:43:33,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {57010#true} assume true; {57010#true} is VALID [2018-11-23 12:43:33,340 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {57010#true} {57010#true} #180#return; {57010#true} is VALID [2018-11-23 12:43:33,340 INFO L256 TraceCheckUtils]: 3: Hoare triple {57010#true} call #t~ret10 := main(); {57010#true} is VALID [2018-11-23 12:43:33,340 INFO L273 TraceCheckUtils]: 4: Hoare triple {57010#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {57010#true} is VALID [2018-11-23 12:43:33,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {57010#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {57010#true} is VALID [2018-11-23 12:43:33,340 INFO L273 TraceCheckUtils]: 6: Hoare triple {57010#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {57010#true} is VALID [2018-11-23 12:43:33,340 INFO L273 TraceCheckUtils]: 7: Hoare triple {57010#true} assume !(0 != ~p1~0); {57010#true} is VALID [2018-11-23 12:43:33,341 INFO L273 TraceCheckUtils]: 8: Hoare triple {57010#true} assume !(0 != ~p2~0); {57010#true} is VALID [2018-11-23 12:43:33,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {57010#true} assume !(0 != ~p3~0); {57010#true} is VALID [2018-11-23 12:43:33,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {57010#true} assume !(0 != ~p4~0); {57010#true} is VALID [2018-11-23 12:43:33,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {57010#true} assume !(0 != ~p5~0); {57010#true} is VALID [2018-11-23 12:43:33,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {57010#true} assume !(0 != ~p6~0); {57010#true} is VALID [2018-11-23 12:43:33,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {57010#true} assume !(0 != ~p7~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {57012#(= main_~p7~0 0)} assume !(0 != ~p8~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {57012#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {57012#(= main_~p7~0 0)} assume !(0 != ~p1~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,346 INFO L273 TraceCheckUtils]: 17: Hoare triple {57012#(= main_~p7~0 0)} assume !(0 != ~p2~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {57012#(= main_~p7~0 0)} assume !(0 != ~p3~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {57012#(= main_~p7~0 0)} assume !(0 != ~p4~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {57012#(= main_~p7~0 0)} assume !(0 != ~p5~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {57012#(= main_~p7~0 0)} assume !(0 != ~p6~0); {57012#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:33,347 INFO L273 TraceCheckUtils]: 22: Hoare triple {57012#(= main_~p7~0 0)} assume 0 != ~p7~0; {57011#false} is VALID [2018-11-23 12:43:33,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {57011#false} assume 1 != ~lk7~0; {57011#false} is VALID [2018-11-23 12:43:33,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {57011#false} assume !false; {57011#false} is VALID [2018-11-23 12:43:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:33,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:33,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:33,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:33,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:33,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:33,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:33,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:33,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:33,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:33,370 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-11-23 12:43:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:35,281 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-11-23 12:43:35,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:35,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 12:43:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 12:43:35,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-23 12:43:35,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:35,876 INFO L225 Difference]: With dead ends: 5836 [2018-11-23 12:43:35,877 INFO L226 Difference]: Without dead ends: 3338 [2018-11-23 12:43:35,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-23 12:43:37,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-11-23 12:43:37,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:37,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3338 states. Second operand 3336 states. [2018-11-23 12:43:37,191 INFO L74 IsIncluded]: Start isIncluded. First operand 3338 states. Second operand 3336 states. [2018-11-23 12:43:37,191 INFO L87 Difference]: Start difference. First operand 3338 states. Second operand 3336 states. [2018-11-23 12:43:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:37,599 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2018-11-23 12:43:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2018-11-23 12:43:37,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:37,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:37,603 INFO L74 IsIncluded]: Start isIncluded. First operand 3336 states. Second operand 3338 states. [2018-11-23 12:43:37,603 INFO L87 Difference]: Start difference. First operand 3336 states. Second operand 3338 states. [2018-11-23 12:43:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:37,929 INFO L93 Difference]: Finished difference Result 3338 states and 4295 transitions. [2018-11-23 12:43:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 4295 transitions. [2018-11-23 12:43:37,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:37,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:37,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:37,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-23 12:43:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-11-23 12:43:38,301 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-11-23 12:43:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:38,301 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-11-23 12:43:38,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-11-23 12:43:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:43:38,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:38,304 INFO L402 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] [2018-11-23 12:43:38,304 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:38,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-11-23 12:43:38,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:38,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:38,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {73197#true} call ULTIMATE.init(); {73197#true} is VALID [2018-11-23 12:43:38,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {73197#true} assume true; {73197#true} is VALID [2018-11-23 12:43:38,428 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {73197#true} {73197#true} #180#return; {73197#true} is VALID [2018-11-23 12:43:38,428 INFO L256 TraceCheckUtils]: 3: Hoare triple {73197#true} call #t~ret10 := main(); {73197#true} is VALID [2018-11-23 12:43:38,428 INFO L273 TraceCheckUtils]: 4: Hoare triple {73197#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {73197#true} is VALID [2018-11-23 12:43:38,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {73197#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {73197#true} is VALID [2018-11-23 12:43:38,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {73197#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {73197#true} is VALID [2018-11-23 12:43:38,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {73197#true} assume !(0 != ~p1~0); {73197#true} is VALID [2018-11-23 12:43:38,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {73197#true} assume !(0 != ~p2~0); {73197#true} is VALID [2018-11-23 12:43:38,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {73197#true} assume !(0 != ~p3~0); {73197#true} is VALID [2018-11-23 12:43:38,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {73197#true} assume !(0 != ~p4~0); {73197#true} is VALID [2018-11-23 12:43:38,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {73197#true} assume !(0 != ~p5~0); {73197#true} is VALID [2018-11-23 12:43:38,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {73197#true} assume !(0 != ~p6~0); {73197#true} is VALID [2018-11-23 12:43:38,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {73197#true} assume 0 != ~p7~0;~lk7~0 := 1; {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {73199#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {73199#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:38,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {73199#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {73198#false} is VALID [2018-11-23 12:43:38,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {73198#false} assume 0 != ~p8~0; {73198#false} is VALID [2018-11-23 12:43:38,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {73198#false} assume 1 != ~lk8~0; {73198#false} is VALID [2018-11-23 12:43:38,434 INFO L273 TraceCheckUtils]: 25: Hoare triple {73198#false} assume !false; {73198#false} is VALID [2018-11-23 12:43:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:38,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:38,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:38,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:43:38,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:38,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:38,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:38,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:38,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:38,458 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-11-23 12:43:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:40,879 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-11-23 12:43:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:40,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:43:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:43:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:43:40,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 12:43:41,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:41,457 INFO L225 Difference]: With dead ends: 5004 [2018-11-23 12:43:41,457 INFO L226 Difference]: Without dead ends: 3402 [2018-11-23 12:43:41,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-11-23 12:43:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-11-23 12:43:42,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:42,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3402 states. Second operand 3400 states. [2018-11-23 12:43:42,318 INFO L74 IsIncluded]: Start isIncluded. First operand 3402 states. Second operand 3400 states. [2018-11-23 12:43:42,318 INFO L87 Difference]: Start difference. First operand 3402 states. Second operand 3400 states. [2018-11-23 12:43:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:42,738 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2018-11-23 12:43:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2018-11-23 12:43:42,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:42,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:42,742 INFO L74 IsIncluded]: Start isIncluded. First operand 3400 states. Second operand 3402 states. [2018-11-23 12:43:42,742 INFO L87 Difference]: Start difference. First operand 3400 states. Second operand 3402 states. [2018-11-23 12:43:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:43,117 INFO L93 Difference]: Finished difference Result 3402 states and 4295 transitions. [2018-11-23 12:43:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4295 transitions. [2018-11-23 12:43:43,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:43,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:43,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:43,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-11-23 12:43:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-11-23 12:43:43,508 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-11-23 12:43:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:43,509 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-11-23 12:43:43,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-11-23 12:43:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:43:43,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:43,511 INFO L402 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] [2018-11-23 12:43:43,511 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:43,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-11-23 12:43:43,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:43,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:43,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:43,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:43,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:43,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {88744#true} call ULTIMATE.init(); {88744#true} is VALID [2018-11-23 12:43:43,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {88744#true} assume true; {88744#true} is VALID [2018-11-23 12:43:43,569 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {88744#true} {88744#true} #180#return; {88744#true} is VALID [2018-11-23 12:43:43,569 INFO L256 TraceCheckUtils]: 3: Hoare triple {88744#true} call #t~ret10 := main(); {88744#true} is VALID [2018-11-23 12:43:43,570 INFO L273 TraceCheckUtils]: 4: Hoare triple {88744#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {88744#true} is VALID [2018-11-23 12:43:43,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {88744#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {88744#true} is VALID [2018-11-23 12:43:43,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {88744#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {88744#true} is VALID [2018-11-23 12:43:43,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {88744#true} assume !(0 != ~p1~0); {88744#true} is VALID [2018-11-23 12:43:43,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {88744#true} assume !(0 != ~p2~0); {88744#true} is VALID [2018-11-23 12:43:43,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {88744#true} assume !(0 != ~p3~0); {88744#true} is VALID [2018-11-23 12:43:43,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {88744#true} assume !(0 != ~p4~0); {88744#true} is VALID [2018-11-23 12:43:43,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {88744#true} assume !(0 != ~p5~0); {88744#true} is VALID [2018-11-23 12:43:43,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {88744#true} assume !(0 != ~p6~0); {88744#true} is VALID [2018-11-23 12:43:43,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {88744#true} assume !(0 != ~p7~0); {88744#true} is VALID [2018-11-23 12:43:43,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {88744#true} assume !(0 != ~p8~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {88746#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {88746#(= main_~p8~0 0)} assume !(0 != ~p1~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {88746#(= main_~p8~0 0)} assume !(0 != ~p2~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {88746#(= main_~p8~0 0)} assume !(0 != ~p3~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,577 INFO L273 TraceCheckUtils]: 19: Hoare triple {88746#(= main_~p8~0 0)} assume !(0 != ~p4~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {88746#(= main_~p8~0 0)} assume !(0 != ~p5~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {88746#(= main_~p8~0 0)} assume !(0 != ~p6~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {88746#(= main_~p8~0 0)} assume !(0 != ~p7~0); {88746#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:43,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {88746#(= main_~p8~0 0)} assume 0 != ~p8~0; {88745#false} is VALID [2018-11-23 12:43:43,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {88745#false} assume 1 != ~lk8~0; {88745#false} is VALID [2018-11-23 12:43:43,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {88745#false} assume !false; {88745#false} is VALID [2018-11-23 12:43:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:43,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:43,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:43,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:43:43,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:43,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:43,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:43,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:43,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:43,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:43,601 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-11-23 12:43:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:50,432 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-11-23 12:43:50,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:50,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:43:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 12:43:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2018-11-23 12:43:50,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2018-11-23 12:43:50,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:52,489 INFO L225 Difference]: With dead ends: 9804 [2018-11-23 12:43:52,489 INFO L226 Difference]: Without dead ends: 6538 [2018-11-23 12:43:52,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-11-23 12:43:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-11-23 12:43:55,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:55,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6538 states. Second operand 6536 states. [2018-11-23 12:43:55,448 INFO L74 IsIncluded]: Start isIncluded. First operand 6538 states. Second operand 6536 states. [2018-11-23 12:43:55,448 INFO L87 Difference]: Start difference. First operand 6538 states. Second operand 6536 states. [2018-11-23 12:43:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:57,091 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2018-11-23 12:43:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2018-11-23 12:43:57,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:57,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:57,098 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 6538 states. [2018-11-23 12:43:57,098 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 6538 states. [2018-11-23 12:43:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:58,724 INFO L93 Difference]: Finished difference Result 6538 states and 7815 transitions. [2018-11-23 12:43:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6538 states and 7815 transitions. [2018-11-23 12:43:58,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:58,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:58,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:58,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-23 12:44:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-11-23 12:44:00,523 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-11-23 12:44:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:44:00,523 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-11-23 12:44:00,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:44:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-11-23 12:44:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:44:00,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:44:00,527 INFO L402 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] [2018-11-23 12:44:00,527 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:44:00,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:44:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-11-23 12:44:00,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:44:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:44:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:44:00,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:44:00,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {118819#true} call ULTIMATE.init(); {118819#true} is VALID [2018-11-23 12:44:00,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {118819#true} assume true; {118819#true} is VALID [2018-11-23 12:44:00,566 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {118819#true} {118819#true} #180#return; {118819#true} is VALID [2018-11-23 12:44:00,566 INFO L256 TraceCheckUtils]: 3: Hoare triple {118819#true} call #t~ret10 := main(); {118819#true} is VALID [2018-11-23 12:44:00,566 INFO L273 TraceCheckUtils]: 4: Hoare triple {118819#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {118819#true} is VALID [2018-11-23 12:44:00,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {118819#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {118819#true} is VALID [2018-11-23 12:44:00,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {118819#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {118819#true} is VALID [2018-11-23 12:44:00,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {118819#true} assume !(0 != ~p1~0); {118819#true} is VALID [2018-11-23 12:44:00,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {118819#true} assume !(0 != ~p2~0); {118819#true} is VALID [2018-11-23 12:44:00,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {118819#true} assume !(0 != ~p3~0); {118819#true} is VALID [2018-11-23 12:44:00,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {118819#true} assume !(0 != ~p4~0); {118819#true} is VALID [2018-11-23 12:44:00,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {118819#true} assume !(0 != ~p5~0); {118819#true} is VALID [2018-11-23 12:44:00,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {118819#true} assume !(0 != ~p6~0); {118819#true} is VALID [2018-11-23 12:44:00,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {118819#true} assume !(0 != ~p7~0); {118819#true} is VALID [2018-11-23 12:44:00,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {118819#true} assume 0 != ~p8~0;~lk8~0 := 1; {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {118821#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {118821#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {118821#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {118821#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {118821#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {118821#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {118821#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,597 INFO L273 TraceCheckUtils]: 22: Hoare triple {118821#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {118821#(= main_~lk8~0 1)} assume 0 != ~p8~0; {118821#(= main_~lk8~0 1)} is VALID [2018-11-23 12:44:00,599 INFO L273 TraceCheckUtils]: 24: Hoare triple {118821#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {118820#false} is VALID [2018-11-23 12:44:00,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {118820#false} assume !false; {118820#false} is VALID [2018-11-23 12:44:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:44:00,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:44:00,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:44:00,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:44:00,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:44:00,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:44:00,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:00,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:44:00,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:44:00,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:00,623 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-11-23 12:44:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:08,859 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-11-23 12:44:08,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:44:08,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 12:44:08,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:44:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 12:44:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 12:44:08,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 12:44:08,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:10,882 INFO L225 Difference]: With dead ends: 7052 [2018-11-23 12:44:10,882 INFO L226 Difference]: Without dead ends: 7050 [2018-11-23 12:44:10,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-11-23 12:44:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-11-23 12:44:13,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:44:13,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7050 states. Second operand 6536 states. [2018-11-23 12:44:13,037 INFO L74 IsIncluded]: Start isIncluded. First operand 7050 states. Second operand 6536 states. [2018-11-23 12:44:13,038 INFO L87 Difference]: Start difference. First operand 7050 states. Second operand 6536 states. [2018-11-23 12:44:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:14,915 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2018-11-23 12:44:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2018-11-23 12:44:14,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:14,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:14,919 INFO L74 IsIncluded]: Start isIncluded. First operand 6536 states. Second operand 7050 states. [2018-11-23 12:44:14,919 INFO L87 Difference]: Start difference. First operand 6536 states. Second operand 7050 states. [2018-11-23 12:44:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:16,806 INFO L93 Difference]: Finished difference Result 7050 states and 8455 transitions. [2018-11-23 12:44:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7050 states and 8455 transitions. [2018-11-23 12:44:16,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:16,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:16,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:44:16,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:44:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-23 12:44:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-11-23 12:44:18,632 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-11-23 12:44:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:44:18,632 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-11-23 12:44:18,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:44:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-11-23 12:44:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:44:18,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:44:18,635 INFO L402 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] [2018-11-23 12:44:18,635 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:44:18,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:44:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-11-23 12:44:18,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:44:18,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:44:18,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:18,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:44:18,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:44:18,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {147166#true} call ULTIMATE.init(); {147166#true} is VALID [2018-11-23 12:44:18,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {147166#true} assume true; {147166#true} is VALID [2018-11-23 12:44:18,684 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {147166#true} {147166#true} #180#return; {147166#true} is VALID [2018-11-23 12:44:18,684 INFO L256 TraceCheckUtils]: 3: Hoare triple {147166#true} call #t~ret10 := main(); {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 4: Hoare triple {147166#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {147166#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {147166#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {147166#true} assume !(0 != ~p1~0); {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {147166#true} assume !(0 != ~p2~0); {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {147166#true} assume !(0 != ~p3~0); {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {147166#true} assume !(0 != ~p4~0); {147166#true} is VALID [2018-11-23 12:44:18,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {147166#true} assume !(0 != ~p5~0); {147166#true} is VALID [2018-11-23 12:44:18,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {147166#true} assume !(0 != ~p6~0); {147166#true} is VALID [2018-11-23 12:44:18,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {147166#true} assume !(0 != ~p7~0); {147166#true} is VALID [2018-11-23 12:44:18,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {147166#true} assume !(0 != ~p8~0); {147166#true} is VALID [2018-11-23 12:44:18,687 INFO L273 TraceCheckUtils]: 15: Hoare triple {147166#true} assume 0 != ~p9~0;~lk9~0 := 1; {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {147168#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,697 INFO L273 TraceCheckUtils]: 24: Hoare triple {147168#(= main_~lk9~0 1)} assume 0 != ~p9~0; {147168#(= main_~lk9~0 1)} is VALID [2018-11-23 12:44:18,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {147168#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {147167#false} is VALID [2018-11-23 12:44:18,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {147167#false} assume !false; {147167#false} is VALID [2018-11-23 12:44:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:44:18,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:44:18,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:44:18,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:44:18,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:44:18,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:44:18,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:18,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:44:18,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:44:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:18,724 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-11-23 12:44:29,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:29,976 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-11-23 12:44:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:44:29,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:44:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:44:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-23 12:44:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:44:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-23 12:44:29,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-23 12:44:30,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:34,716 INFO L225 Difference]: With dead ends: 10634 [2018-11-23 12:44:34,717 INFO L226 Difference]: Without dead ends: 10632 [2018-11-23 12:44:34,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-11-23 12:44:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-11-23 12:44:39,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:44:39,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10632 states. Second operand 10120 states. [2018-11-23 12:44:39,164 INFO L74 IsIncluded]: Start isIncluded. First operand 10632 states. Second operand 10120 states. [2018-11-23 12:44:39,165 INFO L87 Difference]: Start difference. First operand 10632 states. Second operand 10120 states. [2018-11-23 12:44:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:42,355 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2018-11-23 12:44:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2018-11-23 12:44:42,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:42,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:42,362 INFO L74 IsIncluded]: Start isIncluded. First operand 10120 states. Second operand 10632 states. [2018-11-23 12:44:42,362 INFO L87 Difference]: Start difference. First operand 10120 states. Second operand 10632 states. [2018-11-23 12:44:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:44:45,575 INFO L93 Difference]: Finished difference Result 10632 states and 12166 transitions. [2018-11-23 12:44:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 12166 transitions. [2018-11-23 12:44:45,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:44:45,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:44:45,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:44:45,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:44:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-11-23 12:44:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-11-23 12:44:49,029 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-11-23 12:44:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:44:49,029 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-11-23 12:44:49,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:44:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-11-23 12:44:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:44:49,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:44:49,035 INFO L402 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] [2018-11-23 12:44:49,036 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:44:49,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:44:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-11-23 12:44:49,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:44:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:44:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:49,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:44:49,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:44:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:44:49,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {189970#true} call ULTIMATE.init(); {189970#true} is VALID [2018-11-23 12:44:49,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {189970#true} assume true; {189970#true} is VALID [2018-11-23 12:44:49,086 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189970#true} {189970#true} #180#return; {189970#true} is VALID [2018-11-23 12:44:49,086 INFO L256 TraceCheckUtils]: 3: Hoare triple {189970#true} call #t~ret10 := main(); {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 4: Hoare triple {189970#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;havoc ~cond~0; {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {189970#true} assume !false;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~cond~0 := #t~nondet9;havoc #t~nondet9; {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {189970#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0; {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {189970#true} assume !(0 != ~p1~0); {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {189970#true} assume !(0 != ~p2~0); {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {189970#true} assume !(0 != ~p3~0); {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {189970#true} assume !(0 != ~p4~0); {189970#true} is VALID [2018-11-23 12:44:49,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {189970#true} assume !(0 != ~p5~0); {189970#true} is VALID [2018-11-23 12:44:49,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {189970#true} assume !(0 != ~p6~0); {189970#true} is VALID [2018-11-23 12:44:49,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {189970#true} assume !(0 != ~p7~0); {189970#true} is VALID [2018-11-23 12:44:49,088 INFO L273 TraceCheckUtils]: 14: Hoare triple {189970#true} assume !(0 != ~p8~0); {189970#true} is VALID [2018-11-23 12:44:49,088 INFO L273 TraceCheckUtils]: 15: Hoare triple {189970#true} assume !(0 != ~p9~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p1~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p2~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,101 INFO L273 TraceCheckUtils]: 18: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p3~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p4~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,103 INFO L273 TraceCheckUtils]: 20: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p5~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p6~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p7~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {189972#(= main_~p9~0 0)} assume !(0 != ~p8~0); {189972#(= main_~p9~0 0)} is VALID [2018-11-23 12:44:49,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {189972#(= main_~p9~0 0)} assume 0 != ~p9~0; {189971#false} is VALID [2018-11-23 12:44:49,107 INFO L273 TraceCheckUtils]: 25: Hoare triple {189971#false} assume 1 != ~lk9~0; {189971#false} is VALID [2018-11-23 12:44:49,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {189971#false} assume !false; {189971#false} is VALID [2018-11-23 12:44:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:44:49,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:44:49,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:44:49,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:44:49,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:44:49,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:44:49,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:44:49,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:44:49,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:44:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:44:49,133 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-11-23 12:45:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:16,599 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-11-23 12:45:16,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:45:16,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 12:45:16,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:45:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:45:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 12:45:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:45:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 12:45:16,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-23 12:45:16,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:45:16,738 INFO L225 Difference]: With dead ends: 22664 [2018-11-23 12:45:16,738 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:45:16,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:45:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:45:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:45:16,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:45:16,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:45:16,761 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:45:16,761 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:45:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:16,761 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:45:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:45:16,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:45:16,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:45:16,762 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:45:16,762 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:45:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:45:16,763 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:45:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:45:16,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:45:16,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:45:16,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:45:16,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:45:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:45:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:45:16,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-23 12:45:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:45:16,764 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:45:16,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:45:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:45:16,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:45:16,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:45:16,841 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:45:16,841 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:45:16,841 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:45:16,842 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:45:16,842 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:45:16,842 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:45:16,842 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,842 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-23 12:45:16,842 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,842 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-23 12:45:16,842 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,843 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,844 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,845 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:45:16,847 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 12:45:16,848 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L85-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2018-11-23 12:45:16,849 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L119-1 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2018-11-23 12:45:16,850 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L134-1 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-23 12:45:16,851 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2018-11-23 12:45:16,851 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:45:16,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:45:16 BoogieIcfgContainer [2018-11-23 12:45:16,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:45:16,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:45:16,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:45:16,857 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:45:16,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:04" (3/4) ... [2018-11-23 12:45:16,860 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:45:16,866 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:45:16,866 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:45:16,873 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:45:16,873 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:45:16,873 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:45:16,959 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 12:45:16,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:45:16,961 INFO L168 Benchmark]: Toolchain (without parser) took 133311.72 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -370.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-11-23 12:45:16,962 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:45:16,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:45:16,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:45:16,963 INFO L168 Benchmark]: Boogie Preprocessor took 34.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:45:16,963 INFO L168 Benchmark]: RCFGBuilder took 928.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:45:16,964 INFO L168 Benchmark]: TraceAbstraction took 131862.35 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 692.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 362.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-23 12:45:16,964 INFO L168 Benchmark]: Witness Printer took 102.25 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:45:16,967 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 351.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 25.85 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 928.99 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 131862.35 ms. Allocated memory was 2.2 GB in the beginning and 2.9 GB in the end (delta: 692.6 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 362.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Witness Printer took 102.25 ms. Allocated memory is still 2.9 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 131.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 85.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 41.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...