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_10_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:15:32,138 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:15:32,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:15:32,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:15:32,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:15:32,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:15:32,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:15:32,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:15:32,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:15:32,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:15:32,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:15:32,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:15:32,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:15:32,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:15:32,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:15:32,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:15:32,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:15:32,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:15:32,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:15:32,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:15:32,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:15:32,181 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:15:32,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:15:32,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:15:32,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:15:32,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:15:32,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:15:32,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:15:32,188 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:15:32,189 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:15:32,189 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:15:32,190 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:15:32,190 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:15:32,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:15:32,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:15:32,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:15:32,192 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-14 16:15:32,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:15:32,208 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:15:32,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:15:32,209 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:15:32,209 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:15:32,209 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:15:32,210 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:15:32,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:15:32,210 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:15:32,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:15:32,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:15:32,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:15:32,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:15:32,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:15:32,211 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:15:32,211 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:15:32,212 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:15:32,212 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:15:32,212 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:15:32,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:15:32,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:15:32,213 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:15:32,213 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:15:32,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:15:32,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:15:32,214 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:15:32,214 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:15:32,214 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:15:32,214 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:15:32,214 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:15:32,214 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:15:32,215 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:15:32,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:15:32,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:15:32,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:15:32,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:15:32,273 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:15:32,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:15:32,327 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6b834dd/3461dd12247a4707bfd869e76d0941c0/FLAG45730b356 [2018-11-14 16:15:32,786 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:15:32,787 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:15:32,797 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6b834dd/3461dd12247a4707bfd869e76d0941c0/FLAG45730b356 [2018-11-14 16:15:32,813 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc6b834dd/3461dd12247a4707bfd869e76d0941c0 [2018-11-14 16:15:32,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:15:32,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:15:32,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:15:32,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:15:32,832 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:15:32,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:32" (1/1) ... [2018-11-14 16:15:32,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d5f738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:32, skipping insertion in model container [2018-11-14 16:15:32,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:15:32" (1/1) ... [2018-11-14 16:15:32,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:15:32,876 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:15:33,093 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:15:33,101 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:15:33,134 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:15:33,151 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:15:33,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33 WrapperNode [2018-11-14 16:15:33,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:15:33,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:15:33,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:15:33,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:15:33,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (1/1) ... [2018-11-14 16:15:33,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (1/1) ... [2018-11-14 16:15:33,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (1/1) ... [2018-11-14 16:15:33,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (1/1) ... [2018-11-14 16:15:33,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (1/1) ... [2018-11-14 16:15:33,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (1/1) ... [2018-11-14 16:15:33,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (1/1) ... [2018-11-14 16:15:33,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:15:33,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:15:33,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:15:33,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:15:33,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (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-14 16:15:33,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:15:33,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:15:33,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:15:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:15:33,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:15:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:15:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:15:33,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:15:34,238 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:15:34,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:34 BoogieIcfgContainer [2018-11-14 16:15:34,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:15:34,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:15:34,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:15:34,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:15:34,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:15:32" (1/3) ... [2018-11-14 16:15:34,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f9ce0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:34, skipping insertion in model container [2018-11-14 16:15:34,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:15:33" (2/3) ... [2018-11-14 16:15:34,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f9ce0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:15:34, skipping insertion in model container [2018-11-14 16:15:34,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:15:34" (3/3) ... [2018-11-14 16:15:34,248 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-14 16:15:34,259 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:15:34,268 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:15:34,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:15:34,321 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:15:34,322 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:15:34,323 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:15:34,323 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:15:34,323 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:15:34,323 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:15:34,324 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:15:34,324 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:15:34,324 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:15:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 16:15:34,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:15:34,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:34,356 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] [2018-11-14 16:15:34,358 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:34,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1332805667, now seen corresponding path program 1 times [2018-11-14 16:15:34,370 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:34,371 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-14 16:15:34,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:34,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:34,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 16:15:34,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 16:15:34,722 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #198#return; {48#true} is VALID [2018-11-14 16:15:34,723 INFO L256 TraceCheckUtils]: 3: Hoare triple {48#true} call #t~ret11 := main(); {48#true} is VALID [2018-11-14 16:15:34,723 INFO L273 TraceCheckUtils]: 4: Hoare triple {48#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;havoc ~cond~0; {48#true} is VALID [2018-11-14 16:15:34,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 16:15:34,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {48#true} is VALID [2018-11-14 16:15:34,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {48#true} assume !(~cond~0 == 0bv32);~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; {48#true} is VALID [2018-11-14 16:15:34,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {48#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,845 INFO L273 TraceCheckUtils]: 17: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p1~0 != 0bv32; {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:34,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {77#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk1~0 != 1bv32; {49#false} is VALID [2018-11-14 16:15:34,848 INFO L273 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 16:15:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:15:34,854 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:34,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:34,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:34,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:15:34,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:34,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:35,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:35,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:35,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:35,026 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-11-14 16:15:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:35,932 INFO L93 Difference]: Finished difference Result 89 states and 152 transitions. [2018-11-14 16:15:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:35,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:15:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 16:15:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2018-11-14 16:15:35,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2018-11-14 16:15:36,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:36,382 INFO L225 Difference]: With dead ends: 89 [2018-11-14 16:15:36,382 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 16:15:36,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-14 16:15:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 16:15:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2018-11-14 16:15:36,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:36,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 51 states. [2018-11-14 16:15:36,447 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 51 states. [2018-11-14 16:15:36,447 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 51 states. [2018-11-14 16:15:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:36,457 INFO L93 Difference]: Finished difference Result 74 states and 130 transitions. [2018-11-14 16:15:36,457 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 130 transitions. [2018-11-14 16:15:36,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:36,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:36,459 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 74 states. [2018-11-14 16:15:36,459 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 74 states. [2018-11-14 16:15:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:36,468 INFO L93 Difference]: Finished difference Result 74 states and 130 transitions. [2018-11-14 16:15:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 130 transitions. [2018-11-14 16:15:36,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:36,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:36,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:36,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 16:15:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2018-11-14 16:15:36,476 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2018-11-14 16:15:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:36,476 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2018-11-14 16:15:36,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2018-11-14 16:15:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:15:36,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:36,478 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] [2018-11-14 16:15:36,478 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:36,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1919611681, now seen corresponding path program 1 times [2018-11-14 16:15:36,479 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:36,480 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-14 16:15:36,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:36,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:36,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-14 16:15:36,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-14 16:15:36,625 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {419#true} {419#true} #198#return; {419#true} is VALID [2018-11-14 16:15:36,625 INFO L256 TraceCheckUtils]: 3: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2018-11-14 16:15:36,625 INFO L273 TraceCheckUtils]: 4: Hoare triple {419#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;havoc ~cond~0; {419#true} is VALID [2018-11-14 16:15:36,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-14 16:15:36,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {419#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {419#true} is VALID [2018-11-14 16:15:36,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#true} assume !(~cond~0 == 0bv32);~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; {419#true} is VALID [2018-11-14 16:15:36,634 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#true} assume !(~p1~0 != 0bv32); {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume !(~p5~0 != 0bv32); {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {448#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-14 16:15:36,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {448#(= (_ bv0 32) main_~p1~0)} assume ~p1~0 != 0bv32; {420#false} is VALID [2018-11-14 16:15:36,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume ~lk1~0 != 1bv32; {420#false} is VALID [2018-11-14 16:15:36,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-14 16:15:36,651 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-14 16:15:36,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:36,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:36,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:36,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:15:36,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:36,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:36,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:36,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:36,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:36,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:36,822 INFO L87 Difference]: Start difference. First operand 51 states and 90 transitions. Second operand 3 states. [2018-11-14 16:15:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:37,224 INFO L93 Difference]: Finished difference Result 120 states and 215 transitions. [2018-11-14 16:15:37,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:37,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:15:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-14 16:15:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2018-11-14 16:15:37,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2018-11-14 16:15:37,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:37,559 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:15:37,560 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 16:15:37,565 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-14 16:15:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 16:15:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-14 16:15:37,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:37,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-14 16:15:37,601 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-14 16:15:37,601 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-14 16:15:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:37,607 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2018-11-14 16:15:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-11-14 16:15:37,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:37,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:37,608 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-14 16:15:37,608 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-14 16:15:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:37,613 INFO L93 Difference]: Finished difference Result 74 states and 128 transitions. [2018-11-14 16:15:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2018-11-14 16:15:37,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:37,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:37,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:37,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 16:15:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-11-14 16:15:37,619 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 21 [2018-11-14 16:15:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:37,620 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 127 transitions. [2018-11-14 16:15:37,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 127 transitions. [2018-11-14 16:15:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:15:37,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:37,621 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] [2018-11-14 16:15:37,622 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:37,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1632910664, now seen corresponding path program 1 times [2018-11-14 16:15:37,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:37,623 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-14 16:15:37,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:37,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:37,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {841#true} call ULTIMATE.init(); {841#true} is VALID [2018-11-14 16:15:37,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {841#true} assume true; {841#true} is VALID [2018-11-14 16:15:37,748 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {841#true} {841#true} #198#return; {841#true} is VALID [2018-11-14 16:15:37,748 INFO L256 TraceCheckUtils]: 3: Hoare triple {841#true} call #t~ret11 := main(); {841#true} is VALID [2018-11-14 16:15:37,748 INFO L273 TraceCheckUtils]: 4: Hoare triple {841#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;havoc ~cond~0; {841#true} is VALID [2018-11-14 16:15:37,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {841#true} assume true; {841#true} is VALID [2018-11-14 16:15:37,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {841#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {841#true} is VALID [2018-11-14 16:15:37,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {841#true} assume !(~cond~0 == 0bv32);~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; {841#true} is VALID [2018-11-14 16:15:37,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {841#true} assume ~p1~0 != 0bv32;~lk1~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume !(~p5~0 != 0bv32); {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {870#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-14 16:15:37,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {870#(not (= (_ bv0 32) main_~p1~0))} assume !(~p1~0 != 0bv32); {842#false} is VALID [2018-11-14 16:15:37,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {842#false} assume ~p2~0 != 0bv32; {842#false} is VALID [2018-11-14 16:15:37,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {842#false} assume ~lk2~0 != 1bv32; {842#false} is VALID [2018-11-14 16:15:37,800 INFO L273 TraceCheckUtils]: 21: Hoare triple {842#false} assume !false; {842#false} is VALID [2018-11-14 16:15:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:15:37,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:37,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:37,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:37,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:15:37,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:37,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:37,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:37,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:37,830 INFO L87 Difference]: Start difference. First operand 72 states and 127 transitions. Second operand 3 states. [2018-11-14 16:15:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:38,143 INFO L93 Difference]: Finished difference Result 112 states and 193 transitions. [2018-11-14 16:15:38,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:38,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:15:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-14 16:15:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2018-11-14 16:15:38,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2018-11-14 16:15:38,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:38,495 INFO L225 Difference]: With dead ends: 112 [2018-11-14 16:15:38,495 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 16:15:38,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 16:15:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 16:15:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-14 16:15:38,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:38,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2018-11-14 16:15:38,511 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2018-11-14 16:15:38,512 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2018-11-14 16:15:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:38,516 INFO L93 Difference]: Finished difference Result 78 states and 131 transitions. [2018-11-14 16:15:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 131 transitions. [2018-11-14 16:15:38,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:38,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:38,517 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2018-11-14 16:15:38,518 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2018-11-14 16:15:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:38,522 INFO L93 Difference]: Finished difference Result 78 states and 131 transitions. [2018-11-14 16:15:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 131 transitions. [2018-11-14 16:15:38,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:38,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:38,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:38,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 16:15:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 130 transitions. [2018-11-14 16:15:38,528 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 130 transitions. Word has length 22 [2018-11-14 16:15:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:38,528 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 130 transitions. [2018-11-14 16:15:38,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2018-11-14 16:15:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:15:38,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:38,530 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] [2018-11-14 16:15:38,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:38,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash 621793414, now seen corresponding path program 1 times [2018-11-14 16:15:38,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:38,531 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-14 16:15:38,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:38,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:38,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {1272#true} call ULTIMATE.init(); {1272#true} is VALID [2018-11-14 16:15:38,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {1272#true} assume true; {1272#true} is VALID [2018-11-14 16:15:38,652 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1272#true} {1272#true} #198#return; {1272#true} is VALID [2018-11-14 16:15:38,652 INFO L256 TraceCheckUtils]: 3: Hoare triple {1272#true} call #t~ret11 := main(); {1272#true} is VALID [2018-11-14 16:15:38,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {1272#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;havoc ~cond~0; {1272#true} is VALID [2018-11-14 16:15:38,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {1272#true} assume true; {1272#true} is VALID [2018-11-14 16:15:38,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {1272#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {1272#true} is VALID [2018-11-14 16:15:38,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {1272#true} assume !(~cond~0 == 0bv32);~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; {1272#true} is VALID [2018-11-14 16:15:38,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {1272#true} assume !(~p1~0 != 0bv32); {1272#true} is VALID [2018-11-14 16:15:38,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {1272#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,658 INFO L273 TraceCheckUtils]: 14: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,659 INFO L273 TraceCheckUtils]: 16: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,660 INFO L273 TraceCheckUtils]: 17: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,661 INFO L273 TraceCheckUtils]: 18: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,662 INFO L273 TraceCheckUtils]: 19: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p2~0 != 0bv32; {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:38,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {1304#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk2~0 != 1bv32; {1273#false} is VALID [2018-11-14 16:15:38,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {1273#false} assume !false; {1273#false} is VALID [2018-11-14 16:15:38,665 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-14 16:15:38,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:38,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:38,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:15:38,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:38,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:38,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:38,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:38,696 INFO L87 Difference]: Start difference. First operand 76 states and 130 transitions. Second operand 3 states. [2018-11-14 16:15:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:38,899 INFO L93 Difference]: Finished difference Result 141 states and 245 transitions. [2018-11-14 16:15:38,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:38,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:15:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 16:15:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2018-11-14 16:15:38,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2018-11-14 16:15:39,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:39,104 INFO L225 Difference]: With dead ends: 141 [2018-11-14 16:15:39,104 INFO L226 Difference]: Without dead ends: 139 [2018-11-14 16:15:39,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 16:15:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-14 16:15:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-11-14 16:15:39,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:39,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 99 states. [2018-11-14 16:15:39,133 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 99 states. [2018-11-14 16:15:39,134 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 99 states. [2018-11-14 16:15:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:39,140 INFO L93 Difference]: Finished difference Result 139 states and 242 transitions. [2018-11-14 16:15:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 242 transitions. [2018-11-14 16:15:39,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:39,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:39,141 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 139 states. [2018-11-14 16:15:39,142 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 139 states. [2018-11-14 16:15:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:39,148 INFO L93 Difference]: Finished difference Result 139 states and 242 transitions. [2018-11-14 16:15:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 242 transitions. [2018-11-14 16:15:39,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:39,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:39,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:39,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-14 16:15:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 171 transitions. [2018-11-14 16:15:39,155 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 171 transitions. Word has length 22 [2018-11-14 16:15:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:39,155 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 171 transitions. [2018-11-14 16:15:39,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 171 transitions. [2018-11-14 16:15:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:15:39,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:39,157 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] [2018-11-14 16:15:39,157 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:39,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash 34987400, now seen corresponding path program 1 times [2018-11-14 16:15:39,158 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:39,158 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-14 16:15:39,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:39,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:39,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {1878#true} call ULTIMATE.init(); {1878#true} is VALID [2018-11-14 16:15:39,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {1878#true} assume true; {1878#true} is VALID [2018-11-14 16:15:39,264 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1878#true} {1878#true} #198#return; {1878#true} is VALID [2018-11-14 16:15:39,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {1878#true} call #t~ret11 := main(); {1878#true} is VALID [2018-11-14 16:15:39,265 INFO L273 TraceCheckUtils]: 4: Hoare triple {1878#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;havoc ~cond~0; {1878#true} is VALID [2018-11-14 16:15:39,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {1878#true} assume true; {1878#true} is VALID [2018-11-14 16:15:39,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {1878#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {1878#true} is VALID [2018-11-14 16:15:39,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {1878#true} assume !(~cond~0 == 0bv32);~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; {1878#true} is VALID [2018-11-14 16:15:39,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {1878#true} assume !(~p1~0 != 0bv32); {1878#true} is VALID [2018-11-14 16:15:39,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {1878#true} assume !(~p2~0 != 0bv32); {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume !(~p5~0 != 0bv32); {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume !(~p1~0 != 0bv32); {1910#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-14 16:15:39,280 INFO L273 TraceCheckUtils]: 19: Hoare triple {1910#(= (_ bv0 32) main_~p2~0)} assume ~p2~0 != 0bv32; {1879#false} is VALID [2018-11-14 16:15:39,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {1879#false} assume ~lk2~0 != 1bv32; {1879#false} is VALID [2018-11-14 16:15:39,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {1879#false} assume !false; {1879#false} is VALID [2018-11-14 16:15:39,281 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-14 16:15:39,282 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:39,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:39,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:39,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:15:39,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:39,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:39,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:39,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:39,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:39,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:39,315 INFO L87 Difference]: Start difference. First operand 99 states and 171 transitions. Second operand 3 states. [2018-11-14 16:15:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:39,517 INFO L93 Difference]: Finished difference Result 231 states and 405 transitions. [2018-11-14 16:15:39,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:39,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 16:15:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-14 16:15:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2018-11-14 16:15:39,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2018-11-14 16:15:39,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:39,913 INFO L225 Difference]: With dead ends: 231 [2018-11-14 16:15:39,914 INFO L226 Difference]: Without dead ends: 141 [2018-11-14 16:15:39,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-14 16:15:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-14 16:15:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-14 16:15:39,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:39,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-14 16:15:39,975 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-14 16:15:39,975 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-14 16:15:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:39,980 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2018-11-14 16:15:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2018-11-14 16:15:39,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:39,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:39,981 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-14 16:15:39,981 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-14 16:15:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:39,988 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2018-11-14 16:15:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2018-11-14 16:15:39,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:39,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:39,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:39,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-14 16:15:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 239 transitions. [2018-11-14 16:15:39,994 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 239 transitions. Word has length 22 [2018-11-14 16:15:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:39,995 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 239 transitions. [2018-11-14 16:15:39,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 239 transitions. [2018-11-14 16:15:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:15:39,996 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:39,996 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] [2018-11-14 16:15:39,996 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:39,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:39,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2095940372, now seen corresponding path program 1 times [2018-11-14 16:15:39,997 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:39,997 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-14 16:15:40,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:40,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:40,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {2622#true} call ULTIMATE.init(); {2622#true} is VALID [2018-11-14 16:15:40,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {2622#true} assume true; {2622#true} is VALID [2018-11-14 16:15:40,124 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2622#true} {2622#true} #198#return; {2622#true} is VALID [2018-11-14 16:15:40,124 INFO L256 TraceCheckUtils]: 3: Hoare triple {2622#true} call #t~ret11 := main(); {2622#true} is VALID [2018-11-14 16:15:40,125 INFO L273 TraceCheckUtils]: 4: Hoare triple {2622#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;havoc ~cond~0; {2622#true} is VALID [2018-11-14 16:15:40,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {2622#true} assume true; {2622#true} is VALID [2018-11-14 16:15:40,125 INFO L273 TraceCheckUtils]: 6: Hoare triple {2622#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {2622#true} is VALID [2018-11-14 16:15:40,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {2622#true} assume !(~cond~0 == 0bv32);~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; {2622#true} is VALID [2018-11-14 16:15:40,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {2622#true} assume !(~p1~0 != 0bv32); {2622#true} is VALID [2018-11-14 16:15:40,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {2622#true} assume ~p2~0 != 0bv32;~lk2~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,127 INFO L273 TraceCheckUtils]: 12: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume !(~p5~0 != 0bv32); {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume !(~p1~0 != 0bv32); {2654#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-14 16:15:40,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {2654#(not (= (_ bv0 32) main_~p2~0))} assume !(~p2~0 != 0bv32); {2623#false} is VALID [2018-11-14 16:15:40,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {2623#false} assume ~p3~0 != 0bv32; {2623#false} is VALID [2018-11-14 16:15:40,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {2623#false} assume ~lk3~0 != 1bv32; {2623#false} is VALID [2018-11-14 16:15:40,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {2623#false} assume !false; {2623#false} is VALID [2018-11-14 16:15:40,166 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-14 16:15:40,166 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:40,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:40,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:40,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:15:40,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:40,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:40,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:40,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:40,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:40,224 INFO L87 Difference]: Start difference. First operand 139 states and 239 transitions. Second operand 3 states. [2018-11-14 16:15:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:40,524 INFO L93 Difference]: Finished difference Result 208 states and 356 transitions. [2018-11-14 16:15:40,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:40,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:15:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-14 16:15:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:40,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2018-11-14 16:15:40,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2018-11-14 16:15:40,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:40,916 INFO L225 Difference]: With dead ends: 208 [2018-11-14 16:15:40,916 INFO L226 Difference]: Without dead ends: 143 [2018-11-14 16:15:40,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-14 16:15:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-14 16:15:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-11-14 16:15:40,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:40,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 141 states. [2018-11-14 16:15:40,957 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 141 states. [2018-11-14 16:15:40,958 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 141 states. [2018-11-14 16:15:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:40,963 INFO L93 Difference]: Finished difference Result 143 states and 240 transitions. [2018-11-14 16:15:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 240 transitions. [2018-11-14 16:15:40,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:40,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:40,964 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 143 states. [2018-11-14 16:15:40,964 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 143 states. [2018-11-14 16:15:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:40,970 INFO L93 Difference]: Finished difference Result 143 states and 240 transitions. [2018-11-14 16:15:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 240 transitions. [2018-11-14 16:15:40,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:40,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:40,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:40,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-14 16:15:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 239 transitions. [2018-11-14 16:15:40,977 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 239 transitions. Word has length 23 [2018-11-14 16:15:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:40,978 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 239 transitions. [2018-11-14 16:15:40,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 239 transitions. [2018-11-14 16:15:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:15:40,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:40,979 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] [2018-11-14 16:15:40,979 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:40,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1084823122, now seen corresponding path program 1 times [2018-11-14 16:15:40,980 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:40,980 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-14 16:15:41,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:41,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:41,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {3352#true} call ULTIMATE.init(); {3352#true} is VALID [2018-11-14 16:15:41,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-14 16:15:41,344 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3352#true} {3352#true} #198#return; {3352#true} is VALID [2018-11-14 16:15:41,345 INFO L256 TraceCheckUtils]: 3: Hoare triple {3352#true} call #t~ret11 := main(); {3352#true} is VALID [2018-11-14 16:15:41,345 INFO L273 TraceCheckUtils]: 4: Hoare triple {3352#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;havoc ~cond~0; {3352#true} is VALID [2018-11-14 16:15:41,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-14 16:15:41,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {3352#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {3352#true} is VALID [2018-11-14 16:15:41,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {3352#true} assume !(~cond~0 == 0bv32);~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; {3352#true} is VALID [2018-11-14 16:15:41,346 INFO L273 TraceCheckUtils]: 8: Hoare triple {3352#true} assume !(~p1~0 != 0bv32); {3352#true} is VALID [2018-11-14 16:15:41,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {3352#true} assume !(~p2~0 != 0bv32); {3352#true} is VALID [2018-11-14 16:15:41,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {3352#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p3~0 != 0bv32; {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:41,353 INFO L273 TraceCheckUtils]: 21: Hoare triple {3387#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk3~0 != 1bv32; {3353#false} is VALID [2018-11-14 16:15:41,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {3353#false} assume !false; {3353#false} is VALID [2018-11-14 16:15:41,356 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-14 16:15:41,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:41,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:41,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:41,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:15:41,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:41,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:41,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:41,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:41,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:41,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:41,397 INFO L87 Difference]: Start difference. First operand 141 states and 239 transitions. Second operand 3 states. [2018-11-14 16:15:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:41,635 INFO L93 Difference]: Finished difference Result 261 states and 449 transitions. [2018-11-14 16:15:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:41,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:15:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2018-11-14 16:15:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2018-11-14 16:15:41,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2018-11-14 16:15:42,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:42,026 INFO L225 Difference]: With dead ends: 261 [2018-11-14 16:15:42,026 INFO L226 Difference]: Without dead ends: 259 [2018-11-14 16:15:42,027 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-14 16:15:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-14 16:15:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 189. [2018-11-14 16:15:42,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:42,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand 189 states. [2018-11-14 16:15:42,090 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand 189 states. [2018-11-14 16:15:42,091 INFO L87 Difference]: Start difference. First operand 259 states. Second operand 189 states. [2018-11-14 16:15:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:42,112 INFO L93 Difference]: Finished difference Result 259 states and 444 transitions. [2018-11-14 16:15:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 444 transitions. [2018-11-14 16:15:42,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:42,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:42,114 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 259 states. [2018-11-14 16:15:42,114 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 259 states. [2018-11-14 16:15:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:42,132 INFO L93 Difference]: Finished difference Result 259 states and 444 transitions. [2018-11-14 16:15:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 444 transitions. [2018-11-14 16:15:42,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:42,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:42,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:42,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-14 16:15:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 319 transitions. [2018-11-14 16:15:42,139 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 319 transitions. Word has length 23 [2018-11-14 16:15:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:42,139 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 319 transitions. [2018-11-14 16:15:42,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 319 transitions. [2018-11-14 16:15:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:15:42,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:42,143 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] [2018-11-14 16:15:42,143 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:42,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash 498017108, now seen corresponding path program 1 times [2018-11-14 16:15:42,144 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:42,144 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-14 16:15:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:42,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:42,301 INFO L256 TraceCheckUtils]: 0: Hoare triple {4417#true} call ULTIMATE.init(); {4417#true} is VALID [2018-11-14 16:15:42,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {4417#true} assume true; {4417#true} is VALID [2018-11-14 16:15:42,302 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4417#true} {4417#true} #198#return; {4417#true} is VALID [2018-11-14 16:15:42,302 INFO L256 TraceCheckUtils]: 3: Hoare triple {4417#true} call #t~ret11 := main(); {4417#true} is VALID [2018-11-14 16:15:42,303 INFO L273 TraceCheckUtils]: 4: Hoare triple {4417#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;havoc ~cond~0; {4417#true} is VALID [2018-11-14 16:15:42,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {4417#true} assume true; {4417#true} is VALID [2018-11-14 16:15:42,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {4417#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {4417#true} is VALID [2018-11-14 16:15:42,304 INFO L273 TraceCheckUtils]: 7: Hoare triple {4417#true} assume !(~cond~0 == 0bv32);~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; {4417#true} is VALID [2018-11-14 16:15:42,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {4417#true} assume !(~p1~0 != 0bv32); {4417#true} is VALID [2018-11-14 16:15:42,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {4417#true} assume !(~p2~0 != 0bv32); {4417#true} is VALID [2018-11-14 16:15:42,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {4417#true} assume !(~p3~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume !(~p5~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume !(~p1~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume !(~p2~0 != 0bv32); {4452#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-14 16:15:42,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {4452#(= (_ bv0 32) main_~p3~0)} assume ~p3~0 != 0bv32; {4418#false} is VALID [2018-11-14 16:15:42,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {4418#false} assume ~lk3~0 != 1bv32; {4418#false} is VALID [2018-11-14 16:15:42,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {4418#false} assume !false; {4418#false} is VALID [2018-11-14 16:15:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:15:42,311 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:42,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:42,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:42,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:15:42,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:42,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:42,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:42,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:42,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:42,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:42,335 INFO L87 Difference]: Start difference. First operand 189 states and 319 transitions. Second operand 3 states. [2018-11-14 16:15:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:42,579 INFO L93 Difference]: Finished difference Result 445 states and 757 transitions. [2018-11-14 16:15:42,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:42,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 16:15:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 16:15:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2018-11-14 16:15:42,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2018-11-14 16:15:43,385 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-14 16:15:43,392 INFO L225 Difference]: With dead ends: 445 [2018-11-14 16:15:43,392 INFO L226 Difference]: Without dead ends: 267 [2018-11-14 16:15:43,394 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-14 16:15:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-14 16:15:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-11-14 16:15:43,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:43,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand 265 states. [2018-11-14 16:15:43,456 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 265 states. [2018-11-14 16:15:43,456 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 265 states. [2018-11-14 16:15:43,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:43,464 INFO L93 Difference]: Finished difference Result 267 states and 444 transitions. [2018-11-14 16:15:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2018-11-14 16:15:43,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:43,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:43,465 INFO L74 IsIncluded]: Start isIncluded. First operand 265 states. Second operand 267 states. [2018-11-14 16:15:43,465 INFO L87 Difference]: Start difference. First operand 265 states. Second operand 267 states. [2018-11-14 16:15:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:43,473 INFO L93 Difference]: Finished difference Result 267 states and 444 transitions. [2018-11-14 16:15:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2018-11-14 16:15:43,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:43,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:43,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:43,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-14 16:15:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 443 transitions. [2018-11-14 16:15:43,482 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 443 transitions. Word has length 23 [2018-11-14 16:15:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:43,482 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 443 transitions. [2018-11-14 16:15:43,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 443 transitions. [2018-11-14 16:15:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:15:43,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:43,484 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-14 16:15:43,484 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:43,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash -730007523, now seen corresponding path program 1 times [2018-11-14 16:15:43,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:43,485 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-14 16:15:43,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:43,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:44,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {5766#true} call ULTIMATE.init(); {5766#true} is VALID [2018-11-14 16:15:44,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {5766#true} assume true; {5766#true} is VALID [2018-11-14 16:15:44,057 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5766#true} {5766#true} #198#return; {5766#true} is VALID [2018-11-14 16:15:44,057 INFO L256 TraceCheckUtils]: 3: Hoare triple {5766#true} call #t~ret11 := main(); {5766#true} is VALID [2018-11-14 16:15:44,057 INFO L273 TraceCheckUtils]: 4: Hoare triple {5766#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;havoc ~cond~0; {5766#true} is VALID [2018-11-14 16:15:44,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {5766#true} assume true; {5766#true} is VALID [2018-11-14 16:15:44,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {5766#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {5766#true} is VALID [2018-11-14 16:15:44,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {5766#true} assume !(~cond~0 == 0bv32);~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; {5766#true} is VALID [2018-11-14 16:15:44,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {5766#true} assume !(~p1~0 != 0bv32); {5766#true} is VALID [2018-11-14 16:15:44,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#true} assume !(~p2~0 != 0bv32); {5766#true} is VALID [2018-11-14 16:15:44,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#true} assume ~p3~0 != 0bv32;~lk3~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p5~0 != 0bv32); {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,063 INFO L273 TraceCheckUtils]: 16: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,063 INFO L273 TraceCheckUtils]: 17: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,064 INFO L273 TraceCheckUtils]: 18: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p1~0 != 0bv32); {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p2~0 != 0bv32); {5801#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-14 16:15:44,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {5801#(not (= (_ bv0 32) main_~p3~0))} assume !(~p3~0 != 0bv32); {5767#false} is VALID [2018-11-14 16:15:44,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {5767#false} assume ~p4~0 != 0bv32; {5767#false} is VALID [2018-11-14 16:15:44,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {5767#false} assume ~lk4~0 != 1bv32; {5767#false} is VALID [2018-11-14 16:15:44,065 INFO L273 TraceCheckUtils]: 23: Hoare triple {5767#false} assume !false; {5767#false} is VALID [2018-11-14 16:15:44,066 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-14 16:15:44,066 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:44,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:44,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:44,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:44,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:44,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:44,091 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-14 16:15:44,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:44,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:44,092 INFO L87 Difference]: Start difference. First operand 265 states and 443 transitions. Second operand 3 states. [2018-11-14 16:15:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:44,489 INFO L93 Difference]: Finished difference Result 397 states and 661 transitions. [2018-11-14 16:15:44,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:44,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 16:15:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 16:15:44,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2018-11-14 16:15:45,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:45,300 INFO L225 Difference]: With dead ends: 397 [2018-11-14 16:15:45,300 INFO L226 Difference]: Without dead ends: 271 [2018-11-14 16:15:45,301 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-14 16:15:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-14 16:15:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-11-14 16:15:45,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:45,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand 269 states. [2018-11-14 16:15:45,451 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand 269 states. [2018-11-14 16:15:45,452 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 269 states. [2018-11-14 16:15:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:45,460 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2018-11-14 16:15:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 444 transitions. [2018-11-14 16:15:45,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:45,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:45,461 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 271 states. [2018-11-14 16:15:45,461 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 271 states. [2018-11-14 16:15:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:45,468 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2018-11-14 16:15:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 444 transitions. [2018-11-14 16:15:45,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:45,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:45,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:45,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-11-14 16:15:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 443 transitions. [2018-11-14 16:15:45,475 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 443 transitions. Word has length 24 [2018-11-14 16:15:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:45,476 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 443 transitions. [2018-11-14 16:15:45,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 443 transitions. [2018-11-14 16:15:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:15:45,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:45,477 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-14 16:15:45,477 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:45,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:45,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1741124773, now seen corresponding path program 1 times [2018-11-14 16:15:45,478 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:45,478 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-14 16:15:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:45,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:45,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {7082#true} call ULTIMATE.init(); {7082#true} is VALID [2018-11-14 16:15:45,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {7082#true} assume true; {7082#true} is VALID [2018-11-14 16:15:45,744 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7082#true} {7082#true} #198#return; {7082#true} is VALID [2018-11-14 16:15:45,744 INFO L256 TraceCheckUtils]: 3: Hoare triple {7082#true} call #t~ret11 := main(); {7082#true} is VALID [2018-11-14 16:15:45,745 INFO L273 TraceCheckUtils]: 4: Hoare triple {7082#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;havoc ~cond~0; {7082#true} is VALID [2018-11-14 16:15:45,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {7082#true} assume true; {7082#true} is VALID [2018-11-14 16:15:45,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {7082#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {7082#true} is VALID [2018-11-14 16:15:45,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {7082#true} assume !(~cond~0 == 0bv32);~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; {7082#true} is VALID [2018-11-14 16:15:45,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {7082#true} assume !(~p1~0 != 0bv32); {7082#true} is VALID [2018-11-14 16:15:45,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {7082#true} assume !(~p2~0 != 0bv32); {7082#true} is VALID [2018-11-14 16:15:45,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {7082#true} assume !(~p3~0 != 0bv32); {7082#true} is VALID [2018-11-14 16:15:45,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {7082#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,755 INFO L273 TraceCheckUtils]: 21: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p4~0 != 0bv32; {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:45,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {7120#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk4~0 != 1bv32; {7083#false} is VALID [2018-11-14 16:15:45,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {7083#false} assume !false; {7083#false} is VALID [2018-11-14 16:15:45,758 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-14 16:15:45,758 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:45,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:45,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:45,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:45,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:45,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:45,786 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-14 16:15:45,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:45,787 INFO L87 Difference]: Start difference. First operand 269 states and 443 transitions. Second operand 3 states. [2018-11-14 16:15:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:46,221 INFO L93 Difference]: Finished difference Result 493 states and 825 transitions. [2018-11-14 16:15:46,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:46,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:46,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-14 16:15:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2018-11-14 16:15:46,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2018-11-14 16:15:46,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:46,362 INFO L225 Difference]: With dead ends: 493 [2018-11-14 16:15:46,362 INFO L226 Difference]: Without dead ends: 491 [2018-11-14 16:15:46,363 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-14 16:15:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-11-14 16:15:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 369. [2018-11-14 16:15:46,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:46,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand 369 states. [2018-11-14 16:15:46,611 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand 369 states. [2018-11-14 16:15:46,611 INFO L87 Difference]: Start difference. First operand 491 states. Second operand 369 states. [2018-11-14 16:15:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:46,626 INFO L93 Difference]: Finished difference Result 491 states and 816 transitions. [2018-11-14 16:15:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 816 transitions. [2018-11-14 16:15:46,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:46,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:46,628 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand 491 states. [2018-11-14 16:15:46,628 INFO L87 Difference]: Start difference. First operand 369 states. Second operand 491 states. [2018-11-14 16:15:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:46,644 INFO L93 Difference]: Finished difference Result 491 states and 816 transitions. [2018-11-14 16:15:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 816 transitions. [2018-11-14 16:15:46,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:46,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:46,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:46,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-14 16:15:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 599 transitions. [2018-11-14 16:15:46,655 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 599 transitions. Word has length 24 [2018-11-14 16:15:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:46,655 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 599 transitions. [2018-11-14 16:15:46,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:46,655 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 599 transitions. [2018-11-14 16:15:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:15:46,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:46,656 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-14 16:15:46,657 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:46,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:46,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1967036509, now seen corresponding path program 1 times [2018-11-14 16:15:46,657 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:46,657 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-14 16:15:46,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:46,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:46,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {9038#true} call ULTIMATE.init(); {9038#true} is VALID [2018-11-14 16:15:46,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {9038#true} assume true; {9038#true} is VALID [2018-11-14 16:15:46,777 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9038#true} {9038#true} #198#return; {9038#true} is VALID [2018-11-14 16:15:46,777 INFO L256 TraceCheckUtils]: 3: Hoare triple {9038#true} call #t~ret11 := main(); {9038#true} is VALID [2018-11-14 16:15:46,777 INFO L273 TraceCheckUtils]: 4: Hoare triple {9038#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;havoc ~cond~0; {9038#true} is VALID [2018-11-14 16:15:46,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {9038#true} assume true; {9038#true} is VALID [2018-11-14 16:15:46,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {9038#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {9038#true} is VALID [2018-11-14 16:15:46,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {9038#true} assume !(~cond~0 == 0bv32);~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; {9038#true} is VALID [2018-11-14 16:15:46,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {9038#true} assume !(~p1~0 != 0bv32); {9038#true} is VALID [2018-11-14 16:15:46,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {9038#true} assume !(~p2~0 != 0bv32); {9038#true} is VALID [2018-11-14 16:15:46,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {9038#true} assume !(~p3~0 != 0bv32); {9038#true} is VALID [2018-11-14 16:15:46,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {9038#true} assume !(~p4~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p5~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,792 INFO L273 TraceCheckUtils]: 18: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p1~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p2~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume !(~p3~0 != 0bv32); {9076#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-14 16:15:46,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {9076#(= (_ bv0 32) main_~p4~0)} assume ~p4~0 != 0bv32; {9039#false} is VALID [2018-11-14 16:15:46,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {9039#false} assume ~lk4~0 != 1bv32; {9039#false} is VALID [2018-11-14 16:15:46,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {9039#false} assume !false; {9039#false} is VALID [2018-11-14 16:15:46,796 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-14 16:15:46,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:46,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:46,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:46,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:46,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:46,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:46,832 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-14 16:15:46,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:46,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:46,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:46,833 INFO L87 Difference]: Start difference. First operand 369 states and 599 transitions. Second operand 3 states. [2018-11-14 16:15:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:47,455 INFO L93 Difference]: Finished difference Result 869 states and 1417 transitions. [2018-11-14 16:15:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:47,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 16:15:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-14 16:15:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2018-11-14 16:15:47,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2018-11-14 16:15:47,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:47,970 INFO L225 Difference]: With dead ends: 869 [2018-11-14 16:15:47,971 INFO L226 Difference]: Without dead ends: 515 [2018-11-14 16:15:47,972 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-14 16:15:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2018-11-14 16:15:48,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2018-11-14 16:15:48,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:48,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand 513 states. [2018-11-14 16:15:48,129 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand 513 states. [2018-11-14 16:15:48,129 INFO L87 Difference]: Start difference. First operand 515 states. Second operand 513 states. [2018-11-14 16:15:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:48,144 INFO L93 Difference]: Finished difference Result 515 states and 824 transitions. [2018-11-14 16:15:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 824 transitions. [2018-11-14 16:15:48,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:48,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:48,146 INFO L74 IsIncluded]: Start isIncluded. First operand 513 states. Second operand 515 states. [2018-11-14 16:15:48,146 INFO L87 Difference]: Start difference. First operand 513 states. Second operand 515 states. [2018-11-14 16:15:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:48,161 INFO L93 Difference]: Finished difference Result 515 states and 824 transitions. [2018-11-14 16:15:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 824 transitions. [2018-11-14 16:15:48,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:48,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:48,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:48,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-14 16:15:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 823 transitions. [2018-11-14 16:15:48,179 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 823 transitions. Word has length 24 [2018-11-14 16:15:48,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:48,179 INFO L480 AbstractCegarLoop]: Abstraction has 513 states and 823 transitions. [2018-11-14 16:15:48,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 823 transitions. [2018-11-14 16:15:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:15:48,180 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:48,180 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-14 16:15:48,181 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:48,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1859921289, now seen corresponding path program 1 times [2018-11-14 16:15:48,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:48,181 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-14 16:15:48,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:48,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:48,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {11578#true} call ULTIMATE.init(); {11578#true} is VALID [2018-11-14 16:15:48,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {11578#true} assume true; {11578#true} is VALID [2018-11-14 16:15:48,288 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11578#true} {11578#true} #198#return; {11578#true} is VALID [2018-11-14 16:15:48,289 INFO L256 TraceCheckUtils]: 3: Hoare triple {11578#true} call #t~ret11 := main(); {11578#true} is VALID [2018-11-14 16:15:48,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {11578#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;havoc ~cond~0; {11578#true} is VALID [2018-11-14 16:15:48,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {11578#true} assume true; {11578#true} is VALID [2018-11-14 16:15:48,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {11578#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {11578#true} is VALID [2018-11-14 16:15:48,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {11578#true} assume !(~cond~0 == 0bv32);~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; {11578#true} is VALID [2018-11-14 16:15:48,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {11578#true} assume !(~p1~0 != 0bv32); {11578#true} is VALID [2018-11-14 16:15:48,290 INFO L273 TraceCheckUtils]: 9: Hoare triple {11578#true} assume !(~p2~0 != 0bv32); {11578#true} is VALID [2018-11-14 16:15:48,290 INFO L273 TraceCheckUtils]: 10: Hoare triple {11578#true} assume !(~p3~0 != 0bv32); {11578#true} is VALID [2018-11-14 16:15:48,294 INFO L273 TraceCheckUtils]: 11: Hoare triple {11578#true} assume ~p4~0 != 0bv32;~lk4~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p5~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,296 INFO L273 TraceCheckUtils]: 13: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,296 INFO L273 TraceCheckUtils]: 14: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p1~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p2~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p3~0 != 0bv32); {11616#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-14 16:15:48,307 INFO L273 TraceCheckUtils]: 21: Hoare triple {11616#(not (= (_ bv0 32) main_~p4~0))} assume !(~p4~0 != 0bv32); {11579#false} is VALID [2018-11-14 16:15:48,307 INFO L273 TraceCheckUtils]: 22: Hoare triple {11579#false} assume ~p5~0 != 0bv32; {11579#false} is VALID [2018-11-14 16:15:48,307 INFO L273 TraceCheckUtils]: 23: Hoare triple {11579#false} assume ~lk5~0 != 1bv32; {11579#false} is VALID [2018-11-14 16:15:48,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {11579#false} assume !false; {11579#false} is VALID [2018-11-14 16:15:48,308 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-14 16:15:48,308 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:48,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:48,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:48,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:48,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:48,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:48,357 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-14 16:15:48,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:48,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:48,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:48,358 INFO L87 Difference]: Start difference. First operand 513 states and 823 transitions. Second operand 3 states. [2018-11-14 16:15:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:48,722 INFO L93 Difference]: Finished difference Result 769 states and 1229 transitions. [2018-11-14 16:15:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:48,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-14 16:15:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2018-11-14 16:15:48,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2018-11-14 16:15:48,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:48,910 INFO L225 Difference]: With dead ends: 769 [2018-11-14 16:15:48,910 INFO L226 Difference]: Without dead ends: 523 [2018-11-14 16:15:48,911 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-14 16:15:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-11-14 16:15:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2018-11-14 16:15:49,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:49,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand 521 states. [2018-11-14 16:15:49,080 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand 521 states. [2018-11-14 16:15:49,080 INFO L87 Difference]: Start difference. First operand 523 states. Second operand 521 states. [2018-11-14 16:15:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:49,094 INFO L93 Difference]: Finished difference Result 523 states and 824 transitions. [2018-11-14 16:15:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 824 transitions. [2018-11-14 16:15:49,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:49,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:49,095 INFO L74 IsIncluded]: Start isIncluded. First operand 521 states. Second operand 523 states. [2018-11-14 16:15:49,096 INFO L87 Difference]: Start difference. First operand 521 states. Second operand 523 states. [2018-11-14 16:15:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:49,113 INFO L93 Difference]: Finished difference Result 523 states and 824 transitions. [2018-11-14 16:15:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 824 transitions. [2018-11-14 16:15:49,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:49,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:49,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:49,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-11-14 16:15:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 823 transitions. [2018-11-14 16:15:49,132 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 823 transitions. Word has length 25 [2018-11-14 16:15:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:49,133 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 823 transitions. [2018-11-14 16:15:49,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 823 transitions. [2018-11-14 16:15:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:15:49,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:49,134 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-14 16:15:49,135 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:49,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash 848804039, now seen corresponding path program 1 times [2018-11-14 16:15:49,135 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:49,135 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-14 16:15:49,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:49,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:49,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {14045#true} call ULTIMATE.init(); {14045#true} is VALID [2018-11-14 16:15:49,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {14045#true} assume true; {14045#true} is VALID [2018-11-14 16:15:49,253 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14045#true} {14045#true} #198#return; {14045#true} is VALID [2018-11-14 16:15:49,253 INFO L256 TraceCheckUtils]: 3: Hoare triple {14045#true} call #t~ret11 := main(); {14045#true} is VALID [2018-11-14 16:15:49,254 INFO L273 TraceCheckUtils]: 4: Hoare triple {14045#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;havoc ~cond~0; {14045#true} is VALID [2018-11-14 16:15:49,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {14045#true} assume true; {14045#true} is VALID [2018-11-14 16:15:49,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {14045#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {14045#true} is VALID [2018-11-14 16:15:49,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {14045#true} assume !(~cond~0 == 0bv32);~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; {14045#true} is VALID [2018-11-14 16:15:49,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {14045#true} assume !(~p1~0 != 0bv32); {14045#true} is VALID [2018-11-14 16:15:49,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {14045#true} assume !(~p2~0 != 0bv32); {14045#true} is VALID [2018-11-14 16:15:49,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {14045#true} assume !(~p3~0 != 0bv32); {14045#true} is VALID [2018-11-14 16:15:49,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {14045#true} assume !(~p4~0 != 0bv32); {14045#true} is VALID [2018-11-14 16:15:49,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {14045#true} assume !(~p5~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p1~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p2~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,258 INFO L273 TraceCheckUtils]: 20: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p3~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume !(~p4~0 != 0bv32); {14086#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-14 16:15:49,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {14086#(= (_ bv0 32) main_~p5~0)} assume ~p5~0 != 0bv32; {14046#false} is VALID [2018-11-14 16:15:49,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {14046#false} assume ~lk5~0 != 1bv32; {14046#false} is VALID [2018-11-14 16:15:49,261 INFO L273 TraceCheckUtils]: 24: Hoare triple {14046#false} assume !false; {14046#false} is VALID [2018-11-14 16:15:49,261 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-14 16:15:49,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:49,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:49,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:49,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:49,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:49,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:49,289 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-14 16:15:49,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:49,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:49,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:49,290 INFO L87 Difference]: Start difference. First operand 521 states and 823 transitions. Second operand 3 states. [2018-11-14 16:15:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:49,941 INFO L93 Difference]: Finished difference Result 1501 states and 2361 transitions. [2018-11-14 16:15:49,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:49,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 16:15:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2018-11-14 16:15:49,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2018-11-14 16:15:50,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:50,299 INFO L225 Difference]: With dead ends: 1501 [2018-11-14 16:15:50,300 INFO L226 Difference]: Without dead ends: 1003 [2018-11-14 16:15:50,301 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-14 16:15:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-14 16:15:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1001. [2018-11-14 16:15:50,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:50,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand 1001 states. [2018-11-14 16:15:50,642 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand 1001 states. [2018-11-14 16:15:50,642 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand 1001 states. [2018-11-14 16:15:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:50,681 INFO L93 Difference]: Finished difference Result 1003 states and 1544 transitions. [2018-11-14 16:15:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1544 transitions. [2018-11-14 16:15:50,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:50,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:50,684 INFO L74 IsIncluded]: Start isIncluded. First operand 1001 states. Second operand 1003 states. [2018-11-14 16:15:50,684 INFO L87 Difference]: Start difference. First operand 1001 states. Second operand 1003 states. [2018-11-14 16:15:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:50,729 INFO L93 Difference]: Finished difference Result 1003 states and 1544 transitions. [2018-11-14 16:15:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1544 transitions. [2018-11-14 16:15:50,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:50,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:50,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:50,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-14 16:15:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1543 transitions. [2018-11-14 16:15:50,780 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1543 transitions. Word has length 25 [2018-11-14 16:15:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:50,781 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1543 transitions. [2018-11-14 16:15:50,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1543 transitions. [2018-11-14 16:15:50,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:15:50,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:50,782 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-14 16:15:50,782 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:50,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:50,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1435610053, now seen corresponding path program 1 times [2018-11-14 16:15:50,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:50,783 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-14 16:15:50,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:50,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:50,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {18724#true} call ULTIMATE.init(); {18724#true} is VALID [2018-11-14 16:15:50,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {18724#true} assume true; {18724#true} is VALID [2018-11-14 16:15:50,952 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18724#true} {18724#true} #198#return; {18724#true} is VALID [2018-11-14 16:15:50,953 INFO L256 TraceCheckUtils]: 3: Hoare triple {18724#true} call #t~ret11 := main(); {18724#true} is VALID [2018-11-14 16:15:50,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {18724#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;havoc ~cond~0; {18724#true} is VALID [2018-11-14 16:15:50,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {18724#true} assume true; {18724#true} is VALID [2018-11-14 16:15:50,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {18724#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {18724#true} is VALID [2018-11-14 16:15:50,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {18724#true} assume !(~cond~0 == 0bv32);~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; {18724#true} is VALID [2018-11-14 16:15:50,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {18724#true} assume !(~p1~0 != 0bv32); {18724#true} is VALID [2018-11-14 16:15:50,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {18724#true} assume !(~p2~0 != 0bv32); {18724#true} is VALID [2018-11-14 16:15:50,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {18724#true} assume !(~p3~0 != 0bv32); {18724#true} is VALID [2018-11-14 16:15:50,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {18724#true} assume !(~p4~0 != 0bv32); {18724#true} is VALID [2018-11-14 16:15:50,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {18724#true} assume ~p5~0 != 0bv32;~lk5~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,967 INFO L273 TraceCheckUtils]: 22: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p5~0 != 0bv32; {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:50,968 INFO L273 TraceCheckUtils]: 23: Hoare triple {18765#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk5~0 != 1bv32; {18725#false} is VALID [2018-11-14 16:15:50,968 INFO L273 TraceCheckUtils]: 24: Hoare triple {18725#false} assume !false; {18725#false} is VALID [2018-11-14 16:15:50,969 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-14 16:15:50,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:50,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:50,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:50,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:50,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:50,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:50,999 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-14 16:15:50,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:51,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:51,000 INFO L87 Difference]: Start difference. First operand 1001 states and 1543 transitions. Second operand 3 states. [2018-11-14 16:15:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:51,628 INFO L93 Difference]: Finished difference Result 1213 states and 1913 transitions. [2018-11-14 16:15:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:51,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-14 16:15:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-14 16:15:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-14 16:15:51,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-14 16:15:51,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:51,809 INFO L225 Difference]: With dead ends: 1213 [2018-11-14 16:15:51,809 INFO L226 Difference]: Without dead ends: 1211 [2018-11-14 16:15:51,810 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-14 16:15:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-11-14 16:15:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1001. [2018-11-14 16:15:52,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:52,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1211 states. Second operand 1001 states. [2018-11-14 16:15:52,662 INFO L74 IsIncluded]: Start isIncluded. First operand 1211 states. Second operand 1001 states. [2018-11-14 16:15:52,662 INFO L87 Difference]: Start difference. First operand 1211 states. Second operand 1001 states. [2018-11-14 16:15:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:52,712 INFO L93 Difference]: Finished difference Result 1211 states and 1896 transitions. [2018-11-14 16:15:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1896 transitions. [2018-11-14 16:15:52,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:52,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:52,714 INFO L74 IsIncluded]: Start isIncluded. First operand 1001 states. Second operand 1211 states. [2018-11-14 16:15:52,714 INFO L87 Difference]: Start difference. First operand 1001 states. Second operand 1211 states. [2018-11-14 16:15:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:52,777 INFO L93 Difference]: Finished difference Result 1211 states and 1896 transitions. [2018-11-14 16:15:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1896 transitions. [2018-11-14 16:15:52,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:52,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:52,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:52,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-11-14 16:15:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1527 transitions. [2018-11-14 16:15:52,812 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1527 transitions. Word has length 25 [2018-11-14 16:15:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:52,812 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1527 transitions. [2018-11-14 16:15:52,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1527 transitions. [2018-11-14 16:15:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:15:52,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:52,813 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-14 16:15:52,813 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:52,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash 543336178, now seen corresponding path program 1 times [2018-11-14 16:15:52,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:52,814 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-14 16:15:52,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:52,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:53,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {23531#true} call ULTIMATE.init(); {23531#true} is VALID [2018-11-14 16:15:53,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {23531#true} assume true; {23531#true} is VALID [2018-11-14 16:15:53,030 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23531#true} {23531#true} #198#return; {23531#true} is VALID [2018-11-14 16:15:53,031 INFO L256 TraceCheckUtils]: 3: Hoare triple {23531#true} call #t~ret11 := main(); {23531#true} is VALID [2018-11-14 16:15:53,031 INFO L273 TraceCheckUtils]: 4: Hoare triple {23531#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;havoc ~cond~0; {23531#true} is VALID [2018-11-14 16:15:53,031 INFO L273 TraceCheckUtils]: 5: Hoare triple {23531#true} assume true; {23531#true} is VALID [2018-11-14 16:15:53,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {23531#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {23531#true} is VALID [2018-11-14 16:15:53,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {23531#true} assume !(~cond~0 == 0bv32);~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; {23531#true} is VALID [2018-11-14 16:15:53,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {23531#true} assume !(~p1~0 != 0bv32); {23531#true} is VALID [2018-11-14 16:15:53,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {23531#true} assume !(~p2~0 != 0bv32); {23531#true} is VALID [2018-11-14 16:15:53,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {23531#true} assume !(~p3~0 != 0bv32); {23531#true} is VALID [2018-11-14 16:15:53,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {23531#true} assume !(~p4~0 != 0bv32); {23531#true} is VALID [2018-11-14 16:15:53,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {23531#true} assume !(~p5~0 != 0bv32); {23531#true} is VALID [2018-11-14 16:15:53,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {23531#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,034 INFO L273 TraceCheckUtils]: 16: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,036 INFO L273 TraceCheckUtils]: 23: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p6~0 != 0bv32; {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:15:53,037 INFO L273 TraceCheckUtils]: 24: Hoare triple {23575#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk6~0 != 1bv32; {23532#false} is VALID [2018-11-14 16:15:53,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {23532#false} assume !false; {23532#false} is VALID [2018-11-14 16:15:53,039 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-14 16:15:53,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:53,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:53,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:15:53,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:53,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:53,065 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-14 16:15:53,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:53,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:53,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:53,066 INFO L87 Difference]: Start difference. First operand 1001 states and 1527 transitions. Second operand 3 states. [2018-11-14 16:15:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:53,968 INFO L93 Difference]: Finished difference Result 1789 states and 2777 transitions. [2018-11-14 16:15:53,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:53,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:15:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:53,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2018-11-14 16:15:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2018-11-14 16:15:53,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2018-11-14 16:15:54,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:54,214 INFO L225 Difference]: With dead ends: 1789 [2018-11-14 16:15:54,214 INFO L226 Difference]: Without dead ends: 1787 [2018-11-14 16:15:54,215 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-14 16:15:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-11-14 16:15:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1433. [2018-11-14 16:15:55,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:55,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1787 states. Second operand 1433 states. [2018-11-14 16:15:55,425 INFO L74 IsIncluded]: Start isIncluded. First operand 1787 states. Second operand 1433 states. [2018-11-14 16:15:55,426 INFO L87 Difference]: Start difference. First operand 1787 states. Second operand 1433 states. [2018-11-14 16:15:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:55,554 INFO L93 Difference]: Finished difference Result 1787 states and 2744 transitions. [2018-11-14 16:15:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2744 transitions. [2018-11-14 16:15:55,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:55,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:55,557 INFO L74 IsIncluded]: Start isIncluded. First operand 1433 states. Second operand 1787 states. [2018-11-14 16:15:55,557 INFO L87 Difference]: Start difference. First operand 1433 states. Second operand 1787 states. [2018-11-14 16:15:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:55,672 INFO L93 Difference]: Finished difference Result 1787 states and 2744 transitions. [2018-11-14 16:15:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2744 transitions. [2018-11-14 16:15:55,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:55,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:55,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:55,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-11-14 16:15:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2135 transitions. [2018-11-14 16:15:55,737 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2135 transitions. Word has length 26 [2018-11-14 16:15:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:55,737 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2135 transitions. [2018-11-14 16:15:55,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2135 transitions. [2018-11-14 16:15:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:15:55,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:55,739 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-14 16:15:55,739 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:55,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:55,739 INFO L82 PathProgramCache]: Analyzing trace with hash -43469836, now seen corresponding path program 1 times [2018-11-14 16:15:55,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:55,740 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-14 16:15:55,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:55,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:55,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {30517#true} call ULTIMATE.init(); {30517#true} is VALID [2018-11-14 16:15:55,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {30517#true} assume true; {30517#true} is VALID [2018-11-14 16:15:55,831 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {30517#true} {30517#true} #198#return; {30517#true} is VALID [2018-11-14 16:15:55,831 INFO L256 TraceCheckUtils]: 3: Hoare triple {30517#true} call #t~ret11 := main(); {30517#true} is VALID [2018-11-14 16:15:55,831 INFO L273 TraceCheckUtils]: 4: Hoare triple {30517#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;havoc ~cond~0; {30517#true} is VALID [2018-11-14 16:15:55,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {30517#true} assume true; {30517#true} is VALID [2018-11-14 16:15:55,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {30517#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {30517#true} is VALID [2018-11-14 16:15:55,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {30517#true} assume !(~cond~0 == 0bv32);~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; {30517#true} is VALID [2018-11-14 16:15:55,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {30517#true} assume !(~p1~0 != 0bv32); {30517#true} is VALID [2018-11-14 16:15:55,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {30517#true} assume !(~p2~0 != 0bv32); {30517#true} is VALID [2018-11-14 16:15:55,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {30517#true} assume !(~p3~0 != 0bv32); {30517#true} is VALID [2018-11-14 16:15:55,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {30517#true} assume !(~p4~0 != 0bv32); {30517#true} is VALID [2018-11-14 16:15:55,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {30517#true} assume !(~p5~0 != 0bv32); {30517#true} is VALID [2018-11-14 16:15:55,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {30517#true} assume !(~p6~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p1~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p2~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p3~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p4~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume !(~p5~0 != 0bv32); {30561#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-14 16:15:55,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {30561#(= (_ bv0 32) main_~p6~0)} assume ~p6~0 != 0bv32; {30518#false} is VALID [2018-11-14 16:15:55,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {30518#false} assume ~lk6~0 != 1bv32; {30518#false} is VALID [2018-11-14 16:15:55,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {30518#false} assume !false; {30518#false} is VALID [2018-11-14 16:15:55,849 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-14 16:15:55,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:55,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:55,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:55,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:15:55,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:55,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:55,876 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-14 16:15:55,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:55,877 INFO L87 Difference]: Start difference. First operand 1433 states and 2135 transitions. Second operand 3 states. [2018-11-14 16:15:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:57,024 INFO L93 Difference]: Finished difference Result 3357 states and 5017 transitions. [2018-11-14 16:15:57,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:57,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-14 16:15:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-14 16:15:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2018-11-14 16:15:57,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 179 transitions. [2018-11-14 16:15:57,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:15:57,409 INFO L225 Difference]: With dead ends: 3357 [2018-11-14 16:15:57,409 INFO L226 Difference]: Without dead ends: 1947 [2018-11-14 16:15:57,412 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-14 16:15:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2018-11-14 16:15:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1945. [2018-11-14 16:15:58,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:15:58,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1947 states. Second operand 1945 states. [2018-11-14 16:15:58,177 INFO L74 IsIncluded]: Start isIncluded. First operand 1947 states. Second operand 1945 states. [2018-11-14 16:15:58,177 INFO L87 Difference]: Start difference. First operand 1947 states. Second operand 1945 states. [2018-11-14 16:15:58,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:58,292 INFO L93 Difference]: Finished difference Result 1947 states and 2856 transitions. [2018-11-14 16:15:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2856 transitions. [2018-11-14 16:15:58,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:58,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:58,294 INFO L74 IsIncluded]: Start isIncluded. First operand 1945 states. Second operand 1947 states. [2018-11-14 16:15:58,294 INFO L87 Difference]: Start difference. First operand 1945 states. Second operand 1947 states. [2018-11-14 16:15:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:58,417 INFO L93 Difference]: Finished difference Result 1947 states and 2856 transitions. [2018-11-14 16:15:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2856 transitions. [2018-11-14 16:15:58,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:15:58,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:15:58,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:15:58,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:15:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-14 16:15:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2855 transitions. [2018-11-14 16:15:58,534 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2855 transitions. Word has length 26 [2018-11-14 16:15:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:15:58,534 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 2855 transitions. [2018-11-14 16:15:58,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:15:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2855 transitions. [2018-11-14 16:15:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:15:58,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:15:58,536 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-14 16:15:58,536 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:15:58,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:15:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash -336232580, now seen corresponding path program 1 times [2018-11-14 16:15:58,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:15:58,536 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-14 16:15:58,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:15:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:15:58,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:15:58,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {39967#true} call ULTIMATE.init(); {39967#true} is VALID [2018-11-14 16:15:58,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {39967#true} assume true; {39967#true} is VALID [2018-11-14 16:15:58,656 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {39967#true} {39967#true} #198#return; {39967#true} is VALID [2018-11-14 16:15:58,657 INFO L256 TraceCheckUtils]: 3: Hoare triple {39967#true} call #t~ret11 := main(); {39967#true} is VALID [2018-11-14 16:15:58,657 INFO L273 TraceCheckUtils]: 4: Hoare triple {39967#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;havoc ~cond~0; {39967#true} is VALID [2018-11-14 16:15:58,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {39967#true} assume true; {39967#true} is VALID [2018-11-14 16:15:58,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {39967#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {39967#true} is VALID [2018-11-14 16:15:58,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {39967#true} assume !(~cond~0 == 0bv32);~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; {39967#true} is VALID [2018-11-14 16:15:58,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {39967#true} assume !(~p1~0 != 0bv32); {39967#true} is VALID [2018-11-14 16:15:58,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {39967#true} assume !(~p2~0 != 0bv32); {39967#true} is VALID [2018-11-14 16:15:58,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {39967#true} assume !(~p3~0 != 0bv32); {39967#true} is VALID [2018-11-14 16:15:58,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {39967#true} assume !(~p4~0 != 0bv32); {39967#true} is VALID [2018-11-14 16:15:58,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {39967#true} assume !(~p5~0 != 0bv32); {39967#true} is VALID [2018-11-14 16:15:58,661 INFO L273 TraceCheckUtils]: 13: Hoare triple {39967#true} assume ~p6~0 != 0bv32;~lk6~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,662 INFO L273 TraceCheckUtils]: 15: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p1~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,667 INFO L273 TraceCheckUtils]: 19: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p2~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,669 INFO L273 TraceCheckUtils]: 20: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p3~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p4~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,672 INFO L273 TraceCheckUtils]: 22: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p5~0 != 0bv32); {40011#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-14 16:15:58,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {40011#(not (= (_ bv0 32) main_~p6~0))} assume !(~p6~0 != 0bv32); {39968#false} is VALID [2018-11-14 16:15:58,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {39968#false} assume ~p7~0 != 0bv32; {39968#false} is VALID [2018-11-14 16:15:58,672 INFO L273 TraceCheckUtils]: 25: Hoare triple {39968#false} assume ~lk7~0 != 1bv32; {39968#false} is VALID [2018-11-14 16:15:58,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {39968#false} assume !false; {39968#false} is VALID [2018-11-14 16:15:58,673 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-14 16:15:58,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:15:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:15:58,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:15:58,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:15:58,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:15:58,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:15:58,700 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-14 16:15:58,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:15:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:15:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:15:58,701 INFO L87 Difference]: Start difference. First operand 1945 states and 2855 transitions. Second operand 3 states. [2018-11-14 16:15:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:15:59,987 INFO L93 Difference]: Finished difference Result 2941 states and 4313 transitions. [2018-11-14 16:15:59,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:15:59,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:15:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:15:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-14 16:15:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:15:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-14 16:15:59,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-14 16:16:00,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:00,403 INFO L225 Difference]: With dead ends: 2941 [2018-11-14 16:16:00,403 INFO L226 Difference]: Without dead ends: 1995 [2018-11-14 16:16:00,405 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-14 16:16:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2018-11-14 16:16:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2018-11-14 16:16:01,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:01,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1995 states. Second operand 1993 states. [2018-11-14 16:16:01,374 INFO L74 IsIncluded]: Start isIncluded. First operand 1995 states. Second operand 1993 states. [2018-11-14 16:16:01,374 INFO L87 Difference]: Start difference. First operand 1995 states. Second operand 1993 states. [2018-11-14 16:16:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:01,523 INFO L93 Difference]: Finished difference Result 1995 states and 2888 transitions. [2018-11-14 16:16:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2888 transitions. [2018-11-14 16:16:01,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:01,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:01,526 INFO L74 IsIncluded]: Start isIncluded. First operand 1993 states. Second operand 1995 states. [2018-11-14 16:16:01,526 INFO L87 Difference]: Start difference. First operand 1993 states. Second operand 1995 states. [2018-11-14 16:16:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:01,684 INFO L93 Difference]: Finished difference Result 1995 states and 2888 transitions. [2018-11-14 16:16:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2888 transitions. [2018-11-14 16:16:01,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:01,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:01,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:01,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2018-11-14 16:16:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 2887 transitions. [2018-11-14 16:16:01,847 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 2887 transitions. Word has length 27 [2018-11-14 16:16:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:01,848 INFO L480 AbstractCegarLoop]: Abstraction has 1993 states and 2887 transitions. [2018-11-14 16:16:01,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2887 transitions. [2018-11-14 16:16:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:16:01,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:01,849 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-14 16:16:01,849 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:01,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349830, now seen corresponding path program 1 times [2018-11-14 16:16:01,850 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:01,850 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-14 16:16:01,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:01,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:02,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {49148#true} call ULTIMATE.init(); {49148#true} is VALID [2018-11-14 16:16:02,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {49148#true} assume true; {49148#true} is VALID [2018-11-14 16:16:02,008 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {49148#true} {49148#true} #198#return; {49148#true} is VALID [2018-11-14 16:16:02,009 INFO L256 TraceCheckUtils]: 3: Hoare triple {49148#true} call #t~ret11 := main(); {49148#true} is VALID [2018-11-14 16:16:02,009 INFO L273 TraceCheckUtils]: 4: Hoare triple {49148#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;havoc ~cond~0; {49148#true} is VALID [2018-11-14 16:16:02,009 INFO L273 TraceCheckUtils]: 5: Hoare triple {49148#true} assume true; {49148#true} is VALID [2018-11-14 16:16:02,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {49148#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {49148#true} is VALID [2018-11-14 16:16:02,010 INFO L273 TraceCheckUtils]: 7: Hoare triple {49148#true} assume !(~cond~0 == 0bv32);~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; {49148#true} is VALID [2018-11-14 16:16:02,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {49148#true} assume !(~p1~0 != 0bv32); {49148#true} is VALID [2018-11-14 16:16:02,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {49148#true} assume !(~p2~0 != 0bv32); {49148#true} is VALID [2018-11-14 16:16:02,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {49148#true} assume !(~p3~0 != 0bv32); {49148#true} is VALID [2018-11-14 16:16:02,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {49148#true} assume !(~p4~0 != 0bv32); {49148#true} is VALID [2018-11-14 16:16:02,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {49148#true} assume !(~p5~0 != 0bv32); {49148#true} is VALID [2018-11-14 16:16:02,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {49148#true} assume !(~p6~0 != 0bv32); {49148#true} is VALID [2018-11-14 16:16:02,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {49148#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,027 INFO L273 TraceCheckUtils]: 21: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p7~0 != 0bv32; {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:02,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {49195#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk7~0 != 1bv32; {49149#false} is VALID [2018-11-14 16:16:02,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {49149#false} assume !false; {49149#false} is VALID [2018-11-14 16:16:02,029 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-14 16:16:02,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:02,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:02,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:02,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:02,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:02,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:02,061 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-14 16:16:02,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:02,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:02,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:02,062 INFO L87 Difference]: Start difference. First operand 1993 states and 2887 transitions. Second operand 3 states. [2018-11-14 16:16:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:03,684 INFO L93 Difference]: Finished difference Result 3469 states and 5097 transitions. [2018-11-14 16:16:03,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:03,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-14 16:16:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-14 16:16:03,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2018-11-14 16:16:03,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:04,332 INFO L225 Difference]: With dead ends: 3469 [2018-11-14 16:16:04,332 INFO L226 Difference]: Without dead ends: 3467 [2018-11-14 16:16:04,333 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-14 16:16:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-14 16:16:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 2889. [2018-11-14 16:16:04,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:04,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3467 states. Second operand 2889 states. [2018-11-14 16:16:04,990 INFO L74 IsIncluded]: Start isIncluded. First operand 3467 states. Second operand 2889 states. [2018-11-14 16:16:04,990 INFO L87 Difference]: Start difference. First operand 3467 states. Second operand 2889 states. [2018-11-14 16:16:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:05,438 INFO L93 Difference]: Finished difference Result 3467 states and 5032 transitions. [2018-11-14 16:16:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 5032 transitions. [2018-11-14 16:16:05,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:05,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:05,442 INFO L74 IsIncluded]: Start isIncluded. First operand 2889 states. Second operand 3467 states. [2018-11-14 16:16:05,442 INFO L87 Difference]: Start difference. First operand 2889 states. Second operand 3467 states. [2018-11-14 16:16:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:05,894 INFO L93 Difference]: Finished difference Result 3467 states and 5032 transitions. [2018-11-14 16:16:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 5032 transitions. [2018-11-14 16:16:05,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:05,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:05,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:05,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2889 states. [2018-11-14 16:16:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 4071 transitions. [2018-11-14 16:16:06,211 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 4071 transitions. Word has length 27 [2018-11-14 16:16:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:06,212 INFO L480 AbstractCegarLoop]: Abstraction has 2889 states and 4071 transitions. [2018-11-14 16:16:06,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 4071 transitions. [2018-11-14 16:16:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:16:06,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:06,214 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-14 16:16:06,214 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:06,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:06,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1934155844, now seen corresponding path program 1 times [2018-11-14 16:16:06,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:06,215 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-14 16:16:06,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:06,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:06,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {62729#true} call ULTIMATE.init(); {62729#true} is VALID [2018-11-14 16:16:06,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {62729#true} assume true; {62729#true} is VALID [2018-11-14 16:16:06,460 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {62729#true} {62729#true} #198#return; {62729#true} is VALID [2018-11-14 16:16:06,460 INFO L256 TraceCheckUtils]: 3: Hoare triple {62729#true} call #t~ret11 := main(); {62729#true} is VALID [2018-11-14 16:16:06,460 INFO L273 TraceCheckUtils]: 4: Hoare triple {62729#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;havoc ~cond~0; {62729#true} is VALID [2018-11-14 16:16:06,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {62729#true} assume true; {62729#true} is VALID [2018-11-14 16:16:06,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {62729#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {62729#true} is VALID [2018-11-14 16:16:06,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {62729#true} assume !(~cond~0 == 0bv32);~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; {62729#true} is VALID [2018-11-14 16:16:06,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {62729#true} assume !(~p1~0 != 0bv32); {62729#true} is VALID [2018-11-14 16:16:06,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {62729#true} assume !(~p2~0 != 0bv32); {62729#true} is VALID [2018-11-14 16:16:06,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {62729#true} assume !(~p3~0 != 0bv32); {62729#true} is VALID [2018-11-14 16:16:06,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {62729#true} assume !(~p4~0 != 0bv32); {62729#true} is VALID [2018-11-14 16:16:06,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {62729#true} assume !(~p5~0 != 0bv32); {62729#true} is VALID [2018-11-14 16:16:06,462 INFO L273 TraceCheckUtils]: 13: Hoare triple {62729#true} assume !(~p6~0 != 0bv32); {62729#true} is VALID [2018-11-14 16:16:06,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {62729#true} assume !(~p7~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,463 INFO L273 TraceCheckUtils]: 15: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,464 INFO L273 TraceCheckUtils]: 17: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p1~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,464 INFO L273 TraceCheckUtils]: 19: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p2~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p3~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p4~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p5~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,466 INFO L273 TraceCheckUtils]: 23: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume !(~p6~0 != 0bv32); {62776#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-14 16:16:06,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {62776#(= (_ bv0 32) main_~p7~0)} assume ~p7~0 != 0bv32; {62730#false} is VALID [2018-11-14 16:16:06,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {62730#false} assume ~lk7~0 != 1bv32; {62730#false} is VALID [2018-11-14 16:16:06,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {62730#false} assume !false; {62730#false} is VALID [2018-11-14 16:16:06,467 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-14 16:16:06,467 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:06,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:06,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:06,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:06,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:06,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:06,492 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-14 16:16:06,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:06,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:06,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:06,493 INFO L87 Difference]: Start difference. First operand 2889 states and 4071 transitions. Second operand 3 states. [2018-11-14 16:16:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:10,076 INFO L93 Difference]: Finished difference Result 6669 states and 9385 transitions. [2018-11-14 16:16:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:10,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:16:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-14 16:16:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2018-11-14 16:16:10,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 176 transitions. [2018-11-14 16:16:10,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:10,941 INFO L225 Difference]: With dead ends: 6669 [2018-11-14 16:16:10,941 INFO L226 Difference]: Without dead ends: 3851 [2018-11-14 16:16:10,946 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-14 16:16:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-14 16:16:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3849. [2018-11-14 16:16:11,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:11,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3851 states. Second operand 3849 states. [2018-11-14 16:16:11,954 INFO L74 IsIncluded]: Start isIncluded. First operand 3851 states. Second operand 3849 states. [2018-11-14 16:16:11,954 INFO L87 Difference]: Start difference. First operand 3851 states. Second operand 3849 states. [2018-11-14 16:16:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:12,509 INFO L93 Difference]: Finished difference Result 3851 states and 5320 transitions. [2018-11-14 16:16:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5320 transitions. [2018-11-14 16:16:12,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:12,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:12,513 INFO L74 IsIncluded]: Start isIncluded. First operand 3849 states. Second operand 3851 states. [2018-11-14 16:16:12,513 INFO L87 Difference]: Start difference. First operand 3849 states. Second operand 3851 states. [2018-11-14 16:16:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:13,086 INFO L93 Difference]: Finished difference Result 3851 states and 5320 transitions. [2018-11-14 16:16:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5320 transitions. [2018-11-14 16:16:13,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:13,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:13,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:13,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3849 states. [2018-11-14 16:16:13,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5319 transitions. [2018-11-14 16:16:13,706 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5319 transitions. Word has length 27 [2018-11-14 16:16:13,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:13,707 INFO L480 AbstractCegarLoop]: Abstraction has 3849 states and 5319 transitions. [2018-11-14 16:16:13,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:13,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5319 transitions. [2018-11-14 16:16:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:16:13,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:13,709 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-14 16:16:13,710 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:13,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:13,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1182043657, now seen corresponding path program 1 times [2018-11-14 16:16:13,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:13,710 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-14 16:16:13,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:13,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:13,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {81366#true} call ULTIMATE.init(); {81366#true} is VALID [2018-11-14 16:16:13,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {81366#true} assume true; {81366#true} is VALID [2018-11-14 16:16:13,804 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {81366#true} {81366#true} #198#return; {81366#true} is VALID [2018-11-14 16:16:13,804 INFO L256 TraceCheckUtils]: 3: Hoare triple {81366#true} call #t~ret11 := main(); {81366#true} is VALID [2018-11-14 16:16:13,804 INFO L273 TraceCheckUtils]: 4: Hoare triple {81366#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;havoc ~cond~0; {81366#true} is VALID [2018-11-14 16:16:13,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {81366#true} assume true; {81366#true} is VALID [2018-11-14 16:16:13,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {81366#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {81366#true} is VALID [2018-11-14 16:16:13,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {81366#true} assume !(~cond~0 == 0bv32);~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; {81366#true} is VALID [2018-11-14 16:16:13,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {81366#true} assume !(~p1~0 != 0bv32); {81366#true} is VALID [2018-11-14 16:16:13,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {81366#true} assume !(~p2~0 != 0bv32); {81366#true} is VALID [2018-11-14 16:16:13,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {81366#true} assume !(~p3~0 != 0bv32); {81366#true} is VALID [2018-11-14 16:16:13,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {81366#true} assume !(~p4~0 != 0bv32); {81366#true} is VALID [2018-11-14 16:16:13,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {81366#true} assume !(~p5~0 != 0bv32); {81366#true} is VALID [2018-11-14 16:16:13,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {81366#true} assume !(~p6~0 != 0bv32); {81366#true} is VALID [2018-11-14 16:16:13,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {81366#true} assume ~p7~0 != 0bv32;~lk7~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,811 INFO L273 TraceCheckUtils]: 18: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p1~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p2~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p3~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p4~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,812 INFO L273 TraceCheckUtils]: 22: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p5~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,813 INFO L273 TraceCheckUtils]: 23: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p6~0 != 0bv32); {81413#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-14 16:16:13,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {81413#(not (= (_ bv0 32) main_~p7~0))} assume !(~p7~0 != 0bv32); {81367#false} is VALID [2018-11-14 16:16:13,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {81367#false} assume ~p8~0 != 0bv32; {81367#false} is VALID [2018-11-14 16:16:13,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {81367#false} assume ~lk8~0 != 1bv32; {81367#false} is VALID [2018-11-14 16:16:13,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {81367#false} assume !false; {81367#false} is VALID [2018-11-14 16:16:13,814 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-14 16:16:13,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:13,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:13,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:13,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:13,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:13,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:13,842 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-14 16:16:13,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:13,843 INFO L87 Difference]: Start difference. First operand 3849 states and 5319 transitions. Second operand 3 states. [2018-11-14 16:16:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:16,416 INFO L93 Difference]: Finished difference Result 5773 states and 7945 transitions. [2018-11-14 16:16:16,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:16,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-14 16:16:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2018-11-14 16:16:16,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2018-11-14 16:16:16,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:17,306 INFO L225 Difference]: With dead ends: 5773 [2018-11-14 16:16:17,307 INFO L226 Difference]: Without dead ends: 3915 [2018-11-14 16:16:17,310 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-14 16:16:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2018-11-14 16:16:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3913. [2018-11-14 16:16:19,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:19,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3915 states. Second operand 3913 states. [2018-11-14 16:16:19,263 INFO L74 IsIncluded]: Start isIncluded. First operand 3915 states. Second operand 3913 states. [2018-11-14 16:16:19,264 INFO L87 Difference]: Start difference. First operand 3915 states. Second operand 3913 states. [2018-11-14 16:16:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:19,821 INFO L93 Difference]: Finished difference Result 3915 states and 5320 transitions. [2018-11-14 16:16:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 5320 transitions. [2018-11-14 16:16:19,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:19,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:19,826 INFO L74 IsIncluded]: Start isIncluded. First operand 3913 states. Second operand 3915 states. [2018-11-14 16:16:19,826 INFO L87 Difference]: Start difference. First operand 3913 states. Second operand 3915 states. [2018-11-14 16:16:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:20,406 INFO L93 Difference]: Finished difference Result 3915 states and 5320 transitions. [2018-11-14 16:16:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 5320 transitions. [2018-11-14 16:16:20,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:20,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:20,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:20,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-14 16:16:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 5319 transitions. [2018-11-14 16:16:21,050 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 5319 transitions. Word has length 28 [2018-11-14 16:16:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:21,050 INFO L480 AbstractCegarLoop]: Abstraction has 3913 states and 5319 transitions. [2018-11-14 16:16:21,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 5319 transitions. [2018-11-14 16:16:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:16:21,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:21,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, 1, 1, 1] [2018-11-14 16:16:21,053 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:21,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:21,053 INFO L82 PathProgramCache]: Analyzing trace with hash 170926407, now seen corresponding path program 1 times [2018-11-14 16:16:21,054 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:21,054 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-14 16:16:21,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:21,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:21,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {99302#true} call ULTIMATE.init(); {99302#true} is VALID [2018-11-14 16:16:21,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {99302#true} assume true; {99302#true} is VALID [2018-11-14 16:16:21,157 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {99302#true} {99302#true} #198#return; {99302#true} is VALID [2018-11-14 16:16:21,157 INFO L256 TraceCheckUtils]: 3: Hoare triple {99302#true} call #t~ret11 := main(); {99302#true} is VALID [2018-11-14 16:16:21,158 INFO L273 TraceCheckUtils]: 4: Hoare triple {99302#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;havoc ~cond~0; {99302#true} is VALID [2018-11-14 16:16:21,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {99302#true} assume true; {99302#true} is VALID [2018-11-14 16:16:21,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {99302#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {99302#true} assume !(~cond~0 == 0bv32);~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; {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {99302#true} assume !(~p1~0 != 0bv32); {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {99302#true} assume !(~p2~0 != 0bv32); {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {99302#true} assume !(~p3~0 != 0bv32); {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {99302#true} assume !(~p4~0 != 0bv32); {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {99302#true} assume !(~p5~0 != 0bv32); {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {99302#true} assume !(~p6~0 != 0bv32); {99302#true} is VALID [2018-11-14 16:16:21,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {99302#true} assume !(~p7~0 != 0bv32); {99302#true} is VALID [2018-11-14 16:16:21,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {99302#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p1~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p2~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p3~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,162 INFO L273 TraceCheckUtils]: 21: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p4~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p5~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,163 INFO L273 TraceCheckUtils]: 23: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p6~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(~p7~0 != 0bv32); {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~p8~0 != 0bv32; {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:16:21,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {99352#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~lk8~0 != 1bv32; {99303#false} is VALID [2018-11-14 16:16:21,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {99303#false} assume !false; {99303#false} is VALID [2018-11-14 16:16:21,167 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-14 16:16:21,167 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:21,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:21,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:21,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:21,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:21,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:21,232 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-14 16:16:21,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:21,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:21,233 INFO L87 Difference]: Start difference. First operand 3913 states and 5319 transitions. Second operand 3 states. [2018-11-14 16:16:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:25,750 INFO L93 Difference]: Finished difference Result 6669 states and 9161 transitions. [2018-11-14 16:16:25,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:25,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:25,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 16:16:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-14 16:16:25,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-14 16:16:25,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:27,746 INFO L225 Difference]: With dead ends: 6669 [2018-11-14 16:16:27,746 INFO L226 Difference]: Without dead ends: 6667 [2018-11-14 16:16:27,750 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-14 16:16:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2018-11-14 16:16:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5769. [2018-11-14 16:16:29,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:29,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6667 states. Second operand 5769 states. [2018-11-14 16:16:29,691 INFO L74 IsIncluded]: Start isIncluded. First operand 6667 states. Second operand 5769 states. [2018-11-14 16:16:29,691 INFO L87 Difference]: Start difference. First operand 6667 states. Second operand 5769 states. [2018-11-14 16:16:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:31,425 INFO L93 Difference]: Finished difference Result 6667 states and 9032 transitions. [2018-11-14 16:16:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 9032 transitions. [2018-11-14 16:16:31,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:31,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:31,433 INFO L74 IsIncluded]: Start isIncluded. First operand 5769 states. Second operand 6667 states. [2018-11-14 16:16:31,433 INFO L87 Difference]: Start difference. First operand 5769 states. Second operand 6667 states. [2018-11-14 16:16:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:33,140 INFO L93 Difference]: Finished difference Result 6667 states and 9032 transitions. [2018-11-14 16:16:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 9032 transitions. [2018-11-14 16:16:33,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:33,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:33,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:33,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-14 16:16:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7623 transitions. [2018-11-14 16:16:34,495 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7623 transitions. Word has length 28 [2018-11-14 16:16:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:34,495 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 7623 transitions. [2018-11-14 16:16:34,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7623 transitions. [2018-11-14 16:16:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:16:34,498 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:34,499 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-14 16:16:34,499 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:34,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:34,499 INFO L82 PathProgramCache]: Analyzing trace with hash -415879607, now seen corresponding path program 1 times [2018-11-14 16:16:34,499 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:34,499 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-14 16:16:34,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:34,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:34,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {125558#true} call ULTIMATE.init(); {125558#true} is VALID [2018-11-14 16:16:34,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {125558#true} assume true; {125558#true} is VALID [2018-11-14 16:16:34,605 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {125558#true} {125558#true} #198#return; {125558#true} is VALID [2018-11-14 16:16:34,606 INFO L256 TraceCheckUtils]: 3: Hoare triple {125558#true} call #t~ret11 := main(); {125558#true} is VALID [2018-11-14 16:16:34,606 INFO L273 TraceCheckUtils]: 4: Hoare triple {125558#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;havoc ~cond~0; {125558#true} is VALID [2018-11-14 16:16:34,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {125558#true} assume true; {125558#true} is VALID [2018-11-14 16:16:34,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {125558#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {125558#true} is VALID [2018-11-14 16:16:34,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {125558#true} assume !(~cond~0 == 0bv32);~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; {125558#true} is VALID [2018-11-14 16:16:34,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {125558#true} assume !(~p1~0 != 0bv32); {125558#true} is VALID [2018-11-14 16:16:34,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {125558#true} assume !(~p2~0 != 0bv32); {125558#true} is VALID [2018-11-14 16:16:34,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {125558#true} assume !(~p3~0 != 0bv32); {125558#true} is VALID [2018-11-14 16:16:34,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {125558#true} assume !(~p4~0 != 0bv32); {125558#true} is VALID [2018-11-14 16:16:34,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {125558#true} assume !(~p5~0 != 0bv32); {125558#true} is VALID [2018-11-14 16:16:34,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {125558#true} assume !(~p6~0 != 0bv32); {125558#true} is VALID [2018-11-14 16:16:34,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {125558#true} assume !(~p7~0 != 0bv32); {125558#true} is VALID [2018-11-14 16:16:34,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {125558#true} assume !(~p8~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p1~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p2~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p3~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p4~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p5~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p6~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume !(~p7~0 != 0bv32); {125608#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-14 16:16:34,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {125608#(= (_ bv0 32) main_~p8~0)} assume ~p8~0 != 0bv32; {125559#false} is VALID [2018-11-14 16:16:34,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {125559#false} assume ~lk8~0 != 1bv32; {125559#false} is VALID [2018-11-14 16:16:34,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {125559#false} assume !false; {125559#false} is VALID [2018-11-14 16:16:34,615 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-14 16:16:34,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:34,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:34,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:34,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:34,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:34,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:34,642 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-14 16:16:34,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:34,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:34,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:34,643 INFO L87 Difference]: Start difference. First operand 5769 states and 7623 transitions. Second operand 3 states. [2018-11-14 16:16:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:45,710 INFO L93 Difference]: Finished difference Result 13197 states and 17353 transitions. [2018-11-14 16:16:45,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:16:45,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-14 16:16:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:16:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-14 16:16:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:16:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2018-11-14 16:16:45,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 173 transitions. [2018-11-14 16:16:45,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:16:48,200 INFO L225 Difference]: With dead ends: 13197 [2018-11-14 16:16:48,200 INFO L226 Difference]: Without dead ends: 7563 [2018-11-14 16:16:48,206 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-14 16:16:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2018-11-14 16:16:52,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 7561. [2018-11-14 16:16:52,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:16:52,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7563 states. Second operand 7561 states. [2018-11-14 16:16:52,021 INFO L74 IsIncluded]: Start isIncluded. First operand 7563 states. Second operand 7561 states. [2018-11-14 16:16:52,021 INFO L87 Difference]: Start difference. First operand 7563 states. Second operand 7561 states. [2018-11-14 16:16:54,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:54,205 INFO L93 Difference]: Finished difference Result 7563 states and 9736 transitions. [2018-11-14 16:16:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7563 states and 9736 transitions. [2018-11-14 16:16:54,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:54,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:54,211 INFO L74 IsIncluded]: Start isIncluded. First operand 7561 states. Second operand 7563 states. [2018-11-14 16:16:54,211 INFO L87 Difference]: Start difference. First operand 7561 states. Second operand 7563 states. [2018-11-14 16:16:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:16:56,436 INFO L93 Difference]: Finished difference Result 7563 states and 9736 transitions. [2018-11-14 16:16:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 7563 states and 9736 transitions. [2018-11-14 16:16:56,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:16:56,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:16:56,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:16:56,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:16:56,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7561 states. [2018-11-14 16:16:58,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 9735 transitions. [2018-11-14 16:16:58,884 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 9735 transitions. Word has length 28 [2018-11-14 16:16:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:16:58,884 INFO L480 AbstractCegarLoop]: Abstraction has 7561 states and 9735 transitions. [2018-11-14 16:16:58,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:16:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 9735 transitions. [2018-11-14 16:16:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:16:58,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:16:58,887 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-14 16:16:58,888 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:16:58,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:16:58,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1003967089, now seen corresponding path program 1 times [2018-11-14 16:16:58,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:16:58,888 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-14 16:16:58,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:16:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:16:58,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:16:58,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {162182#true} call ULTIMATE.init(); {162182#true} is VALID [2018-11-14 16:16:58,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {162182#true} assume true; {162182#true} is VALID [2018-11-14 16:16:58,993 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {162182#true} {162182#true} #198#return; {162182#true} is VALID [2018-11-14 16:16:58,993 INFO L256 TraceCheckUtils]: 3: Hoare triple {162182#true} call #t~ret11 := main(); {162182#true} is VALID [2018-11-14 16:16:58,993 INFO L273 TraceCheckUtils]: 4: Hoare triple {162182#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;havoc ~cond~0; {162182#true} is VALID [2018-11-14 16:16:58,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {162182#true} assume true; {162182#true} is VALID [2018-11-14 16:16:58,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {162182#true} assume !false;~cond~0 := #t~nondet10;havoc #t~nondet10; {162182#true} is VALID [2018-11-14 16:16:58,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {162182#true} assume !(~cond~0 == 0bv32);~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; {162182#true} is VALID [2018-11-14 16:16:58,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {162182#true} assume !(~p1~0 != 0bv32); {162182#true} is VALID [2018-11-14 16:16:58,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {162182#true} assume !(~p2~0 != 0bv32); {162182#true} is VALID [2018-11-14 16:16:58,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {162182#true} assume !(~p3~0 != 0bv32); {162182#true} is VALID [2018-11-14 16:16:58,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {162182#true} assume !(~p4~0 != 0bv32); {162182#true} is VALID [2018-11-14 16:16:58,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {162182#true} assume !(~p5~0 != 0bv32); {162182#true} is VALID [2018-11-14 16:16:58,994 INFO L273 TraceCheckUtils]: 13: Hoare triple {162182#true} assume !(~p6~0 != 0bv32); {162182#true} is VALID [2018-11-14 16:16:58,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {162182#true} assume !(~p7~0 != 0bv32); {162182#true} is VALID [2018-11-14 16:16:58,995 INFO L273 TraceCheckUtils]: 15: Hoare triple {162182#true} assume ~p8~0 != 0bv32;~lk8~0 := 1bv32; {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,995 INFO L273 TraceCheckUtils]: 16: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume ~p9~0 != 0bv32;~lk9~0 := 1bv32; {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume ~p10~0 != 0bv32;~lk10~0 := 1bv32; {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p1~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,996 INFO L273 TraceCheckUtils]: 19: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p2~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,996 INFO L273 TraceCheckUtils]: 20: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p3~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p4~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p5~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p6~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p7~0 != 0bv32); {162232#(not (= (_ bv0 32) main_~p8~0))} is VALID [2018-11-14 16:16:58,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {162232#(not (= (_ bv0 32) main_~p8~0))} assume !(~p8~0 != 0bv32); {162183#false} is VALID [2018-11-14 16:16:58,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {162183#false} assume ~p9~0 != 0bv32; {162183#false} is VALID [2018-11-14 16:16:58,999 INFO L273 TraceCheckUtils]: 27: Hoare triple {162183#false} assume ~lk9~0 != 1bv32; {162183#false} is VALID [2018-11-14 16:16:58,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {162183#false} assume !false; {162183#false} is VALID [2018-11-14 16:16:59,000 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-14 16:16:59,001 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:16:59,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:16:59,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:16:59,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:16:59,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:16:59,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:16:59,030 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-14 16:16:59,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:16:59,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:16:59,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:16:59,031 INFO L87 Difference]: Start difference. First operand 7561 states and 9735 transitions. Second operand 3 states. [2018-11-14 16:17:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:17:06,956 INFO L93 Difference]: Finished difference Result 11341 states and 14537 transitions. [2018-11-14 16:17:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:17:06,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:17:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:17:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:17:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-14 16:17:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:17:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2018-11-14 16:17:06,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 168 transitions. [2018-11-14 16:17:07,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.