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_7_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:42:41,962 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:42:41,964 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:42:41,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:42:41,976 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:42:41,977 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:42:41,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:42:41,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:42:41,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:42:41,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:42:41,990 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:42:41,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:42:41,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:42:41,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:42:41,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:42:41,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:42:42,000 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:42:42,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:42:42,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:42:42,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:42:42,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:42:42,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:42:42,015 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:42:42,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:42:42,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:42:42,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:42:42,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:42:42,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:42:42,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:42:42,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:42:42,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:42:42,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:42:42,020 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:42:42,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:42:42,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:42:42,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:42:42,023 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:42,037 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:42:42,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:42:42,038 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:42:42,038 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:42:42,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:42:42,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:42:42,039 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:42:42,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:42:42,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:42:42,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:42:42,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:42:42,040 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:42:42,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:42:42,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:42:42,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:42:42,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:42:42,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:42:42,041 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:42:42,042 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:42:42,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:42:42,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:42:42,042 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:42:42,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:42:42,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:42:42,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:42:42,043 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:42:42,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:42:42,043 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:42:42,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:42:42,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:42:42,044 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:42:42,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:42:42,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:42:42,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:42:42,105 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:42:42,105 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:42:42,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:42,168 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f3a01ed/f8d0680e8b134541a8bd2afcbbd59fec/FLAGed2d94a30 [2018-11-23 12:42:42,575 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:42:42,576 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:42,583 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f3a01ed/f8d0680e8b134541a8bd2afcbbd59fec/FLAGed2d94a30 [2018-11-23 12:42:42,954 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f3a01ed/f8d0680e8b134541a8bd2afcbbd59fec [2018-11-23 12:42:42,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:42:42,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:42:42,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:42,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:42:42,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:42:42,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:42" (1/1) ... [2018-11-23 12:42:42,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:42, skipping insertion in model container [2018-11-23 12:42:42,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:42:42" (1/1) ... [2018-11-23 12:42:42,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:42:43,014 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:42:43,289 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:43,294 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:42:43,323 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:42:43,339 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:42:43,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:43 WrapperNode [2018-11-23 12:42:43,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:42:43,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:43,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:42:43,341 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:42:43,349 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:43" (1/1) ... [2018-11-23 12:42:43,354 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:43" (1/1) ... [2018-11-23 12:42:43,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:42:43,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:42:43,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:42:43,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:42:43,372 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:43" (1/1) ... [2018-11-23 12:42:43,372 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:43" (1/1) ... [2018-11-23 12:42:43,373 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:43" (1/1) ... [2018-11-23 12:42:43,374 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:43" (1/1) ... [2018-11-23 12:42:43,381 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:43" (1/1) ... [2018-11-23 12:42:43,391 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:43" (1/1) ... [2018-11-23 12:42:43,393 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:43" (1/1) ... [2018-11-23 12:42:43,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:42:43,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:42:43,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:42:43,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:42:43,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:43" (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:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:42:43,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:42:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:42:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:42:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:42:43,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:42:44,304 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:42:44,305 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 12:42:44,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:44 BoogieIcfgContainer [2018-11-23 12:42:44,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:42:44,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:42:44,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:42:44,311 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:42:44,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:42:42" (1/3) ... [2018-11-23 12:42:44,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7468a9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:44, skipping insertion in model container [2018-11-23 12:42:44,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:42:43" (2/3) ... [2018-11-23 12:42:44,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7468a9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:42:44, skipping insertion in model container [2018-11-23 12:42:44,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:42:44" (3/3) ... [2018-11-23 12:42:44,317 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 12:42:44,327 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:42:44,335 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:42:44,349 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:42:44,382 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:42:44,382 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:42:44,383 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:42:44,383 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:42:44,385 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:42:44,385 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:42:44,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:42:44,386 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:42:44,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:42:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-11-23 12:42:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:44,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:44,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:44,417 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:44,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:44,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2018-11-23 12:42:44,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:44,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:44,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {38#true} is VALID [2018-11-23 12:42:44,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2018-11-23 12:42:44,629 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #146#return; {38#true} is VALID [2018-11-23 12:42:44,630 INFO L256 TraceCheckUtils]: 3: Hoare triple {38#true} call #t~ret8 := main(); {38#true} is VALID [2018-11-23 12:42:44,630 INFO L273 TraceCheckUtils]: 4: Hoare triple {38#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;havoc ~cond~0; {38#true} is VALID [2018-11-23 12:42:44,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {38#true} is VALID [2018-11-23 12:42:44,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {38#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; {38#true} is VALID [2018-11-23 12:42:44,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#true} assume 0 != ~p1~0;~lk1~0 := 1; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#(= main_~lk1~0 1)} assume 0 != ~p2~0;~lk2~0 := 1; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,666 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#(= main_~lk1~0 1)} assume 0 != ~p1~0; {40#(= main_~lk1~0 1)} is VALID [2018-11-23 12:42:44,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {39#false} is VALID [2018-11-23 12:42:44,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2018-11-23 12:42:44,675 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:44,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:44,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:44,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:44,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:44,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:44,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:44,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:44,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:44,929 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-11-23 12:42:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,301 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2018-11-23 12:42:45,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:45,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:42:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 12:42:45,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 12:42:45,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:45,672 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:42:45,673 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:42:45,679 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:42:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:42:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-23 12:42:45,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:45,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 38 states. [2018-11-23 12:42:45,807 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 38 states. [2018-11-23 12:42:45,807 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 38 states. [2018-11-23 12:42:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,817 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2018-11-23 12:42:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2018-11-23 12:42:45,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,820 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 54 states. [2018-11-23 12:42:45,820 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 54 states. [2018-11-23 12:42:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:45,832 INFO L93 Difference]: Finished difference Result 54 states and 92 transitions. [2018-11-23 12:42:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 92 transitions. [2018-11-23 12:42:45,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:45,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:45,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:45,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:42:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-11-23 12:42:45,844 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2018-11-23 12:42:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:45,845 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2018-11-23 12:42:45,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2018-11-23 12:42:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:42:45,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:45,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:42:45,847 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:45,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2018-11-23 12:42:45,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:45,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:45,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:45,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:46,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {276#true} call ULTIMATE.init(); {276#true} is VALID [2018-11-23 12:42:46,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {276#true} assume true; {276#true} is VALID [2018-11-23 12:42:46,053 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {276#true} {276#true} #146#return; {276#true} is VALID [2018-11-23 12:42:46,053 INFO L256 TraceCheckUtils]: 3: Hoare triple {276#true} call #t~ret8 := main(); {276#true} is VALID [2018-11-23 12:42:46,053 INFO L273 TraceCheckUtils]: 4: Hoare triple {276#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;havoc ~cond~0; {276#true} is VALID [2018-11-23 12:42:46,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {276#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {276#true} is VALID [2018-11-23 12:42:46,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {276#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; {276#true} is VALID [2018-11-23 12:42:46,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {276#true} assume !(0 != ~p1~0); {278#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:46,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {278#(= main_~p1~0 0)} assume 0 != ~p2~0;~lk2~0 := 1; {278#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:46,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {278#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:46,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {278#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {278#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:46,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {278#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {278#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:46,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {278#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {278#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:46,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {278#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {278#(= main_~p1~0 0)} is VALID [2018-11-23 12:42:46,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {278#(= main_~p1~0 0)} assume 0 != ~p1~0; {277#false} is VALID [2018-11-23 12:42:46,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {277#false} assume 1 != ~lk1~0; {277#false} is VALID [2018-11-23 12:42:46,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {277#false} assume !false; {277#false} is VALID [2018-11-23 12:42:46,065 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:46,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:46,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:46,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:46,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:46,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:46,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,159 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2018-11-23 12:42:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,389 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-11-23 12:42:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:46,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:42:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 12:42:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2018-11-23 12:42:46,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2018-11-23 12:42:46,727 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:42:46,730 INFO L225 Difference]: With dead ends: 87 [2018-11-23 12:42:46,730 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:42:46,732 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:42:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:42:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-23 12:42:46,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:46,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 52 states. [2018-11-23 12:42:46,754 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 52 states. [2018-11-23 12:42:46,755 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 52 states. [2018-11-23 12:42:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,759 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2018-11-23 12:42:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2018-11-23 12:42:46,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,760 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 54 states. [2018-11-23 12:42:46,761 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 54 states. [2018-11-23 12:42:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:46,764 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2018-11-23 12:42:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2018-11-23 12:42:46,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:46,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:46,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:46,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:42:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-11-23 12:42:46,769 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2018-11-23 12:42:46,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:46,770 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2018-11-23 12:42:46,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2018-11-23 12:42:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:46,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:46,771 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:46,772 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:46,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2018-11-23 12:42:46,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:46,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:46,845 INFO L256 TraceCheckUtils]: 0: Hoare triple {545#true} call ULTIMATE.init(); {545#true} is VALID [2018-11-23 12:42:46,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {545#true} assume true; {545#true} is VALID [2018-11-23 12:42:46,845 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} #146#return; {545#true} is VALID [2018-11-23 12:42:46,846 INFO L256 TraceCheckUtils]: 3: Hoare triple {545#true} call #t~ret8 := main(); {545#true} is VALID [2018-11-23 12:42:46,846 INFO L273 TraceCheckUtils]: 4: Hoare triple {545#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;havoc ~cond~0; {545#true} is VALID [2018-11-23 12:42:46,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {545#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {545#true} is VALID [2018-11-23 12:42:46,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {545#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; {545#true} is VALID [2018-11-23 12:42:46,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {545#true} assume 0 != ~p1~0;~lk1~0 := 1; {547#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {547#(not (= main_~p1~0 0))} assume 0 != ~p2~0;~lk2~0 := 1; {547#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {547#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {547#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {547#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {547#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {547#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {547#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {547#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {547#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {547#(not (= main_~p1~0 0))} is VALID [2018-11-23 12:42:46,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {547#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {546#false} is VALID [2018-11-23 12:42:46,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {546#false} assume 0 != ~p2~0; {546#false} is VALID [2018-11-23 12:42:46,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {546#false} assume 1 != ~lk2~0; {546#false} is VALID [2018-11-23 12:42:46,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {546#false} assume !false; {546#false} is VALID [2018-11-23 12:42:46,860 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:46,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:46,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:46,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:46,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:46,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:46,897 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:46,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:46,899 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2018-11-23 12:42:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,064 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2018-11-23 12:42:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:47,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 12:42:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2018-11-23 12:42:47,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2018-11-23 12:42:47,256 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:42:47,260 INFO L225 Difference]: With dead ends: 81 [2018-11-23 12:42:47,261 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:42:47,261 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:42:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:42:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:42:47,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:47,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:42:47,300 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:42:47,300 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:42:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,303 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2018-11-23 12:42:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-11-23 12:42:47,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,304 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:42:47,304 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:42:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,308 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2018-11-23 12:42:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-11-23 12:42:47,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:47,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:42:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-11-23 12:42:47,313 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2018-11-23 12:42:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:47,313 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2018-11-23 12:42:47,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2018-11-23 12:42:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:47,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:47,314 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:47,315 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:47,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2018-11-23 12:42:47,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:47,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:47,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {819#true} call ULTIMATE.init(); {819#true} is VALID [2018-11-23 12:42:47,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {819#true} assume true; {819#true} is VALID [2018-11-23 12:42:47,366 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {819#true} {819#true} #146#return; {819#true} is VALID [2018-11-23 12:42:47,366 INFO L256 TraceCheckUtils]: 3: Hoare triple {819#true} call #t~ret8 := main(); {819#true} is VALID [2018-11-23 12:42:47,367 INFO L273 TraceCheckUtils]: 4: Hoare triple {819#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;havoc ~cond~0; {819#true} is VALID [2018-11-23 12:42:47,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {819#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {819#true} is VALID [2018-11-23 12:42:47,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {819#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; {819#true} is VALID [2018-11-23 12:42:47,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {819#true} assume !(0 != ~p1~0); {819#true} is VALID [2018-11-23 12:42:47,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {819#true} assume 0 != ~p2~0;~lk2~0 := 1; {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {821#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {821#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {821#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {821#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {821#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {821#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {821#(= main_~lk2~0 1)} assume 0 != ~p2~0; {821#(= main_~lk2~0 1)} is VALID [2018-11-23 12:42:47,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {821#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {820#false} is VALID [2018-11-23 12:42:47,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {820#false} assume !false; {820#false} is VALID [2018-11-23 12:42:47,390 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:47,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:47,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:47,420 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:47,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:47,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:47,422 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2018-11-23 12:42:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,557 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2018-11-23 12:42:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:47,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:42:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 12:42:47,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 12:42:47,659 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:42:47,663 INFO L225 Difference]: With dead ends: 100 [2018-11-23 12:42:47,663 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 12:42:47,664 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:42:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 12:42:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-11-23 12:42:47,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:47,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 72 states. [2018-11-23 12:42:47,721 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 72 states. [2018-11-23 12:42:47,721 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 72 states. [2018-11-23 12:42:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,732 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2018-11-23 12:42:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 165 transitions. [2018-11-23 12:42:47,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,733 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 98 states. [2018-11-23 12:42:47,734 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 98 states. [2018-11-23 12:42:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:47,741 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2018-11-23 12:42:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 165 transitions. [2018-11-23 12:42:47,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:47,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:47,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:47,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 12:42:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2018-11-23 12:42:47,752 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2018-11-23 12:42:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:47,753 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2018-11-23 12:42:47,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2018-11-23 12:42:47,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:42:47,754 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:47,754 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:47,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:47,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2018-11-23 12:42:47,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:47,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:47,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:47,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:47,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {1212#true} call ULTIMATE.init(); {1212#true} is VALID [2018-11-23 12:42:47,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {1212#true} assume true; {1212#true} is VALID [2018-11-23 12:42:47,848 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1212#true} {1212#true} #146#return; {1212#true} is VALID [2018-11-23 12:42:47,848 INFO L256 TraceCheckUtils]: 3: Hoare triple {1212#true} call #t~ret8 := main(); {1212#true} is VALID [2018-11-23 12:42:47,848 INFO L273 TraceCheckUtils]: 4: Hoare triple {1212#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;havoc ~cond~0; {1212#true} is VALID [2018-11-23 12:42:47,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {1212#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {1212#true} is VALID [2018-11-23 12:42:47,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {1212#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; {1212#true} is VALID [2018-11-23 12:42:47,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {1212#true} assume !(0 != ~p1~0); {1212#true} is VALID [2018-11-23 12:42:47,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {1212#true} assume !(0 != ~p2~0); {1214#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {1214#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1214#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {1214#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1214#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {1214#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1214#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {1214#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1214#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {1214#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1214#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {1214#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1214#(= main_~p2~0 0)} is VALID [2018-11-23 12:42:47,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {1214#(= main_~p2~0 0)} assume 0 != ~p2~0; {1213#false} is VALID [2018-11-23 12:42:47,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {1213#false} assume 1 != ~lk2~0; {1213#false} is VALID [2018-11-23 12:42:47,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {1213#false} assume !false; {1213#false} is VALID [2018-11-23 12:42:47,862 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:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:47,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:47,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:47,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:47,919 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:47,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:47,920 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2018-11-23 12:42:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,107 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2018-11-23 12:42:48,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:42:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:42:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:42:48,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 12:42:48,314 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:42:48,318 INFO L225 Difference]: With dead ends: 164 [2018-11-23 12:42:48,318 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 12:42:48,319 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:42:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 12:42:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-23 12:42:48,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:48,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-23 12:42:48,472 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-23 12:42:48,472 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-23 12:42:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,477 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2018-11-23 12:42:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 163 transitions. [2018-11-23 12:42:48,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,478 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-23 12:42:48,479 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-23 12:42:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,483 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2018-11-23 12:42:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 163 transitions. [2018-11-23 12:42:48,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:48,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 12:42:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2018-11-23 12:42:48,489 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2018-11-23 12:42:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:48,490 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2018-11-23 12:42:48,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2018-11-23 12:42:48,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:48,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:48,491 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:42:48,491 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:48,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:48,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2018-11-23 12:42:48,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:48,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:48,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:48,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:48,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {1703#true} call ULTIMATE.init(); {1703#true} is VALID [2018-11-23 12:42:48,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {1703#true} assume true; {1703#true} is VALID [2018-11-23 12:42:48,554 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1703#true} {1703#true} #146#return; {1703#true} is VALID [2018-11-23 12:42:48,555 INFO L256 TraceCheckUtils]: 3: Hoare triple {1703#true} call #t~ret8 := main(); {1703#true} is VALID [2018-11-23 12:42:48,555 INFO L273 TraceCheckUtils]: 4: Hoare triple {1703#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;havoc ~cond~0; {1703#true} is VALID [2018-11-23 12:42:48,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {1703#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {1703#true} is VALID [2018-11-23 12:42:48,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {1703#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; {1703#true} is VALID [2018-11-23 12:42:48,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {1703#true} assume !(0 != ~p1~0); {1703#true} is VALID [2018-11-23 12:42:48,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {1703#true} assume 0 != ~p2~0;~lk2~0 := 1; {1705#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:48,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {1705#(not (= main_~p2~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1705#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:48,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {1705#(not (= main_~p2~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1705#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:48,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {1705#(not (= main_~p2~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1705#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:48,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {1705#(not (= main_~p2~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1705#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:48,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {1705#(not (= main_~p2~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1705#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:48,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {1705#(not (= main_~p2~0 0))} assume !(0 != ~p1~0); {1705#(not (= main_~p2~0 0))} is VALID [2018-11-23 12:42:48,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {1705#(not (= main_~p2~0 0))} assume !(0 != ~p2~0); {1704#false} is VALID [2018-11-23 12:42:48,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {1704#false} assume 0 != ~p3~0; {1704#false} is VALID [2018-11-23 12:42:48,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {1704#false} assume 1 != ~lk3~0; {1704#false} is VALID [2018-11-23 12:42:48,574 INFO L273 TraceCheckUtils]: 18: Hoare triple {1704#false} assume !false; {1704#false} is VALID [2018-11-23 12:42:48,575 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:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:48,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:48,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:48,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:48,602 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:42:48,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:48,603 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2018-11-23 12:42:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,743 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2018-11-23 12:42:48,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:48,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-23 12:42:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2018-11-23 12:42:48,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2018-11-23 12:42:48,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:48,907 INFO L225 Difference]: With dead ends: 147 [2018-11-23 12:42:48,907 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 12:42:48,908 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:42:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 12:42:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-23 12:42:48,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:48,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 100 states. [2018-11-23 12:42:48,947 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 100 states. [2018-11-23 12:42:48,947 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 100 states. [2018-11-23 12:42:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,951 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2018-11-23 12:42:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2018-11-23 12:42:48,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,952 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 102 states. [2018-11-23 12:42:48,952 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 102 states. [2018-11-23 12:42:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:48,956 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2018-11-23 12:42:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 163 transitions. [2018-11-23 12:42:48,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:48,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:48,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:48,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:42:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2018-11-23 12:42:48,962 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2018-11-23 12:42:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:48,962 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2018-11-23 12:42:48,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2018-11-23 12:42:48,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:48,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:48,963 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:42:48,963 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:48,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:48,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2018-11-23 12:42:48,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:48,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:48,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:48,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:49,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {2183#true} call ULTIMATE.init(); {2183#true} is VALID [2018-11-23 12:42:49,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {2183#true} assume true; {2183#true} is VALID [2018-11-23 12:42:49,035 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2183#true} {2183#true} #146#return; {2183#true} is VALID [2018-11-23 12:42:49,035 INFO L256 TraceCheckUtils]: 3: Hoare triple {2183#true} call #t~ret8 := main(); {2183#true} is VALID [2018-11-23 12:42:49,035 INFO L273 TraceCheckUtils]: 4: Hoare triple {2183#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;havoc ~cond~0; {2183#true} is VALID [2018-11-23 12:42:49,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {2183#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {2183#true} is VALID [2018-11-23 12:42:49,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {2183#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; {2183#true} is VALID [2018-11-23 12:42:49,036 INFO L273 TraceCheckUtils]: 7: Hoare triple {2183#true} assume !(0 != ~p1~0); {2183#true} is VALID [2018-11-23 12:42:49,036 INFO L273 TraceCheckUtils]: 8: Hoare triple {2183#true} assume !(0 != ~p2~0); {2183#true} is VALID [2018-11-23 12:42:49,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {2183#true} assume 0 != ~p3~0;~lk3~0 := 1; {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {2185#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {2185#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {2185#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,043 INFO L273 TraceCheckUtils]: 13: Hoare triple {2185#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {2185#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {2185#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {2185#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2185#(= main_~lk3~0 1)} is VALID [2018-11-23 12:42:49,064 INFO L273 TraceCheckUtils]: 17: Hoare triple {2185#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2184#false} is VALID [2018-11-23 12:42:49,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {2184#false} assume !false; {2184#false} is VALID [2018-11-23 12:42:49,065 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:49,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:49,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:49,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:49,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:49,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:49,091 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:42:49,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:49,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:49,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:49,092 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2018-11-23 12:42:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,248 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2018-11-23 12:42:49,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:49,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:49,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:42:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 12:42:49,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-23 12:42:49,376 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:42:49,380 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:42:49,380 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 12:42:49,381 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:42:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 12:42:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2018-11-23 12:42:49,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:49,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 136 states. [2018-11-23 12:42:49,527 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 136 states. [2018-11-23 12:42:49,527 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 136 states. [2018-11-23 12:42:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,532 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2018-11-23 12:42:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 291 transitions. [2018-11-23 12:42:49,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,534 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 178 states. [2018-11-23 12:42:49,534 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 178 states. [2018-11-23 12:42:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:49,541 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2018-11-23 12:42:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 291 transitions. [2018-11-23 12:42:49,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:49,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:49,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:49,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 12:42:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2018-11-23 12:42:49,547 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2018-11-23 12:42:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:49,547 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2018-11-23 12:42:49,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2018-11-23 12:42:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:42:49,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:49,549 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:42:49,549 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:49,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2018-11-23 12:42:49,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:49,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:49,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {2886#true} call ULTIMATE.init(); {2886#true} is VALID [2018-11-23 12:42:49,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {2886#true} assume true; {2886#true} is VALID [2018-11-23 12:42:49,785 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2886#true} {2886#true} #146#return; {2886#true} is VALID [2018-11-23 12:42:49,785 INFO L256 TraceCheckUtils]: 3: Hoare triple {2886#true} call #t~ret8 := main(); {2886#true} is VALID [2018-11-23 12:42:49,785 INFO L273 TraceCheckUtils]: 4: Hoare triple {2886#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;havoc ~cond~0; {2886#true} is VALID [2018-11-23 12:42:49,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {2886#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {2886#true} is VALID [2018-11-23 12:42:49,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {2886#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; {2886#true} is VALID [2018-11-23 12:42:49,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {2886#true} assume !(0 != ~p1~0); {2886#true} is VALID [2018-11-23 12:42:49,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {2886#true} assume !(0 != ~p2~0); {2886#true} is VALID [2018-11-23 12:42:49,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {2886#true} assume !(0 != ~p3~0); {2888#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {2888#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2888#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {2888#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2888#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {2888#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2888#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {2888#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2888#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {2888#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2888#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {2888#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2888#(= main_~p3~0 0)} is VALID [2018-11-23 12:42:49,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {2888#(= main_~p3~0 0)} assume 0 != ~p3~0; {2887#false} is VALID [2018-11-23 12:42:49,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {2887#false} assume 1 != ~lk3~0; {2887#false} is VALID [2018-11-23 12:42:49,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {2887#false} assume !false; {2887#false} is VALID [2018-11-23 12:42:49,890 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:49,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:49,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:49,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:49,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:49,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:49,911 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:42:49,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:49,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:49,912 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2018-11-23 12:42:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,118 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-23 12:42:50,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:50,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:42:50,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-23 12:42:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-23 12:42:50,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2018-11-23 12:42:50,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:50,532 INFO L225 Difference]: With dead ends: 312 [2018-11-23 12:42:50,532 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 12:42:50,534 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:42:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 12:42:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-23 12:42:50,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:50,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2018-11-23 12:42:50,643 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2018-11-23 12:42:50,643 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2018-11-23 12:42:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,652 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2018-11-23 12:42:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2018-11-23 12:42:50,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,653 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2018-11-23 12:42:50,653 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2018-11-23 12:42:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:50,660 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2018-11-23 12:42:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2018-11-23 12:42:50,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:50,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:50,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:50,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 12:42:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2018-11-23 12:42:50,668 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2018-11-23 12:42:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:50,669 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2018-11-23 12:42:50,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2018-11-23 12:42:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:42:50,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:50,670 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:42:50,671 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:50,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2018-11-23 12:42:50,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:50,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:50,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:50,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {3793#true} call ULTIMATE.init(); {3793#true} is VALID [2018-11-23 12:42:50,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {3793#true} assume true; {3793#true} is VALID [2018-11-23 12:42:50,889 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3793#true} {3793#true} #146#return; {3793#true} is VALID [2018-11-23 12:42:50,890 INFO L256 TraceCheckUtils]: 3: Hoare triple {3793#true} call #t~ret8 := main(); {3793#true} is VALID [2018-11-23 12:42:50,890 INFO L273 TraceCheckUtils]: 4: Hoare triple {3793#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;havoc ~cond~0; {3793#true} is VALID [2018-11-23 12:42:50,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {3793#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {3793#true} is VALID [2018-11-23 12:42:50,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {3793#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; {3793#true} is VALID [2018-11-23 12:42:50,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {3793#true} assume !(0 != ~p1~0); {3793#true} is VALID [2018-11-23 12:42:50,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {3793#true} assume !(0 != ~p2~0); {3793#true} is VALID [2018-11-23 12:42:50,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {3793#true} assume 0 != ~p3~0;~lk3~0 := 1; {3795#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {3795#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3795#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {3795#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3795#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {3795#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {3795#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {3795#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {3795#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {3795#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3795#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {3795#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3795#(not (= main_~p3~0 0))} is VALID [2018-11-23 12:42:50,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {3795#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3794#false} is VALID [2018-11-23 12:42:50,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {3794#false} assume 0 != ~p4~0; {3794#false} is VALID [2018-11-23 12:42:50,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {3794#false} assume 1 != ~lk4~0; {3794#false} is VALID [2018-11-23 12:42:50,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {3794#false} assume !false; {3794#false} is VALID [2018-11-23 12:42:50,910 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:50,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:50,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:50,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:50,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:50,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:50,930 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:42:50,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:50,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:50,931 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2018-11-23 12:42:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,085 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2018-11-23 12:42:51,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:51,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:42:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2018-11-23 12:42:51,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2018-11-23 12:42:51,321 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:42:51,325 INFO L225 Difference]: With dead ends: 276 [2018-11-23 12:42:51,325 INFO L226 Difference]: Without dead ends: 190 [2018-11-23 12:42:51,326 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:42:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-23 12:42:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-11-23 12:42:51,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:51,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand 188 states. [2018-11-23 12:42:51,380 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 188 states. [2018-11-23 12:42:51,380 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 188 states. [2018-11-23 12:42:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,387 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2018-11-23 12:42:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2018-11-23 12:42:51,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:51,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:51,389 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 190 states. [2018-11-23 12:42:51,389 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 190 states. [2018-11-23 12:42:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,395 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2018-11-23 12:42:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2018-11-23 12:42:51,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:51,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:51,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:51,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-23 12:42:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2018-11-23 12:42:51,403 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2018-11-23 12:42:51,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:51,403 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2018-11-23 12:42:51,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2018-11-23 12:42:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:42:51,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:51,405 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:42:51,405 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:51,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2018-11-23 12:42:51,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:51,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:51,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:51,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {4676#true} call ULTIMATE.init(); {4676#true} is VALID [2018-11-23 12:42:51,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {4676#true} assume true; {4676#true} is VALID [2018-11-23 12:42:51,587 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4676#true} {4676#true} #146#return; {4676#true} is VALID [2018-11-23 12:42:51,587 INFO L256 TraceCheckUtils]: 3: Hoare triple {4676#true} call #t~ret8 := main(); {4676#true} is VALID [2018-11-23 12:42:51,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {4676#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;havoc ~cond~0; {4676#true} is VALID [2018-11-23 12:42:51,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {4676#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {4676#true} is VALID [2018-11-23 12:42:51,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {4676#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; {4676#true} is VALID [2018-11-23 12:42:51,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {4676#true} assume !(0 != ~p1~0); {4676#true} is VALID [2018-11-23 12:42:51,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {4676#true} assume !(0 != ~p2~0); {4676#true} is VALID [2018-11-23 12:42:51,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {4676#true} assume !(0 != ~p3~0); {4676#true} is VALID [2018-11-23 12:42:51,590 INFO L273 TraceCheckUtils]: 10: Hoare triple {4676#true} assume 0 != ~p4~0;~lk4~0 := 1; {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {4678#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {4678#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {4678#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {4678#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {4678#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4678#(= main_~lk4~0 1)} is VALID [2018-11-23 12:42:51,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {4678#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4677#false} is VALID [2018-11-23 12:42:51,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {4677#false} assume !false; {4677#false} is VALID [2018-11-23 12:42:51,598 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:51,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:51,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:51,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:51,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:51,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:51,637 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:42:51,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:51,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:51,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:51,638 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2018-11-23 12:42:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:51,860 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2018-11-23 12:42:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:51,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 12:42:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-23 12:42:51,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-23 12:42:52,399 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:42:52,409 INFO L225 Difference]: With dead ends: 332 [2018-11-23 12:42:52,409 INFO L226 Difference]: Without dead ends: 330 [2018-11-23 12:42:52,409 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:42:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-23 12:42:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2018-11-23 12:42:52,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:52,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand 264 states. [2018-11-23 12:42:52,480 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 264 states. [2018-11-23 12:42:52,480 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 264 states. [2018-11-23 12:42:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,490 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2018-11-23 12:42:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 511 transitions. [2018-11-23 12:42:52,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:52,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:52,492 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand 330 states. [2018-11-23 12:42:52,492 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 330 states. [2018-11-23 12:42:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:52,503 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2018-11-23 12:42:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 511 transitions. [2018-11-23 12:42:52,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:52,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:52,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:52,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-23 12:42:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2018-11-23 12:42:52,513 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2018-11-23 12:42:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:52,513 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2018-11-23 12:42:52,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2018-11-23 12:42:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:42:52,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:52,515 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:42:52,515 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:52,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:52,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2018-11-23 12:42:52,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:52,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:52,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:52,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {5975#true} call ULTIMATE.init(); {5975#true} is VALID [2018-11-23 12:42:52,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {5975#true} assume true; {5975#true} is VALID [2018-11-23 12:42:52,756 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5975#true} {5975#true} #146#return; {5975#true} is VALID [2018-11-23 12:42:52,757 INFO L256 TraceCheckUtils]: 3: Hoare triple {5975#true} call #t~ret8 := main(); {5975#true} is VALID [2018-11-23 12:42:52,757 INFO L273 TraceCheckUtils]: 4: Hoare triple {5975#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;havoc ~cond~0; {5975#true} is VALID [2018-11-23 12:42:52,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {5975#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {5975#true} is VALID [2018-11-23 12:42:52,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {5975#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; {5975#true} is VALID [2018-11-23 12:42:52,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {5975#true} assume !(0 != ~p1~0); {5975#true} is VALID [2018-11-23 12:42:52,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {5975#true} assume !(0 != ~p2~0); {5975#true} is VALID [2018-11-23 12:42:52,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {5975#true} assume !(0 != ~p3~0); {5975#true} is VALID [2018-11-23 12:42:52,771 INFO L273 TraceCheckUtils]: 10: Hoare triple {5975#true} assume !(0 != ~p4~0); {5977#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:52,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {5977#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5977#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:52,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {5977#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5977#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:52,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {5977#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5977#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:52,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {5977#(= main_~p4~0 0)} assume !(0 != ~p1~0); {5977#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:52,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {5977#(= main_~p4~0 0)} assume !(0 != ~p2~0); {5977#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:52,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {5977#(= main_~p4~0 0)} assume !(0 != ~p3~0); {5977#(= main_~p4~0 0)} is VALID [2018-11-23 12:42:52,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {5977#(= main_~p4~0 0)} assume 0 != ~p4~0; {5976#false} is VALID [2018-11-23 12:42:52,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {5976#false} assume 1 != ~lk4~0; {5976#false} is VALID [2018-11-23 12:42:52,853 INFO L273 TraceCheckUtils]: 19: Hoare triple {5976#false} assume !false; {5976#false} is VALID [2018-11-23 12:42:52,854 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:52,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:52,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:52,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:52,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:52,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:53,030 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:42:53,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:53,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:53,032 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2018-11-23 12:42:53,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:53,400 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2018-11-23 12:42:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:53,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 12:42:53,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-23 12:42:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-23 12:42:53,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-23 12:42:53,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:53,898 INFO L225 Difference]: With dead ends: 604 [2018-11-23 12:42:53,899 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 12:42:53,900 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:42:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 12:42:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-23 12:42:54,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:54,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand 352 states. [2018-11-23 12:42:54,375 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 352 states. [2018-11-23 12:42:54,376 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 352 states. [2018-11-23 12:42:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:54,384 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2018-11-23 12:42:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 519 transitions. [2018-11-23 12:42:54,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:54,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:54,386 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand 354 states. [2018-11-23 12:42:54,386 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 354 states. [2018-11-23 12:42:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:54,396 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2018-11-23 12:42:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 519 transitions. [2018-11-23 12:42:54,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:54,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:54,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:54,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-23 12:42:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2018-11-23 12:42:54,408 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2018-11-23 12:42:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:54,408 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2018-11-23 12:42:54,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2018-11-23 12:42:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:42:54,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:54,409 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:42:54,410 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:54,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:54,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2018-11-23 12:42:54,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:54,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:54,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:54,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:54,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {7698#true} call ULTIMATE.init(); {7698#true} is VALID [2018-11-23 12:42:54,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {7698#true} assume true; {7698#true} is VALID [2018-11-23 12:42:54,643 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7698#true} {7698#true} #146#return; {7698#true} is VALID [2018-11-23 12:42:54,643 INFO L256 TraceCheckUtils]: 3: Hoare triple {7698#true} call #t~ret8 := main(); {7698#true} is VALID [2018-11-23 12:42:54,643 INFO L273 TraceCheckUtils]: 4: Hoare triple {7698#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;havoc ~cond~0; {7698#true} is VALID [2018-11-23 12:42:54,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {7698#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {7698#true} is VALID [2018-11-23 12:42:54,644 INFO L273 TraceCheckUtils]: 6: Hoare triple {7698#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; {7698#true} is VALID [2018-11-23 12:42:54,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {7698#true} assume !(0 != ~p1~0); {7698#true} is VALID [2018-11-23 12:42:54,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {7698#true} assume !(0 != ~p2~0); {7698#true} is VALID [2018-11-23 12:42:54,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {7698#true} assume !(0 != ~p3~0); {7698#true} is VALID [2018-11-23 12:42:54,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {7698#true} assume 0 != ~p4~0;~lk4~0 := 1; {7700#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:54,666 INFO L273 TraceCheckUtils]: 11: Hoare triple {7700#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7700#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:54,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {7700#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7700#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:54,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {7700#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7700#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:54,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {7700#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {7700#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:54,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {7700#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {7700#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:54,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {7700#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {7700#(not (= main_~p4~0 0))} is VALID [2018-11-23 12:42:54,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {7700#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {7699#false} is VALID [2018-11-23 12:42:54,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {7699#false} assume 0 != ~p5~0; {7699#false} is VALID [2018-11-23 12:42:54,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {7699#false} assume 1 != ~lk5~0; {7699#false} is VALID [2018-11-23 12:42:54,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {7699#false} assume !false; {7699#false} is VALID [2018-11-23 12:42:54,746 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:54,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:54,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:54,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:54,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:54,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:54,841 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:42:54,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:54,842 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2018-11-23 12:42:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:55,307 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2018-11-23 12:42:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:55,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 12:42:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2018-11-23 12:42:55,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2018-11-23 12:42:55,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:55,807 INFO L225 Difference]: With dead ends: 528 [2018-11-23 12:42:55,807 INFO L226 Difference]: Without dead ends: 362 [2018-11-23 12:42:55,808 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:42:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-23 12:42:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-11-23 12:42:55,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:55,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand 360 states. [2018-11-23 12:42:55,982 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand 360 states. [2018-11-23 12:42:55,982 INFO L87 Difference]: Start difference. First operand 362 states. Second operand 360 states. [2018-11-23 12:42:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:55,992 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2018-11-23 12:42:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 519 transitions. [2018-11-23 12:42:55,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:55,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:55,993 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand 362 states. [2018-11-23 12:42:55,993 INFO L87 Difference]: Start difference. First operand 360 states. Second operand 362 states. [2018-11-23 12:42:56,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:56,005 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2018-11-23 12:42:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 519 transitions. [2018-11-23 12:42:56,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:56,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:56,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:56,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-23 12:42:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2018-11-23 12:42:56,018 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2018-11-23 12:42:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:56,018 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2018-11-23 12:42:56,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2018-11-23 12:42:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:42:56,019 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:56,019 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:42:56,020 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:56,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2018-11-23 12:42:56,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:56,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:56,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:56,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:56,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {9369#true} call ULTIMATE.init(); {9369#true} is VALID [2018-11-23 12:42:56,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {9369#true} assume true; {9369#true} is VALID [2018-11-23 12:42:56,237 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9369#true} {9369#true} #146#return; {9369#true} is VALID [2018-11-23 12:42:56,237 INFO L256 TraceCheckUtils]: 3: Hoare triple {9369#true} call #t~ret8 := main(); {9369#true} is VALID [2018-11-23 12:42:56,237 INFO L273 TraceCheckUtils]: 4: Hoare triple {9369#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;havoc ~cond~0; {9369#true} is VALID [2018-11-23 12:42:56,238 INFO L273 TraceCheckUtils]: 5: Hoare triple {9369#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {9369#true} is VALID [2018-11-23 12:42:56,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {9369#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; {9369#true} is VALID [2018-11-23 12:42:56,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {9369#true} assume !(0 != ~p1~0); {9369#true} is VALID [2018-11-23 12:42:56,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {9369#true} assume !(0 != ~p2~0); {9369#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {9369#true} assume !(0 != ~p3~0); {9369#true} is VALID [2018-11-23 12:42:56,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {9369#true} assume !(0 != ~p4~0); {9369#true} is VALID [2018-11-23 12:42:56,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {9369#true} assume 0 != ~p5~0;~lk5~0 := 1; {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {9371#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {9371#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {9371#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {9371#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,315 INFO L273 TraceCheckUtils]: 16: Hoare triple {9371#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,328 INFO L273 TraceCheckUtils]: 17: Hoare triple {9371#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {9371#(= main_~lk5~0 1)} assume 0 != ~p5~0; {9371#(= main_~lk5~0 1)} is VALID [2018-11-23 12:42:56,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {9371#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {9370#false} is VALID [2018-11-23 12:42:56,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {9370#false} assume !false; {9370#false} is VALID [2018-11-23 12:42:56,353 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:56,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:56,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:56,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:56,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:56,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:56,524 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:42:56,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:56,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:56,525 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2018-11-23 12:42:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:56,774 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2018-11-23 12:42:56,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:56,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 12:42:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 12:42:56,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-23 12:42:56,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:56,891 INFO L225 Difference]: With dead ends: 620 [2018-11-23 12:42:56,891 INFO L226 Difference]: Without dead ends: 618 [2018-11-23 12:42:56,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:42:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-23 12:42:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-11-23 12:42:57,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:57,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand 520 states. [2018-11-23 12:42:57,012 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand 520 states. [2018-11-23 12:42:57,012 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 520 states. [2018-11-23 12:42:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:57,031 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2018-11-23 12:42:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 887 transitions. [2018-11-23 12:42:57,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:57,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:57,032 INFO L74 IsIncluded]: Start isIncluded. First operand 520 states. Second operand 618 states. [2018-11-23 12:42:57,033 INFO L87 Difference]: Start difference. First operand 520 states. Second operand 618 states. [2018-11-23 12:42:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:57,052 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2018-11-23 12:42:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 887 transitions. [2018-11-23 12:42:57,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:57,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:57,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:57,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-23 12:42:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2018-11-23 12:42:57,069 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2018-11-23 12:42:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:57,069 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2018-11-23 12:42:57,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2018-11-23 12:42:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:42:57,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:57,071 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:42:57,071 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:57,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2018-11-23 12:42:57,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:57,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:57,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {11812#true} call ULTIMATE.init(); {11812#true} is VALID [2018-11-23 12:42:57,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {11812#true} assume true; {11812#true} is VALID [2018-11-23 12:42:57,256 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11812#true} {11812#true} #146#return; {11812#true} is VALID [2018-11-23 12:42:57,257 INFO L256 TraceCheckUtils]: 3: Hoare triple {11812#true} call #t~ret8 := main(); {11812#true} is VALID [2018-11-23 12:42:57,257 INFO L273 TraceCheckUtils]: 4: Hoare triple {11812#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;havoc ~cond~0; {11812#true} is VALID [2018-11-23 12:42:57,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {11812#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {11812#true} is VALID [2018-11-23 12:42:57,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {11812#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; {11812#true} is VALID [2018-11-23 12:42:57,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {11812#true} assume !(0 != ~p1~0); {11812#true} is VALID [2018-11-23 12:42:57,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {11812#true} assume !(0 != ~p2~0); {11812#true} is VALID [2018-11-23 12:42:57,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {11812#true} assume !(0 != ~p3~0); {11812#true} is VALID [2018-11-23 12:42:57,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {11812#true} assume !(0 != ~p4~0); {11812#true} is VALID [2018-11-23 12:42:57,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {11812#true} assume !(0 != ~p5~0); {11814#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:57,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {11814#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {11814#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:57,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {11814#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {11814#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:57,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {11814#(= main_~p5~0 0)} assume !(0 != ~p1~0); {11814#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:57,264 INFO L273 TraceCheckUtils]: 15: Hoare triple {11814#(= main_~p5~0 0)} assume !(0 != ~p2~0); {11814#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:57,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {11814#(= main_~p5~0 0)} assume !(0 != ~p3~0); {11814#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:57,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {11814#(= main_~p5~0 0)} assume !(0 != ~p4~0); {11814#(= main_~p5~0 0)} is VALID [2018-11-23 12:42:57,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {11814#(= main_~p5~0 0)} assume 0 != ~p5~0; {11813#false} is VALID [2018-11-23 12:42:57,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {11813#false} assume 1 != ~lk5~0; {11813#false} is VALID [2018-11-23 12:42:57,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {11813#false} assume !false; {11813#false} is VALID [2018-11-23 12:42:57,268 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:57,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:57,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:57,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:57,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:57,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:57,289 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:42:57,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:57,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:57,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:57,290 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2018-11-23 12:42:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:57,804 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2018-11-23 12:42:57,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:57,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 12:42:57,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:57,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2018-11-23 12:42:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2018-11-23 12:42:57,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2018-11-23 12:42:58,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:42:58,487 INFO L225 Difference]: With dead ends: 1180 [2018-11-23 12:42:58,487 INFO L226 Difference]: Without dead ends: 682 [2018-11-23 12:42:58,488 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:42:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-11-23 12:42:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-11-23 12:42:58,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:42:58,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 682 states. Second operand 680 states. [2018-11-23 12:42:58,978 INFO L74 IsIncluded]: Start isIncluded. First operand 682 states. Second operand 680 states. [2018-11-23 12:42:58,978 INFO L87 Difference]: Start difference. First operand 682 states. Second operand 680 states. [2018-11-23 12:42:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:59,000 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2018-11-23 12:42:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 919 transitions. [2018-11-23 12:42:59,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:59,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:59,002 INFO L74 IsIncluded]: Start isIncluded. First operand 680 states. Second operand 682 states. [2018-11-23 12:42:59,002 INFO L87 Difference]: Start difference. First operand 680 states. Second operand 682 states. [2018-11-23 12:42:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:59,023 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2018-11-23 12:42:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 919 transitions. [2018-11-23 12:42:59,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:42:59,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:42:59,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:42:59,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:42:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-11-23 12:42:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2018-11-23 12:42:59,043 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2018-11-23 12:42:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:42:59,043 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2018-11-23 12:42:59,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:42:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2018-11-23 12:42:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:42:59,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:42:59,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, 1, 1, 1] [2018-11-23 12:42:59,044 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:42:59,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:42:59,045 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2018-11-23 12:42:59,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:42:59,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:42:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:59,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:42:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:42:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:42:59,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {15135#true} call ULTIMATE.init(); {15135#true} is VALID [2018-11-23 12:42:59,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {15135#true} assume true; {15135#true} is VALID [2018-11-23 12:42:59,174 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15135#true} {15135#true} #146#return; {15135#true} is VALID [2018-11-23 12:42:59,174 INFO L256 TraceCheckUtils]: 3: Hoare triple {15135#true} call #t~ret8 := main(); {15135#true} is VALID [2018-11-23 12:42:59,174 INFO L273 TraceCheckUtils]: 4: Hoare triple {15135#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;havoc ~cond~0; {15135#true} is VALID [2018-11-23 12:42:59,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {15135#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {15135#true} is VALID [2018-11-23 12:42:59,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {15135#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; {15135#true} is VALID [2018-11-23 12:42:59,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {15135#true} assume !(0 != ~p1~0); {15135#true} is VALID [2018-11-23 12:42:59,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {15135#true} assume !(0 != ~p2~0); {15135#true} is VALID [2018-11-23 12:42:59,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {15135#true} assume !(0 != ~p3~0); {15135#true} is VALID [2018-11-23 12:42:59,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {15135#true} assume !(0 != ~p4~0); {15135#true} is VALID [2018-11-23 12:42:59,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {15135#true} assume 0 != ~p5~0;~lk5~0 := 1; {15137#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:59,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {15137#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {15137#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:59,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {15137#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {15137#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:59,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {15137#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {15137#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:59,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {15137#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {15137#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:59,214 INFO L273 TraceCheckUtils]: 16: Hoare triple {15137#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {15137#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:59,216 INFO L273 TraceCheckUtils]: 17: Hoare triple {15137#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {15137#(not (= main_~p5~0 0))} is VALID [2018-11-23 12:42:59,216 INFO L273 TraceCheckUtils]: 18: Hoare triple {15137#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {15136#false} is VALID [2018-11-23 12:42:59,216 INFO L273 TraceCheckUtils]: 19: Hoare triple {15136#false} assume 0 != ~p6~0; {15136#false} is VALID [2018-11-23 12:42:59,216 INFO L273 TraceCheckUtils]: 20: Hoare triple {15136#false} assume 1 != ~lk6~0; {15136#false} is VALID [2018-11-23 12:42:59,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {15136#false} assume !false; {15136#false} is VALID [2018-11-23 12:42:59,217 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:59,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:42:59,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:42:59,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:42:59,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:42:59,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:42:59,237 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:42:59,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:42:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:42:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:42:59,238 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2018-11-23 12:42:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:42:59,888 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2018-11-23 12:42:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:42:59,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:42:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:42:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-23 12:42:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:42:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-23 12:42:59,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2018-11-23 12:43:00,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:00,046 INFO L225 Difference]: With dead ends: 1020 [2018-11-23 12:43:00,047 INFO L226 Difference]: Without dead ends: 698 [2018-11-23 12:43:00,047 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,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-23 12:43:00,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-23 12:43:00,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:00,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand 696 states. [2018-11-23 12:43:00,762 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand 696 states. [2018-11-23 12:43:00,762 INFO L87 Difference]: Start difference. First operand 698 states. Second operand 696 states. [2018-11-23 12:43:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,783 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2018-11-23 12:43:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 919 transitions. [2018-11-23 12:43:00,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:00,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:00,784 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand 698 states. [2018-11-23 12:43:00,785 INFO L87 Difference]: Start difference. First operand 696 states. Second operand 698 states. [2018-11-23 12:43:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:00,810 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2018-11-23 12:43:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 919 transitions. [2018-11-23 12:43:00,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:00,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:00,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:00,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-23 12:43:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2018-11-23 12:43:00,838 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2018-11-23 12:43:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:00,838 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2018-11-23 12:43:00,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2018-11-23 12:43:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:00,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:00,840 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:00,840 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:00,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:00,840 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2018-11-23 12:43:00,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:00,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:00,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:00,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:00,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:00,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {18346#true} call ULTIMATE.init(); {18346#true} is VALID [2018-11-23 12:43:00,883 INFO L273 TraceCheckUtils]: 1: Hoare triple {18346#true} assume true; {18346#true} is VALID [2018-11-23 12:43:00,883 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18346#true} {18346#true} #146#return; {18346#true} is VALID [2018-11-23 12:43:00,883 INFO L256 TraceCheckUtils]: 3: Hoare triple {18346#true} call #t~ret8 := main(); {18346#true} is VALID [2018-11-23 12:43:00,884 INFO L273 TraceCheckUtils]: 4: Hoare triple {18346#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;havoc ~cond~0; {18346#true} is VALID [2018-11-23 12:43:00,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {18346#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {18346#true} is VALID [2018-11-23 12:43:00,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {18346#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; {18346#true} is VALID [2018-11-23 12:43:00,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {18346#true} assume !(0 != ~p1~0); {18346#true} is VALID [2018-11-23 12:43:00,884 INFO L273 TraceCheckUtils]: 8: Hoare triple {18346#true} assume !(0 != ~p2~0); {18346#true} is VALID [2018-11-23 12:43:00,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {18346#true} assume !(0 != ~p3~0); {18346#true} is VALID [2018-11-23 12:43:00,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {18346#true} assume !(0 != ~p4~0); {18346#true} is VALID [2018-11-23 12:43:00,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {18346#true} assume !(0 != ~p5~0); {18346#true} is VALID [2018-11-23 12:43:00,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {18346#true} assume 0 != ~p6~0;~lk6~0 := 1; {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {18348#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {18348#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {18348#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {18348#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,900 INFO L273 TraceCheckUtils]: 17: Hoare triple {18348#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {18348#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {18348#(= main_~lk6~0 1)} assume 0 != ~p6~0; {18348#(= main_~lk6~0 1)} is VALID [2018-11-23 12:43:00,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {18348#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {18347#false} is VALID [2018-11-23 12:43:00,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {18347#false} assume !false; {18347#false} is VALID [2018-11-23 12:43:00,907 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,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:00,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:00,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:00,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:00,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:00,962 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:00,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:00,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:00,962 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2018-11-23 12:43:01,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:01,807 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2018-11-23 12:43:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:01,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:43:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 12:43:01,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 12:43:01,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:01,943 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 12:43:01,943 INFO L226 Difference]: Without dead ends: 1162 [2018-11-23 12:43:01,944 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,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-23 12:43:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2018-11-23 12:43:02,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:02,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1162 states. Second operand 1032 states. [2018-11-23 12:43:02,581 INFO L74 IsIncluded]: Start isIncluded. First operand 1162 states. Second operand 1032 states. [2018-11-23 12:43:02,582 INFO L87 Difference]: Start difference. First operand 1162 states. Second operand 1032 states. [2018-11-23 12:43:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,631 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2018-11-23 12:43:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1511 transitions. [2018-11-23 12:43:02,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,633 INFO L74 IsIncluded]: Start isIncluded. First operand 1032 states. Second operand 1162 states. [2018-11-23 12:43:02,634 INFO L87 Difference]: Start difference. First operand 1032 states. Second operand 1162 states. [2018-11-23 12:43:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:02,689 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2018-11-23 12:43:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1511 transitions. [2018-11-23 12:43:02,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:02,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:02,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:02,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-23 12:43:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2018-11-23 12:43:02,729 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2018-11-23 12:43:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:02,729 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2018-11-23 12:43:02,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2018-11-23 12:43:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:43:02,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:02,730 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:02,731 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:02,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:02,731 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2018-11-23 12:43:02,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:02,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:02,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:02,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {22981#true} call ULTIMATE.init(); {22981#true} is VALID [2018-11-23 12:43:02,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {22981#true} assume true; {22981#true} is VALID [2018-11-23 12:43:02,779 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22981#true} {22981#true} #146#return; {22981#true} is VALID [2018-11-23 12:43:02,779 INFO L256 TraceCheckUtils]: 3: Hoare triple {22981#true} call #t~ret8 := main(); {22981#true} is VALID [2018-11-23 12:43:02,779 INFO L273 TraceCheckUtils]: 4: Hoare triple {22981#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;havoc ~cond~0; {22981#true} is VALID [2018-11-23 12:43:02,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {22981#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {22981#true} is VALID [2018-11-23 12:43:02,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {22981#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; {22981#true} is VALID [2018-11-23 12:43:02,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {22981#true} assume !(0 != ~p1~0); {22981#true} is VALID [2018-11-23 12:43:02,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {22981#true} assume !(0 != ~p2~0); {22981#true} is VALID [2018-11-23 12:43:02,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {22981#true} assume !(0 != ~p3~0); {22981#true} is VALID [2018-11-23 12:43:02,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {22981#true} assume !(0 != ~p4~0); {22981#true} is VALID [2018-11-23 12:43:02,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {22981#true} assume !(0 != ~p5~0); {22981#true} is VALID [2018-11-23 12:43:02,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {22981#true} assume !(0 != ~p6~0); {22983#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {22983#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {22983#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {22983#(= main_~p6~0 0)} assume !(0 != ~p1~0); {22983#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {22983#(= main_~p6~0 0)} assume !(0 != ~p2~0); {22983#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {22983#(= main_~p6~0 0)} assume !(0 != ~p3~0); {22983#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {22983#(= main_~p6~0 0)} assume !(0 != ~p4~0); {22983#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {22983#(= main_~p6~0 0)} assume !(0 != ~p5~0); {22983#(= main_~p6~0 0)} is VALID [2018-11-23 12:43:02,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {22983#(= main_~p6~0 0)} assume 0 != ~p6~0; {22982#false} is VALID [2018-11-23 12:43:02,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {22982#false} assume 1 != ~lk6~0; {22982#false} is VALID [2018-11-23 12:43:02,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {22982#false} assume !false; {22982#false} is VALID [2018-11-23 12:43:02,792 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,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:02,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:02,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:02,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:02,822 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:02,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:02,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:02,823 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2018-11-23 12:43:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:03,980 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2018-11-23 12:43:03,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:03,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 12:43:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:43:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-23 12:43:03,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-23 12:43:04,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:04,313 INFO L225 Difference]: With dead ends: 2316 [2018-11-23 12:43:04,313 INFO L226 Difference]: Without dead ends: 1322 [2018-11-23 12:43:04,314 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:04,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-11-23 12:43:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2018-11-23 12:43:05,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:05,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1322 states. Second operand 1320 states. [2018-11-23 12:43:05,285 INFO L74 IsIncluded]: Start isIncluded. First operand 1322 states. Second operand 1320 states. [2018-11-23 12:43:05,285 INFO L87 Difference]: Start difference. First operand 1322 states. Second operand 1320 states. [2018-11-23 12:43:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,342 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2018-11-23 12:43:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1607 transitions. [2018-11-23 12:43:05,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:05,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:05,344 INFO L74 IsIncluded]: Start isIncluded. First operand 1320 states. Second operand 1322 states. [2018-11-23 12:43:05,344 INFO L87 Difference]: Start difference. First operand 1320 states. Second operand 1322 states. [2018-11-23 12:43:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:05,411 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2018-11-23 12:43:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1607 transitions. [2018-11-23 12:43:05,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:05,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:05,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:05,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-11-23 12:43:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2018-11-23 12:43:05,466 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2018-11-23 12:43:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:05,466 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2018-11-23 12:43:05,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2018-11-23 12:43:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:05,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:05,468 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:05,468 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:05,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2018-11-23 12:43:05,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:05,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {29440#true} call ULTIMATE.init(); {29440#true} is VALID [2018-11-23 12:43:05,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {29440#true} assume true; {29440#true} is VALID [2018-11-23 12:43:05,544 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29440#true} {29440#true} #146#return; {29440#true} is VALID [2018-11-23 12:43:05,544 INFO L256 TraceCheckUtils]: 3: Hoare triple {29440#true} call #t~ret8 := main(); {29440#true} is VALID [2018-11-23 12:43:05,544 INFO L273 TraceCheckUtils]: 4: Hoare triple {29440#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;havoc ~cond~0; {29440#true} is VALID [2018-11-23 12:43:05,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {29440#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {29440#true} is VALID [2018-11-23 12:43:05,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {29440#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; {29440#true} is VALID [2018-11-23 12:43:05,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {29440#true} assume !(0 != ~p1~0); {29440#true} is VALID [2018-11-23 12:43:05,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {29440#true} assume !(0 != ~p2~0); {29440#true} is VALID [2018-11-23 12:43:05,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {29440#true} assume !(0 != ~p3~0); {29440#true} is VALID [2018-11-23 12:43:05,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {29440#true} assume !(0 != ~p4~0); {29440#true} is VALID [2018-11-23 12:43:05,545 INFO L273 TraceCheckUtils]: 11: Hoare triple {29440#true} assume !(0 != ~p5~0); {29440#true} is VALID [2018-11-23 12:43:05,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {29440#true} assume 0 != ~p6~0;~lk6~0 := 1; {29442#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:05,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {29442#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {29442#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:05,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {29442#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {29442#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:05,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {29442#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {29442#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:05,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {29442#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {29442#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:05,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {29442#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {29442#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:05,559 INFO L273 TraceCheckUtils]: 18: Hoare triple {29442#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {29442#(not (= main_~p6~0 0))} is VALID [2018-11-23 12:43:05,559 INFO L273 TraceCheckUtils]: 19: Hoare triple {29442#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {29441#false} is VALID [2018-11-23 12:43:05,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {29441#false} assume 0 != ~p7~0; {29441#false} is VALID [2018-11-23 12:43:05,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {29441#false} assume 1 != ~lk7~0; {29441#false} is VALID [2018-11-23 12:43:05,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {29441#false} assume !false; {29441#false} is VALID [2018-11-23 12:43:05,560 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,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:05,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:05,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:05,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:05,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:05,579 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:05,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:05,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:05,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:05,580 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2018-11-23 12:43:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:06,460 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2018-11-23 12:43:06,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:06,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 12:43:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 12:43:06,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2018-11-23 12:43:06,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:06,657 INFO L225 Difference]: With dead ends: 1980 [2018-11-23 12:43:06,657 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 12:43:06,659 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,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 12:43:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-23 12:43:07,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:07,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1352 states. [2018-11-23 12:43:07,241 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1352 states. [2018-11-23 12:43:07,241 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1352 states. [2018-11-23 12:43:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,306 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2018-11-23 12:43:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1607 transitions. [2018-11-23 12:43:07,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:07,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:07,307 INFO L74 IsIncluded]: Start isIncluded. First operand 1352 states. Second operand 1354 states. [2018-11-23 12:43:07,307 INFO L87 Difference]: Start difference. First operand 1352 states. Second operand 1354 states. [2018-11-23 12:43:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:07,375 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2018-11-23 12:43:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1607 transitions. [2018-11-23 12:43:07,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:07,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:07,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:07,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:07,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-23 12:43:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2018-11-23 12:43:07,438 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2018-11-23 12:43:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:07,438 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2018-11-23 12:43:07,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2018-11-23 12:43:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:07,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:07,440 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:07,440 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:07,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:07,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2018-11-23 12:43:07,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:07,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:07,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:07,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:07,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:07,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {35659#true} call ULTIMATE.init(); {35659#true} is VALID [2018-11-23 12:43:07,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {35659#true} assume true; {35659#true} is VALID [2018-11-23 12:43:07,474 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {35659#true} {35659#true} #146#return; {35659#true} is VALID [2018-11-23 12:43:07,474 INFO L256 TraceCheckUtils]: 3: Hoare triple {35659#true} call #t~ret8 := main(); {35659#true} is VALID [2018-11-23 12:43:07,475 INFO L273 TraceCheckUtils]: 4: Hoare triple {35659#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;havoc ~cond~0; {35659#true} is VALID [2018-11-23 12:43:07,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {35659#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {35659#true} is VALID [2018-11-23 12:43:07,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {35659#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; {35659#true} is VALID [2018-11-23 12:43:07,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {35659#true} assume !(0 != ~p1~0); {35659#true} is VALID [2018-11-23 12:43:07,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {35659#true} assume !(0 != ~p2~0); {35659#true} is VALID [2018-11-23 12:43:07,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {35659#true} assume !(0 != ~p3~0); {35659#true} is VALID [2018-11-23 12:43:07,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {35659#true} assume !(0 != ~p4~0); {35659#true} is VALID [2018-11-23 12:43:07,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {35659#true} assume !(0 != ~p5~0); {35659#true} is VALID [2018-11-23 12:43:07,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {35659#true} assume !(0 != ~p6~0); {35659#true} is VALID [2018-11-23 12:43:07,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {35659#true} assume 0 != ~p7~0;~lk7~0 := 1; {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {35661#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {35661#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {35661#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {35661#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {35661#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {35661#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {35661#(= main_~lk7~0 1)} assume 0 != ~p7~0; {35661#(= main_~lk7~0 1)} is VALID [2018-11-23 12:43:07,495 INFO L273 TraceCheckUtils]: 21: Hoare triple {35661#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {35660#false} is VALID [2018-11-23 12:43:07,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {35660#false} assume !false; {35660#false} is VALID [2018-11-23 12:43:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:07,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:07,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:07,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:07,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:07,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:07,523 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:07,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:07,523 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2018-11-23 12:43:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:09,045 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2018-11-23 12:43:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:09,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 12:43:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 12:43:09,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 12:43:09,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:09,319 INFO L225 Difference]: With dead ends: 2186 [2018-11-23 12:43:09,319 INFO L226 Difference]: Without dead ends: 2184 [2018-11-23 12:43:09,320 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,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2018-11-23 12:43:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2018-11-23 12:43:10,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:10,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2184 states. Second operand 2056 states. [2018-11-23 12:43:10,440 INFO L74 IsIncluded]: Start isIncluded. First operand 2184 states. Second operand 2056 states. [2018-11-23 12:43:10,440 INFO L87 Difference]: Start difference. First operand 2184 states. Second operand 2056 states. [2018-11-23 12:43:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,587 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2018-11-23 12:43:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2502 transitions. [2018-11-23 12:43:10,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:10,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:10,589 INFO L74 IsIncluded]: Start isIncluded. First operand 2056 states. Second operand 2184 states. [2018-11-23 12:43:10,590 INFO L87 Difference]: Start difference. First operand 2056 states. Second operand 2184 states. [2018-11-23 12:43:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:10,747 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2018-11-23 12:43:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2502 transitions. [2018-11-23 12:43:10,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:10,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:10,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:10,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-11-23 12:43:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2018-11-23 12:43:10,901 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2018-11-23 12:43:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:10,901 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2018-11-23 12:43:10,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2018-11-23 12:43:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:43:10,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:10,903 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:10,903 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:43:10,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2018-11-23 12:43:10,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:10,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:10,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:10,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {44479#true} call ULTIMATE.init(); {44479#true} is VALID [2018-11-23 12:43:10,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {44479#true} assume true; {44479#true} is VALID [2018-11-23 12:43:10,946 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {44479#true} {44479#true} #146#return; {44479#true} is VALID [2018-11-23 12:43:10,947 INFO L256 TraceCheckUtils]: 3: Hoare triple {44479#true} call #t~ret8 := main(); {44479#true} is VALID [2018-11-23 12:43:10,947 INFO L273 TraceCheckUtils]: 4: Hoare triple {44479#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;havoc ~cond~0; {44479#true} is VALID [2018-11-23 12:43:10,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {44479#true} assume !false;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~cond~0 := #t~nondet7;havoc #t~nondet7; {44479#true} is VALID [2018-11-23 12:43:10,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {44479#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; {44479#true} is VALID [2018-11-23 12:43:10,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {44479#true} assume !(0 != ~p1~0); {44479#true} is VALID [2018-11-23 12:43:10,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {44479#true} assume !(0 != ~p2~0); {44479#true} is VALID [2018-11-23 12:43:10,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {44479#true} assume !(0 != ~p3~0); {44479#true} is VALID [2018-11-23 12:43:10,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {44479#true} assume !(0 != ~p4~0); {44479#true} is VALID [2018-11-23 12:43:10,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {44479#true} assume !(0 != ~p5~0); {44479#true} is VALID [2018-11-23 12:43:10,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {44479#true} assume !(0 != ~p6~0); {44479#true} is VALID [2018-11-23 12:43:10,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {44479#true} assume !(0 != ~p7~0); {44481#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:10,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {44481#(= main_~p7~0 0)} assume !(0 != ~p1~0); {44481#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:10,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {44481#(= main_~p7~0 0)} assume !(0 != ~p2~0); {44481#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:10,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {44481#(= main_~p7~0 0)} assume !(0 != ~p3~0); {44481#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:10,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {44481#(= main_~p7~0 0)} assume !(0 != ~p4~0); {44481#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:10,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {44481#(= main_~p7~0 0)} assume !(0 != ~p5~0); {44481#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:10,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {44481#(= main_~p7~0 0)} assume !(0 != ~p6~0); {44481#(= main_~p7~0 0)} is VALID [2018-11-23 12:43:10,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {44481#(= main_~p7~0 0)} assume 0 != ~p7~0; {44480#false} is VALID [2018-11-23 12:43:10,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {44480#false} assume 1 != ~lk7~0; {44480#false} is VALID [2018-11-23 12:43:10,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {44480#false} assume !false; {44480#false} is VALID [2018-11-23 12:43:10,963 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,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:10,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:10,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:10,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:43:10,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:43:10,990 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:10,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:10,991 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2018-11-23 12:43:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,518 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2018-11-23 12:43:13,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:13,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 12:43:13,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 12:43:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:43:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2018-11-23 12:43:13,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2018-11-23 12:43:13,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:43:13,640 INFO L225 Difference]: With dead ends: 4552 [2018-11-23 12:43:13,640 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:43:13,648 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,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:43:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:43:13,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:43:13,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:13,648 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:13,648 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,649 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:43:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:13,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:13,649 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:13,650 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:43:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:13,650 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:43:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:13,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:43:13,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:43:13,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:43:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:43:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:43:13,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-11-23 12:43:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:13,651 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:43:13,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:43:13,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:43:13,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:43:13,758 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 12:43:13,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:13,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:43:13,758 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:43:13,758 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:43:13,758 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,759 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-11-23 12:43:13,759 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,760 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,761 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-11-23 12:43:13,761 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,761 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-11-23 12:43:13,761 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-23 12:43:13,761 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,761 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:13,763 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2018-11-23 12:43:13,764 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L81-1 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2018-11-23 12:43:13,765 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2018-11-23 12:43:13,766 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-23 12:43:13,767 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2018-11-23 12:43:13,767 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:13,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:43:13 BoogieIcfgContainer [2018-11-23 12:43:13,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:43:13,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:43:13,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:43:13,774 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:43:13,774 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:44" (3/4) ... [2018-11-23 12:43:13,777 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:43:13,783 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:43:13,784 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:43:13,791 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 12:43:13,791 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 12:43:13,792 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:43:13,892 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 12:43:13,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:43:13,896 INFO L168 Benchmark]: Toolchain (without parser) took 30931.53 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -975.3 MB). Peak memory consumption was 57.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:13,898 INFO L168 Benchmark]: CDTParser took 0.22 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:13,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.50 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:13,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.93 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:13,899 INFO L168 Benchmark]: Boogie Preprocessor took 34.20 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:13,899 INFO L168 Benchmark]: RCFGBuilder took 909.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 668.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:13,902 INFO L168 Benchmark]: TraceAbstraction took 29466.75 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 363.9 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -296.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:13,902 INFO L168 Benchmark]: Witness Printer took 119.07 ms. Allocated memory is still 2.5 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:43:13,906 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 372.50 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 19.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.20 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 909.65 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 668.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29466.75 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 363.9 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -296.4 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB. * Witness Printer took 119.07 ms. Allocated memory is still 2.5 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 35 locations, 1 error locations. SAFE Result, 29.3s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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: 7.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 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.0s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...