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_8_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:42:55,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:42:55,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:42:55,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:42:55,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:42:55,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:42:55,771 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:42:55,773 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:42:55,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:42:55,776 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:42:55,777 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:42:55,777 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:42:55,778 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:42:55,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:42:55,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:42:55,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:42:55,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:42:55,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:42:55,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:42:55,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:42:55,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:42:55,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:42:55,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:42:55,797 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:42:55,797 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:42:55,798 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:42:55,799 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:42:55,800 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:42:55,801 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:42:55,802 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:42:55,802 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:42:55,803 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:42:55,803 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:42:55,803 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:42:55,804 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:42:55,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:42:55,805 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:42:55,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:42:55,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:42:55,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:42:55,822 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:42:55,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:42:55,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:42:55,823 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:42:55,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:42:55,823 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:42:55,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:42:55,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:42:55,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:42:55,824 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:42:55,824 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:42:55,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:42:55,825 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:42:55,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:42:55,825 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:42:55,825 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:42:55,825 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:42:55,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:42:55,826 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:42:55,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:42:55,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:42:55,826 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:42:55,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:42:55,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:42:55,827 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:42:55,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:42:55,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:42:55,828 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:42:55,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:42:55,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:42:55,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:42:55,907 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:42:55,908 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:42:55,909 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:55,965 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e39a5b31/ef087edec2aa471180623f0b3c465e07/FLAG5ed91413c [2018-11-23 12:42:56,394 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:42:56,395 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:56,403 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e39a5b31/ef087edec2aa471180623f0b3c465e07/FLAG5ed91413c [2018-11-23 12:42:56,778 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e39a5b31/ef087edec2aa471180623f0b3c465e07 [2018-11-23 12:42:56,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:42:56,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:42:56,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:56,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:42:56,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:42:56,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:56" (1/1) ... [2018-11-23 12:42:56,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f15d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:56, skipping insertion in model container [2018-11-23 12:42:56,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:56" (1/1) ... [2018-11-23 12:42:56,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:42:56,839 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:42:57,039 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:57,044 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:42:57,083 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:57,098 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:42:57,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57 WrapperNode [2018-11-23 12:42:57,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:57,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:57,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:42:57,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:42:57,110 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:42:57" (1/1) ... [2018-11-23 12:42:57,116 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:42:57" (1/1) ... [2018-11-23 12:42:57,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:57,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:42:57,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:42:57,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:42:57,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (1/1) ... [2018-11-23 12:42:57,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (1/1) ... [2018-11-23 12:42:57,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (1/1) ... [2018-11-23 12:42:57,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (1/1) ... [2018-11-23 12:42:57,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (1/1) ... [2018-11-23 12:42:57,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (1/1) ... [2018-11-23 12:42:57,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (1/1) ... [2018-11-23 12:42:57,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:42:57,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:42:57,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:42:57,180 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:42:57,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (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:42:57,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:42:57,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:42:57,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:42:57,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:42:57,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:42:57,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:42:58,206 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:42:58,207 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:42:58,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:58 BoogieIcfgContainer [2018-11-23 12:42:58,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:42:58,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:42:58,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:42:58,212 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:42:58,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:42:56" (1/3) ... [2018-11-23 12:42:58,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3666c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:58, skipping insertion in model container [2018-11-23 12:42:58,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:57" (2/3) ... [2018-11-23 12:42:58,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3666c5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:58, skipping insertion in model container [2018-11-23 12:42:58,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:58" (3/3) ... [2018-11-23 12:42:58,216 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:58,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:42:58,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:42:58,247 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:42:58,280 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:42:58,281 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:42:58,281 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:42:58,282 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:42:58,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:42:58,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:42:58,285 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:42:58,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:42:58,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:42:58,310 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 12:42:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:58,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:58,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:58,323 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:58,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:58,333 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-11-23 12:42:58,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:58,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:58,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:58,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:58,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:58,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-23 12:42:58,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-23 12:42:58,635 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #163#return; {41#true} is VALID [2018-11-23 12:42:58,636 INFO L256 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret9 := main(); {41#true} is VALID [2018-11-23 12:42:58,636 INFO L273 TraceCheckUtils]: 4: Hoare triple {41#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;havoc ~cond~0; {41#true} is VALID [2018-11-23 12:42:58,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {41#true} is VALID [2018-11-23 12:42:58,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#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; {41#true} is VALID [2018-11-23 12:42:58,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#true} assume 0 != ~p1~0;~lk1~0 := 1; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {43#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {43#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {43#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {43#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {43#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {43#(= main_~lk1~0 1)} assume !(0 != ~p8~0); {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {43#(= main_~lk1~0 1)} assume 0 != ~p1~0; {43#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:58,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {43#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {42#false} is VALID [2018-11-23 12:42:58,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-23 12:42:58,686 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:42:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:58,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:58,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:58,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:58,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:58,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:58,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:58,871 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-11-23 12:42:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:59,417 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-11-23 12:42:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:59,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:42:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:42:59,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 12:43:00,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:00,077 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:43:00,077 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:43:00,081 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:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:43:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-23 12:43:00,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:00,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2018-11-23 12:43:00,131 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2018-11-23 12:43:00,131 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2018-11-23 12:43:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,139 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2018-11-23 12:43:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2018-11-23 12:43:00,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:00,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:00,141 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2018-11-23 12:43:00,141 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2018-11-23 12:43:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,149 INFO L93 Difference]: Finished difference Result 60 states and 104 transitions. [2018-11-23 12:43:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2018-11-23 12:43:00,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:00,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:00,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:00,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:43:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-11-23 12:43:00,157 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-11-23 12:43:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:00,157 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-11-23 12:43:00,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-11-23 12:43:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:43:00,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:00,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:00,159 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:00,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-11-23 12:43:00,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:00,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:00,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:00,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:00,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:00,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 12:43:00,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 12:43:00,253 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #163#return; {301#true} is VALID [2018-11-23 12:43:00,254 INFO L256 TraceCheckUtils]: 3: Hoare triple {301#true} call #t~ret9 := main(); {301#true} is VALID [2018-11-23 12:43:00,254 INFO L273 TraceCheckUtils]: 4: Hoare triple {301#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;havoc ~cond~0; {301#true} is VALID [2018-11-23 12:43:00,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {301#true} is VALID [2018-11-23 12:43:00,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#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; {301#true} is VALID [2018-11-23 12:43:00,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#true} assume !(0 != ~p1~0); {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {303#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {303#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {303#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {303#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {303#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {303#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,319 INFO L273 TraceCheckUtils]: 14: Hoare triple {303#(= main_~p1~0 0)} assume !(0 != ~p8~0); {303#(= main_~p1~0 0)} is VALID [2018-11-23 12:43:00,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {303#(= main_~p1~0 0)} assume 0 != ~p1~0; {302#false} is VALID [2018-11-23 12:43:00,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {302#false} assume 1 != ~lk1~0; {302#false} is VALID [2018-11-23 12:43:00,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 12:43:00,323 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:00,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:00,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:00,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:43:00,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:00,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:00,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:00,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:00,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:00,372 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-11-23 12:43:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,666 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-11-23 12:43:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:00,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:43:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 12:43:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2018-11-23 12:43:00,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2018-11-23 12:43:00,998 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:01,002 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:43:01,002 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:43:01,003 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:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:43:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 12:43:01,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:01,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2018-11-23 12:43:01,027 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2018-11-23 12:43:01,027 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2018-11-23 12:43:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,032 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2018-11-23 12:43:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2018-11-23 12:43:01,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:01,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:01,033 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2018-11-23 12:43:01,033 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2018-11-23 12:43:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,037 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2018-11-23 12:43:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2018-11-23 12:43:01,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:01,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:01,039 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:01,039 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:43:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-11-23 12:43:01,043 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-11-23 12:43:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:01,043 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-11-23 12:43:01,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-11-23 12:43:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:43:01,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:01,044 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:01,045 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:01,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-11-23 12:43:01,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:01,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:01,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:01,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:01,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:01,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2018-11-23 12:43:01,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {598#true} assume true; {598#true} is VALID [2018-11-23 12:43:01,122 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {598#true} {598#true} #163#return; {598#true} is VALID [2018-11-23 12:43:01,123 INFO L256 TraceCheckUtils]: 3: Hoare triple {598#true} call #t~ret9 := main(); {598#true} is VALID [2018-11-23 12:43:01,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {598#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;havoc ~cond~0; {598#true} is VALID [2018-11-23 12:43:01,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {598#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {598#true} is VALID [2018-11-23 12:43:01,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {598#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; {598#true} is VALID [2018-11-23 12:43:01,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {598#true} assume 0 != ~p1~0;~lk1~0 := 1; {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {600#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {600#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {600#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {600#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {600#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {600#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {600#(not (= main_~p1~0 0))} assume !(0 != ~p8~0); {600#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:43:01,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {599#false} is VALID [2018-11-23 12:43:01,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {599#false} assume 0 != ~p2~0; {599#false} is VALID [2018-11-23 12:43:01,136 INFO L273 TraceCheckUtils]: 17: Hoare triple {599#false} assume 1 != ~lk2~0; {599#false} is VALID [2018-11-23 12:43:01,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {599#false} assume !false; {599#false} is VALID [2018-11-23 12:43:01,137 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:01,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:01,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:01,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:01,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:01,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:01,188 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:01,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:01,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:01,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:01,189 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-11-23 12:43:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,364 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-11-23 12:43:01,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:01,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:43:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2018-11-23 12:43:01,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2018-11-23 12:43:01,575 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:01,578 INFO L225 Difference]: With dead ends: 90 [2018-11-23 12:43:01,578 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:43:01,579 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:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:43:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-23 12:43:01,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:01,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2018-11-23 12:43:01,622 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2018-11-23 12:43:01,622 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2018-11-23 12:43:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,626 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2018-11-23 12:43:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2018-11-23 12:43:01,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:01,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:01,627 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2018-11-23 12:43:01,627 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2018-11-23 12:43:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,631 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2018-11-23 12:43:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 104 transitions. [2018-11-23 12:43:01,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:01,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:01,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:01,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:43:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-11-23 12:43:01,636 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-11-23 12:43:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:01,636 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-11-23 12:43:01,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-11-23 12:43:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:43:01,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:01,637 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:01,638 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:01,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-11-23 12:43:01,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:01,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:01,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {899#true} call ULTIMATE.init(); {899#true} is VALID [2018-11-23 12:43:01,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {899#true} assume true; {899#true} is VALID [2018-11-23 12:43:01,692 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {899#true} {899#true} #163#return; {899#true} is VALID [2018-11-23 12:43:01,693 INFO L256 TraceCheckUtils]: 3: Hoare triple {899#true} call #t~ret9 := main(); {899#true} is VALID [2018-11-23 12:43:01,693 INFO L273 TraceCheckUtils]: 4: Hoare triple {899#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;havoc ~cond~0; {899#true} is VALID [2018-11-23 12:43:01,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {899#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {899#true} is VALID [2018-11-23 12:43:01,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {899#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; {899#true} is VALID [2018-11-23 12:43:01,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {899#true} assume !(0 != ~p1~0); {899#true} is VALID [2018-11-23 12:43:01,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {899#true} assume 0 != ~p2~0;~lk2~0 := 1; {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {901#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {901#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {901#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {901#(= main_~lk2~0 1)} assume !(0 != ~p8~0); {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {901#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#(= main_~lk2~0 1)} assume 0 != ~p2~0; {901#(= main_~lk2~0 1)} is VALID [2018-11-23 12:43:01,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {900#false} is VALID [2018-11-23 12:43:01,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#false} assume !false; {900#false} is VALID [2018-11-23 12:43:01,710 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:01,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:01,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:01,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:01,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:01,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:01,744 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:01,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:01,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:01,746 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-11-23 12:43:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,871 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-11-23 12:43:01,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:01,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:43:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 12:43:01,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 12:43:02,079 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:02,082 INFO L225 Difference]: With dead ends: 112 [2018-11-23 12:43:02,082 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 12:43:02,083 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:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 12:43:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-11-23 12:43:02,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:02,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 80 states. [2018-11-23 12:43:02,113 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 80 states. [2018-11-23 12:43:02,114 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 80 states. [2018-11-23 12:43:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,119 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2018-11-23 12:43:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2018-11-23 12:43:02,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,120 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 110 states. [2018-11-23 12:43:02,121 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 110 states. [2018-11-23 12:43:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,126 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2018-11-23 12:43:02,126 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 189 transitions. [2018-11-23 12:43:02,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:02,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 12:43:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-11-23 12:43:02,133 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-11-23 12:43:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:02,135 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-11-23 12:43:02,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-11-23 12:43:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:43:02,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:02,137 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:02,137 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:02,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:02,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-11-23 12:43:02,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:02,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:02,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:02,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {1336#true} call ULTIMATE.init(); {1336#true} is VALID [2018-11-23 12:43:02,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {1336#true} assume true; {1336#true} is VALID [2018-11-23 12:43:02,217 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1336#true} {1336#true} #163#return; {1336#true} is VALID [2018-11-23 12:43:02,218 INFO L256 TraceCheckUtils]: 3: Hoare triple {1336#true} call #t~ret9 := main(); {1336#true} is VALID [2018-11-23 12:43:02,218 INFO L273 TraceCheckUtils]: 4: Hoare triple {1336#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;havoc ~cond~0; {1336#true} is VALID [2018-11-23 12:43:02,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {1336#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1336#true} is VALID [2018-11-23 12:43:02,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {1336#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; {1336#true} is VALID [2018-11-23 12:43:02,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {1336#true} assume !(0 != ~p1~0); {1336#true} is VALID [2018-11-23 12:43:02,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {1336#true} assume !(0 != ~p2~0); {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {1338#(= main_~p2~0 0)} assume !(0 != ~p8~0); {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {1338#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1338#(= main_~p2~0 0)} is VALID [2018-11-23 12:43:02,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {1338#(= main_~p2~0 0)} assume 0 != ~p2~0; {1337#false} is VALID [2018-11-23 12:43:02,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {1337#false} assume 1 != ~lk2~0; {1337#false} is VALID [2018-11-23 12:43:02,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1337#false} assume !false; {1337#false} is VALID [2018-11-23 12:43:02,246 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:02,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:02,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:02,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:02,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:02,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:02,274 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:02,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:02,275 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-11-23 12:43:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,439 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-11-23 12:43:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:02,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:43:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:02,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-23 12:43:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-23 12:43:02,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2018-11-23 12:43:02,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:02,772 INFO L225 Difference]: With dead ends: 184 [2018-11-23 12:43:02,773 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 12:43:02,774 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:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 12:43:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-23 12:43:02,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:02,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 110 states. [2018-11-23 12:43:02,828 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 110 states. [2018-11-23 12:43:02,828 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 110 states. [2018-11-23 12:43:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,834 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2018-11-23 12:43:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2018-11-23 12:43:02,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,835 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 112 states. [2018-11-23 12:43:02,835 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 112 states. [2018-11-23 12:43:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,840 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2018-11-23 12:43:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 187 transitions. [2018-11-23 12:43:02,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:02,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 12:43:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-11-23 12:43:02,846 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-11-23 12:43:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:02,846 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-11-23 12:43:02,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-11-23 12:43:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:43:02,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:02,848 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:02,848 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:02,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-11-23 12:43:02,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:02,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:02,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:02,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:02,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {1883#true} call ULTIMATE.init(); {1883#true} is VALID [2018-11-23 12:43:02,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {1883#true} assume true; {1883#true} is VALID [2018-11-23 12:43:02,948 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1883#true} {1883#true} #163#return; {1883#true} is VALID [2018-11-23 12:43:02,949 INFO L256 TraceCheckUtils]: 3: Hoare triple {1883#true} call #t~ret9 := main(); {1883#true} is VALID [2018-11-23 12:43:02,949 INFO L273 TraceCheckUtils]: 4: Hoare triple {1883#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;havoc ~cond~0; {1883#true} is VALID [2018-11-23 12:43:02,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {1883#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {1883#true} is VALID [2018-11-23 12:43:02,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {1883#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; {1883#true} is VALID [2018-11-23 12:43:02,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {1883#true} assume !(0 != ~p1~0); {1883#true} is VALID [2018-11-23 12:43:02,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {1883#true} assume 0 != ~p2~0;~lk2~0 := 1; {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {1885#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {1885#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {1885#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {1885#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {1885#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,960 INFO L273 TraceCheckUtils]: 14: Hoare triple {1885#(not (= main_~p2~0 0))} assume !(0 != ~p8~0); {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,960 INFO L273 TraceCheckUtils]: 15: Hoare triple {1885#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {1885#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:43:02,966 INFO L273 TraceCheckUtils]: 16: Hoare triple {1885#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {1884#false} is VALID [2018-11-23 12:43:02,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {1884#false} assume 0 != ~p3~0; {1884#false} is VALID [2018-11-23 12:43:02,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {1884#false} assume 1 != ~lk3~0; {1884#false} is VALID [2018-11-23 12:43:02,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {1884#false} assume !false; {1884#false} is VALID [2018-11-23 12:43:02,968 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:02,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:02,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:02,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:02,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:02,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:02,989 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:02,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:02,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:02,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:02,990 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-11-23 12:43:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,135 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-11-23 12:43:03,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:03,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 12:43:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 12:43:03,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-23 12:43:03,320 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:43:03,323 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:43:03,323 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 12:43:03,324 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:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 12:43:03,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 12:43:03,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:03,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 112 states. [2018-11-23 12:43:03,386 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 112 states. [2018-11-23 12:43:03,386 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 112 states. [2018-11-23 12:43:03,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,390 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2018-11-23 12:43:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2018-11-23 12:43:03,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:03,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:03,391 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 114 states. [2018-11-23 12:43:03,391 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 114 states. [2018-11-23 12:43:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,396 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2018-11-23 12:43:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 187 transitions. [2018-11-23 12:43:03,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:03,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:03,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:03,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 12:43:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-11-23 12:43:03,402 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-11-23 12:43:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:03,403 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-11-23 12:43:03,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-11-23 12:43:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:43:03,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:03,404 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:03,404 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:03,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:03,405 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-11-23 12:43:03,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:03,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:03,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:03,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {2417#true} call ULTIMATE.init(); {2417#true} is VALID [2018-11-23 12:43:03,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {2417#true} assume true; {2417#true} is VALID [2018-11-23 12:43:03,647 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2417#true} {2417#true} #163#return; {2417#true} is VALID [2018-11-23 12:43:03,648 INFO L256 TraceCheckUtils]: 3: Hoare triple {2417#true} call #t~ret9 := main(); {2417#true} is VALID [2018-11-23 12:43:03,648 INFO L273 TraceCheckUtils]: 4: Hoare triple {2417#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;havoc ~cond~0; {2417#true} is VALID [2018-11-23 12:43:03,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {2417#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {2417#true} is VALID [2018-11-23 12:43:03,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {2417#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; {2417#true} is VALID [2018-11-23 12:43:03,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {2417#true} assume !(0 != ~p1~0); {2417#true} is VALID [2018-11-23 12:43:03,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {2417#true} assume !(0 != ~p2~0); {2417#true} is VALID [2018-11-23 12:43:03,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {2417#true} assume 0 != ~p3~0;~lk3~0 := 1; {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {2419#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {2419#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {2419#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {2419#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {2419#(= main_~lk3~0 1)} assume !(0 != ~p8~0); {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {2419#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {2419#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {2419#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2419#(= main_~lk3~0 1)} is VALID [2018-11-23 12:43:03,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {2419#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2418#false} is VALID [2018-11-23 12:43:03,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {2418#false} assume !false; {2418#false} is VALID [2018-11-23 12:43:03,791 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:03,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:03,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:03,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:03,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:03,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:03,962 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:03,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:03,963 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-11-23 12:43:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:04,259 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-11-23 12:43:04,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:04,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:43:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2018-11-23 12:43:04,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2018-11-23 12:43:04,384 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:04,388 INFO L225 Difference]: With dead ends: 204 [2018-11-23 12:43:04,388 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 12:43:04,389 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:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 12:43:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-11-23 12:43:04,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:04,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 152 states. [2018-11-23 12:43:04,440 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 152 states. [2018-11-23 12:43:04,441 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 152 states. [2018-11-23 12:43:04,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:04,449 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2018-11-23 12:43:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2018-11-23 12:43:04,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:04,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:04,450 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 202 states. [2018-11-23 12:43:04,450 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 202 states. [2018-11-23 12:43:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:04,457 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2018-11-23 12:43:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 339 transitions. [2018-11-23 12:43:04,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:04,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:04,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:04,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 12:43:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-11-23 12:43:04,465 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-11-23 12:43:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:04,465 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-11-23 12:43:04,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-11-23 12:43:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:43:04,466 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:04,467 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:04,467 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:04,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-11-23 12:43:04,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:04,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:04,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:04,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:04,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {3208#true} call ULTIMATE.init(); {3208#true} is VALID [2018-11-23 12:43:04,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {3208#true} assume true; {3208#true} is VALID [2018-11-23 12:43:04,708 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3208#true} {3208#true} #163#return; {3208#true} is VALID [2018-11-23 12:43:04,708 INFO L256 TraceCheckUtils]: 3: Hoare triple {3208#true} call #t~ret9 := main(); {3208#true} is VALID [2018-11-23 12:43:04,708 INFO L273 TraceCheckUtils]: 4: Hoare triple {3208#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;havoc ~cond~0; {3208#true} is VALID [2018-11-23 12:43:04,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {3208#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {3208#true} is VALID [2018-11-23 12:43:04,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {3208#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; {3208#true} is VALID [2018-11-23 12:43:04,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {3208#true} assume !(0 != ~p1~0); {3208#true} is VALID [2018-11-23 12:43:04,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {3208#true} assume !(0 != ~p2~0); {3208#true} is VALID [2018-11-23 12:43:04,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {3208#true} assume !(0 != ~p3~0); {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {3210#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {3210#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {3210#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {3210#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {3210#(= main_~p3~0 0)} assume !(0 != ~p8~0); {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {3210#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {3210#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3210#(= main_~p3~0 0)} is VALID [2018-11-23 12:43:04,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {3210#(= main_~p3~0 0)} assume 0 != ~p3~0; {3209#false} is VALID [2018-11-23 12:43:04,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {3209#false} assume 1 != ~lk3~0; {3209#false} is VALID [2018-11-23 12:43:04,836 INFO L273 TraceCheckUtils]: 19: Hoare triple {3209#false} assume !false; {3209#false} is VALID [2018-11-23 12:43:04,838 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:04,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:04,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:04,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:04,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:04,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:04,870 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:04,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:04,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:04,872 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-11-23 12:43:05,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,265 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-11-23 12:43:05,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:05,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:43:05,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-23 12:43:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-23 12:43:05,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2018-11-23 12:43:05,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:05,471 INFO L225 Difference]: With dead ends: 352 [2018-11-23 12:43:05,471 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 12:43:05,472 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:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 12:43:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-11-23 12:43:05,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:05,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 208 states. [2018-11-23 12:43:05,567 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 208 states. [2018-11-23 12:43:05,567 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 208 states. [2018-11-23 12:43:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,577 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2018-11-23 12:43:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2018-11-23 12:43:05,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:05,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:05,578 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 210 states. [2018-11-23 12:43:05,578 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 210 states. [2018-11-23 12:43:05,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,586 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2018-11-23 12:43:05,587 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 339 transitions. [2018-11-23 12:43:05,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:05,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:05,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:05,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-23 12:43:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-11-23 12:43:05,596 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-11-23 12:43:05,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:05,597 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-11-23 12:43:05,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-11-23 12:43:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:05,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:05,598 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:05,598 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:05,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-11-23 12:43:05,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:05,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:05,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:05,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:05,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {4227#true} call ULTIMATE.init(); {4227#true} is VALID [2018-11-23 12:43:05,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {4227#true} assume true; {4227#true} is VALID [2018-11-23 12:43:05,792 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4227#true} {4227#true} #163#return; {4227#true} is VALID [2018-11-23 12:43:05,793 INFO L256 TraceCheckUtils]: 3: Hoare triple {4227#true} call #t~ret9 := main(); {4227#true} is VALID [2018-11-23 12:43:05,793 INFO L273 TraceCheckUtils]: 4: Hoare triple {4227#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;havoc ~cond~0; {4227#true} is VALID [2018-11-23 12:43:05,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {4227#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {4227#true} is VALID [2018-11-23 12:43:05,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {4227#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; {4227#true} is VALID [2018-11-23 12:43:05,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {4227#true} assume !(0 != ~p1~0); {4227#true} is VALID [2018-11-23 12:43:05,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {4227#true} assume !(0 != ~p2~0); {4227#true} is VALID [2018-11-23 12:43:05,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {4227#true} assume 0 != ~p3~0;~lk3~0 := 1; {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {4229#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {4229#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {4229#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {4229#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {4229#(not (= main_~p3~0 0))} assume !(0 != ~p8~0); {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {4229#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {4229#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4229#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:43:05,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {4229#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4228#false} is VALID [2018-11-23 12:43:05,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {4228#false} assume 0 != ~p4~0; {4228#false} is VALID [2018-11-23 12:43:05,822 INFO L273 TraceCheckUtils]: 19: Hoare triple {4228#false} assume 1 != ~lk4~0; {4228#false} is VALID [2018-11-23 12:43:05,822 INFO L273 TraceCheckUtils]: 20: Hoare triple {4228#false} assume !false; {4228#false} is VALID [2018-11-23 12:43:05,823 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,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:05,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:05,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:05,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:05,858 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:05,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:05,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:05,860 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-11-23 12:43:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,065 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-23 12:43:06,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:06,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-23 12:43:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-23 12:43:06,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-23 12:43:06,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:06,262 INFO L225 Difference]: With dead ends: 312 [2018-11-23 12:43:06,263 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 12:43:06,263 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,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 12:43:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-11-23 12:43:06,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:06,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand 212 states. [2018-11-23 12:43:06,313 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 212 states. [2018-11-23 12:43:06,313 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 212 states. [2018-11-23 12:43:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,319 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2018-11-23 12:43:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2018-11-23 12:43:06,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:06,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:06,321 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 214 states. [2018-11-23 12:43:06,321 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 214 states. [2018-11-23 12:43:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,327 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2018-11-23 12:43:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 339 transitions. [2018-11-23 12:43:06,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:06,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:06,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:06,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 12:43:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-11-23 12:43:06,334 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-11-23 12:43:06,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:06,335 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-11-23 12:43:06,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-11-23 12:43:06,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:06,336 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:06,336 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:06,336 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:06,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:06,337 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-11-23 12:43:06,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:06,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:06,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:06,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:06,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {5218#true} call ULTIMATE.init(); {5218#true} is VALID [2018-11-23 12:43:06,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {5218#true} assume true; {5218#true} is VALID [2018-11-23 12:43:06,572 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5218#true} {5218#true} #163#return; {5218#true} is VALID [2018-11-23 12:43:06,572 INFO L256 TraceCheckUtils]: 3: Hoare triple {5218#true} call #t~ret9 := main(); {5218#true} is VALID [2018-11-23 12:43:06,572 INFO L273 TraceCheckUtils]: 4: Hoare triple {5218#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;havoc ~cond~0; {5218#true} is VALID [2018-11-23 12:43:06,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {5218#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {5218#true} is VALID [2018-11-23 12:43:06,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {5218#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; {5218#true} is VALID [2018-11-23 12:43:06,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {5218#true} assume !(0 != ~p1~0); {5218#true} is VALID [2018-11-23 12:43:06,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {5218#true} assume !(0 != ~p2~0); {5218#true} is VALID [2018-11-23 12:43:06,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {5218#true} assume !(0 != ~p3~0); {5218#true} is VALID [2018-11-23 12:43:06,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {5218#true} assume 0 != ~p4~0;~lk4~0 := 1; {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {5220#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {5220#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {5220#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {5220#(= main_~lk4~0 1)} assume !(0 != ~p8~0); {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {5220#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {5220#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {5220#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {5220#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5220#(= main_~lk4~0 1)} is VALID [2018-11-23 12:43:06,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {5220#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5219#false} is VALID [2018-11-23 12:43:06,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {5219#false} assume !false; {5219#false} is VALID [2018-11-23 12:43:06,692 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,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:06,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:06,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:06,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:06,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:06,963 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:06,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:06,965 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-11-23 12:43:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,153 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-11-23 12:43:07,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:07,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:07,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 12:43:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2018-11-23 12:43:07,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2018-11-23 12:43:07,708 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:07,719 INFO L225 Difference]: With dead ends: 380 [2018-11-23 12:43:07,720 INFO L226 Difference]: Without dead ends: 378 [2018-11-23 12:43:07,720 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:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-23 12:43:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-11-23 12:43:07,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:07,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand 296 states. [2018-11-23 12:43:07,846 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand 296 states. [2018-11-23 12:43:07,846 INFO L87 Difference]: Start difference. First operand 378 states. Second operand 296 states. [2018-11-23 12:43:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,858 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2018-11-23 12:43:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2018-11-23 12:43:07,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:07,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:07,860 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 378 states. [2018-11-23 12:43:07,860 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 378 states. [2018-11-23 12:43:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,871 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2018-11-23 12:43:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 607 transitions. [2018-11-23 12:43:07,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:07,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:07,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:07,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-23 12:43:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-11-23 12:43:07,880 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-11-23 12:43:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:07,880 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-11-23 12:43:07,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-11-23 12:43:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:43:07,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:07,881 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:07,882 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:07,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-11-23 12:43:07,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:07,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:07,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:07,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:07,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:08,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {6693#true} call ULTIMATE.init(); {6693#true} is VALID [2018-11-23 12:43:08,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {6693#true} assume true; {6693#true} is VALID [2018-11-23 12:43:08,084 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6693#true} {6693#true} #163#return; {6693#true} is VALID [2018-11-23 12:43:08,085 INFO L256 TraceCheckUtils]: 3: Hoare triple {6693#true} call #t~ret9 := main(); {6693#true} is VALID [2018-11-23 12:43:08,085 INFO L273 TraceCheckUtils]: 4: Hoare triple {6693#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;havoc ~cond~0; {6693#true} is VALID [2018-11-23 12:43:08,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {6693#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {6693#true} is VALID [2018-11-23 12:43:08,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {6693#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; {6693#true} is VALID [2018-11-23 12:43:08,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {6693#true} assume !(0 != ~p1~0); {6693#true} is VALID [2018-11-23 12:43:08,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {6693#true} assume !(0 != ~p2~0); {6693#true} is VALID [2018-11-23 12:43:08,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {6693#true} assume !(0 != ~p3~0); {6693#true} is VALID [2018-11-23 12:43:08,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {6693#true} assume !(0 != ~p4~0); {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {6695#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {6695#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {6695#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,148 INFO L273 TraceCheckUtils]: 14: Hoare triple {6695#(= main_~p4~0 0)} assume !(0 != ~p8~0); {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {6695#(= main_~p4~0 0)} assume !(0 != ~p1~0); {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {6695#(= main_~p4~0 0)} assume !(0 != ~p2~0); {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {6695#(= main_~p4~0 0)} assume !(0 != ~p3~0); {6695#(= main_~p4~0 0)} is VALID [2018-11-23 12:43:08,198 INFO L273 TraceCheckUtils]: 18: Hoare triple {6695#(= main_~p4~0 0)} assume 0 != ~p4~0; {6694#false} is VALID [2018-11-23 12:43:08,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {6694#false} assume 1 != ~lk4~0; {6694#false} is VALID [2018-11-23 12:43:08,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {6694#false} assume !false; {6694#false} is VALID [2018-11-23 12:43:08,199 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,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:08,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:08,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:08,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:08,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:08,459 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:08,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:08,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:08,460 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-11-23 12:43:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:08,993 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-11-23 12:43:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:08,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:43:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:43:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 12:43:08,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 12:43:09,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:09,750 INFO L225 Difference]: With dead ends: 684 [2018-11-23 12:43:09,751 INFO L226 Difference]: Without dead ends: 402 [2018-11-23 12:43:09,752 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,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-23 12:43:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-11-23 12:43:10,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:10,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand 400 states. [2018-11-23 12:43:10,223 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand 400 states. [2018-11-23 12:43:10,223 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 400 states. [2018-11-23 12:43:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,235 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2018-11-23 12:43:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2018-11-23 12:43:10,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:10,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:10,237 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand 402 states. [2018-11-23 12:43:10,237 INFO L87 Difference]: Start difference. First operand 400 states. Second operand 402 states. [2018-11-23 12:43:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,250 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2018-11-23 12:43:10,250 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 615 transitions. [2018-11-23 12:43:10,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:10,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:10,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:10,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-23 12:43:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-11-23 12:43:10,264 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-11-23 12:43:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:10,264 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-11-23 12:43:10,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-11-23 12:43:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:10,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:10,266 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:10,266 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:10,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:10,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-11-23 12:43:10,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:10,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:10,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:10,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {8640#true} call ULTIMATE.init(); {8640#true} is VALID [2018-11-23 12:43:10,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {8640#true} assume true; {8640#true} is VALID [2018-11-23 12:43:10,480 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8640#true} {8640#true} #163#return; {8640#true} is VALID [2018-11-23 12:43:10,480 INFO L256 TraceCheckUtils]: 3: Hoare triple {8640#true} call #t~ret9 := main(); {8640#true} is VALID [2018-11-23 12:43:10,480 INFO L273 TraceCheckUtils]: 4: Hoare triple {8640#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;havoc ~cond~0; {8640#true} is VALID [2018-11-23 12:43:10,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {8640#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {8640#true} is VALID [2018-11-23 12:43:10,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {8640#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; {8640#true} is VALID [2018-11-23 12:43:10,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {8640#true} assume !(0 != ~p1~0); {8640#true} is VALID [2018-11-23 12:43:10,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {8640#true} assume !(0 != ~p2~0); {8640#true} is VALID [2018-11-23 12:43:10,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {8640#true} assume !(0 != ~p3~0); {8640#true} is VALID [2018-11-23 12:43:10,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {8640#true} assume 0 != ~p4~0;~lk4~0 := 1; {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {8642#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {8642#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {8642#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {8642#(not (= main_~p4~0 0))} assume !(0 != ~p8~0); {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {8642#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {8642#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {8642#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {8642#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:43:10,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {8642#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {8641#false} is VALID [2018-11-23 12:43:10,596 INFO L273 TraceCheckUtils]: 19: Hoare triple {8641#false} assume 0 != ~p5~0; {8641#false} is VALID [2018-11-23 12:43:10,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {8641#false} assume 1 != ~lk5~0; {8641#false} is VALID [2018-11-23 12:43:10,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {8641#false} assume !false; {8641#false} is VALID [2018-11-23 12:43:10,597 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,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:10,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:10,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:10,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:10,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:10,701 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:10,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:10,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:10,702 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-11-23 12:43:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,912 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-11-23 12:43:10,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:10,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:10,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2018-11-23 12:43:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2018-11-23 12:43:10,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2018-11-23 12:43:11,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:11,639 INFO L225 Difference]: With dead ends: 600 [2018-11-23 12:43:11,639 INFO L226 Difference]: Without dead ends: 410 [2018-11-23 12:43:11,640 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:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-23 12:43:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-11-23 12:43:11,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:11,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 410 states. Second operand 408 states. [2018-11-23 12:43:11,771 INFO L74 IsIncluded]: Start isIncluded. First operand 410 states. Second operand 408 states. [2018-11-23 12:43:11,771 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 408 states. [2018-11-23 12:43:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:11,781 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2018-11-23 12:43:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2018-11-23 12:43:11,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:11,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:11,782 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand 410 states. [2018-11-23 12:43:11,782 INFO L87 Difference]: Start difference. First operand 408 states. Second operand 410 states. [2018-11-23 12:43:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:11,794 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2018-11-23 12:43:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2018-11-23 12:43:11,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:11,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:11,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:11,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-23 12:43:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-11-23 12:43:11,806 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-11-23 12:43:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:11,807 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-11-23 12:43:11,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-11-23 12:43:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:11,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:11,808 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:11,808 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:11,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-11-23 12:43:11,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:11,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:11,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:11,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:11,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {10527#true} call ULTIMATE.init(); {10527#true} is VALID [2018-11-23 12:43:11,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {10527#true} assume true; {10527#true} is VALID [2018-11-23 12:43:11,896 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10527#true} {10527#true} #163#return; {10527#true} is VALID [2018-11-23 12:43:11,896 INFO L256 TraceCheckUtils]: 3: Hoare triple {10527#true} call #t~ret9 := main(); {10527#true} is VALID [2018-11-23 12:43:11,896 INFO L273 TraceCheckUtils]: 4: Hoare triple {10527#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;havoc ~cond~0; {10527#true} is VALID [2018-11-23 12:43:11,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {10527#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {10527#true} is VALID [2018-11-23 12:43:11,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {10527#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; {10527#true} is VALID [2018-11-23 12:43:11,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {10527#true} assume !(0 != ~p1~0); {10527#true} is VALID [2018-11-23 12:43:11,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {10527#true} assume !(0 != ~p2~0); {10527#true} is VALID [2018-11-23 12:43:11,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {10527#true} assume !(0 != ~p3~0); {10527#true} is VALID [2018-11-23 12:43:11,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {10527#true} assume !(0 != ~p4~0); {10527#true} is VALID [2018-11-23 12:43:11,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {10527#true} assume 0 != ~p5~0;~lk5~0 := 1; {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {10529#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {10529#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {10529#(= main_~lk5~0 1)} assume !(0 != ~p8~0); {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {10529#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {10529#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {10529#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {10529#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {10529#(= main_~lk5~0 1)} assume 0 != ~p5~0; {10529#(= main_~lk5~0 1)} is VALID [2018-11-23 12:43:11,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {10529#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {10528#false} is VALID [2018-11-23 12:43:11,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {10528#false} assume !false; {10528#false} is VALID [2018-11-23 12:43:11,912 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,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:11,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:11,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:11,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:11,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:11,944 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:11,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:11,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:11,944 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-11-23 12:43:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:12,344 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-11-23 12:43:12,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:12,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:43:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:43:12,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 12:43:12,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:12,444 INFO L225 Difference]: With dead ends: 716 [2018-11-23 12:43:12,444 INFO L226 Difference]: Without dead ends: 714 [2018-11-23 12:43:12,444 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,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-23 12:43:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-11-23 12:43:12,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:12,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand 584 states. [2018-11-23 12:43:12,637 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand 584 states. [2018-11-23 12:43:12,637 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 584 states. [2018-11-23 12:43:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:12,659 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2018-11-23 12:43:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2018-11-23 12:43:12,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:12,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:12,660 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 714 states. [2018-11-23 12:43:12,660 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 714 states. [2018-11-23 12:43:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:12,688 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2018-11-23 12:43:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1079 transitions. [2018-11-23 12:43:12,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:12,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:12,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:12,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 12:43:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-11-23 12:43:12,709 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-11-23 12:43:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:12,709 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-11-23 12:43:12,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-11-23 12:43:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:12,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:12,711 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,711 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:12,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-11-23 12:43:12,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:12,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:12,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:12,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:12,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {13322#true} call ULTIMATE.init(); {13322#true} is VALID [2018-11-23 12:43:12,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {13322#true} assume true; {13322#true} is VALID [2018-11-23 12:43:12,816 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13322#true} {13322#true} #163#return; {13322#true} is VALID [2018-11-23 12:43:12,817 INFO L256 TraceCheckUtils]: 3: Hoare triple {13322#true} call #t~ret9 := main(); {13322#true} is VALID [2018-11-23 12:43:12,817 INFO L273 TraceCheckUtils]: 4: Hoare triple {13322#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;havoc ~cond~0; {13322#true} is VALID [2018-11-23 12:43:12,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {13322#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {13322#true} is VALID [2018-11-23 12:43:12,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {13322#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; {13322#true} is VALID [2018-11-23 12:43:12,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {13322#true} assume !(0 != ~p1~0); {13322#true} is VALID [2018-11-23 12:43:12,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {13322#true} assume !(0 != ~p2~0); {13322#true} is VALID [2018-11-23 12:43:12,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {13322#true} assume !(0 != ~p3~0); {13322#true} is VALID [2018-11-23 12:43:12,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {13322#true} assume !(0 != ~p4~0); {13322#true} is VALID [2018-11-23 12:43:12,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {13322#true} assume !(0 != ~p5~0); {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {13324#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {13324#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {13324#(= main_~p5~0 0)} assume !(0 != ~p8~0); {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,826 INFO L273 TraceCheckUtils]: 15: Hoare triple {13324#(= main_~p5~0 0)} assume !(0 != ~p1~0); {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {13324#(= main_~p5~0 0)} assume !(0 != ~p2~0); {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,830 INFO L273 TraceCheckUtils]: 17: Hoare triple {13324#(= main_~p5~0 0)} assume !(0 != ~p3~0); {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {13324#(= main_~p5~0 0)} assume !(0 != ~p4~0); {13324#(= main_~p5~0 0)} is VALID [2018-11-23 12:43:12,832 INFO L273 TraceCheckUtils]: 19: Hoare triple {13324#(= main_~p5~0 0)} assume 0 != ~p5~0; {13323#false} is VALID [2018-11-23 12:43:12,832 INFO L273 TraceCheckUtils]: 20: Hoare triple {13323#false} assume 1 != ~lk5~0; {13323#false} is VALID [2018-11-23 12:43:12,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {13323#false} assume !false; {13323#false} is VALID [2018-11-23 12:43:12,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:12,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:12,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:12,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:12,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:12,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:12,852 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,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:12,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:12,853 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-11-23 12:43:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,174 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-11-23 12:43:13,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:13,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:13,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-23 12:43:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:13,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2018-11-23 12:43:13,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2018-11-23 12:43:13,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:13,389 INFO L225 Difference]: With dead ends: 1340 [2018-11-23 12:43:13,389 INFO L226 Difference]: Without dead ends: 778 [2018-11-23 12:43:13,390 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,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-23 12:43:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-11-23 12:43:13,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:13,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 778 states. Second operand 776 states. [2018-11-23 12:43:13,734 INFO L74 IsIncluded]: Start isIncluded. First operand 778 states. Second operand 776 states. [2018-11-23 12:43:13,734 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 776 states. [2018-11-23 12:43:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,759 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2018-11-23 12:43:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2018-11-23 12:43:13,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:13,760 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand 778 states. [2018-11-23 12:43:13,760 INFO L87 Difference]: Start difference. First operand 776 states. Second operand 778 states. [2018-11-23 12:43:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,784 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2018-11-23 12:43:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1111 transitions. [2018-11-23 12:43:13,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:13,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:13,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 12:43:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-11-23 12:43:13,819 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-11-23 12:43:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:13,819 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-11-23 12:43:13,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-11-23 12:43:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:13,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:13,821 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:13,821 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:13,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-11-23 12:43:13,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:13,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:13,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:13,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:13,885 INFO L256 TraceCheckUtils]: 0: Hoare triple {17093#true} call ULTIMATE.init(); {17093#true} is VALID [2018-11-23 12:43:13,885 INFO L273 TraceCheckUtils]: 1: Hoare triple {17093#true} assume true; {17093#true} is VALID [2018-11-23 12:43:13,886 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17093#true} {17093#true} #163#return; {17093#true} is VALID [2018-11-23 12:43:13,886 INFO L256 TraceCheckUtils]: 3: Hoare triple {17093#true} call #t~ret9 := main(); {17093#true} is VALID [2018-11-23 12:43:13,886 INFO L273 TraceCheckUtils]: 4: Hoare triple {17093#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;havoc ~cond~0; {17093#true} is VALID [2018-11-23 12:43:13,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {17093#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {17093#true} is VALID [2018-11-23 12:43:13,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {17093#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; {17093#true} is VALID [2018-11-23 12:43:13,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {17093#true} assume !(0 != ~p1~0); {17093#true} is VALID [2018-11-23 12:43:13,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {17093#true} assume !(0 != ~p2~0); {17093#true} is VALID [2018-11-23 12:43:13,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {17093#true} assume !(0 != ~p3~0); {17093#true} is VALID [2018-11-23 12:43:13,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {17093#true} assume !(0 != ~p4~0); {17093#true} is VALID [2018-11-23 12:43:13,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {17093#true} assume 0 != ~p5~0;~lk5~0 := 1; {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {17095#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {17095#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {17095#(not (= main_~p5~0 0))} assume !(0 != ~p8~0); {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {17095#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {17095#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {17095#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {17095#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {17095#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:43:13,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {17095#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {17094#false} is VALID [2018-11-23 12:43:13,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {17094#false} assume 0 != ~p6~0; {17094#false} is VALID [2018-11-23 12:43:13,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {17094#false} assume 1 != ~lk6~0; {17094#false} is VALID [2018-11-23 12:43:13,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {17094#false} assume !false; {17094#false} is VALID [2018-11-23 12:43:13,909 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:13,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:13,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:13,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:13,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:13,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:13,961 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:13,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:13,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:13,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:13,962 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-11-23 12:43:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:14,352 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-11-23 12:43:14,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:14,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:43:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2018-11-23 12:43:14,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2018-11-23 12:43:14,466 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:14,506 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 12:43:14,506 INFO L226 Difference]: Without dead ends: 794 [2018-11-23 12:43:14,507 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:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-23 12:43:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-11-23 12:43:15,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:15,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 794 states. Second operand 792 states. [2018-11-23 12:43:15,291 INFO L74 IsIncluded]: Start isIncluded. First operand 794 states. Second operand 792 states. [2018-11-23 12:43:15,291 INFO L87 Difference]: Start difference. First operand 794 states. Second operand 792 states. [2018-11-23 12:43:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:15,320 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2018-11-23 12:43:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2018-11-23 12:43:15,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:15,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:15,321 INFO L74 IsIncluded]: Start isIncluded. First operand 792 states. Second operand 794 states. [2018-11-23 12:43:15,321 INFO L87 Difference]: Start difference. First operand 792 states. Second operand 794 states. [2018-11-23 12:43:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:15,353 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2018-11-23 12:43:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1111 transitions. [2018-11-23 12:43:15,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:15,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:15,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:15,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-23 12:43:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-11-23 12:43:15,380 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-11-23 12:43:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:15,380 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-11-23 12:43:15,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-11-23 12:43:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:15,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:15,382 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:15,382 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:15,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:15,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-11-23 12:43:15,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:15,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:15,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:15,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:15,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:15,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {20736#true} call ULTIMATE.init(); {20736#true} is VALID [2018-11-23 12:43:15,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {20736#true} assume true; {20736#true} is VALID [2018-11-23 12:43:15,431 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20736#true} {20736#true} #163#return; {20736#true} is VALID [2018-11-23 12:43:15,431 INFO L256 TraceCheckUtils]: 3: Hoare triple {20736#true} call #t~ret9 := main(); {20736#true} is VALID [2018-11-23 12:43:15,431 INFO L273 TraceCheckUtils]: 4: Hoare triple {20736#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;havoc ~cond~0; {20736#true} is VALID [2018-11-23 12:43:15,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {20736#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {20736#true} is VALID [2018-11-23 12:43:15,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {20736#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; {20736#true} is VALID [2018-11-23 12:43:15,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {20736#true} assume !(0 != ~p1~0); {20736#true} is VALID [2018-11-23 12:43:15,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {20736#true} assume !(0 != ~p2~0); {20736#true} is VALID [2018-11-23 12:43:15,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {20736#true} assume !(0 != ~p3~0); {20736#true} is VALID [2018-11-23 12:43:15,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {20736#true} assume !(0 != ~p4~0); {20736#true} is VALID [2018-11-23 12:43:15,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {20736#true} assume !(0 != ~p5~0); {20736#true} is VALID [2018-11-23 12:43:15,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {20736#true} assume 0 != ~p6~0;~lk6~0 := 1; {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {20738#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {20738#(= main_~lk6~0 1)} assume !(0 != ~p8~0); {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {20738#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {20738#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {20738#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {20738#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,441 INFO L273 TraceCheckUtils]: 19: Hoare triple {20738#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {20738#(= main_~lk6~0 1)} assume 0 != ~p6~0; {20738#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:15,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {20738#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {20737#false} is VALID [2018-11-23 12:43:15,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {20737#false} assume !false; {20737#false} is VALID [2018-11-23 12:43:15,444 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,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:15,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:15,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:15,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:15,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:15,464 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:15,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:15,465 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-11-23 12:43:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:16,341 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-11-23 12:43:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:16,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:43:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:43:16,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-23 12:43:16,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:16,511 INFO L225 Difference]: With dead ends: 1356 [2018-11-23 12:43:16,511 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 12:43:16,512 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,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 12:43:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-11-23 12:43:17,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:17,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1160 states. [2018-11-23 12:43:17,039 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1160 states. [2018-11-23 12:43:17,039 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1160 states. [2018-11-23 12:43:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:17,105 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2018-11-23 12:43:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2018-11-23 12:43:17,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:17,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:17,107 INFO L74 IsIncluded]: Start isIncluded. First operand 1160 states. Second operand 1354 states. [2018-11-23 12:43:17,107 INFO L87 Difference]: Start difference. First operand 1160 states. Second operand 1354 states. [2018-11-23 12:43:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:17,175 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2018-11-23 12:43:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1895 transitions. [2018-11-23 12:43:17,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:17,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:17,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:17,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-23 12:43:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-11-23 12:43:17,219 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-11-23 12:43:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:17,220 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-11-23 12:43:17,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-11-23 12:43:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:17,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:17,221 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,222 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:17,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-11-23 12:43:17,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:17,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:17,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:17,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {26075#true} call ULTIMATE.init(); {26075#true} is VALID [2018-11-23 12:43:17,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {26075#true} assume true; {26075#true} is VALID [2018-11-23 12:43:17,290 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26075#true} {26075#true} #163#return; {26075#true} is VALID [2018-11-23 12:43:17,291 INFO L256 TraceCheckUtils]: 3: Hoare triple {26075#true} call #t~ret9 := main(); {26075#true} is VALID [2018-11-23 12:43:17,291 INFO L273 TraceCheckUtils]: 4: Hoare triple {26075#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;havoc ~cond~0; {26075#true} is VALID [2018-11-23 12:43:17,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {26075#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {26075#true} is VALID [2018-11-23 12:43:17,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {26075#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; {26075#true} is VALID [2018-11-23 12:43:17,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {26075#true} assume !(0 != ~p1~0); {26075#true} is VALID [2018-11-23 12:43:17,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {26075#true} assume !(0 != ~p2~0); {26075#true} is VALID [2018-11-23 12:43:17,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {26075#true} assume !(0 != ~p3~0); {26075#true} is VALID [2018-11-23 12:43:17,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {26075#true} assume !(0 != ~p4~0); {26075#true} is VALID [2018-11-23 12:43:17,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {26075#true} assume !(0 != ~p5~0); {26075#true} is VALID [2018-11-23 12:43:17,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {26075#true} assume !(0 != ~p6~0); {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {26077#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {26077#(= main_~p6~0 0)} assume !(0 != ~p8~0); {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {26077#(= main_~p6~0 0)} assume !(0 != ~p1~0); {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {26077#(= main_~p6~0 0)} assume !(0 != ~p2~0); {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {26077#(= main_~p6~0 0)} assume !(0 != ~p3~0); {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {26077#(= main_~p6~0 0)} assume !(0 != ~p4~0); {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {26077#(= main_~p6~0 0)} assume !(0 != ~p5~0); {26077#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:17,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {26077#(= main_~p6~0 0)} assume 0 != ~p6~0; {26076#false} is VALID [2018-11-23 12:43:17,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {26076#false} assume 1 != ~lk6~0; {26076#false} is VALID [2018-11-23 12:43:17,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {26076#false} assume !false; {26076#false} is VALID [2018-11-23 12:43:17,310 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,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:17,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:17,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:17,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:17,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:17,332 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,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:17,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:17,333 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-11-23 12:43:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:18,301 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-11-23 12:43:18,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:18,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:18,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-23 12:43:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-23 12:43:18,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2018-11-23 12:43:18,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:18,543 INFO L225 Difference]: With dead ends: 2636 [2018-11-23 12:43:18,543 INFO L226 Difference]: Without dead ends: 1514 [2018-11-23 12:43:18,545 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,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-11-23 12:43:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-11-23 12:43:19,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:19,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1514 states. Second operand 1512 states. [2018-11-23 12:43:19,014 INFO L74 IsIncluded]: Start isIncluded. First operand 1514 states. Second operand 1512 states. [2018-11-23 12:43:19,014 INFO L87 Difference]: Start difference. First operand 1514 states. Second operand 1512 states. [2018-11-23 12:43:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:19,099 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2018-11-23 12:43:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2018-11-23 12:43:19,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:19,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:19,101 INFO L74 IsIncluded]: Start isIncluded. First operand 1512 states. Second operand 1514 states. [2018-11-23 12:43:19,101 INFO L87 Difference]: Start difference. First operand 1512 states. Second operand 1514 states. [2018-11-23 12:43:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:19,182 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2018-11-23 12:43:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1991 transitions. [2018-11-23 12:43:19,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:19,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:19,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:19,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-11-23 12:43:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-11-23 12:43:19,248 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-11-23 12:43:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:19,248 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-11-23 12:43:19,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-11-23 12:43:19,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:19,249 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:19,250 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:19,250 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:19,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-11-23 12:43:19,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:19,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:19,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:19,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {33430#true} call ULTIMATE.init(); {33430#true} is VALID [2018-11-23 12:43:19,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {33430#true} assume true; {33430#true} is VALID [2018-11-23 12:43:19,315 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {33430#true} {33430#true} #163#return; {33430#true} is VALID [2018-11-23 12:43:19,315 INFO L256 TraceCheckUtils]: 3: Hoare triple {33430#true} call #t~ret9 := main(); {33430#true} is VALID [2018-11-23 12:43:19,316 INFO L273 TraceCheckUtils]: 4: Hoare triple {33430#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;havoc ~cond~0; {33430#true} is VALID [2018-11-23 12:43:19,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {33430#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {33430#true} is VALID [2018-11-23 12:43:19,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {33430#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; {33430#true} is VALID [2018-11-23 12:43:19,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {33430#true} assume !(0 != ~p1~0); {33430#true} is VALID [2018-11-23 12:43:19,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {33430#true} assume !(0 != ~p2~0); {33430#true} is VALID [2018-11-23 12:43:19,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {33430#true} assume !(0 != ~p3~0); {33430#true} is VALID [2018-11-23 12:43:19,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {33430#true} assume !(0 != ~p4~0); {33430#true} is VALID [2018-11-23 12:43:19,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {33430#true} assume !(0 != ~p5~0); {33430#true} is VALID [2018-11-23 12:43:19,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {33430#true} assume 0 != ~p6~0;~lk6~0 := 1; {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {33432#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {33432#(not (= main_~p6~0 0))} assume !(0 != ~p8~0); {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {33432#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {33432#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,322 INFO L273 TraceCheckUtils]: 17: Hoare triple {33432#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,322 INFO L273 TraceCheckUtils]: 18: Hoare triple {33432#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,323 INFO L273 TraceCheckUtils]: 19: Hoare triple {33432#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {33432#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:19,324 INFO L273 TraceCheckUtils]: 20: Hoare triple {33432#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {33431#false} is VALID [2018-11-23 12:43:19,324 INFO L273 TraceCheckUtils]: 21: Hoare triple {33431#false} assume 0 != ~p7~0; {33431#false} is VALID [2018-11-23 12:43:19,324 INFO L273 TraceCheckUtils]: 22: Hoare triple {33431#false} assume 1 != ~lk7~0; {33431#false} is VALID [2018-11-23 12:43:19,324 INFO L273 TraceCheckUtils]: 23: Hoare triple {33431#false} assume !false; {33431#false} is VALID [2018-11-23 12:43:19,325 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,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:19,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:19,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:19,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:19,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:19,342 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:19,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:19,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:19,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:19,343 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-11-23 12:43:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:20,304 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-11-23 12:43:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:20,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 12:43:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2018-11-23 12:43:20,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2018-11-23 12:43:20,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:20,575 INFO L225 Difference]: With dead ends: 2268 [2018-11-23 12:43:20,575 INFO L226 Difference]: Without dead ends: 1546 [2018-11-23 12:43:20,577 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:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-23 12:43:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-11-23 12:43:21,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:21,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1546 states. Second operand 1544 states. [2018-11-23 12:43:21,415 INFO L74 IsIncluded]: Start isIncluded. First operand 1546 states. Second operand 1544 states. [2018-11-23 12:43:21,415 INFO L87 Difference]: Start difference. First operand 1546 states. Second operand 1544 states. [2018-11-23 12:43:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,509 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2018-11-23 12:43:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2018-11-23 12:43:21,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:21,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:21,511 INFO L74 IsIncluded]: Start isIncluded. First operand 1544 states. Second operand 1546 states. [2018-11-23 12:43:21,511 INFO L87 Difference]: Start difference. First operand 1544 states. Second operand 1546 states. [2018-11-23 12:43:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:21,588 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2018-11-23 12:43:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1991 transitions. [2018-11-23 12:43:21,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:21,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:21,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:21,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 12:43:21,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-11-23 12:43:21,664 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-11-23 12:43:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:21,664 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-11-23 12:43:21,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-11-23 12:43:21,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:21,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:21,666 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:21,666 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:21,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-11-23 12:43:21,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:21,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:21,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:21,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {40513#true} call ULTIMATE.init(); {40513#true} is VALID [2018-11-23 12:43:21,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {40513#true} assume true; {40513#true} is VALID [2018-11-23 12:43:21,782 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {40513#true} {40513#true} #163#return; {40513#true} is VALID [2018-11-23 12:43:21,783 INFO L256 TraceCheckUtils]: 3: Hoare triple {40513#true} call #t~ret9 := main(); {40513#true} is VALID [2018-11-23 12:43:21,783 INFO L273 TraceCheckUtils]: 4: Hoare triple {40513#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;havoc ~cond~0; {40513#true} is VALID [2018-11-23 12:43:21,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {40513#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {40513#true} is VALID [2018-11-23 12:43:21,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {40513#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; {40513#true} is VALID [2018-11-23 12:43:21,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {40513#true} assume !(0 != ~p1~0); {40513#true} is VALID [2018-11-23 12:43:21,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {40513#true} assume !(0 != ~p2~0); {40513#true} is VALID [2018-11-23 12:43:21,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {40513#true} assume !(0 != ~p3~0); {40513#true} is VALID [2018-11-23 12:43:21,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {40513#true} assume !(0 != ~p4~0); {40513#true} is VALID [2018-11-23 12:43:21,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {40513#true} assume !(0 != ~p5~0); {40513#true} is VALID [2018-11-23 12:43:21,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {40513#true} assume !(0 != ~p6~0); {40513#true} is VALID [2018-11-23 12:43:21,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {40513#true} assume 0 != ~p7~0;~lk7~0 := 1; {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {40515#(= main_~lk7~0 1)} assume !(0 != ~p8~0); {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {40515#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {40515#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {40515#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {40515#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {40515#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {40515#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {40515#(= main_~lk7~0 1)} assume 0 != ~p7~0; {40515#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:21,796 INFO L273 TraceCheckUtils]: 22: Hoare triple {40515#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {40514#false} is VALID [2018-11-23 12:43:21,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {40514#false} assume !false; {40514#false} is VALID [2018-11-23 12:43:21,797 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:21,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:21,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:21,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:21,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:21,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:21,817 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,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:21,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:21,818 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-11-23 12:43:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:23,548 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-11-23 12:43:23,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:23,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 12:43:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 12:43:23,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 12:43:23,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:23,880 INFO L225 Difference]: With dead ends: 2572 [2018-11-23 12:43:23,881 INFO L226 Difference]: Without dead ends: 2570 [2018-11-23 12:43:23,881 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,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-11-23 12:43:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-11-23 12:43:24,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:24,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2570 states. Second operand 2312 states. [2018-11-23 12:43:24,921 INFO L74 IsIncluded]: Start isIncluded. First operand 2570 states. Second operand 2312 states. [2018-11-23 12:43:24,921 INFO L87 Difference]: Start difference. First operand 2570 states. Second operand 2312 states. [2018-11-23 12:43:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:25,173 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2018-11-23 12:43:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2018-11-23 12:43:25,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:25,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:25,177 INFO L74 IsIncluded]: Start isIncluded. First operand 2312 states. Second operand 2570 states. [2018-11-23 12:43:25,177 INFO L87 Difference]: Start difference. First operand 2312 states. Second operand 2570 states. [2018-11-23 12:43:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:25,425 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2018-11-23 12:43:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3271 transitions. [2018-11-23 12:43:25,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:25,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:25,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:25,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-23 12:43:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-11-23 12:43:25,643 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-11-23 12:43:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:25,643 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-11-23 12:43:25,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-11-23 12:43:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:43:25,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:25,646 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:25,646 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:25,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-11-23 12:43:25,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:25,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:25,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:25,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {50748#true} call ULTIMATE.init(); {50748#true} is VALID [2018-11-23 12:43:25,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {50748#true} assume true; {50748#true} is VALID [2018-11-23 12:43:25,916 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {50748#true} {50748#true} #163#return; {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L256 TraceCheckUtils]: 3: Hoare triple {50748#true} call #t~ret9 := main(); {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L273 TraceCheckUtils]: 4: Hoare triple {50748#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;havoc ~cond~0; {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {50748#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {50748#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; {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {50748#true} assume !(0 != ~p1~0); {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {50748#true} assume !(0 != ~p2~0); {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {50748#true} assume !(0 != ~p3~0); {50748#true} is VALID [2018-11-23 12:43:25,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {50748#true} assume !(0 != ~p4~0); {50748#true} is VALID [2018-11-23 12:43:25,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {50748#true} assume !(0 != ~p5~0); {50748#true} is VALID [2018-11-23 12:43:25,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {50748#true} assume !(0 != ~p6~0); {50748#true} is VALID [2018-11-23 12:43:25,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {50748#true} assume !(0 != ~p7~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {50750#(= main_~p7~0 0)} assume !(0 != ~p8~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {50750#(= main_~p7~0 0)} assume !(0 != ~p1~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {50750#(= main_~p7~0 0)} assume !(0 != ~p2~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {50750#(= main_~p7~0 0)} assume !(0 != ~p3~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {50750#(= main_~p7~0 0)} assume !(0 != ~p4~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,924 INFO L273 TraceCheckUtils]: 19: Hoare triple {50750#(= main_~p7~0 0)} assume !(0 != ~p5~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {50750#(= main_~p7~0 0)} assume !(0 != ~p6~0); {50750#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:25,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {50750#(= main_~p7~0 0)} assume 0 != ~p7~0; {50749#false} is VALID [2018-11-23 12:43:25,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {50749#false} assume 1 != ~lk7~0; {50749#false} is VALID [2018-11-23 12:43:25,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {50749#false} assume !false; {50749#false} is VALID [2018-11-23 12:43:25,925 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:25,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:25,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:25,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:25,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:25,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:25,945 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:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:25,946 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-11-23 12:43:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:27,908 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-11-23 12:43:27,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:27,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 12:43:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 12:43:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 12:43:27,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2018-11-23 12:43:28,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:28,382 INFO L225 Difference]: With dead ends: 5196 [2018-11-23 12:43:28,382 INFO L226 Difference]: Without dead ends: 2954 [2018-11-23 12:43:28,385 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:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-23 12:43:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-11-23 12:43:29,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:29,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2954 states. Second operand 2952 states. [2018-11-23 12:43:29,479 INFO L74 IsIncluded]: Start isIncluded. First operand 2954 states. Second operand 2952 states. [2018-11-23 12:43:29,479 INFO L87 Difference]: Start difference. First operand 2954 states. Second operand 2952 states. [2018-11-23 12:43:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:29,787 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2018-11-23 12:43:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2018-11-23 12:43:29,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:29,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:29,790 INFO L74 IsIncluded]: Start isIncluded. First operand 2952 states. Second operand 2954 states. [2018-11-23 12:43:29,790 INFO L87 Difference]: Start difference. First operand 2952 states. Second operand 2954 states. [2018-11-23 12:43:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:30,098 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2018-11-23 12:43:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3527 transitions. [2018-11-23 12:43:30,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:30,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:30,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:30,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-11-23 12:43:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-11-23 12:43:30,434 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-11-23 12:43:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:30,434 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-11-23 12:43:30,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-11-23 12:43:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:30,437 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:30,437 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:30,437 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:30,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-11-23 12:43:30,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:30,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:30,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:30,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:30,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:30,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {65143#true} call ULTIMATE.init(); {65143#true} is VALID [2018-11-23 12:43:30,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {65143#true} assume true; {65143#true} is VALID [2018-11-23 12:43:30,666 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {65143#true} {65143#true} #163#return; {65143#true} is VALID [2018-11-23 12:43:30,667 INFO L256 TraceCheckUtils]: 3: Hoare triple {65143#true} call #t~ret9 := main(); {65143#true} is VALID [2018-11-23 12:43:30,667 INFO L273 TraceCheckUtils]: 4: Hoare triple {65143#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;havoc ~cond~0; {65143#true} is VALID [2018-11-23 12:43:30,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {65143#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {65143#true} is VALID [2018-11-23 12:43:30,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {65143#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; {65143#true} is VALID [2018-11-23 12:43:30,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {65143#true} assume !(0 != ~p1~0); {65143#true} is VALID [2018-11-23 12:43:30,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {65143#true} assume !(0 != ~p2~0); {65143#true} is VALID [2018-11-23 12:43:30,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {65143#true} assume !(0 != ~p3~0); {65143#true} is VALID [2018-11-23 12:43:30,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {65143#true} assume !(0 != ~p4~0); {65143#true} is VALID [2018-11-23 12:43:30,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {65143#true} assume !(0 != ~p5~0); {65143#true} is VALID [2018-11-23 12:43:30,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {65143#true} assume !(0 != ~p6~0); {65143#true} is VALID [2018-11-23 12:43:30,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {65143#true} assume 0 != ~p7~0;~lk7~0 := 1; {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p8~0); {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {65145#(not (= main_~p7~0 0))} is VALID [2018-11-23 12:43:30,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {65145#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {65144#false} is VALID [2018-11-23 12:43:30,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {65144#false} assume 0 != ~p8~0; {65144#false} is VALID [2018-11-23 12:43:30,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {65144#false} assume 1 != ~lk8~0; {65144#false} is VALID [2018-11-23 12:43:30,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {65144#false} assume !false; {65144#false} is VALID [2018-11-23 12:43:30,729 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:30,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:30,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:30,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:30,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:30,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:30,768 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:30,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:30,769 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-11-23 12:43:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:33,281 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-11-23 12:43:33,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:33,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 12:43:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 12:43:33,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2018-11-23 12:43:33,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:33,820 INFO L225 Difference]: With dead ends: 4428 [2018-11-23 12:43:33,820 INFO L226 Difference]: Without dead ends: 3018 [2018-11-23 12:43:33,823 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:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-11-23 12:43:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-11-23 12:43:35,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:35,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3018 states. Second operand 3016 states. [2018-11-23 12:43:35,879 INFO L74 IsIncluded]: Start isIncluded. First operand 3018 states. Second operand 3016 states. [2018-11-23 12:43:35,879 INFO L87 Difference]: Start difference. First operand 3018 states. Second operand 3016 states. [2018-11-23 12:43:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:36,143 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2018-11-23 12:43:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2018-11-23 12:43:36,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:36,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:36,146 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3018 states. [2018-11-23 12:43:36,146 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3018 states. [2018-11-23 12:43:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:36,393 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2018-11-23 12:43:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 3527 transitions. [2018-11-23 12:43:36,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:36,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:36,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:36,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 12:43:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-11-23 12:43:36,660 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-11-23 12:43:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:36,660 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-11-23 12:43:36,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-11-23 12:43:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:36,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:36,662 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:36,663 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:36,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:36,663 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-11-23 12:43:36,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:36,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:36,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:36,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:36,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:36,726 INFO L256 TraceCheckUtils]: 0: Hoare triple {78962#true} call ULTIMATE.init(); {78962#true} is VALID [2018-11-23 12:43:36,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {78962#true} assume true; {78962#true} is VALID [2018-11-23 12:43:36,726 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {78962#true} {78962#true} #163#return; {78962#true} is VALID [2018-11-23 12:43:36,726 INFO L256 TraceCheckUtils]: 3: Hoare triple {78962#true} call #t~ret9 := main(); {78962#true} is VALID [2018-11-23 12:43:36,726 INFO L273 TraceCheckUtils]: 4: Hoare triple {78962#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;havoc ~cond~0; {78962#true} is VALID [2018-11-23 12:43:36,727 INFO L273 TraceCheckUtils]: 5: Hoare triple {78962#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {78962#true} is VALID [2018-11-23 12:43:36,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {78962#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; {78962#true} is VALID [2018-11-23 12:43:36,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {78962#true} assume !(0 != ~p1~0); {78962#true} is VALID [2018-11-23 12:43:36,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {78962#true} assume !(0 != ~p2~0); {78962#true} is VALID [2018-11-23 12:43:36,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {78962#true} assume !(0 != ~p3~0); {78962#true} is VALID [2018-11-23 12:43:36,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {78962#true} assume !(0 != ~p4~0); {78962#true} is VALID [2018-11-23 12:43:36,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {78962#true} assume !(0 != ~p5~0); {78962#true} is VALID [2018-11-23 12:43:36,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {78962#true} assume !(0 != ~p6~0); {78962#true} is VALID [2018-11-23 12:43:36,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {78962#true} assume !(0 != ~p7~0); {78962#true} is VALID [2018-11-23 12:43:36,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {78962#true} assume !(0 != ~p8~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,733 INFO L273 TraceCheckUtils]: 15: Hoare triple {78964#(= main_~p8~0 0)} assume !(0 != ~p1~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {78964#(= main_~p8~0 0)} assume !(0 != ~p2~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {78964#(= main_~p8~0 0)} assume !(0 != ~p3~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {78964#(= main_~p8~0 0)} assume !(0 != ~p4~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {78964#(= main_~p8~0 0)} assume !(0 != ~p5~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {78964#(= main_~p8~0 0)} assume !(0 != ~p6~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {78964#(= main_~p8~0 0)} assume !(0 != ~p7~0); {78964#(= main_~p8~0 0)} is VALID [2018-11-23 12:43:36,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {78964#(= main_~p8~0 0)} assume 0 != ~p8~0; {78963#false} is VALID [2018-11-23 12:43:36,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {78963#false} assume 1 != ~lk8~0; {78963#false} is VALID [2018-11-23 12:43:36,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {78963#false} assume !false; {78963#false} is VALID [2018-11-23 12:43:36,743 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:36,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:36,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:36,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:36,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:36,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:36,764 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:36,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:36,765 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-11-23 12:43:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:42,224 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-11-23 12:43:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:42,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:43:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:43:42,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 12:43:42,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:42,793 INFO L225 Difference]: With dead ends: 8650 [2018-11-23 12:43:42,793 INFO L226 Difference]: Without dead ends: 3016 [2018-11-23 12:43:42,799 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:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-11-23 12:43:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-11-23 12:43:44,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:44,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3016 states. Second operand 3016 states. [2018-11-23 12:43:44,949 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2018-11-23 12:43:44,949 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2018-11-23 12:43:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:45,237 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 12:43:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 12:43:45,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:45,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:45,240 INFO L74 IsIncluded]: Start isIncluded. First operand 3016 states. Second operand 3016 states. [2018-11-23 12:43:45,240 INFO L87 Difference]: Start difference. First operand 3016 states. Second operand 3016 states. [2018-11-23 12:43:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:45,485 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 12:43:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 12:43:45,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:45,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:45,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:45,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 12:43:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-11-23 12:43:45,827 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-11-23 12:43:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:45,828 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-11-23 12:43:45,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 12:43:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:43:45,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:45,830 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:45,830 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:45,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-11-23 12:43:45,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:45,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:45,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:45,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:45,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:45,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {97190#true} call ULTIMATE.init(); {97190#true} is VALID [2018-11-23 12:43:45,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {97190#true} assume true; {97190#true} is VALID [2018-11-23 12:43:45,886 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {97190#true} {97190#true} #163#return; {97190#true} is VALID [2018-11-23 12:43:45,886 INFO L256 TraceCheckUtils]: 3: Hoare triple {97190#true} call #t~ret9 := main(); {97190#true} is VALID [2018-11-23 12:43:45,887 INFO L273 TraceCheckUtils]: 4: Hoare triple {97190#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;havoc ~cond~0; {97190#true} is VALID [2018-11-23 12:43:45,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {97190#true} assume !false;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~cond~0 := #t~nondet8;havoc #t~nondet8; {97190#true} is VALID [2018-11-23 12:43:45,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {97190#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; {97190#true} is VALID [2018-11-23 12:43:45,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {97190#true} assume !(0 != ~p1~0); {97190#true} is VALID [2018-11-23 12:43:45,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {97190#true} assume !(0 != ~p2~0); {97190#true} is VALID [2018-11-23 12:43:45,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {97190#true} assume !(0 != ~p3~0); {97190#true} is VALID [2018-11-23 12:43:45,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {97190#true} assume !(0 != ~p4~0); {97190#true} is VALID [2018-11-23 12:43:45,888 INFO L273 TraceCheckUtils]: 11: Hoare triple {97190#true} assume !(0 != ~p5~0); {97190#true} is VALID [2018-11-23 12:43:45,888 INFO L273 TraceCheckUtils]: 12: Hoare triple {97190#true} assume !(0 != ~p6~0); {97190#true} is VALID [2018-11-23 12:43:45,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {97190#true} assume !(0 != ~p7~0); {97190#true} is VALID [2018-11-23 12:43:45,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {97190#true} assume 0 != ~p8~0;~lk8~0 := 1; {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {97192#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,892 INFO L273 TraceCheckUtils]: 16: Hoare triple {97192#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,892 INFO L273 TraceCheckUtils]: 17: Hoare triple {97192#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {97192#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {97192#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {97192#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {97192#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {97192#(= main_~lk8~0 1)} assume 0 != ~p8~0; {97192#(= main_~lk8~0 1)} is VALID [2018-11-23 12:43:45,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {97192#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {97191#false} is VALID [2018-11-23 12:43:45,898 INFO L273 TraceCheckUtils]: 24: Hoare triple {97191#false} assume !false; {97191#false} is VALID [2018-11-23 12:43:45,899 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:45,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:45,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:45,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:45,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:45,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:45,931 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:45,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:45,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:45,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:45,932 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-11-23 12:43:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:48,825 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 12:43:48,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:48,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 12:43:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 12:43:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 12:43:48,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-23 12:43:48,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:48,888 INFO L225 Difference]: With dead ends: 3016 [2018-11-23 12:43:48,888 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:43:48,891 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:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:43:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:43:48,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:48,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:48,892 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:48,892 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:48,893 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:43:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:48,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:48,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:48,893 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:48,893 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:48,893 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:43:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:48,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:48,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:48,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:48,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:43:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:43:48,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-23 12:43:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:48,894 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:43:48,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:48,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:48,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:43:48,935 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:43:48,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:48,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:48,935 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:43:48,935 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,936 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,937 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-23 12:43:48,938 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,938 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-23 12:43:48,939 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,939 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,939 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-23 12:43:48,939 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-23 12:43:48,939 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 12:43:48,941 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-23 12:43:48,942 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-23 12:43:48,943 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2018-11-23 12:43:48,944 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-23 12:43:48,945 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-23 12:43:48,945 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-23 12:43:48,945 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2018-11-23 12:43:48,945 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-23 12:43:48,945 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2018-11-23 12:43:48,945 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:43:48,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:43:48 BoogieIcfgContainer [2018-11-23 12:43:48,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:43:48,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:43:48,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:43:48,951 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:43:48,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:58" (3/4) ... [2018-11-23 12:43:48,954 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:43:48,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:43:48,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:43:48,967 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:43:48,967 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:43:48,967 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:43:49,034 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 12:43:49,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:43:49,036 INFO L168 Benchmark]: Toolchain (without parser) took 52246.79 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:43:49,037 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:43:49,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.13 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:43:49,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.37 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:43:49,038 INFO L168 Benchmark]: Boogie Preprocessor took 55.16 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:43:49,038 INFO L168 Benchmark]: RCFGBuilder took 1028.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -750.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:49,039 INFO L168 Benchmark]: TraceAbstraction took 50740.95 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 462.9 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -448.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:49,039 INFO L168 Benchmark]: Witness Printer took 83.58 ms. Allocated memory is still 2.7 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:49,042 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 307.13 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 24.37 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 55.16 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 1028.48 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -750.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50740.95 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 462.9 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -448.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Witness Printer took 83.58 ms. Allocated memory is still 2.7 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. SAFE Result, 50.6s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 29.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, 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: 15.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 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.9s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...