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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:34:20,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:34:20,953 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:34:20,975 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:34:20,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:34:20,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:34:20,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:34:20,979 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:34:20,981 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:34:20,982 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:34:20,985 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:34:20,985 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:34:20,987 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:34:20,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:34:20,991 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:34:20,992 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:34:20,993 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:34:20,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:34:21,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:34:21,007 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:34:21,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:34:21,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:34:21,018 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:34:21,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:34:21,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:34:21,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:34:21,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:34:21,025 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:34:21,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:34:21,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:34:21,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:34:21,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:34:21,031 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:34:21,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:34:21,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:34:21,033 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:34:21,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:34:21,061 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:34:21,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:34:21,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:34:21,063 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:34:21,064 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:34:21,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:34:21,064 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:34:21,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:34:21,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:34:21,065 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:34:21,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:34:21,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:34:21,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:34:21,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:34:21,067 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:34:21,067 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:34:21,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:34:21,068 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:34:21,068 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:34:21,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:34:21,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:34:21,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:34:21,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:34:21,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:34:21,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:34:21,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:34:21,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:34:21,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:34:21,071 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:34:21,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:34:21,071 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:34:21,071 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:34:21,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:34:21,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:34:21,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:34:21,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:34:21,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:34:21,149 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:34:21,150 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 21:34:21,220 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b663b5759/fa79501924dd4704bdc393ad51f606fc/FLAG61705abc6 [2018-11-18 21:34:21,699 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:34:21,700 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 21:34:21,709 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b663b5759/fa79501924dd4704bdc393ad51f606fc/FLAG61705abc6 [2018-11-18 21:34:22,038 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b663b5759/fa79501924dd4704bdc393ad51f606fc [2018-11-18 21:34:22,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:34:22,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:34:22,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:34:22,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:34:22,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:34:22,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dba5026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22, skipping insertion in model container [2018-11-18 21:34:22,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:34:22,098 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:34:22,345 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:34:22,352 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:34:22,397 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:34:22,421 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:34:22,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22 WrapperNode [2018-11-18 21:34:22,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:34:22,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:34:22,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:34:22,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:34:22,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (1/1) ... [2018-11-18 21:34:22,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:34:22,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:34:22,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:34:22,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:34:22,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (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-18 21:34:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:34:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:34:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:34:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:34:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:34:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:34:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:34:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:34:23,750 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:34:23,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:34:23 BoogieIcfgContainer [2018-11-18 21:34:23,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:34:23,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:34:23,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:34:23,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:34:23,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:34:22" (1/3) ... [2018-11-18 21:34:23,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c08d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:34:23, skipping insertion in model container [2018-11-18 21:34:23,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:22" (2/3) ... [2018-11-18 21:34:23,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c08d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:34:23, skipping insertion in model container [2018-11-18 21:34:23,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:34:23" (3/3) ... [2018-11-18 21:34:23,759 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 21:34:23,769 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:34:23,778 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:34:23,794 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:34:23,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:34:23,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:34:23,826 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:34:23,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:34:23,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:34:23,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:34:23,826 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:34:23,826 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:34:23,826 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:34:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-18 21:34:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 21:34:23,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:23,854 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:23,856 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:23,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:23,862 INFO L82 PathProgramCache]: Analyzing trace with hash -731061561, now seen corresponding path program 1 times [2018-11-18 21:34:23,867 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:23,868 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:23,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:23,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:24,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-18 21:34:24,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-18 21:34:24,277 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #249#return; {57#true} is VALID [2018-11-18 21:34:24,277 INFO L256 TraceCheckUtils]: 3: Hoare triple {57#true} call #t~ret14 := main(); {57#true} is VALID [2018-11-18 21:34:24,277 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {57#true} is VALID [2018-11-18 21:34:24,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-18 21:34:24,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {57#true} is VALID [2018-11-18 21:34:24,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {57#true} is VALID [2018-11-18 21:34:24,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:24,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {86#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {58#false} is VALID [2018-11-18 21:34:24,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-18 21:34:24,351 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-18 21:34:24,351 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:24,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:24,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:24,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 21:34:24,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:24,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:24,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:24,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:24,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:24,451 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-11-18 21:34:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:25,546 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2018-11-18 21:34:25,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:25,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 21:34:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-18 21:34:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-18 21:34:25,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-18 21:34:26,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:26,127 INFO L225 Difference]: With dead ends: 107 [2018-11-18 21:34:26,127 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 21:34:26,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-18 21:34:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 21:34:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 63. [2018-11-18 21:34:26,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:26,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 63 states. [2018-11-18 21:34:26,182 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 63 states. [2018-11-18 21:34:26,182 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 63 states. [2018-11-18 21:34:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:26,192 INFO L93 Difference]: Finished difference Result 92 states and 166 transitions. [2018-11-18 21:34:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2018-11-18 21:34:26,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:26,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:26,194 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 92 states. [2018-11-18 21:34:26,195 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 92 states. [2018-11-18 21:34:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:26,204 INFO L93 Difference]: Finished difference Result 92 states and 166 transitions. [2018-11-18 21:34:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 166 transitions. [2018-11-18 21:34:26,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:26,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:26,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:26,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 21:34:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 114 transitions. [2018-11-18 21:34:26,214 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 114 transitions. Word has length 24 [2018-11-18 21:34:26,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:26,215 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 114 transitions. [2018-11-18 21:34:26,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 114 transitions. [2018-11-18 21:34:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 21:34:26,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:26,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:26,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:26,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1752129915, now seen corresponding path program 1 times [2018-11-18 21:34:26,218 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:26,218 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:26,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:26,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:26,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {503#true} call ULTIMATE.init(); {503#true} is VALID [2018-11-18 21:34:26,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-18 21:34:26,428 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {503#true} {503#true} #249#return; {503#true} is VALID [2018-11-18 21:34:26,429 INFO L256 TraceCheckUtils]: 3: Hoare triple {503#true} call #t~ret14 := main(); {503#true} is VALID [2018-11-18 21:34:26,429 INFO L273 TraceCheckUtils]: 4: Hoare triple {503#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {503#true} is VALID [2018-11-18 21:34:26,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-18 21:34:26,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {503#true} is VALID [2018-11-18 21:34:26,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {503#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {503#true} is VALID [2018-11-18 21:34:26,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {503#true} assume !(0bv32 != ~p1~0); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p5~0); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,444 INFO L273 TraceCheckUtils]: 19: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,445 INFO L273 TraceCheckUtils]: 20: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p13~0); {532#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-18 21:34:26,446 INFO L273 TraceCheckUtils]: 21: Hoare triple {532#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {504#false} is VALID [2018-11-18 21:34:26,446 INFO L273 TraceCheckUtils]: 22: Hoare triple {504#false} assume 1bv32 != ~lk1~0; {504#false} is VALID [2018-11-18 21:34:26,447 INFO L273 TraceCheckUtils]: 23: Hoare triple {504#false} assume !false; {504#false} is VALID [2018-11-18 21:34:26,449 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-18 21:34:26,449 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:26,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:26,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:26,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 21:34:26,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:26,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:26,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:26,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:26,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:26,492 INFO L87 Difference]: Start difference. First operand 63 states and 114 transitions. Second operand 3 states. [2018-11-18 21:34:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:26,899 INFO L93 Difference]: Finished difference Result 150 states and 275 transitions. [2018-11-18 21:34:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:26,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 21:34:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-18 21:34:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-18 21:34:26,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 248 transitions. [2018-11-18 21:34:27,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:27,343 INFO L225 Difference]: With dead ends: 150 [2018-11-18 21:34:27,343 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 21:34:27,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-18 21:34:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 21:34:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-18 21:34:27,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:27,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-18 21:34:27,396 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-18 21:34:27,397 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-18 21:34:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:27,403 INFO L93 Difference]: Finished difference Result 92 states and 164 transitions. [2018-11-18 21:34:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2018-11-18 21:34:27,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:27,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:27,405 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-18 21:34:27,405 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-18 21:34:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:27,411 INFO L93 Difference]: Finished difference Result 92 states and 164 transitions. [2018-11-18 21:34:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2018-11-18 21:34:27,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:27,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:27,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:27,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 21:34:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2018-11-18 21:34:27,418 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 24 [2018-11-18 21:34:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:27,419 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2018-11-18 21:34:27,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2018-11-18 21:34:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 21:34:27,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:27,420 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:27,421 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:27,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:27,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1187859502, now seen corresponding path program 1 times [2018-11-18 21:34:27,422 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:27,422 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:27,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:27,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:27,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2018-11-18 21:34:27,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {1018#true} assume true; {1018#true} is VALID [2018-11-18 21:34:27,550 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1018#true} {1018#true} #249#return; {1018#true} is VALID [2018-11-18 21:34:27,550 INFO L256 TraceCheckUtils]: 3: Hoare triple {1018#true} call #t~ret14 := main(); {1018#true} is VALID [2018-11-18 21:34:27,550 INFO L273 TraceCheckUtils]: 4: Hoare triple {1018#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1018#true} is VALID [2018-11-18 21:34:27,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {1018#true} assume true; {1018#true} is VALID [2018-11-18 21:34:27,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {1018#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {1018#true} is VALID [2018-11-18 21:34:27,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {1018#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {1018#true} is VALID [2018-11-18 21:34:27,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {1018#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p5~0); {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,580 INFO L273 TraceCheckUtils]: 17: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,580 INFO L273 TraceCheckUtils]: 18: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,581 INFO L273 TraceCheckUtils]: 19: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,581 INFO L273 TraceCheckUtils]: 20: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p13~0); {1047#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-18 21:34:27,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {1047#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {1019#false} is VALID [2018-11-18 21:34:27,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {1019#false} assume 0bv32 != ~p2~0; {1019#false} is VALID [2018-11-18 21:34:27,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {1019#false} assume 1bv32 != ~lk2~0; {1019#false} is VALID [2018-11-18 21:34:27,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2018-11-18 21:34:27,585 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-18 21:34:27,585 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:27,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:27,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:27,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 21:34:27,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:27,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:27,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:27,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:27,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:27,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:27,680 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand 3 states. [2018-11-18 21:34:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:27,980 INFO L93 Difference]: Finished difference Result 139 states and 247 transitions. [2018-11-18 21:34:27,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:27,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 21:34:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-18 21:34:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-18 21:34:27,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2018-11-18 21:34:28,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:28,279 INFO L225 Difference]: With dead ends: 139 [2018-11-18 21:34:28,280 INFO L226 Difference]: Without dead ends: 96 [2018-11-18 21:34:28,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-18 21:34:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-18 21:34:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-18 21:34:28,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:28,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-18 21:34:28,314 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-18 21:34:28,315 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-18 21:34:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:28,320 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2018-11-18 21:34:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 167 transitions. [2018-11-18 21:34:28,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:28,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:28,321 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-18 21:34:28,321 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-18 21:34:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:28,327 INFO L93 Difference]: Finished difference Result 96 states and 167 transitions. [2018-11-18 21:34:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 167 transitions. [2018-11-18 21:34:28,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:28,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:28,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:28,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 21:34:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2018-11-18 21:34:28,333 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 25 [2018-11-18 21:34:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:28,333 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2018-11-18 21:34:28,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2018-11-18 21:34:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 21:34:28,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:28,334 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:28,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:28,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1518759892, now seen corresponding path program 1 times [2018-11-18 21:34:28,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:28,336 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:28,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:28,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:28,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {1539#true} call ULTIMATE.init(); {1539#true} is VALID [2018-11-18 21:34:28,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-18 21:34:28,478 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1539#true} {1539#true} #249#return; {1539#true} is VALID [2018-11-18 21:34:28,478 INFO L256 TraceCheckUtils]: 3: Hoare triple {1539#true} call #t~ret14 := main(); {1539#true} is VALID [2018-11-18 21:34:28,478 INFO L273 TraceCheckUtils]: 4: Hoare triple {1539#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {1539#true} is VALID [2018-11-18 21:34:28,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {1539#true} assume true; {1539#true} is VALID [2018-11-18 21:34:28,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {1539#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {1539#true} is VALID [2018-11-18 21:34:28,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {1539#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {1539#true} is VALID [2018-11-18 21:34:28,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {1539#true} assume !(0bv32 != ~p1~0); {1539#true} is VALID [2018-11-18 21:34:28,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {1539#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,491 INFO L273 TraceCheckUtils]: 19: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,492 INFO L273 TraceCheckUtils]: 21: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:28,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {1571#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1540#false} is VALID [2018-11-18 21:34:28,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {1540#false} assume !false; {1540#false} is VALID [2018-11-18 21:34:28,496 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-18 21:34:28,497 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:28,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:28,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:28,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 21:34:28,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:28,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:28,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:28,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:28,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:28,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:28,548 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand 3 states. [2018-11-18 21:34:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:28,780 INFO L93 Difference]: Finished difference Result 177 states and 317 transitions. [2018-11-18 21:34:28,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:28,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 21:34:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-18 21:34:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2018-11-18 21:34:28,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2018-11-18 21:34:28,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:28,996 INFO L225 Difference]: With dead ends: 177 [2018-11-18 21:34:28,996 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 21:34:28,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-18 21:34:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 21:34:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 123. [2018-11-18 21:34:29,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:29,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 123 states. [2018-11-18 21:34:29,027 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 123 states. [2018-11-18 21:34:29,027 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 123 states. [2018-11-18 21:34:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:29,035 INFO L93 Difference]: Finished difference Result 175 states and 314 transitions. [2018-11-18 21:34:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 314 transitions. [2018-11-18 21:34:29,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:29,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:29,036 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 175 states. [2018-11-18 21:34:29,037 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 175 states. [2018-11-18 21:34:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:29,045 INFO L93 Difference]: Finished difference Result 175 states and 314 transitions. [2018-11-18 21:34:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 314 transitions. [2018-11-18 21:34:29,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:29,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:29,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:29,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 21:34:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 219 transitions. [2018-11-18 21:34:29,051 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 219 transitions. Word has length 25 [2018-11-18 21:34:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:29,052 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 219 transitions. [2018-11-18 21:34:29,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 219 transitions. [2018-11-18 21:34:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 21:34:29,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:29,053 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:29,053 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:29,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash 497691538, now seen corresponding path program 1 times [2018-11-18 21:34:29,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:29,054 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:29,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:29,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:29,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-18 21:34:29,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 21:34:29,179 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2286#true} {2286#true} #249#return; {2286#true} is VALID [2018-11-18 21:34:29,179 INFO L256 TraceCheckUtils]: 3: Hoare triple {2286#true} call #t~ret14 := main(); {2286#true} is VALID [2018-11-18 21:34:29,179 INFO L273 TraceCheckUtils]: 4: Hoare triple {2286#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {2286#true} is VALID [2018-11-18 21:34:29,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-18 21:34:29,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {2286#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {2286#true} is VALID [2018-11-18 21:34:29,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {2286#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {2286#true} is VALID [2018-11-18 21:34:29,180 INFO L273 TraceCheckUtils]: 8: Hoare triple {2286#true} assume !(0bv32 != ~p1~0); {2286#true} is VALID [2018-11-18 21:34:29,184 INFO L273 TraceCheckUtils]: 9: Hoare triple {2286#true} assume !(0bv32 != ~p2~0); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,189 INFO L273 TraceCheckUtils]: 12: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p5~0); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,196 INFO L273 TraceCheckUtils]: 18: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p13~0); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,200 INFO L273 TraceCheckUtils]: 21: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {2318#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-18 21:34:29,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {2318#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {2287#false} is VALID [2018-11-18 21:34:29,200 INFO L273 TraceCheckUtils]: 23: Hoare triple {2287#false} assume 1bv32 != ~lk2~0; {2287#false} is VALID [2018-11-18 21:34:29,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-18 21:34:29,202 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-18 21:34:29,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:29,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:29,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:29,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 21:34:29,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:29,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:29,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:29,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:29,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:29,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:29,247 INFO L87 Difference]: Start difference. First operand 123 states and 219 transitions. Second operand 3 states. [2018-11-18 21:34:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:29,610 INFO L93 Difference]: Finished difference Result 291 states and 525 transitions. [2018-11-18 21:34:29,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:29,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 21:34:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-18 21:34:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-18 21:34:29,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2018-11-18 21:34:30,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:30,218 INFO L225 Difference]: With dead ends: 291 [2018-11-18 21:34:30,218 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 21:34:30,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-18 21:34:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 21:34:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-11-18 21:34:30,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:30,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 175 states. [2018-11-18 21:34:30,269 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 175 states. [2018-11-18 21:34:30,269 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 175 states. [2018-11-18 21:34:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:30,275 INFO L93 Difference]: Finished difference Result 177 states and 312 transitions. [2018-11-18 21:34:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2018-11-18 21:34:30,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:30,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:30,277 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 177 states. [2018-11-18 21:34:30,277 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 177 states. [2018-11-18 21:34:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:30,284 INFO L93 Difference]: Finished difference Result 177 states and 312 transitions. [2018-11-18 21:34:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 312 transitions. [2018-11-18 21:34:30,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:30,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:30,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:30,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 21:34:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 311 transitions. [2018-11-18 21:34:30,292 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 311 transitions. Word has length 25 [2018-11-18 21:34:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:30,293 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 311 transitions. [2018-11-18 21:34:30,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 311 transitions. [2018-11-18 21:34:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 21:34:30,295 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:30,295 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:30,295 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:30,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash -162870854, now seen corresponding path program 1 times [2018-11-18 21:34:30,296 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:30,296 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:30,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:30,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:30,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {3207#true} call ULTIMATE.init(); {3207#true} is VALID [2018-11-18 21:34:30,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {3207#true} assume true; {3207#true} is VALID [2018-11-18 21:34:30,635 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3207#true} {3207#true} #249#return; {3207#true} is VALID [2018-11-18 21:34:30,635 INFO L256 TraceCheckUtils]: 3: Hoare triple {3207#true} call #t~ret14 := main(); {3207#true} is VALID [2018-11-18 21:34:30,635 INFO L273 TraceCheckUtils]: 4: Hoare triple {3207#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {3207#true} is VALID [2018-11-18 21:34:30,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {3207#true} assume true; {3207#true} is VALID [2018-11-18 21:34:30,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {3207#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {3207#true} is VALID [2018-11-18 21:34:30,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {3207#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {3207#true} is VALID [2018-11-18 21:34:30,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {3207#true} assume !(0bv32 != ~p1~0); {3207#true} is VALID [2018-11-18 21:34:30,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {3207#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p5~0); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,643 INFO L273 TraceCheckUtils]: 19: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p13~0); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {3239#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-18 21:34:30,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {3239#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {3208#false} is VALID [2018-11-18 21:34:30,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {3208#false} assume 0bv32 != ~p3~0; {3208#false} is VALID [2018-11-18 21:34:30,646 INFO L273 TraceCheckUtils]: 24: Hoare triple {3208#false} assume 1bv32 != ~lk3~0; {3208#false} is VALID [2018-11-18 21:34:30,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {3208#false} assume !false; {3208#false} is VALID [2018-11-18 21:34:30,650 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-18 21:34:30,650 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:30,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:30,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:30,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 21:34:30,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:30,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:30,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:30,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:30,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:30,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:30,686 INFO L87 Difference]: Start difference. First operand 175 states and 311 transitions. Second operand 3 states. [2018-11-18 21:34:30,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:30,921 INFO L93 Difference]: Finished difference Result 262 states and 464 transitions. [2018-11-18 21:34:30,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:30,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 21:34:30,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-18 21:34:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-18 21:34:30,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2018-11-18 21:34:31,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:31,631 INFO L225 Difference]: With dead ends: 262 [2018-11-18 21:34:31,631 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 21:34:31,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-18 21:34:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 21:34:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-11-18 21:34:31,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:31,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 177 states. [2018-11-18 21:34:31,678 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 177 states. [2018-11-18 21:34:31,678 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 177 states. [2018-11-18 21:34:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:31,684 INFO L93 Difference]: Finished difference Result 179 states and 312 transitions. [2018-11-18 21:34:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 312 transitions. [2018-11-18 21:34:31,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:31,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:31,685 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 179 states. [2018-11-18 21:34:31,686 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 179 states. [2018-11-18 21:34:31,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:31,692 INFO L93 Difference]: Finished difference Result 179 states and 312 transitions. [2018-11-18 21:34:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 312 transitions. [2018-11-18 21:34:31,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:31,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:31,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:31,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-18 21:34:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 311 transitions. [2018-11-18 21:34:31,699 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 311 transitions. Word has length 26 [2018-11-18 21:34:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:31,700 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 311 transitions. [2018-11-18 21:34:31,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 311 transitions. [2018-11-18 21:34:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 21:34:31,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:31,701 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:31,701 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:31,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1751218756, now seen corresponding path program 1 times [2018-11-18 21:34:31,702 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:31,702 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:31,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:31,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:31,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {4108#true} call ULTIMATE.init(); {4108#true} is VALID [2018-11-18 21:34:31,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {4108#true} assume true; {4108#true} is VALID [2018-11-18 21:34:31,840 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4108#true} {4108#true} #249#return; {4108#true} is VALID [2018-11-18 21:34:31,840 INFO L256 TraceCheckUtils]: 3: Hoare triple {4108#true} call #t~ret14 := main(); {4108#true} is VALID [2018-11-18 21:34:31,840 INFO L273 TraceCheckUtils]: 4: Hoare triple {4108#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {4108#true} is VALID [2018-11-18 21:34:31,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {4108#true} assume true; {4108#true} is VALID [2018-11-18 21:34:31,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {4108#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {4108#true} is VALID [2018-11-18 21:34:31,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {4108#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {4108#true} is VALID [2018-11-18 21:34:31,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {4108#true} assume !(0bv32 != ~p1~0); {4108#true} is VALID [2018-11-18 21:34:31,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {4108#true} assume !(0bv32 != ~p2~0); {4108#true} is VALID [2018-11-18 21:34:31,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {4108#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,889 INFO L273 TraceCheckUtils]: 22: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:31,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {4143#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {4109#false} is VALID [2018-11-18 21:34:31,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {4109#false} assume !false; {4109#false} is VALID [2018-11-18 21:34:31,892 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-18 21:34:31,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:31,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:31,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:31,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 21:34:31,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:31,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:31,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:31,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:31,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:31,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:31,922 INFO L87 Difference]: Start difference. First operand 177 states and 311 transitions. Second operand 3 states. [2018-11-18 21:34:32,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:32,285 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2018-11-18 21:34:32,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:32,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 21:34:32,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-18 21:34:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2018-11-18 21:34:32,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2018-11-18 21:34:32,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:32,522 INFO L225 Difference]: With dead ends: 333 [2018-11-18 21:34:32,522 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 21:34:32,523 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-18 21:34:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 21:34:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2018-11-18 21:34:32,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:32,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand 237 states. [2018-11-18 21:34:32,568 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand 237 states. [2018-11-18 21:34:32,569 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 237 states. [2018-11-18 21:34:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:32,577 INFO L93 Difference]: Finished difference Result 331 states and 588 transitions. [2018-11-18 21:34:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 588 transitions. [2018-11-18 21:34:32,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:32,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:32,578 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 331 states. [2018-11-18 21:34:32,578 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 331 states. [2018-11-18 21:34:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:32,587 INFO L93 Difference]: Finished difference Result 331 states and 588 transitions. [2018-11-18 21:34:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 588 transitions. [2018-11-18 21:34:32,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:32,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:32,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:32,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-18 21:34:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 415 transitions. [2018-11-18 21:34:32,595 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 415 transitions. Word has length 26 [2018-11-18 21:34:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:32,595 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 415 transitions. [2018-11-18 21:34:32,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 415 transitions. [2018-11-18 21:34:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 21:34:32,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:32,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:32,597 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:32,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:32,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1522680186, now seen corresponding path program 1 times [2018-11-18 21:34:32,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:32,598 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:32,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:32,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:33,103 INFO L256 TraceCheckUtils]: 0: Hoare triple {5446#true} call ULTIMATE.init(); {5446#true} is VALID [2018-11-18 21:34:33,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {5446#true} assume true; {5446#true} is VALID [2018-11-18 21:34:33,104 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5446#true} {5446#true} #249#return; {5446#true} is VALID [2018-11-18 21:34:33,104 INFO L256 TraceCheckUtils]: 3: Hoare triple {5446#true} call #t~ret14 := main(); {5446#true} is VALID [2018-11-18 21:34:33,104 INFO L273 TraceCheckUtils]: 4: Hoare triple {5446#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {5446#true} is VALID [2018-11-18 21:34:33,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {5446#true} assume true; {5446#true} is VALID [2018-11-18 21:34:33,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {5446#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {5446#true} is VALID [2018-11-18 21:34:33,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {5446#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {5446#true} is VALID [2018-11-18 21:34:33,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {5446#true} assume !(0bv32 != ~p1~0); {5446#true} is VALID [2018-11-18 21:34:33,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {5446#true} assume !(0bv32 != ~p2~0); {5446#true} is VALID [2018-11-18 21:34:33,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {5446#true} assume !(0bv32 != ~p3~0); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p5~0); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,114 INFO L273 TraceCheckUtils]: 17: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p13~0); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {5481#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-18 21:34:33,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {5481#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {5447#false} is VALID [2018-11-18 21:34:33,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {5447#false} assume 1bv32 != ~lk3~0; {5447#false} is VALID [2018-11-18 21:34:33,116 INFO L273 TraceCheckUtils]: 25: Hoare triple {5447#false} assume !false; {5447#false} is VALID [2018-11-18 21:34:33,117 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-18 21:34:33,117 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:33,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:33,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:33,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 21:34:33,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:33,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:33,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:33,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:33,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:33,146 INFO L87 Difference]: Start difference. First operand 237 states and 415 transitions. Second operand 3 states. [2018-11-18 21:34:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:33,677 INFO L93 Difference]: Finished difference Result 565 states and 997 transitions. [2018-11-18 21:34:33,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:33,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 21:34:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-18 21:34:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:33,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2018-11-18 21:34:33,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 242 transitions. [2018-11-18 21:34:34,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:34,323 INFO L225 Difference]: With dead ends: 565 [2018-11-18 21:34:34,323 INFO L226 Difference]: Without dead ends: 339 [2018-11-18 21:34:34,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-18 21:34:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-18 21:34:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-11-18 21:34:34,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:34,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand 337 states. [2018-11-18 21:34:34,423 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand 337 states. [2018-11-18 21:34:34,423 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 337 states. [2018-11-18 21:34:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:34,436 INFO L93 Difference]: Finished difference Result 339 states and 588 transitions. [2018-11-18 21:34:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 588 transitions. [2018-11-18 21:34:34,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:34,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:34,437 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 339 states. [2018-11-18 21:34:34,438 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 339 states. [2018-11-18 21:34:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:34,448 INFO L93 Difference]: Finished difference Result 339 states and 588 transitions. [2018-11-18 21:34:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 588 transitions. [2018-11-18 21:34:34,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:34,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:34,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:34,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 21:34:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 587 transitions. [2018-11-18 21:34:34,461 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 587 transitions. Word has length 26 [2018-11-18 21:34:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:34,461 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 587 transitions. [2018-11-18 21:34:34,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 587 transitions. [2018-11-18 21:34:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 21:34:34,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:34,463 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:34,463 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:34,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:34,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1547006503, now seen corresponding path program 1 times [2018-11-18 21:34:34,463 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:34,464 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:34,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:34,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:34,924 INFO L256 TraceCheckUtils]: 0: Hoare triple {7140#true} call ULTIMATE.init(); {7140#true} is VALID [2018-11-18 21:34:34,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {7140#true} assume true; {7140#true} is VALID [2018-11-18 21:34:34,924 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7140#true} {7140#true} #249#return; {7140#true} is VALID [2018-11-18 21:34:34,924 INFO L256 TraceCheckUtils]: 3: Hoare triple {7140#true} call #t~ret14 := main(); {7140#true} is VALID [2018-11-18 21:34:34,925 INFO L273 TraceCheckUtils]: 4: Hoare triple {7140#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {7140#true} is VALID [2018-11-18 21:34:34,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {7140#true} assume true; {7140#true} is VALID [2018-11-18 21:34:34,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {7140#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {7140#true} is VALID [2018-11-18 21:34:34,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {7140#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {7140#true} is VALID [2018-11-18 21:34:34,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {7140#true} assume !(0bv32 != ~p1~0); {7140#true} is VALID [2018-11-18 21:34:34,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {7140#true} assume !(0bv32 != ~p2~0); {7140#true} is VALID [2018-11-18 21:34:34,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {7140#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p5~0); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p13~0); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,939 INFO L273 TraceCheckUtils]: 21: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {7175#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-18 21:34:34,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {7175#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {7141#false} is VALID [2018-11-18 21:34:34,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {7141#false} assume 0bv32 != ~p4~0; {7141#false} is VALID [2018-11-18 21:34:34,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {7141#false} assume 1bv32 != ~lk4~0; {7141#false} is VALID [2018-11-18 21:34:34,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {7141#false} assume !false; {7141#false} is VALID [2018-11-18 21:34:34,943 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-18 21:34:34,944 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:34,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:34,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:34,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 21:34:34,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:34,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:34,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:34,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:34,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:34,976 INFO L87 Difference]: Start difference. First operand 337 states and 587 transitions. Second operand 3 states. [2018-11-18 21:34:35,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:35,379 INFO L93 Difference]: Finished difference Result 505 states and 877 transitions. [2018-11-18 21:34:35,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:35,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 21:34:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-18 21:34:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-18 21:34:35,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-18 21:34:35,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:35,603 INFO L225 Difference]: With dead ends: 505 [2018-11-18 21:34:35,604 INFO L226 Difference]: Without dead ends: 343 [2018-11-18 21:34:35,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-18 21:34:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-18 21:34:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-11-18 21:34:35,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:35,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand 341 states. [2018-11-18 21:34:35,692 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand 341 states. [2018-11-18 21:34:35,692 INFO L87 Difference]: Start difference. First operand 343 states. Second operand 341 states. [2018-11-18 21:34:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:35,701 INFO L93 Difference]: Finished difference Result 343 states and 588 transitions. [2018-11-18 21:34:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 588 transitions. [2018-11-18 21:34:35,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:35,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:35,703 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand 343 states. [2018-11-18 21:34:35,703 INFO L87 Difference]: Start difference. First operand 341 states. Second operand 343 states. [2018-11-18 21:34:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:35,712 INFO L93 Difference]: Finished difference Result 343 states and 588 transitions. [2018-11-18 21:34:35,712 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 588 transitions. [2018-11-18 21:34:35,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:35,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:35,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:35,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-18 21:34:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 587 transitions. [2018-11-18 21:34:35,722 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 587 transitions. Word has length 27 [2018-11-18 21:34:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:35,722 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 587 transitions. [2018-11-18 21:34:35,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 587 transitions. [2018-11-18 21:34:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 21:34:35,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:35,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:35,723 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:35,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash -41341399, now seen corresponding path program 1 times [2018-11-18 21:34:35,724 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:35,724 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:35,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:35,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:35,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {8789#true} call ULTIMATE.init(); {8789#true} is VALID [2018-11-18 21:34:35,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {8789#true} assume true; {8789#true} is VALID [2018-11-18 21:34:35,845 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8789#true} {8789#true} #249#return; {8789#true} is VALID [2018-11-18 21:34:35,845 INFO L256 TraceCheckUtils]: 3: Hoare triple {8789#true} call #t~ret14 := main(); {8789#true} is VALID [2018-11-18 21:34:35,845 INFO L273 TraceCheckUtils]: 4: Hoare triple {8789#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {8789#true} is VALID [2018-11-18 21:34:35,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {8789#true} assume true; {8789#true} is VALID [2018-11-18 21:34:35,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {8789#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {8789#true} is VALID [2018-11-18 21:34:35,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {8789#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {8789#true} is VALID [2018-11-18 21:34:35,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {8789#true} assume !(0bv32 != ~p1~0); {8789#true} is VALID [2018-11-18 21:34:35,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {8789#true} assume !(0bv32 != ~p2~0); {8789#true} is VALID [2018-11-18 21:34:35,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {8789#true} assume !(0bv32 != ~p3~0); {8789#true} is VALID [2018-11-18 21:34:35,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {8789#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,850 INFO L273 TraceCheckUtils]: 16: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,853 INFO L273 TraceCheckUtils]: 20: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:35,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {8827#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {8790#false} is VALID [2018-11-18 21:34:35,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {8790#false} assume !false; {8790#false} is VALID [2018-11-18 21:34:35,859 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-18 21:34:35,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:35,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:35,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 21:34:35,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:35,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:35,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:35,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:35,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:35,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:35,917 INFO L87 Difference]: Start difference. First operand 341 states and 587 transitions. Second operand 3 states. [2018-11-18 21:34:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:36,838 INFO L93 Difference]: Finished difference Result 637 states and 1113 transitions. [2018-11-18 21:34:36,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:36,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 21:34:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-18 21:34:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2018-11-18 21:34:36,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2018-11-18 21:34:37,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:37,024 INFO L225 Difference]: With dead ends: 637 [2018-11-18 21:34:37,024 INFO L226 Difference]: Without dead ends: 635 [2018-11-18 21:34:37,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-18 21:34:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-11-18 21:34:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 465. [2018-11-18 21:34:37,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:37,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand 465 states. [2018-11-18 21:34:37,214 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand 465 states. [2018-11-18 21:34:37,214 INFO L87 Difference]: Start difference. First operand 635 states. Second operand 465 states. [2018-11-18 21:34:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:37,234 INFO L93 Difference]: Finished difference Result 635 states and 1104 transitions. [2018-11-18 21:34:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1104 transitions. [2018-11-18 21:34:37,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:37,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:37,236 INFO L74 IsIncluded]: Start isIncluded. First operand 465 states. Second operand 635 states. [2018-11-18 21:34:37,236 INFO L87 Difference]: Start difference. First operand 465 states. Second operand 635 states. [2018-11-18 21:34:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:37,260 INFO L93 Difference]: Finished difference Result 635 states and 1104 transitions. [2018-11-18 21:34:37,260 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1104 transitions. [2018-11-18 21:34:37,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:37,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:37,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:37,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-18 21:34:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 791 transitions. [2018-11-18 21:34:37,277 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 791 transitions. Word has length 27 [2018-11-18 21:34:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:37,277 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 791 transitions. [2018-11-18 21:34:37,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 791 transitions. [2018-11-18 21:34:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 21:34:37,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:37,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:37,279 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:37,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:37,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1062409753, now seen corresponding path program 1 times [2018-11-18 21:34:37,280 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:37,280 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:37,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:37,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:37,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {11282#true} call ULTIMATE.init(); {11282#true} is VALID [2018-11-18 21:34:37,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {11282#true} assume true; {11282#true} is VALID [2018-11-18 21:34:37,409 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11282#true} {11282#true} #249#return; {11282#true} is VALID [2018-11-18 21:34:37,410 INFO L256 TraceCheckUtils]: 3: Hoare triple {11282#true} call #t~ret14 := main(); {11282#true} is VALID [2018-11-18 21:34:37,410 INFO L273 TraceCheckUtils]: 4: Hoare triple {11282#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {11282#true} is VALID [2018-11-18 21:34:37,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {11282#true} assume true; {11282#true} is VALID [2018-11-18 21:34:37,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {11282#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {11282#true} is VALID [2018-11-18 21:34:37,411 INFO L273 TraceCheckUtils]: 7: Hoare triple {11282#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {11282#true} is VALID [2018-11-18 21:34:37,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {11282#true} assume !(0bv32 != ~p1~0); {11282#true} is VALID [2018-11-18 21:34:37,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {11282#true} assume !(0bv32 != ~p2~0); {11282#true} is VALID [2018-11-18 21:34:37,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {11282#true} assume !(0bv32 != ~p3~0); {11282#true} is VALID [2018-11-18 21:34:37,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {11282#true} assume !(0bv32 != ~p4~0); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p5~0); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,419 INFO L273 TraceCheckUtils]: 16: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p13~0); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,423 INFO L273 TraceCheckUtils]: 23: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {11320#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-18 21:34:37,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {11320#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {11283#false} is VALID [2018-11-18 21:34:37,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {11283#false} assume 1bv32 != ~lk4~0; {11283#false} is VALID [2018-11-18 21:34:37,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {11283#false} assume !false; {11283#false} is VALID [2018-11-18 21:34:37,426 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-18 21:34:37,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:37,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:37,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:37,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 21:34:37,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:37,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:37,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:37,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:37,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:37,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:37,473 INFO L87 Difference]: Start difference. First operand 465 states and 791 transitions. Second operand 3 states. [2018-11-18 21:34:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:37,853 INFO L93 Difference]: Finished difference Result 1109 states and 1897 transitions. [2018-11-18 21:34:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:37,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 21:34:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-18 21:34:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2018-11-18 21:34:37,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 239 transitions. [2018-11-18 21:34:38,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:38,118 INFO L225 Difference]: With dead ends: 1109 [2018-11-18 21:34:38,118 INFO L226 Difference]: Without dead ends: 659 [2018-11-18 21:34:38,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-18 21:34:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-11-18 21:34:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2018-11-18 21:34:38,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:38,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand 657 states. [2018-11-18 21:34:38,352 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand 657 states. [2018-11-18 21:34:38,352 INFO L87 Difference]: Start difference. First operand 659 states. Second operand 657 states. [2018-11-18 21:34:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:38,373 INFO L93 Difference]: Finished difference Result 659 states and 1112 transitions. [2018-11-18 21:34:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1112 transitions. [2018-11-18 21:34:38,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:38,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:38,375 INFO L74 IsIncluded]: Start isIncluded. First operand 657 states. Second operand 659 states. [2018-11-18 21:34:38,376 INFO L87 Difference]: Start difference. First operand 657 states. Second operand 659 states. [2018-11-18 21:34:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:38,402 INFO L93 Difference]: Finished difference Result 659 states and 1112 transitions. [2018-11-18 21:34:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1112 transitions. [2018-11-18 21:34:38,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:38,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:38,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:38,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-18 21:34:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1111 transitions. [2018-11-18 21:34:38,430 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1111 transitions. Word has length 27 [2018-11-18 21:34:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:38,430 INFO L480 AbstractCegarLoop]: Abstraction has 657 states and 1111 transitions. [2018-11-18 21:34:38,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1111 transitions. [2018-11-18 21:34:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 21:34:38,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:38,431 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:38,432 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:38,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1281369937, now seen corresponding path program 1 times [2018-11-18 21:34:38,432 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:38,432 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:38,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:38,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:38,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {14503#true} call ULTIMATE.init(); {14503#true} is VALID [2018-11-18 21:34:38,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {14503#true} assume true; {14503#true} is VALID [2018-11-18 21:34:38,555 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14503#true} {14503#true} #249#return; {14503#true} is VALID [2018-11-18 21:34:38,555 INFO L256 TraceCheckUtils]: 3: Hoare triple {14503#true} call #t~ret14 := main(); {14503#true} is VALID [2018-11-18 21:34:38,555 INFO L273 TraceCheckUtils]: 4: Hoare triple {14503#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {14503#true} is VALID [2018-11-18 21:34:38,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {14503#true} assume true; {14503#true} is VALID [2018-11-18 21:34:38,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {14503#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {14503#true} is VALID [2018-11-18 21:34:38,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {14503#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {14503#true} is VALID [2018-11-18 21:34:38,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {14503#true} assume !(0bv32 != ~p1~0); {14503#true} is VALID [2018-11-18 21:34:38,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {14503#true} assume !(0bv32 != ~p2~0); {14503#true} is VALID [2018-11-18 21:34:38,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {14503#true} assume !(0bv32 != ~p3~0); {14503#true} is VALID [2018-11-18 21:34:38,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {14503#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p5~0); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p13~0); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,564 INFO L273 TraceCheckUtils]: 22: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {14541#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-18 21:34:38,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {14541#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {14504#false} is VALID [2018-11-18 21:34:38,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {14504#false} assume 0bv32 != ~p5~0; {14504#false} is VALID [2018-11-18 21:34:38,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {14504#false} assume 1bv32 != ~lk5~0; {14504#false} is VALID [2018-11-18 21:34:38,567 INFO L273 TraceCheckUtils]: 27: Hoare triple {14504#false} assume !false; {14504#false} is VALID [2018-11-18 21:34:38,569 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-18 21:34:38,569 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:38,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:38,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:38,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:34:38,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:38,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:38,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:38,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:38,603 INFO L87 Difference]: Start difference. First operand 657 states and 1111 transitions. Second operand 3 states. [2018-11-18 21:34:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:39,028 INFO L93 Difference]: Finished difference Result 985 states and 1661 transitions. [2018-11-18 21:34:39,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:39,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:34:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:39,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-18 21:34:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2018-11-18 21:34:39,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2018-11-18 21:34:39,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:39,324 INFO L225 Difference]: With dead ends: 985 [2018-11-18 21:34:39,324 INFO L226 Difference]: Without dead ends: 667 [2018-11-18 21:34:39,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-18 21:34:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-18 21:34:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2018-11-18 21:34:39,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:39,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand 665 states. [2018-11-18 21:34:39,536 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand 665 states. [2018-11-18 21:34:39,536 INFO L87 Difference]: Start difference. First operand 667 states. Second operand 665 states. [2018-11-18 21:34:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:39,576 INFO L93 Difference]: Finished difference Result 667 states and 1112 transitions. [2018-11-18 21:34:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1112 transitions. [2018-11-18 21:34:39,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:39,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:39,577 INFO L74 IsIncluded]: Start isIncluded. First operand 665 states. Second operand 667 states. [2018-11-18 21:34:39,577 INFO L87 Difference]: Start difference. First operand 665 states. Second operand 667 states. [2018-11-18 21:34:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:39,601 INFO L93 Difference]: Finished difference Result 667 states and 1112 transitions. [2018-11-18 21:34:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1112 transitions. [2018-11-18 21:34:39,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:39,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:39,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:39,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-11-18 21:34:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1111 transitions. [2018-11-18 21:34:39,626 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1111 transitions. Word has length 28 [2018-11-18 21:34:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:39,626 INFO L480 AbstractCegarLoop]: Abstraction has 665 states and 1111 transitions. [2018-11-18 21:34:39,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:39,626 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1111 transitions. [2018-11-18 21:34:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 21:34:39,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:39,628 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:39,628 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:39,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1425249457, now seen corresponding path program 1 times [2018-11-18 21:34:39,630 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:39,630 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:39,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:39,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:39,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {17627#true} call ULTIMATE.init(); {17627#true} is VALID [2018-11-18 21:34:39,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {17627#true} assume true; {17627#true} is VALID [2018-11-18 21:34:39,731 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17627#true} {17627#true} #249#return; {17627#true} is VALID [2018-11-18 21:34:39,732 INFO L256 TraceCheckUtils]: 3: Hoare triple {17627#true} call #t~ret14 := main(); {17627#true} is VALID [2018-11-18 21:34:39,732 INFO L273 TraceCheckUtils]: 4: Hoare triple {17627#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {17627#true} is VALID [2018-11-18 21:34:39,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {17627#true} assume true; {17627#true} is VALID [2018-11-18 21:34:39,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {17627#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {17627#true} is VALID [2018-11-18 21:34:39,732 INFO L273 TraceCheckUtils]: 7: Hoare triple {17627#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {17627#true} is VALID [2018-11-18 21:34:39,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {17627#true} assume !(0bv32 != ~p1~0); {17627#true} is VALID [2018-11-18 21:34:39,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {17627#true} assume !(0bv32 != ~p2~0); {17627#true} is VALID [2018-11-18 21:34:39,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {17627#true} assume !(0bv32 != ~p3~0); {17627#true} is VALID [2018-11-18 21:34:39,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {17627#true} assume !(0bv32 != ~p4~0); {17627#true} is VALID [2018-11-18 21:34:39,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {17627#true} assume !(0bv32 != ~p5~0); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,736 INFO L273 TraceCheckUtils]: 14: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p13~0); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {17668#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-18 21:34:39,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {17668#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {17628#false} is VALID [2018-11-18 21:34:39,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {17628#false} assume 1bv32 != ~lk5~0; {17628#false} is VALID [2018-11-18 21:34:39,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {17628#false} assume !false; {17628#false} is VALID [2018-11-18 21:34:39,756 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-18 21:34:39,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:39,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:39,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:39,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:34:39,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:39,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:39,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:39,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:39,797 INFO L87 Difference]: Start difference. First operand 665 states and 1111 transitions. Second operand 3 states. [2018-11-18 21:34:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:41,040 INFO L93 Difference]: Finished difference Result 1933 states and 3225 transitions. [2018-11-18 21:34:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:41,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:34:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-18 21:34:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2018-11-18 21:34:41,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2018-11-18 21:34:41,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:41,341 INFO L225 Difference]: With dead ends: 1933 [2018-11-18 21:34:41,342 INFO L226 Difference]: Without dead ends: 1291 [2018-11-18 21:34:41,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-18 21:34:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2018-11-18 21:34:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2018-11-18 21:34:41,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:41,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand 1289 states. [2018-11-18 21:34:41,679 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand 1289 states. [2018-11-18 21:34:41,679 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand 1289 states. [2018-11-18 21:34:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:41,745 INFO L93 Difference]: Finished difference Result 1291 states and 2120 transitions. [2018-11-18 21:34:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2120 transitions. [2018-11-18 21:34:41,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:41,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:41,747 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand 1291 states. [2018-11-18 21:34:41,747 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand 1291 states. [2018-11-18 21:34:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:41,804 INFO L93 Difference]: Finished difference Result 1291 states and 2120 transitions. [2018-11-18 21:34:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2120 transitions. [2018-11-18 21:34:41,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:41,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:41,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:41,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-18 21:34:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2119 transitions. [2018-11-18 21:34:41,856 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2119 transitions. Word has length 28 [2018-11-18 21:34:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:41,856 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2119 transitions. [2018-11-18 21:34:41,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:41,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2119 transitions. [2018-11-18 21:34:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 21:34:41,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:41,857 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:41,858 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:41,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1848649485, now seen corresponding path program 1 times [2018-11-18 21:34:41,858 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:41,858 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:41,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:41,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:41,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {23611#true} call ULTIMATE.init(); {23611#true} is VALID [2018-11-18 21:34:41,999 INFO L273 TraceCheckUtils]: 1: Hoare triple {23611#true} assume true; {23611#true} is VALID [2018-11-18 21:34:41,999 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23611#true} {23611#true} #249#return; {23611#true} is VALID [2018-11-18 21:34:42,000 INFO L256 TraceCheckUtils]: 3: Hoare triple {23611#true} call #t~ret14 := main(); {23611#true} is VALID [2018-11-18 21:34:42,000 INFO L273 TraceCheckUtils]: 4: Hoare triple {23611#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {23611#true} is VALID [2018-11-18 21:34:42,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {23611#true} assume true; {23611#true} is VALID [2018-11-18 21:34:42,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {23611#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {23611#true} is VALID [2018-11-18 21:34:42,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {23611#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {23611#true} is VALID [2018-11-18 21:34:42,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {23611#true} assume !(0bv32 != ~p1~0); {23611#true} is VALID [2018-11-18 21:34:42,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {23611#true} assume !(0bv32 != ~p2~0); {23611#true} is VALID [2018-11-18 21:34:42,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {23611#true} assume !(0bv32 != ~p3~0); {23611#true} is VALID [2018-11-18 21:34:42,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {23611#true} assume !(0bv32 != ~p4~0); {23611#true} is VALID [2018-11-18 21:34:42,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {23611#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,006 INFO L273 TraceCheckUtils]: 23: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,007 INFO L273 TraceCheckUtils]: 24: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,007 INFO L273 TraceCheckUtils]: 25: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:42,008 INFO L273 TraceCheckUtils]: 26: Hoare triple {23652#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {23612#false} is VALID [2018-11-18 21:34:42,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {23612#false} assume !false; {23612#false} is VALID [2018-11-18 21:34:42,009 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-18 21:34:42,010 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:42,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:42,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:34:42,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:42,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:42,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:42,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:42,043 INFO L87 Difference]: Start difference. First operand 1289 states and 2119 transitions. Second operand 3 states. [2018-11-18 21:34:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:42,685 INFO L93 Difference]: Finished difference Result 1597 states and 2681 transitions. [2018-11-18 21:34:42,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:42,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 21:34:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-18 21:34:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2018-11-18 21:34:42,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2018-11-18 21:34:42,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:42,935 INFO L225 Difference]: With dead ends: 1597 [2018-11-18 21:34:42,935 INFO L226 Difference]: Without dead ends: 1595 [2018-11-18 21:34:42,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-18 21:34:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-18 21:34:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1289. [2018-11-18 21:34:44,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:44,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1595 states. Second operand 1289 states. [2018-11-18 21:34:44,573 INFO L74 IsIncluded]: Start isIncluded. First operand 1595 states. Second operand 1289 states. [2018-11-18 21:34:44,574 INFO L87 Difference]: Start difference. First operand 1595 states. Second operand 1289 states. [2018-11-18 21:34:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:44,677 INFO L93 Difference]: Finished difference Result 1595 states and 2664 transitions. [2018-11-18 21:34:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2664 transitions. [2018-11-18 21:34:44,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:44,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:44,680 INFO L74 IsIncluded]: Start isIncluded. First operand 1289 states. Second operand 1595 states. [2018-11-18 21:34:44,680 INFO L87 Difference]: Start difference. First operand 1289 states. Second operand 1595 states. [2018-11-18 21:34:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:44,792 INFO L93 Difference]: Finished difference Result 1595 states and 2664 transitions. [2018-11-18 21:34:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2664 transitions. [2018-11-18 21:34:44,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:44,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:44,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:44,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2018-11-18 21:34:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2103 transitions. [2018-11-18 21:34:44,861 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2103 transitions. Word has length 28 [2018-11-18 21:34:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:44,861 INFO L480 AbstractCegarLoop]: Abstraction has 1289 states and 2103 transitions. [2018-11-18 21:34:44,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2103 transitions. [2018-11-18 21:34:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 21:34:44,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:44,863 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:44,863 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:44,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:44,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1233273980, now seen corresponding path program 1 times [2018-11-18 21:34:44,864 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:44,864 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:44,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:45,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {29867#true} call ULTIMATE.init(); {29867#true} is VALID [2018-11-18 21:34:45,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {29867#true} assume true; {29867#true} is VALID [2018-11-18 21:34:45,171 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29867#true} {29867#true} #249#return; {29867#true} is VALID [2018-11-18 21:34:45,171 INFO L256 TraceCheckUtils]: 3: Hoare triple {29867#true} call #t~ret14 := main(); {29867#true} is VALID [2018-11-18 21:34:45,171 INFO L273 TraceCheckUtils]: 4: Hoare triple {29867#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {29867#true} is VALID [2018-11-18 21:34:45,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {29867#true} assume true; {29867#true} is VALID [2018-11-18 21:34:45,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {29867#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {29867#true} is VALID [2018-11-18 21:34:45,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {29867#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {29867#true} is VALID [2018-11-18 21:34:45,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {29867#true} assume !(0bv32 != ~p1~0); {29867#true} is VALID [2018-11-18 21:34:45,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {29867#true} assume !(0bv32 != ~p2~0); {29867#true} is VALID [2018-11-18 21:34:45,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {29867#true} assume !(0bv32 != ~p3~0); {29867#true} is VALID [2018-11-18 21:34:45,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {29867#true} assume !(0bv32 != ~p4~0); {29867#true} is VALID [2018-11-18 21:34:45,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {29867#true} assume !(0bv32 != ~p5~0); {29867#true} is VALID [2018-11-18 21:34:45,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {29867#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,197 INFO L273 TraceCheckUtils]: 24: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:45,202 INFO L273 TraceCheckUtils]: 27: Hoare triple {29911#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {29868#false} is VALID [2018-11-18 21:34:45,202 INFO L273 TraceCheckUtils]: 28: Hoare triple {29868#false} assume !false; {29868#false} is VALID [2018-11-18 21:34:45,203 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-18 21:34:45,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:45,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:45,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:45,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 21:34:45,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:45,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:45,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:45,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:45,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:45,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:45,242 INFO L87 Difference]: Start difference. First operand 1289 states and 2103 transitions. Second operand 3 states. [2018-11-18 21:34:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:46,183 INFO L93 Difference]: Finished difference Result 2365 states and 3929 transitions. [2018-11-18 21:34:46,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:46,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 21:34:46,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-18 21:34:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2018-11-18 21:34:46,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2018-11-18 21:34:46,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:46,530 INFO L225 Difference]: With dead ends: 2365 [2018-11-18 21:34:46,530 INFO L226 Difference]: Without dead ends: 2363 [2018-11-18 21:34:46,531 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-18 21:34:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states. [2018-11-18 21:34:47,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1817. [2018-11-18 21:34:47,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:47,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2363 states. Second operand 1817 states. [2018-11-18 21:34:47,003 INFO L74 IsIncluded]: Start isIncluded. First operand 2363 states. Second operand 1817 states. [2018-11-18 21:34:47,003 INFO L87 Difference]: Start difference. First operand 2363 states. Second operand 1817 states. [2018-11-18 21:34:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:47,207 INFO L93 Difference]: Finished difference Result 2363 states and 3896 transitions. [2018-11-18 21:34:47,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3896 transitions. [2018-11-18 21:34:47,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:47,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:47,209 INFO L74 IsIncluded]: Start isIncluded. First operand 1817 states. Second operand 2363 states. [2018-11-18 21:34:47,209 INFO L87 Difference]: Start difference. First operand 1817 states. Second operand 2363 states. [2018-11-18 21:34:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:47,382 INFO L93 Difference]: Finished difference Result 2363 states and 3896 transitions. [2018-11-18 21:34:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3896 transitions. [2018-11-18 21:34:47,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:47,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:47,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:47,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1817 states. [2018-11-18 21:34:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2903 transitions. [2018-11-18 21:34:47,486 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2903 transitions. Word has length 29 [2018-11-18 21:34:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:47,486 INFO L480 AbstractCegarLoop]: Abstraction has 1817 states and 2903 transitions. [2018-11-18 21:34:47,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2903 transitions. [2018-11-18 21:34:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 21:34:47,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:47,488 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:47,488 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:47,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:47,489 INFO L82 PathProgramCache]: Analyzing trace with hash 212205626, now seen corresponding path program 1 times [2018-11-18 21:34:47,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:47,489 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:47,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:47,598 INFO L256 TraceCheckUtils]: 0: Hoare triple {38974#true} call ULTIMATE.init(); {38974#true} is VALID [2018-11-18 21:34:47,598 INFO L273 TraceCheckUtils]: 1: Hoare triple {38974#true} assume true; {38974#true} is VALID [2018-11-18 21:34:47,599 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {38974#true} {38974#true} #249#return; {38974#true} is VALID [2018-11-18 21:34:47,599 INFO L256 TraceCheckUtils]: 3: Hoare triple {38974#true} call #t~ret14 := main(); {38974#true} is VALID [2018-11-18 21:34:47,599 INFO L273 TraceCheckUtils]: 4: Hoare triple {38974#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {38974#true} is VALID [2018-11-18 21:34:47,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {38974#true} assume true; {38974#true} is VALID [2018-11-18 21:34:47,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {38974#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {38974#true} is VALID [2018-11-18 21:34:47,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {38974#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {38974#true} is VALID [2018-11-18 21:34:47,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {38974#true} assume !(0bv32 != ~p1~0); {38974#true} is VALID [2018-11-18 21:34:47,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {38974#true} assume !(0bv32 != ~p2~0); {38974#true} is VALID [2018-11-18 21:34:47,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {38974#true} assume !(0bv32 != ~p3~0); {38974#true} is VALID [2018-11-18 21:34:47,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {38974#true} assume !(0bv32 != ~p4~0); {38974#true} is VALID [2018-11-18 21:34:47,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {38974#true} assume !(0bv32 != ~p5~0); {38974#true} is VALID [2018-11-18 21:34:47,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {38974#true} assume !(0bv32 != ~p6~0); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p13~0); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {39018#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-18 21:34:47,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {39018#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {38975#false} is VALID [2018-11-18 21:34:47,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {38975#false} assume 1bv32 != ~lk6~0; {38975#false} is VALID [2018-11-18 21:34:47,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {38975#false} assume !false; {38975#false} is VALID [2018-11-18 21:34:47,607 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-18 21:34:47,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:47,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 21:34:47,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:47,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:47,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:47,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:47,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:47,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:47,639 INFO L87 Difference]: Start difference. First operand 1817 states and 2903 transitions. Second operand 3 states. [2018-11-18 21:34:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:49,207 INFO L93 Difference]: Finished difference Result 4317 states and 6937 transitions. [2018-11-18 21:34:49,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:49,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 21:34:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-18 21:34:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 233 transitions. [2018-11-18 21:34:49,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 233 transitions. [2018-11-18 21:34:49,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:49,736 INFO L225 Difference]: With dead ends: 4317 [2018-11-18 21:34:49,736 INFO L226 Difference]: Without dead ends: 2523 [2018-11-18 21:34:49,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-18 21:34:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-11-18 21:34:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2521. [2018-11-18 21:34:50,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:50,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2523 states. Second operand 2521 states. [2018-11-18 21:34:50,658 INFO L74 IsIncluded]: Start isIncluded. First operand 2523 states. Second operand 2521 states. [2018-11-18 21:34:50,659 INFO L87 Difference]: Start difference. First operand 2523 states. Second operand 2521 states. [2018-11-18 21:34:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:50,864 INFO L93 Difference]: Finished difference Result 2523 states and 4008 transitions. [2018-11-18 21:34:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4008 transitions. [2018-11-18 21:34:50,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:50,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:50,867 INFO L74 IsIncluded]: Start isIncluded. First operand 2521 states. Second operand 2523 states. [2018-11-18 21:34:50,867 INFO L87 Difference]: Start difference. First operand 2521 states. Second operand 2523 states. [2018-11-18 21:34:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:51,039 INFO L93 Difference]: Finished difference Result 2523 states and 4008 transitions. [2018-11-18 21:34:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4008 transitions. [2018-11-18 21:34:51,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:51,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:51,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:51,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2018-11-18 21:34:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4007 transitions. [2018-11-18 21:34:51,248 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4007 transitions. Word has length 29 [2018-11-18 21:34:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:51,248 INFO L480 AbstractCegarLoop]: Abstraction has 2521 states and 4007 transitions. [2018-11-18 21:34:51,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4007 transitions. [2018-11-18 21:34:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 21:34:51,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:51,250 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:51,250 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:51,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -422998170, now seen corresponding path program 1 times [2018-11-18 21:34:51,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:51,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:51,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:51,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {51121#true} call ULTIMATE.init(); {51121#true} is VALID [2018-11-18 21:34:51,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {51121#true} assume true; {51121#true} is VALID [2018-11-18 21:34:51,350 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {51121#true} {51121#true} #249#return; {51121#true} is VALID [2018-11-18 21:34:51,350 INFO L256 TraceCheckUtils]: 3: Hoare triple {51121#true} call #t~ret14 := main(); {51121#true} is VALID [2018-11-18 21:34:51,350 INFO L273 TraceCheckUtils]: 4: Hoare triple {51121#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {51121#true} is VALID [2018-11-18 21:34:51,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {51121#true} assume true; {51121#true} is VALID [2018-11-18 21:34:51,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {51121#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {51121#true} is VALID [2018-11-18 21:34:51,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {51121#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {51121#true} is VALID [2018-11-18 21:34:51,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {51121#true} assume !(0bv32 != ~p1~0); {51121#true} is VALID [2018-11-18 21:34:51,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {51121#true} assume !(0bv32 != ~p2~0); {51121#true} is VALID [2018-11-18 21:34:51,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {51121#true} assume !(0bv32 != ~p3~0); {51121#true} is VALID [2018-11-18 21:34:51,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {51121#true} assume !(0bv32 != ~p4~0); {51121#true} is VALID [2018-11-18 21:34:51,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {51121#true} assume !(0bv32 != ~p5~0); {51121#true} is VALID [2018-11-18 21:34:51,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {51121#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p13~0); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {51165#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-18 21:34:51,357 INFO L273 TraceCheckUtils]: 26: Hoare triple {51165#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {51122#false} is VALID [2018-11-18 21:34:51,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {51122#false} assume 0bv32 != ~p7~0; {51122#false} is VALID [2018-11-18 21:34:51,358 INFO L273 TraceCheckUtils]: 28: Hoare triple {51122#false} assume 1bv32 != ~lk7~0; {51122#false} is VALID [2018-11-18 21:34:51,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {51122#false} assume !false; {51122#false} is VALID [2018-11-18 21:34:51,359 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-18 21:34:51,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:51,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:51,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:51,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 21:34:51,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:51,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:51,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:51,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:51,391 INFO L87 Difference]: Start difference. First operand 2521 states and 4007 transitions. Second operand 3 states. [2018-11-18 21:34:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:52,642 INFO L93 Difference]: Finished difference Result 3805 states and 6041 transitions. [2018-11-18 21:34:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:52,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 21:34:52,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-18 21:34:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2018-11-18 21:34:52,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 228 transitions. [2018-11-18 21:34:52,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:53,088 INFO L225 Difference]: With dead ends: 3805 [2018-11-18 21:34:53,088 INFO L226 Difference]: Without dead ends: 2571 [2018-11-18 21:34:53,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-18 21:34:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2018-11-18 21:34:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2569. [2018-11-18 21:34:53,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:53,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand 2569 states. [2018-11-18 21:34:53,995 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand 2569 states. [2018-11-18 21:34:53,996 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand 2569 states. [2018-11-18 21:34:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:54,228 INFO L93 Difference]: Finished difference Result 2571 states and 4040 transitions. [2018-11-18 21:34:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4040 transitions. [2018-11-18 21:34:54,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:54,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:54,231 INFO L74 IsIncluded]: Start isIncluded. First operand 2569 states. Second operand 2571 states. [2018-11-18 21:34:54,231 INFO L87 Difference]: Start difference. First operand 2569 states. Second operand 2571 states. [2018-11-18 21:34:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:54,414 INFO L93 Difference]: Finished difference Result 2571 states and 4040 transitions. [2018-11-18 21:34:54,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4040 transitions. [2018-11-18 21:34:54,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:54,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:54,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:34:54,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:34:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-11-18 21:34:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4039 transitions. [2018-11-18 21:34:54,615 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4039 transitions. Word has length 30 [2018-11-18 21:34:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:34:54,616 INFO L480 AbstractCegarLoop]: Abstraction has 2569 states and 4039 transitions. [2018-11-18 21:34:54,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:34:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4039 transitions. [2018-11-18 21:34:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 21:34:54,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:34:54,617 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:34:54,618 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:34:54,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:34:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2011346072, now seen corresponding path program 1 times [2018-11-18 21:34:54,618 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:34:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:34:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:34:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:34:54,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:34:54,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {62903#true} call ULTIMATE.init(); {62903#true} is VALID [2018-11-18 21:34:54,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {62903#true} assume true; {62903#true} is VALID [2018-11-18 21:34:54,719 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {62903#true} {62903#true} #249#return; {62903#true} is VALID [2018-11-18 21:34:54,719 INFO L256 TraceCheckUtils]: 3: Hoare triple {62903#true} call #t~ret14 := main(); {62903#true} is VALID [2018-11-18 21:34:54,719 INFO L273 TraceCheckUtils]: 4: Hoare triple {62903#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {62903#true} is VALID [2018-11-18 21:34:54,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {62903#true} assume true; {62903#true} is VALID [2018-11-18 21:34:54,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {62903#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {62903#true} is VALID [2018-11-18 21:34:54,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {62903#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {62903#true} is VALID [2018-11-18 21:34:54,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {62903#true} assume !(0bv32 != ~p1~0); {62903#true} is VALID [2018-11-18 21:34:54,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {62903#true} assume !(0bv32 != ~p2~0); {62903#true} is VALID [2018-11-18 21:34:54,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {62903#true} assume !(0bv32 != ~p3~0); {62903#true} is VALID [2018-11-18 21:34:54,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {62903#true} assume !(0bv32 != ~p4~0); {62903#true} is VALID [2018-11-18 21:34:54,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {62903#true} assume !(0bv32 != ~p5~0); {62903#true} is VALID [2018-11-18 21:34:54,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {62903#true} assume !(0bv32 != ~p6~0); {62903#true} is VALID [2018-11-18 21:34:54,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {62903#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,736 INFO L273 TraceCheckUtils]: 19: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,736 INFO L273 TraceCheckUtils]: 20: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,741 INFO L273 TraceCheckUtils]: 22: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,742 INFO L273 TraceCheckUtils]: 26: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:34:54,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {62950#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {62904#false} is VALID [2018-11-18 21:34:54,743 INFO L273 TraceCheckUtils]: 29: Hoare triple {62904#false} assume !false; {62904#false} is VALID [2018-11-18 21:34:54,744 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-18 21:34:54,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:34:54,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:34:54,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:34:54,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 21:34:54,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:34:54,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:34:54,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:54,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:34:54,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:34:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:34:54,776 INFO L87 Difference]: Start difference. First operand 2569 states and 4039 transitions. Second operand 3 states. [2018-11-18 21:34:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:57,087 INFO L93 Difference]: Finished difference Result 4621 states and 7401 transitions. [2018-11-18 21:34:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:34:57,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 21:34:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:34:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-18 21:34:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:34:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2018-11-18 21:34:57,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2018-11-18 21:34:57,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:34:58,133 INFO L225 Difference]: With dead ends: 4621 [2018-11-18 21:34:58,134 INFO L226 Difference]: Without dead ends: 4619 [2018-11-18 21:34:58,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-18 21:34:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-18 21:34:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 3657. [2018-11-18 21:34:59,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:34:59,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4619 states. Second operand 3657 states. [2018-11-18 21:34:59,117 INFO L74 IsIncluded]: Start isIncluded. First operand 4619 states. Second operand 3657 states. [2018-11-18 21:34:59,117 INFO L87 Difference]: Start difference. First operand 4619 states. Second operand 3657 states. [2018-11-18 21:34:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:34:59,910 INFO L93 Difference]: Finished difference Result 4619 states and 7336 transitions. [2018-11-18 21:34:59,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 7336 transitions. [2018-11-18 21:34:59,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:34:59,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:34:59,915 INFO L74 IsIncluded]: Start isIncluded. First operand 3657 states. Second operand 4619 states. [2018-11-18 21:34:59,916 INFO L87 Difference]: Start difference. First operand 3657 states. Second operand 4619 states. [2018-11-18 21:35:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:00,714 INFO L93 Difference]: Finished difference Result 4619 states and 7336 transitions. [2018-11-18 21:35:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4619 states and 7336 transitions. [2018-11-18 21:35:00,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:35:00,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:35:00,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:35:00,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:35:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-11-18 21:35:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 5607 transitions. [2018-11-18 21:35:01,164 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 5607 transitions. Word has length 30 [2018-11-18 21:35:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:35:01,164 INFO L480 AbstractCegarLoop]: Abstraction has 3657 states and 5607 transitions. [2018-11-18 21:35:01,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:35:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 5607 transitions. [2018-11-18 21:35:01,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 21:35:01,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:35:01,166 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:35:01,167 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:35:01,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:35:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1262552870, now seen corresponding path program 1 times [2018-11-18 21:35:01,167 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:35:01,167 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:35:01,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:35:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:01,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:35:01,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {80717#true} call ULTIMATE.init(); {80717#true} is VALID [2018-11-18 21:35:01,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {80717#true} assume true; {80717#true} is VALID [2018-11-18 21:35:01,287 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {80717#true} {80717#true} #249#return; {80717#true} is VALID [2018-11-18 21:35:01,287 INFO L256 TraceCheckUtils]: 3: Hoare triple {80717#true} call #t~ret14 := main(); {80717#true} is VALID [2018-11-18 21:35:01,287 INFO L273 TraceCheckUtils]: 4: Hoare triple {80717#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {80717#true} is VALID [2018-11-18 21:35:01,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {80717#true} assume true; {80717#true} is VALID [2018-11-18 21:35:01,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {80717#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {80717#true} is VALID [2018-11-18 21:35:01,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {80717#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {80717#true} is VALID [2018-11-18 21:35:01,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {80717#true} assume !(0bv32 != ~p1~0); {80717#true} is VALID [2018-11-18 21:35:01,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {80717#true} assume !(0bv32 != ~p2~0); {80717#true} is VALID [2018-11-18 21:35:01,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {80717#true} assume !(0bv32 != ~p3~0); {80717#true} is VALID [2018-11-18 21:35:01,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {80717#true} assume !(0bv32 != ~p4~0); {80717#true} is VALID [2018-11-18 21:35:01,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {80717#true} assume !(0bv32 != ~p5~0); {80717#true} is VALID [2018-11-18 21:35:01,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {80717#true} assume !(0bv32 != ~p6~0); {80717#true} is VALID [2018-11-18 21:35:01,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {80717#true} assume !(0bv32 != ~p7~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,302 INFO L273 TraceCheckUtils]: 20: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p13~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,305 INFO L273 TraceCheckUtils]: 26: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {80764#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-18 21:35:01,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {80764#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {80718#false} is VALID [2018-11-18 21:35:01,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {80718#false} assume 1bv32 != ~lk7~0; {80718#false} is VALID [2018-11-18 21:35:01,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {80718#false} assume !false; {80718#false} is VALID [2018-11-18 21:35:01,307 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-18 21:35:01,307 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:35:01,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:35:01,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:35:01,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 21:35:01,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:35:01,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:35:01,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:01,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:35:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:35:01,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:35:01,397 INFO L87 Difference]: Start difference. First operand 3657 states and 5607 transitions. Second operand 3 states. [2018-11-18 21:35:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:05,331 INFO L93 Difference]: Finished difference Result 8589 states and 13225 transitions. [2018-11-18 21:35:05,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:35:05,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 21:35:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:35:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-18 21:35:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2018-11-18 21:35:05,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2018-11-18 21:35:05,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:06,729 INFO L225 Difference]: With dead ends: 8589 [2018-11-18 21:35:06,729 INFO L226 Difference]: Without dead ends: 5003 [2018-11-18 21:35:06,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-18 21:35:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-18 21:35:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 5001. [2018-11-18 21:35:07,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:35:07,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5003 states. Second operand 5001 states. [2018-11-18 21:35:07,949 INFO L74 IsIncluded]: Start isIncluded. First operand 5003 states. Second operand 5001 states. [2018-11-18 21:35:07,949 INFO L87 Difference]: Start difference. First operand 5003 states. Second operand 5001 states. [2018-11-18 21:35:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:08,855 INFO L93 Difference]: Finished difference Result 5003 states and 7624 transitions. [2018-11-18 21:35:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7624 transitions. [2018-11-18 21:35:08,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:35:08,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:35:08,860 INFO L74 IsIncluded]: Start isIncluded. First operand 5001 states. Second operand 5003 states. [2018-11-18 21:35:08,860 INFO L87 Difference]: Start difference. First operand 5001 states. Second operand 5003 states. [2018-11-18 21:35:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:09,793 INFO L93 Difference]: Finished difference Result 5003 states and 7624 transitions. [2018-11-18 21:35:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7624 transitions. [2018-11-18 21:35:09,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:35:09,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:35:09,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:35:09,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:35:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5001 states. [2018-11-18 21:35:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5001 states to 5001 states and 7623 transitions. [2018-11-18 21:35:10,823 INFO L78 Accepts]: Start accepts. Automaton has 5001 states and 7623 transitions. Word has length 30 [2018-11-18 21:35:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:35:10,823 INFO L480 AbstractCegarLoop]: Abstraction has 5001 states and 7623 transitions. [2018-11-18 21:35:10,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:35:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5001 states and 7623 transitions. [2018-11-18 21:35:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 21:35:10,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:35:10,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:35:10,826 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:35:10,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:35:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2072995663, now seen corresponding path program 1 times [2018-11-18 21:35:10,827 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:35:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:35:10,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:35:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:10,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:35:10,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {104739#true} call ULTIMATE.init(); {104739#true} is VALID [2018-11-18 21:35:10,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {104739#true} assume true; {104739#true} is VALID [2018-11-18 21:35:10,948 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {104739#true} {104739#true} #249#return; {104739#true} is VALID [2018-11-18 21:35:10,948 INFO L256 TraceCheckUtils]: 3: Hoare triple {104739#true} call #t~ret14 := main(); {104739#true} is VALID [2018-11-18 21:35:10,948 INFO L273 TraceCheckUtils]: 4: Hoare triple {104739#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {104739#true} is VALID [2018-11-18 21:35:10,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {104739#true} assume true; {104739#true} is VALID [2018-11-18 21:35:10,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {104739#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {104739#true} is VALID [2018-11-18 21:35:10,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {104739#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {104739#true} is VALID [2018-11-18 21:35:10,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {104739#true} assume !(0bv32 != ~p1~0); {104739#true} is VALID [2018-11-18 21:35:10,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {104739#true} assume !(0bv32 != ~p2~0); {104739#true} is VALID [2018-11-18 21:35:10,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {104739#true} assume !(0bv32 != ~p3~0); {104739#true} is VALID [2018-11-18 21:35:10,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {104739#true} assume !(0bv32 != ~p4~0); {104739#true} is VALID [2018-11-18 21:35:10,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {104739#true} assume !(0bv32 != ~p5~0); {104739#true} is VALID [2018-11-18 21:35:10,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {104739#true} assume !(0bv32 != ~p6~0); {104739#true} is VALID [2018-11-18 21:35:10,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {104739#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p13~0); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,953 INFO L273 TraceCheckUtils]: 21: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {104786#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-18 21:35:10,956 INFO L273 TraceCheckUtils]: 27: Hoare triple {104786#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {104740#false} is VALID [2018-11-18 21:35:10,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {104740#false} assume 0bv32 != ~p8~0; {104740#false} is VALID [2018-11-18 21:35:10,957 INFO L273 TraceCheckUtils]: 29: Hoare triple {104740#false} assume 1bv32 != ~lk8~0; {104740#false} is VALID [2018-11-18 21:35:10,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {104740#false} assume !false; {104740#false} is VALID [2018-11-18 21:35:10,959 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-18 21:35:10,959 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:35:10,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:35:10,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:35:10,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 21:35:10,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:35:10,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:35:10,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:10,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:35:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:35:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:35:10,992 INFO L87 Difference]: Start difference. First operand 5001 states and 7623 transitions. Second operand 3 states. [2018-11-18 21:35:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:15,039 INFO L93 Difference]: Finished difference Result 7501 states and 11401 transitions. [2018-11-18 21:35:15,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:35:15,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 21:35:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:35:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-18 21:35:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2018-11-18 21:35:15,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2018-11-18 21:35:15,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:16,415 INFO L225 Difference]: With dead ends: 7501 [2018-11-18 21:35:16,415 INFO L226 Difference]: Without dead ends: 5067 [2018-11-18 21:35:16,421 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-18 21:35:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2018-11-18 21:35:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5065. [2018-11-18 21:35:18,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:35:18,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5067 states. Second operand 5065 states. [2018-11-18 21:35:18,205 INFO L74 IsIncluded]: Start isIncluded. First operand 5067 states. Second operand 5065 states. [2018-11-18 21:35:18,205 INFO L87 Difference]: Start difference. First operand 5067 states. Second operand 5065 states. [2018-11-18 21:35:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:19,139 INFO L93 Difference]: Finished difference Result 5067 states and 7624 transitions. [2018-11-18 21:35:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7624 transitions. [2018-11-18 21:35:19,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:35:19,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:35:19,145 INFO L74 IsIncluded]: Start isIncluded. First operand 5065 states. Second operand 5067 states. [2018-11-18 21:35:19,145 INFO L87 Difference]: Start difference. First operand 5065 states. Second operand 5067 states. [2018-11-18 21:35:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:19,929 INFO L93 Difference]: Finished difference Result 5067 states and 7624 transitions. [2018-11-18 21:35:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 7624 transitions. [2018-11-18 21:35:19,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:35:19,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:35:19,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:35:19,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:35:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5065 states. [2018-11-18 21:35:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5065 states to 5065 states and 7623 transitions. [2018-11-18 21:35:20,765 INFO L78 Accepts]: Start accepts. Automaton has 5065 states and 7623 transitions. Word has length 31 [2018-11-18 21:35:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:35:20,765 INFO L480 AbstractCegarLoop]: Abstraction has 5065 states and 7623 transitions. [2018-11-18 21:35:20,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:35:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 5065 states and 7623 transitions. [2018-11-18 21:35:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 21:35:20,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:35:20,767 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:35:20,767 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:35:20,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:35:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash 484647761, now seen corresponding path program 1 times [2018-11-18 21:35:20,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:35:20,768 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:35:20,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:35:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:20,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:35:20,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {127868#true} call ULTIMATE.init(); {127868#true} is VALID [2018-11-18 21:35:20,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {127868#true} assume true; {127868#true} is VALID [2018-11-18 21:35:20,912 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {127868#true} {127868#true} #249#return; {127868#true} is VALID [2018-11-18 21:35:20,913 INFO L256 TraceCheckUtils]: 3: Hoare triple {127868#true} call #t~ret14 := main(); {127868#true} is VALID [2018-11-18 21:35:20,913 INFO L273 TraceCheckUtils]: 4: Hoare triple {127868#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {127868#true} is VALID [2018-11-18 21:35:20,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {127868#true} assume true; {127868#true} is VALID [2018-11-18 21:35:20,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {127868#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {127868#true} is VALID [2018-11-18 21:35:20,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {127868#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {127868#true} is VALID [2018-11-18 21:35:20,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {127868#true} assume !(0bv32 != ~p1~0); {127868#true} is VALID [2018-11-18 21:35:20,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {127868#true} assume !(0bv32 != ~p2~0); {127868#true} is VALID [2018-11-18 21:35:20,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {127868#true} assume !(0bv32 != ~p3~0); {127868#true} is VALID [2018-11-18 21:35:20,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {127868#true} assume !(0bv32 != ~p4~0); {127868#true} is VALID [2018-11-18 21:35:20,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {127868#true} assume !(0bv32 != ~p5~0); {127868#true} is VALID [2018-11-18 21:35:20,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {127868#true} assume !(0bv32 != ~p6~0); {127868#true} is VALID [2018-11-18 21:35:20,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {127868#true} assume !(0bv32 != ~p7~0); {127868#true} is VALID [2018-11-18 21:35:20,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {127868#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,918 INFO L273 TraceCheckUtils]: 20: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,921 INFO L273 TraceCheckUtils]: 23: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:35:20,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {127918#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {127869#false} is VALID [2018-11-18 21:35:20,928 INFO L273 TraceCheckUtils]: 30: Hoare triple {127869#false} assume !false; {127869#false} is VALID [2018-11-18 21:35:20,929 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-18 21:35:20,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:35:20,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:35:20,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:35:20,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 21:35:20,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:35:20,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:35:20,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:20,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:35:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:35:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:35:20,977 INFO L87 Difference]: Start difference. First operand 5065 states and 7623 transitions. Second operand 3 states. [2018-11-18 21:35:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:26,820 INFO L93 Difference]: Finished difference Result 8973 states and 13769 transitions. [2018-11-18 21:35:26,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:35:26,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 21:35:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:35:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-18 21:35:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2018-11-18 21:35:26,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2018-11-18 21:35:26,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:30,563 INFO L225 Difference]: With dead ends: 8973 [2018-11-18 21:35:30,563 INFO L226 Difference]: Without dead ends: 8971 [2018-11-18 21:35:30,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-18 21:35:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2018-11-18 21:35:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 7305. [2018-11-18 21:35:33,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:35:33,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8971 states. Second operand 7305 states. [2018-11-18 21:35:33,199 INFO L74 IsIncluded]: Start isIncluded. First operand 8971 states. Second operand 7305 states. [2018-11-18 21:35:33,199 INFO L87 Difference]: Start difference. First operand 8971 states. Second operand 7305 states. [2018-11-18 21:35:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:36,170 INFO L93 Difference]: Finished difference Result 8971 states and 13640 transitions. [2018-11-18 21:35:36,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 13640 transitions. [2018-11-18 21:35:36,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:35:36,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:35:36,176 INFO L74 IsIncluded]: Start isIncluded. First operand 7305 states. Second operand 8971 states. [2018-11-18 21:35:36,177 INFO L87 Difference]: Start difference. First operand 7305 states. Second operand 8971 states. [2018-11-18 21:35:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:38,666 INFO L93 Difference]: Finished difference Result 8971 states and 13640 transitions. [2018-11-18 21:35:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 13640 transitions. [2018-11-18 21:35:38,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:35:38,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:35:38,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:35:38,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:35:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2018-11-18 21:35:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 10695 transitions. [2018-11-18 21:35:40,393 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 10695 transitions. Word has length 31 [2018-11-18 21:35:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:35:40,393 INFO L480 AbstractCegarLoop]: Abstraction has 7305 states and 10695 transitions. [2018-11-18 21:35:40,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:35:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 10695 transitions. [2018-11-18 21:35:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 21:35:40,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:35:40,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:35:40,397 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:35:40,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:35:40,400 INFO L82 PathProgramCache]: Analyzing trace with hash -536420593, now seen corresponding path program 1 times [2018-11-18 21:35:40,400 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:35:40,400 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:35:40,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:35:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:35:40,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:35:40,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {162581#true} call ULTIMATE.init(); {162581#true} is VALID [2018-11-18 21:35:40,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {162581#true} assume true; {162581#true} is VALID [2018-11-18 21:35:40,510 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {162581#true} {162581#true} #249#return; {162581#true} is VALID [2018-11-18 21:35:40,511 INFO L256 TraceCheckUtils]: 3: Hoare triple {162581#true} call #t~ret14 := main(); {162581#true} is VALID [2018-11-18 21:35:40,511 INFO L273 TraceCheckUtils]: 4: Hoare triple {162581#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {162581#true} is VALID [2018-11-18 21:35:40,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {162581#true} assume true; {162581#true} is VALID [2018-11-18 21:35:40,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {162581#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {162581#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {162581#true} assume !(0bv32 != ~p1~0); {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {162581#true} assume !(0bv32 != ~p2~0); {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {162581#true} assume !(0bv32 != ~p3~0); {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {162581#true} assume !(0bv32 != ~p4~0); {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 12: Hoare triple {162581#true} assume !(0bv32 != ~p5~0); {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {162581#true} assume !(0bv32 != ~p6~0); {162581#true} is VALID [2018-11-18 21:35:40,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {162581#true} assume !(0bv32 != ~p7~0); {162581#true} is VALID [2018-11-18 21:35:40,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {162581#true} assume !(0bv32 != ~p8~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,514 INFO L273 TraceCheckUtils]: 18: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,514 INFO L273 TraceCheckUtils]: 19: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p13~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,518 INFO L273 TraceCheckUtils]: 27: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {162631#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-18 21:35:40,519 INFO L273 TraceCheckUtils]: 28: Hoare triple {162631#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {162582#false} is VALID [2018-11-18 21:35:40,519 INFO L273 TraceCheckUtils]: 29: Hoare triple {162582#false} assume 1bv32 != ~lk8~0; {162582#false} is VALID [2018-11-18 21:35:40,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {162582#false} assume !false; {162582#false} is VALID [2018-11-18 21:35:40,520 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-18 21:35:40,521 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:35:40,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:35:40,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:35:40,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 21:35:40,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:35:40,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:35:40,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:40,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:35:40,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:35:40,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:35:40,553 INFO L87 Difference]: Start difference. First operand 7305 states and 10695 transitions. Second operand 3 states. [2018-11-18 21:35:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:35:55,331 INFO L93 Difference]: Finished difference Result 17037 states and 25033 transitions. [2018-11-18 21:35:55,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:35:55,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 21:35:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:35:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-18 21:35:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:35:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2018-11-18 21:35:55,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 227 transitions. [2018-11-18 21:35:55,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:35:59,106 INFO L225 Difference]: With dead ends: 17037 [2018-11-18 21:35:59,106 INFO L226 Difference]: Without dead ends: 9867 [2018-11-18 21:35:59,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-18 21:35:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2018-11-18 21:36:04,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9865. [2018-11-18 21:36:04,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:36:04,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9867 states. Second operand 9865 states. [2018-11-18 21:36:04,417 INFO L74 IsIncluded]: Start isIncluded. First operand 9867 states. Second operand 9865 states. [2018-11-18 21:36:04,418 INFO L87 Difference]: Start difference. First operand 9867 states. Second operand 9865 states. [2018-11-18 21:36:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:36:07,988 INFO L93 Difference]: Finished difference Result 9867 states and 14344 transitions. [2018-11-18 21:36:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9867 states and 14344 transitions. [2018-11-18 21:36:07,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:36:07,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:36:07,996 INFO L74 IsIncluded]: Start isIncluded. First operand 9865 states. Second operand 9867 states. [2018-11-18 21:36:07,996 INFO L87 Difference]: Start difference. First operand 9865 states. Second operand 9867 states. [2018-11-18 21:36:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:36:11,580 INFO L93 Difference]: Finished difference Result 9867 states and 14344 transitions. [2018-11-18 21:36:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 9867 states and 14344 transitions. [2018-11-18 21:36:11,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:36:11,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:36:11,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:36:11,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:36:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2018-11-18 21:36:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 14343 transitions. [2018-11-18 21:36:15,298 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 14343 transitions. Word has length 31 [2018-11-18 21:36:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:36:15,298 INFO L480 AbstractCegarLoop]: Abstraction has 9865 states and 14343 transitions. [2018-11-18 21:36:15,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:36:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 14343 transitions. [2018-11-18 21:36:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 21:36:15,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:36:15,302 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:36:15,302 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:36:15,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:36:15,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2139393499, now seen corresponding path program 1 times [2018-11-18 21:36:15,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:36:15,303 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:36:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:36:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:36:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:36:15,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:36:15,410 INFO L256 TraceCheckUtils]: 0: Hoare triple {209966#true} call ULTIMATE.init(); {209966#true} is VALID [2018-11-18 21:36:15,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {209966#true} assume true; {209966#true} is VALID [2018-11-18 21:36:15,411 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {209966#true} {209966#true} #249#return; {209966#true} is VALID [2018-11-18 21:36:15,411 INFO L256 TraceCheckUtils]: 3: Hoare triple {209966#true} call #t~ret14 := main(); {209966#true} is VALID [2018-11-18 21:36:15,411 INFO L273 TraceCheckUtils]: 4: Hoare triple {209966#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {209966#true} is VALID [2018-11-18 21:36:15,412 INFO L273 TraceCheckUtils]: 5: Hoare triple {209966#true} assume true; {209966#true} is VALID [2018-11-18 21:36:15,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {209966#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {209966#true} is VALID [2018-11-18 21:36:15,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {209966#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {209966#true} is VALID [2018-11-18 21:36:15,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {209966#true} assume !(0bv32 != ~p1~0); {209966#true} is VALID [2018-11-18 21:36:15,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {209966#true} assume !(0bv32 != ~p2~0); {209966#true} is VALID [2018-11-18 21:36:15,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {209966#true} assume !(0bv32 != ~p3~0); {209966#true} is VALID [2018-11-18 21:36:15,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {209966#true} assume !(0bv32 != ~p4~0); {209966#true} is VALID [2018-11-18 21:36:15,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {209966#true} assume !(0bv32 != ~p5~0); {209966#true} is VALID [2018-11-18 21:36:15,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {209966#true} assume !(0bv32 != ~p6~0); {209966#true} is VALID [2018-11-18 21:36:15,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {209966#true} assume !(0bv32 != ~p7~0); {209966#true} is VALID [2018-11-18 21:36:15,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {209966#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,414 INFO L273 TraceCheckUtils]: 18: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p13~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p1~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,416 INFO L273 TraceCheckUtils]: 22: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p2~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p3~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p4~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p5~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p6~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p7~0); {210016#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-18 21:36:15,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {210016#(not (= (_ bv0 32) main_~p8~0))} assume !(0bv32 != ~p8~0); {209967#false} is VALID [2018-11-18 21:36:15,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {209967#false} assume 0bv32 != ~p9~0; {209967#false} is VALID [2018-11-18 21:36:15,419 INFO L273 TraceCheckUtils]: 30: Hoare triple {209967#false} assume 1bv32 != ~lk9~0; {209967#false} is VALID [2018-11-18 21:36:15,419 INFO L273 TraceCheckUtils]: 31: Hoare triple {209967#false} assume !false; {209967#false} is VALID [2018-11-18 21:36:15,421 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-18 21:36:15,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:36:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:36:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:36:15,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 21:36:15,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:36:15,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:36:15,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:36:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:36:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:36:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:36:15,458 INFO L87 Difference]: Start difference. First operand 9865 states and 14343 transitions. Second operand 3 states. [2018-11-18 21:36:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:36:28,055 INFO L93 Difference]: Finished difference Result 14797 states and 21449 transitions. [2018-11-18 21:36:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:36:28,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 21:36:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:36:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:36:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-18 21:36:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:36:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2018-11-18 21:36:28,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 222 transitions. [2018-11-18 21:36:28,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:36:33,267 INFO L225 Difference]: With dead ends: 14797 [2018-11-18 21:36:33,268 INFO L226 Difference]: Without dead ends: 9995 [2018-11-18 21:36:33,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-18 21:36:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9995 states. [2018-11-18 21:36:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9995 to 9993. [2018-11-18 21:36:37,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:36:37,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9995 states. Second operand 9993 states. [2018-11-18 21:36:37,560 INFO L74 IsIncluded]: Start isIncluded. First operand 9995 states. Second operand 9993 states. [2018-11-18 21:36:37,560 INFO L87 Difference]: Start difference. First operand 9995 states. Second operand 9993 states. [2018-11-18 21:36:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:36:41,197 INFO L93 Difference]: Finished difference Result 9995 states and 14344 transitions. [2018-11-18 21:36:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9995 states and 14344 transitions. [2018-11-18 21:36:41,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:36:41,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:36:41,203 INFO L74 IsIncluded]: Start isIncluded. First operand 9993 states. Second operand 9995 states. [2018-11-18 21:36:41,203 INFO L87 Difference]: Start difference. First operand 9993 states. Second operand 9995 states. [2018-11-18 21:36:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:36:44,924 INFO L93 Difference]: Finished difference Result 9995 states and 14344 transitions. [2018-11-18 21:36:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9995 states and 14344 transitions. [2018-11-18 21:36:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:36:44,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:36:44,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:36:44,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:36:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9993 states. [2018-11-18 21:36:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9993 states to 9993 states and 14343 transitions. [2018-11-18 21:36:48,886 INFO L78 Accepts]: Start accepts. Automaton has 9993 states and 14343 transitions. Word has length 32 [2018-11-18 21:36:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:36:48,887 INFO L480 AbstractCegarLoop]: Abstraction has 9993 states and 14343 transitions. [2018-11-18 21:36:48,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:36:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 9993 states and 14343 transitions. [2018-11-18 21:36:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 21:36:48,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:36:48,890 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:36:48,891 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:36:48,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:36:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash 551045597, now seen corresponding path program 1 times [2018-11-18 21:36:48,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:36:48,891 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:36:48,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:36:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:36:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:36:48,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:36:49,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {255498#true} call ULTIMATE.init(); {255498#true} is VALID [2018-11-18 21:36:49,001 INFO L273 TraceCheckUtils]: 1: Hoare triple {255498#true} assume true; {255498#true} is VALID [2018-11-18 21:36:49,001 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {255498#true} {255498#true} #249#return; {255498#true} is VALID [2018-11-18 21:36:49,001 INFO L256 TraceCheckUtils]: 3: Hoare triple {255498#true} call #t~ret14 := main(); {255498#true} is VALID [2018-11-18 21:36:49,002 INFO L273 TraceCheckUtils]: 4: Hoare triple {255498#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {255498#true} is VALID [2018-11-18 21:36:49,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {255498#true} assume true; {255498#true} is VALID [2018-11-18 21:36:49,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {255498#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {255498#true} is VALID [2018-11-18 21:36:49,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {255498#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {255498#true} is VALID [2018-11-18 21:36:49,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {255498#true} assume !(0bv32 != ~p1~0); {255498#true} is VALID [2018-11-18 21:36:49,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {255498#true} assume !(0bv32 != ~p2~0); {255498#true} is VALID [2018-11-18 21:36:49,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {255498#true} assume !(0bv32 != ~p3~0); {255498#true} is VALID [2018-11-18 21:36:49,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {255498#true} assume !(0bv32 != ~p4~0); {255498#true} is VALID [2018-11-18 21:36:49,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {255498#true} assume !(0bv32 != ~p5~0); {255498#true} is VALID [2018-11-18 21:36:49,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {255498#true} assume !(0bv32 != ~p6~0); {255498#true} is VALID [2018-11-18 21:36:49,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {255498#true} assume !(0bv32 != ~p7~0); {255498#true} is VALID [2018-11-18 21:36:49,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {255498#true} assume !(0bv32 != ~p8~0); {255498#true} is VALID [2018-11-18 21:36:49,004 INFO L273 TraceCheckUtils]: 16: Hoare triple {255498#true} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,005 INFO L273 TraceCheckUtils]: 19: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p13~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,005 INFO L273 TraceCheckUtils]: 21: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0; {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:36:49,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {255551#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk9~0; {255499#false} is VALID [2018-11-18 21:36:49,034 INFO L273 TraceCheckUtils]: 31: Hoare triple {255499#false} assume !false; {255499#false} is VALID [2018-11-18 21:36:49,035 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-18 21:36:49,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:36:49,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:36:49,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:36:49,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 21:36:49,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:36:49,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:36:49,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:36:49,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:36:49,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:36:49,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:36:49,069 INFO L87 Difference]: Start difference. First operand 9993 states and 14343 transitions. Second operand 3 states. [2018-11-18 21:37:08,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:37:08,106 INFO L93 Difference]: Finished difference Result 17421 states and 25481 transitions. [2018-11-18 21:37:08,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:37:08,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 21:37:08,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:37:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:37:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2018-11-18 21:37:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:37:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2018-11-18 21:37:08,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2018-11-18 21:37:08,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:37:20,716 INFO L225 Difference]: With dead ends: 17421 [2018-11-18 21:37:20,716 INFO L226 Difference]: Without dead ends: 17419 [2018-11-18 21:37:20,718 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-18 21:37:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17419 states. [2018-11-18 21:37:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17419 to 14601. [2018-11-18 21:37:24,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:37:24,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17419 states. Second operand 14601 states. [2018-11-18 21:37:24,236 INFO L74 IsIncluded]: Start isIncluded. First operand 17419 states. Second operand 14601 states. [2018-11-18 21:37:24,236 INFO L87 Difference]: Start difference. First operand 17419 states. Second operand 14601 states. [2018-11-18 21:37:33,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:37:33,565 INFO L93 Difference]: Finished difference Result 17419 states and 25224 transitions. [2018-11-18 21:37:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 25224 transitions. [2018-11-18 21:37:33,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:37:33,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:37:33,575 INFO L74 IsIncluded]: Start isIncluded. First operand 14601 states. Second operand 17419 states. [2018-11-18 21:37:33,575 INFO L87 Difference]: Start difference. First operand 14601 states. Second operand 17419 states. [2018-11-18 21:37:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:37:44,970 INFO L93 Difference]: Finished difference Result 17419 states and 25224 transitions. [2018-11-18 21:37:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 17419 states and 25224 transitions. [2018-11-18 21:37:44,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:37:44,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:37:44,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:37:44,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:37:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2018-11-18 21:37:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20359 transitions. [2018-11-18 21:37:55,050 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20359 transitions. Word has length 32 [2018-11-18 21:37:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:37:55,051 INFO L480 AbstractCegarLoop]: Abstraction has 14601 states and 20359 transitions. [2018-11-18 21:37:55,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:37:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20359 transitions. [2018-11-18 21:37:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 21:37:55,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:37:55,058 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:37:55,058 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:37:55,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:37:55,058 INFO L82 PathProgramCache]: Analyzing trace with hash -470022757, now seen corresponding path program 1 times [2018-11-18 21:37:55,058 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:37:55,058 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:37:55,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:37:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:37:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:37:55,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:37:55,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {323238#true} call ULTIMATE.init(); {323238#true} is VALID [2018-11-18 21:37:55,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {323238#true} assume true; {323238#true} is VALID [2018-11-18 21:37:55,171 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {323238#true} {323238#true} #249#return; {323238#true} is VALID [2018-11-18 21:37:55,171 INFO L256 TraceCheckUtils]: 3: Hoare triple {323238#true} call #t~ret14 := main(); {323238#true} is VALID [2018-11-18 21:37:55,172 INFO L273 TraceCheckUtils]: 4: Hoare triple {323238#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;havoc ~cond~0; {323238#true} is VALID [2018-11-18 21:37:55,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {323238#true} assume true; {323238#true} is VALID [2018-11-18 21:37:55,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {323238#true} assume !false;~cond~0 := #t~nondet13;havoc #t~nondet13; {323238#true} is VALID [2018-11-18 21:37:55,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {323238#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32; {323238#true} is VALID [2018-11-18 21:37:55,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {323238#true} assume !(0bv32 != ~p1~0); {323238#true} is VALID [2018-11-18 21:37:55,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {323238#true} assume !(0bv32 != ~p2~0); {323238#true} is VALID [2018-11-18 21:37:55,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {323238#true} assume !(0bv32 != ~p3~0); {323238#true} is VALID [2018-11-18 21:37:55,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {323238#true} assume !(0bv32 != ~p4~0); {323238#true} is VALID [2018-11-18 21:37:55,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {323238#true} assume !(0bv32 != ~p5~0); {323238#true} is VALID [2018-11-18 21:37:55,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {323238#true} assume !(0bv32 != ~p6~0); {323238#true} is VALID [2018-11-18 21:37:55,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {323238#true} assume !(0bv32 != ~p7~0); {323238#true} is VALID [2018-11-18 21:37:55,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {323238#true} assume !(0bv32 != ~p8~0); {323238#true} is VALID [2018-11-18 21:37:55,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {323238#true} assume !(0bv32 != ~p9~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p13~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p1~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p2~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p3~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p4~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p5~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p6~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p7~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p8~0); {323291#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-18 21:37:55,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {323291#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p9~0; {323239#false} is VALID [2018-11-18 21:37:55,182 INFO L273 TraceCheckUtils]: 30: Hoare triple {323239#false} assume 1bv32 != ~lk9~0; {323239#false} is VALID [2018-11-18 21:37:55,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {323239#false} assume !false; {323239#false} is VALID [2018-11-18 21:37:55,183 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-18 21:37:55,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:37:55,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:37:55,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:37:55,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 21:37:55,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:37:55,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:37:55,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:37:55,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:37:55,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:37:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:37:55,215 INFO L87 Difference]: Start difference. First operand 14601 states and 20359 transitions. Second operand 3 states.