java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:25,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:25,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:25,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:25,132 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:25,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:25,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:25,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:25,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:25,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:25,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:25,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:25,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:25,150 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:25,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:25,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:25,157 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:25,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:25,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:25,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:25,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:25,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:25,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:25,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:25,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:25,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:25,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:25,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:25,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:25,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:25,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:25,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:25,183 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:25,183 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:25,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:25,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:25,187 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-23 10:54:25,217 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:25,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:25,219 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:25,219 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:25,223 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:25,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:25,223 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:25,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:25,225 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:25,225 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:25,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:25,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:25,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:25,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:25,226 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:25,226 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:25,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:25,227 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:25,227 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:25,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:25,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:25,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:25,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:25,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:25,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:25,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:25,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:25,230 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:25,230 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:25,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:25,231 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:25,231 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:25,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:25,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:25,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:25,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:25,314 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:25,314 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:25,315 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:25,370 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e11986f/15f090d26eba4b949dd68eb7b5ba9927/FLAG9aa4da12c [2018-11-23 10:54:25,774 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:25,775 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:25,784 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e11986f/15f090d26eba4b949dd68eb7b5ba9927/FLAG9aa4da12c [2018-11-23 10:54:26,155 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3e11986f/15f090d26eba4b949dd68eb7b5ba9927 [2018-11-23 10:54:26,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:26,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:26,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:26,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:26,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:26,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26, skipping insertion in model container [2018-11-23 10:54:26,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:26,217 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:26,495 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:26,502 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:26,565 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:26,585 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:26,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26 WrapperNode [2018-11-23 10:54:26,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:26,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:26,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:26,587 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:26,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:26,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:26,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:26,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:26,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... [2018-11-23 10:54:26,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:26,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:26,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:26,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:26,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:26,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:26,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:26,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:26,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:27,862 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:27,863 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:27,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:27 BoogieIcfgContainer [2018-11-23 10:54:27,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:27,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:27,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:27,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:27,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:26" (1/3) ... [2018-11-23 10:54:27,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e55284a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:27, skipping insertion in model container [2018-11-23 10:54:27,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:26" (2/3) ... [2018-11-23 10:54:27,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e55284a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:27, skipping insertion in model container [2018-11-23 10:54:27,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:27" (3/3) ... [2018-11-23 10:54:27,872 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:27,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:27,887 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:27,902 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:27,934 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:27,934 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:27,935 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:27,935 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:27,937 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:27,937 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:27,937 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:27,937 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:27,938 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-23 10:54:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:27,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:27,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:27,968 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:27,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:27,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-11-23 10:54:27,978 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:27,978 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-23 10:54:27,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:28,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:28,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-23 10:54:28,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-23 10:54:28,452 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {59#true} {59#true} #265#return; {59#true} is VALID [2018-11-23 10:54:28,452 INFO L256 TraceCheckUtils]: 3: Hoare triple {59#true} call #t~ret15 := main(); {59#true} is VALID [2018-11-23 10:54:28,453 INFO L273 TraceCheckUtils]: 4: Hoare triple {59#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {59#true} is VALID [2018-11-23 10:54:28,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {59#true} is VALID [2018-11-23 10:54:28,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {59#true} is VALID [2018-11-23 10:54:28,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,490 INFO L273 TraceCheckUtils]: 20: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:28,503 INFO L273 TraceCheckUtils]: 22: Hoare triple {85#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {60#false} is VALID [2018-11-23 10:54:28,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-23 10:54:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:28,511 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:28,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:28,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:28,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:28,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:28,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:28,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:28,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:28,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:28,624 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-11-23 10:54:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:29,620 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-11-23 10:54:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:29,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 10:54:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2018-11-23 10:54:29,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2018-11-23 10:54:30,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:30,233 INFO L225 Difference]: With dead ends: 111 [2018-11-23 10:54:30,234 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 10:54:30,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 10:54:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-11-23 10:54:30,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:30,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 66 states. [2018-11-23 10:54:30,288 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 66 states. [2018-11-23 10:54:30,288 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 66 states. [2018-11-23 10:54:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,299 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2018-11-23 10:54:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2018-11-23 10:54:30,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:30,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:30,301 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 96 states. [2018-11-23 10:54:30,301 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 96 states. [2018-11-23 10:54:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,311 INFO L93 Difference]: Finished difference Result 96 states and 176 transitions. [2018-11-23 10:54:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 176 transitions. [2018-11-23 10:54:30,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:30,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:30,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:30,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 10:54:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-11-23 10:54:30,320 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-11-23 10:54:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:30,321 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-11-23 10:54:30,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-11-23 10:54:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:54:30,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:30,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:30,323 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:30,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-11-23 10:54:30,324 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:30,324 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-23 10:54:30,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:30,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:30,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {520#true} call ULTIMATE.init(); {520#true} is VALID [2018-11-23 10:54:30,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {520#true} assume true; {520#true} is VALID [2018-11-23 10:54:30,492 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {520#true} {520#true} #265#return; {520#true} is VALID [2018-11-23 10:54:30,492 INFO L256 TraceCheckUtils]: 3: Hoare triple {520#true} call #t~ret15 := main(); {520#true} is VALID [2018-11-23 10:54:30,493 INFO L273 TraceCheckUtils]: 4: Hoare triple {520#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {520#true} is VALID [2018-11-23 10:54:30,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {520#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {520#true} is VALID [2018-11-23 10:54:30,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {520#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {520#true} is VALID [2018-11-23 10:54:30,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {520#true} assume !(0bv32 != ~p1~0); {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume !(0bv32 != ~p8~0); {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,502 INFO L273 TraceCheckUtils]: 16: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {546#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:30,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {546#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {521#false} is VALID [2018-11-23 10:54:30,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {521#false} assume 1bv32 != ~lk1~0; {521#false} is VALID [2018-11-23 10:54:30,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {521#false} assume !false; {521#false} is VALID [2018-11-23 10:54:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:30,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:30,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:30,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:30,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:30,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:30,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:30,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:30,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:30,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:30,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:30,549 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-11-23 10:54:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:30,986 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-11-23 10:54:30,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:30,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 10:54:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2018-11-23 10:54:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2018-11-23 10:54:30,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 263 transitions. [2018-11-23 10:54:31,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:31,347 INFO L225 Difference]: With dead ends: 157 [2018-11-23 10:54:31,347 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 10:54:31,348 INFO L631 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-23 10:54:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 10:54:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-23 10:54:31,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:31,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 94 states. [2018-11-23 10:54:31,375 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 94 states. [2018-11-23 10:54:31,376 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 94 states. [2018-11-23 10:54:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,381 INFO L93 Difference]: Finished difference Result 96 states and 174 transitions. [2018-11-23 10:54:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 174 transitions. [2018-11-23 10:54:31,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:31,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:31,383 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 96 states. [2018-11-23 10:54:31,383 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 96 states. [2018-11-23 10:54:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,389 INFO L93 Difference]: Finished difference Result 96 states and 174 transitions. [2018-11-23 10:54:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 174 transitions. [2018-11-23 10:54:31,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:31,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:31,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:31,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 10:54:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-11-23 10:54:31,397 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-11-23 10:54:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:31,397 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-11-23 10:54:31,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-11-23 10:54:31,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:31,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:31,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:31,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:31,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-11-23 10:54:31,400 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:31,400 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-23 10:54:31,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:31,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:31,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {1054#true} call ULTIMATE.init(); {1054#true} is VALID [2018-11-23 10:54:31,599 INFO L273 TraceCheckUtils]: 1: Hoare triple {1054#true} assume true; {1054#true} is VALID [2018-11-23 10:54:31,599 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1054#true} {1054#true} #265#return; {1054#true} is VALID [2018-11-23 10:54:31,600 INFO L256 TraceCheckUtils]: 3: Hoare triple {1054#true} call #t~ret15 := main(); {1054#true} is VALID [2018-11-23 10:54:31,600 INFO L273 TraceCheckUtils]: 4: Hoare triple {1054#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {1054#true} is VALID [2018-11-23 10:54:31,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {1054#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {1054#true} is VALID [2018-11-23 10:54:31,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {1054#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {1054#true} is VALID [2018-11-23 10:54:31,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {1054#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p8~0); {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {1080#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:31,642 INFO L273 TraceCheckUtils]: 21: Hoare triple {1080#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {1055#false} is VALID [2018-11-23 10:54:31,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {1055#false} assume 0bv32 != ~p2~0; {1055#false} is VALID [2018-11-23 10:54:31,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {1055#false} assume 1bv32 != ~lk2~0; {1055#false} is VALID [2018-11-23 10:54:31,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {1055#false} assume !false; {1055#false} is VALID [2018-11-23 10:54:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:31,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:31,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:31,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:31,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:31,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:31,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:31,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:31,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:31,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:31,686 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-11-23 10:54:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:31,957 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-11-23 10:54:31,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:31,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2018-11-23 10:54:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2018-11-23 10:54:31,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 258 transitions. [2018-11-23 10:54:32,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:32,413 INFO L225 Difference]: With dead ends: 144 [2018-11-23 10:54:32,413 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 10:54:32,414 INFO L631 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-23 10:54:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 10:54:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-23 10:54:32,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:32,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2018-11-23 10:54:32,441 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2018-11-23 10:54:32,441 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2018-11-23 10:54:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:32,446 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2018-11-23 10:54:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 176 transitions. [2018-11-23 10:54:32,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:32,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:32,448 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2018-11-23 10:54:32,448 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2018-11-23 10:54:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:32,453 INFO L93 Difference]: Finished difference Result 99 states and 176 transitions. [2018-11-23 10:54:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 176 transitions. [2018-11-23 10:54:32,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:32,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:32,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:32,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 10:54:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-11-23 10:54:32,459 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-11-23 10:54:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:32,460 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-11-23 10:54:32,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-11-23 10:54:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:32,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:32,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:32,461 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:32,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:32,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-11-23 10:54:32,462 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:32,462 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-23 10:54:32,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:32,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:32,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {1589#true} call ULTIMATE.init(); {1589#true} is VALID [2018-11-23 10:54:32,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {1589#true} assume true; {1589#true} is VALID [2018-11-23 10:54:32,592 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1589#true} {1589#true} #265#return; {1589#true} is VALID [2018-11-23 10:54:32,592 INFO L256 TraceCheckUtils]: 3: Hoare triple {1589#true} call #t~ret15 := main(); {1589#true} is VALID [2018-11-23 10:54:32,592 INFO L273 TraceCheckUtils]: 4: Hoare triple {1589#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {1589#true} is VALID [2018-11-23 10:54:32,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {1589#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {1589#true} is VALID [2018-11-23 10:54:32,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {1589#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {1589#true} is VALID [2018-11-23 10:54:32,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {1589#true} assume !(0bv32 != ~p1~0); {1589#true} is VALID [2018-11-23 10:54:32,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {1589#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,595 INFO L273 TraceCheckUtils]: 11: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,600 INFO L273 TraceCheckUtils]: 18: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:32,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {1618#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {1590#false} is VALID [2018-11-23 10:54:32,605 INFO L273 TraceCheckUtils]: 24: Hoare triple {1590#false} assume !false; {1590#false} is VALID [2018-11-23 10:54:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:32,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:32,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:32,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:32,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:32,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:32,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:32,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:32,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:32,659 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-11-23 10:54:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:32,887 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-11-23 10:54:32,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:32,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 10:54:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2018-11-23 10:54:32,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2018-11-23 10:54:33,142 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-23 10:54:33,148 INFO L225 Difference]: With dead ends: 184 [2018-11-23 10:54:33,148 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 10:54:33,148 INFO L631 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-23 10:54:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 10:54:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-11-23 10:54:33,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:33,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 128 states. [2018-11-23 10:54:33,184 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 128 states. [2018-11-23 10:54:33,184 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 128 states. [2018-11-23 10:54:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:33,192 INFO L93 Difference]: Finished difference Result 182 states and 333 transitions. [2018-11-23 10:54:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 333 transitions. [2018-11-23 10:54:33,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:33,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:33,194 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 182 states. [2018-11-23 10:54:33,194 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 182 states. [2018-11-23 10:54:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:33,202 INFO L93 Difference]: Finished difference Result 182 states and 333 transitions. [2018-11-23 10:54:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 333 transitions. [2018-11-23 10:54:33,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:33,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:33,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:33,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 10:54:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-11-23 10:54:33,209 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-11-23 10:54:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:33,210 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-11-23 10:54:33,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-11-23 10:54:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:54:33,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:33,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:33,211 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:33,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-11-23 10:54:33,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:33,212 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-23 10:54:33,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:33,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:33,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {2362#true} call ULTIMATE.init(); {2362#true} is VALID [2018-11-23 10:54:33,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {2362#true} assume true; {2362#true} is VALID [2018-11-23 10:54:33,354 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2362#true} {2362#true} #265#return; {2362#true} is VALID [2018-11-23 10:54:33,355 INFO L256 TraceCheckUtils]: 3: Hoare triple {2362#true} call #t~ret15 := main(); {2362#true} is VALID [2018-11-23 10:54:33,355 INFO L273 TraceCheckUtils]: 4: Hoare triple {2362#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {2362#true} is VALID [2018-11-23 10:54:33,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {2362#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {2362#true} is VALID [2018-11-23 10:54:33,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {2362#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {2362#true} is VALID [2018-11-23 10:54:33,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {2362#true} assume !(0bv32 != ~p1~0); {2362#true} is VALID [2018-11-23 10:54:33,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {2362#true} assume !(0bv32 != ~p2~0); {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,362 INFO L273 TraceCheckUtils]: 9: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,362 INFO L273 TraceCheckUtils]: 10: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,363 INFO L273 TraceCheckUtils]: 11: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p8~0); {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,366 INFO L273 TraceCheckUtils]: 18: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,367 INFO L273 TraceCheckUtils]: 19: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {2391#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:33,368 INFO L273 TraceCheckUtils]: 22: Hoare triple {2391#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {2363#false} is VALID [2018-11-23 10:54:33,369 INFO L273 TraceCheckUtils]: 23: Hoare triple {2363#false} assume 1bv32 != ~lk2~0; {2363#false} is VALID [2018-11-23 10:54:33,369 INFO L273 TraceCheckUtils]: 24: Hoare triple {2363#false} assume !false; {2363#false} is VALID [2018-11-23 10:54:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:33,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:33,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:33,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:33,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:33,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:33,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:33,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:33,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:33,439 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-11-23 10:54:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:33,756 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-11-23 10:54:33,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:33,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 10:54:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2018-11-23 10:54:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2018-11-23 10:54:33,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2018-11-23 10:54:34,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:34,307 INFO L225 Difference]: With dead ends: 304 [2018-11-23 10:54:34,307 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 10:54:34,309 INFO L631 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-23 10:54:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 10:54:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-11-23 10:54:34,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:34,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand 182 states. [2018-11-23 10:54:34,378 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 182 states. [2018-11-23 10:54:34,378 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 182 states. [2018-11-23 10:54:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:34,385 INFO L93 Difference]: Finished difference Result 184 states and 331 transitions. [2018-11-23 10:54:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 331 transitions. [2018-11-23 10:54:34,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:34,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:34,386 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 184 states. [2018-11-23 10:54:34,386 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 184 states. [2018-11-23 10:54:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:34,394 INFO L93 Difference]: Finished difference Result 184 states and 331 transitions. [2018-11-23 10:54:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 331 transitions. [2018-11-23 10:54:34,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:34,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:34,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:34,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-23 10:54:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-11-23 10:54:34,403 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-11-23 10:54:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:34,403 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-11-23 10:54:34,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-11-23 10:54:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:34,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:34,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:34,405 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:34,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-11-23 10:54:34,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:34,406 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-23 10:54:34,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:34,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:34,534 INFO L256 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2018-11-23 10:54:34,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {3317#true} assume true; {3317#true} is VALID [2018-11-23 10:54:34,535 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3317#true} {3317#true} #265#return; {3317#true} is VALID [2018-11-23 10:54:34,535 INFO L256 TraceCheckUtils]: 3: Hoare triple {3317#true} call #t~ret15 := main(); {3317#true} is VALID [2018-11-23 10:54:34,535 INFO L273 TraceCheckUtils]: 4: Hoare triple {3317#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {3317#true} is VALID [2018-11-23 10:54:34,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {3317#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {3317#true} is VALID [2018-11-23 10:54:34,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {3317#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {3317#true} is VALID [2018-11-23 10:54:34,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {3317#true} assume !(0bv32 != ~p1~0); {3317#true} is VALID [2018-11-23 10:54:34,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {3317#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,538 INFO L273 TraceCheckUtils]: 9: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p8~0); {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,545 INFO L273 TraceCheckUtils]: 15: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {3346#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:34,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {3346#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {3318#false} is VALID [2018-11-23 10:54:34,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {3318#false} assume 0bv32 != ~p3~0; {3318#false} is VALID [2018-11-23 10:54:34,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {3318#false} assume 1bv32 != ~lk3~0; {3318#false} is VALID [2018-11-23 10:54:34,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2018-11-23 10:54:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:34,553 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:34,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:34,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:34,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:34,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:34,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:34,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:34,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:34,590 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-11-23 10:54:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:35,014 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-11-23 10:54:35,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:35,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2018-11-23 10:54:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2018-11-23 10:54:35,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2018-11-23 10:54:35,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:35,551 INFO L225 Difference]: With dead ends: 273 [2018-11-23 10:54:35,551 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 10:54:35,552 INFO L631 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-23 10:54:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 10:54:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-23 10:54:35,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:35,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 184 states. [2018-11-23 10:54:35,584 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 184 states. [2018-11-23 10:54:35,584 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 184 states. [2018-11-23 10:54:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:35,590 INFO L93 Difference]: Finished difference Result 186 states and 331 transitions. [2018-11-23 10:54:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 331 transitions. [2018-11-23 10:54:35,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:35,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:35,591 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 186 states. [2018-11-23 10:54:35,591 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 186 states. [2018-11-23 10:54:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:35,596 INFO L93 Difference]: Finished difference Result 186 states and 331 transitions. [2018-11-23 10:54:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 331 transitions. [2018-11-23 10:54:35,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:35,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:35,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:35,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 10:54:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-11-23 10:54:35,602 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-11-23 10:54:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-11-23 10:54:35,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-11-23 10:54:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:35,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:35,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:35,603 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:35,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-11-23 10:54:35,604 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:35,604 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-23 10:54:35,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:35,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:36,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {4250#true} call ULTIMATE.init(); {4250#true} is VALID [2018-11-23 10:54:36,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {4250#true} assume true; {4250#true} is VALID [2018-11-23 10:54:36,149 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4250#true} {4250#true} #265#return; {4250#true} is VALID [2018-11-23 10:54:36,149 INFO L256 TraceCheckUtils]: 3: Hoare triple {4250#true} call #t~ret15 := main(); {4250#true} is VALID [2018-11-23 10:54:36,149 INFO L273 TraceCheckUtils]: 4: Hoare triple {4250#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {4250#true} is VALID [2018-11-23 10:54:36,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {4250#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {4250#true} is VALID [2018-11-23 10:54:36,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {4250#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {4250#true} is VALID [2018-11-23 10:54:36,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {4250#true} assume !(0bv32 != ~p1~0); {4250#true} is VALID [2018-11-23 10:54:36,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {4250#true} assume !(0bv32 != ~p2~0); {4250#true} is VALID [2018-11-23 10:54:36,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {4250#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,201 INFO L273 TraceCheckUtils]: 21: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:36,203 INFO L273 TraceCheckUtils]: 24: Hoare triple {4282#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {4251#false} is VALID [2018-11-23 10:54:36,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {4251#false} assume !false; {4251#false} is VALID [2018-11-23 10:54:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:36,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:36,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:36,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:36,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:36,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:36,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:36,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:36,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:36,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:36,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:36,234 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-11-23 10:54:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,480 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-11-23 10:54:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:36,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 10:54:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2018-11-23 10:54:36,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2018-11-23 10:54:37,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,090 INFO L225 Difference]: With dead ends: 348 [2018-11-23 10:54:37,090 INFO L226 Difference]: Without dead ends: 346 [2018-11-23 10:54:37,091 INFO L631 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-23 10:54:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-23 10:54:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-11-23 10:54:37,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:37,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand 248 states. [2018-11-23 10:54:37,144 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand 248 states. [2018-11-23 10:54:37,144 INFO L87 Difference]: Start difference. First operand 346 states. Second operand 248 states. [2018-11-23 10:54:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,154 INFO L93 Difference]: Finished difference Result 346 states and 627 transitions. [2018-11-23 10:54:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 627 transitions. [2018-11-23 10:54:37,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,156 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand 346 states. [2018-11-23 10:54:37,156 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 346 states. [2018-11-23 10:54:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,166 INFO L93 Difference]: Finished difference Result 346 states and 627 transitions. [2018-11-23 10:54:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 627 transitions. [2018-11-23 10:54:37,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:37,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-23 10:54:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-11-23 10:54:37,173 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-11-23 10:54:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:37,174 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-11-23 10:54:37,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-11-23 10:54:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:54:37,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:37,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:37,175 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:37,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:37,175 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-11-23 10:54:37,176 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:37,176 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-23 10:54:37,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:37,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {5644#true} call ULTIMATE.init(); {5644#true} is VALID [2018-11-23 10:54:37,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {5644#true} assume true; {5644#true} is VALID [2018-11-23 10:54:37,587 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5644#true} {5644#true} #265#return; {5644#true} is VALID [2018-11-23 10:54:37,588 INFO L256 TraceCheckUtils]: 3: Hoare triple {5644#true} call #t~ret15 := main(); {5644#true} is VALID [2018-11-23 10:54:37,588 INFO L273 TraceCheckUtils]: 4: Hoare triple {5644#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {5644#true} is VALID [2018-11-23 10:54:37,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {5644#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {5644#true} is VALID [2018-11-23 10:54:37,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {5644#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {5644#true} is VALID [2018-11-23 10:54:37,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {5644#true} assume !(0bv32 != ~p1~0); {5644#true} is VALID [2018-11-23 10:54:37,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {5644#true} assume !(0bv32 != ~p2~0); {5644#true} is VALID [2018-11-23 10:54:37,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {5644#true} assume !(0bv32 != ~p3~0); {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p8~0); {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {5676#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:37,598 INFO L273 TraceCheckUtils]: 23: Hoare triple {5676#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {5645#false} is VALID [2018-11-23 10:54:37,598 INFO L273 TraceCheckUtils]: 24: Hoare triple {5645#false} assume 1bv32 != ~lk3~0; {5645#false} is VALID [2018-11-23 10:54:37,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {5645#false} assume !false; {5645#false} is VALID [2018-11-23 10:54:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:37,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:37,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:37,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:37,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:37,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:37,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:37,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:37,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:37,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:37,635 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-11-23 10:54:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,457 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-11-23 10:54:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:38,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 10:54:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2018-11-23 10:54:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2018-11-23 10:54:38,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 257 transitions. [2018-11-23 10:54:39,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,013 INFO L225 Difference]: With dead ends: 592 [2018-11-23 10:54:39,013 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 10:54:39,014 INFO L631 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-23 10:54:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 10:54:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-23 10:54:39,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:39,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand 352 states. [2018-11-23 10:54:39,128 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 352 states. [2018-11-23 10:54:39,129 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 352 states. [2018-11-23 10:54:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,138 INFO L93 Difference]: Finished difference Result 354 states and 627 transitions. [2018-11-23 10:54:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 627 transitions. [2018-11-23 10:54:39,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,140 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand 354 states. [2018-11-23 10:54:39,140 INFO L87 Difference]: Start difference. First operand 352 states. Second operand 354 states. [2018-11-23 10:54:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,150 INFO L93 Difference]: Finished difference Result 354 states and 627 transitions. [2018-11-23 10:54:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 627 transitions. [2018-11-23 10:54:39,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:39,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-23 10:54:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-11-23 10:54:39,162 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-11-23 10:54:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:39,162 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-11-23 10:54:39,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-11-23 10:54:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:39,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:39,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:39,163 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:39,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-11-23 10:54:39,164 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:39,164 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-23 10:54:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:39,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2018-11-23 10:54:39,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {7410#true} assume true; {7410#true} is VALID [2018-11-23 10:54:39,615 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7410#true} {7410#true} #265#return; {7410#true} is VALID [2018-11-23 10:54:39,616 INFO L256 TraceCheckUtils]: 3: Hoare triple {7410#true} call #t~ret15 := main(); {7410#true} is VALID [2018-11-23 10:54:39,616 INFO L273 TraceCheckUtils]: 4: Hoare triple {7410#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {7410#true} is VALID [2018-11-23 10:54:39,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {7410#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {7410#true} is VALID [2018-11-23 10:54:39,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {7410#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {7410#true} is VALID [2018-11-23 10:54:39,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {7410#true} assume !(0bv32 != ~p1~0); {7410#true} is VALID [2018-11-23 10:54:39,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {7410#true} assume !(0bv32 != ~p2~0); {7410#true} is VALID [2018-11-23 10:54:39,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {7410#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p8~0); {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,642 INFO L273 TraceCheckUtils]: 19: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {7442#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:39,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {7442#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {7411#false} is VALID [2018-11-23 10:54:39,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {7411#false} assume 0bv32 != ~p4~0; {7411#false} is VALID [2018-11-23 10:54:39,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {7411#false} assume 1bv32 != ~lk4~0; {7411#false} is VALID [2018-11-23 10:54:39,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2018-11-23 10:54:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:39,646 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:39,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:39,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:39,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:39,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:39,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:39,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:39,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:39,678 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-11-23 10:54:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,960 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-11-23 10:54:39,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:39,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2018-11-23 10:54:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2018-11-23 10:54:39,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2018-11-23 10:54:40,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,523 INFO L225 Difference]: With dead ends: 528 [2018-11-23 10:54:40,523 INFO L226 Difference]: Without dead ends: 358 [2018-11-23 10:54:40,523 INFO L631 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-23 10:54:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-23 10:54:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-11-23 10:54:40,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:40,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 358 states. Second operand 356 states. [2018-11-23 10:54:40,584 INFO L74 IsIncluded]: Start isIncluded. First operand 358 states. Second operand 356 states. [2018-11-23 10:54:40,584 INFO L87 Difference]: Start difference. First operand 358 states. Second operand 356 states. [2018-11-23 10:54:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,594 INFO L93 Difference]: Finished difference Result 358 states and 627 transitions. [2018-11-23 10:54:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 627 transitions. [2018-11-23 10:54:40,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,595 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand 358 states. [2018-11-23 10:54:40,595 INFO L87 Difference]: Start difference. First operand 356 states. Second operand 358 states. [2018-11-23 10:54:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,605 INFO L93 Difference]: Finished difference Result 358 states and 627 transitions. [2018-11-23 10:54:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 627 transitions. [2018-11-23 10:54:40,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:40,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-23 10:54:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-11-23 10:54:40,617 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-11-23 10:54:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:40,617 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-11-23 10:54:40,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-11-23 10:54:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:40,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:40,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:40,619 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:40,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-11-23 10:54:40,619 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:40,619 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-23 10:54:40,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:41,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {9127#true} call ULTIMATE.init(); {9127#true} is VALID [2018-11-23 10:54:41,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {9127#true} assume true; {9127#true} is VALID [2018-11-23 10:54:41,045 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9127#true} {9127#true} #265#return; {9127#true} is VALID [2018-11-23 10:54:41,045 INFO L256 TraceCheckUtils]: 3: Hoare triple {9127#true} call #t~ret15 := main(); {9127#true} is VALID [2018-11-23 10:54:41,045 INFO L273 TraceCheckUtils]: 4: Hoare triple {9127#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {9127#true} is VALID [2018-11-23 10:54:41,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {9127#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {9127#true} is VALID [2018-11-23 10:54:41,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {9127#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {9127#true} is VALID [2018-11-23 10:54:41,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {9127#true} assume !(0bv32 != ~p1~0); {9127#true} is VALID [2018-11-23 10:54:41,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {9127#true} assume !(0bv32 != ~p2~0); {9127#true} is VALID [2018-11-23 10:54:41,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {9127#true} assume !(0bv32 != ~p3~0); {9127#true} is VALID [2018-11-23 10:54:41,046 INFO L273 TraceCheckUtils]: 10: Hoare triple {9127#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,050 INFO L273 TraceCheckUtils]: 18: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,058 INFO L273 TraceCheckUtils]: 21: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,062 INFO L273 TraceCheckUtils]: 24: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:41,063 INFO L273 TraceCheckUtils]: 25: Hoare triple {9162#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {9128#false} is VALID [2018-11-23 10:54:41,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {9128#false} assume !false; {9128#false} is VALID [2018-11-23 10:54:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:41,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:41,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:41,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:41,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:41,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:41,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:41,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:41,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:41,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:41,126 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-11-23 10:54:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,056 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-11-23 10:54:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:42,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2018-11-23 10:54:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2018-11-23 10:54:42,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 166 transitions. [2018-11-23 10:54:42,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:42,641 INFO L225 Difference]: With dead ends: 668 [2018-11-23 10:54:42,641 INFO L226 Difference]: Without dead ends: 666 [2018-11-23 10:54:42,641 INFO L631 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-23 10:54:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-23 10:54:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-11-23 10:54:42,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:42,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand 488 states. [2018-11-23 10:54:42,784 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand 488 states. [2018-11-23 10:54:42,784 INFO L87 Difference]: Start difference. First operand 666 states. Second operand 488 states. [2018-11-23 10:54:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,809 INFO L93 Difference]: Finished difference Result 666 states and 1183 transitions. [2018-11-23 10:54:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1183 transitions. [2018-11-23 10:54:42,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:42,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:42,811 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand 666 states. [2018-11-23 10:54:42,811 INFO L87 Difference]: Start difference. First operand 488 states. Second operand 666 states. [2018-11-23 10:54:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,834 INFO L93 Difference]: Finished difference Result 666 states and 1183 transitions. [2018-11-23 10:54:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1183 transitions. [2018-11-23 10:54:42,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:42,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:42,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:42,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-23 10:54:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-11-23 10:54:42,851 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-11-23 10:54:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:42,851 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-11-23 10:54:42,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-11-23 10:54:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:54:42,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:42,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:42,852 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:42,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-11-23 10:54:42,853 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:42,853 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-23 10:54:42,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:42,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:42,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {11736#true} call ULTIMATE.init(); {11736#true} is VALID [2018-11-23 10:54:42,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {11736#true} assume true; {11736#true} is VALID [2018-11-23 10:54:42,966 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11736#true} {11736#true} #265#return; {11736#true} is VALID [2018-11-23 10:54:42,966 INFO L256 TraceCheckUtils]: 3: Hoare triple {11736#true} call #t~ret15 := main(); {11736#true} is VALID [2018-11-23 10:54:42,966 INFO L273 TraceCheckUtils]: 4: Hoare triple {11736#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {11736#true} is VALID [2018-11-23 10:54:42,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {11736#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {11736#true} is VALID [2018-11-23 10:54:42,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {11736#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {11736#true} is VALID [2018-11-23 10:54:42,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {11736#true} assume !(0bv32 != ~p1~0); {11736#true} is VALID [2018-11-23 10:54:42,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {11736#true} assume !(0bv32 != ~p2~0); {11736#true} is VALID [2018-11-23 10:54:42,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {11736#true} assume !(0bv32 != ~p3~0); {11736#true} is VALID [2018-11-23 10:54:42,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {11736#true} assume !(0bv32 != ~p4~0); {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:42,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p8~0); {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,027 INFO L273 TraceCheckUtils]: 21: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {11771#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {11771#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {11737#false} is VALID [2018-11-23 10:54:43,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {11737#false} assume 1bv32 != ~lk4~0; {11737#false} is VALID [2018-11-23 10:54:43,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {11737#false} assume !false; {11737#false} is VALID [2018-11-23 10:54:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:43,032 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:43,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:43,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:43,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:43,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:43,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:43,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:43,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:43,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:43,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:43,064 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-11-23 10:54:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:43,417 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-11-23 10:54:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:43,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:54:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2018-11-23 10:54:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2018-11-23 10:54:43,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 254 transitions. [2018-11-23 10:54:43,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:43,720 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 10:54:43,720 INFO L226 Difference]: Without dead ends: 690 [2018-11-23 10:54:43,721 INFO L631 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-23 10:54:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-11-23 10:54:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-11-23 10:54:43,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:43,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 690 states. Second operand 688 states. [2018-11-23 10:54:43,982 INFO L74 IsIncluded]: Start isIncluded. First operand 690 states. Second operand 688 states. [2018-11-23 10:54:43,982 INFO L87 Difference]: Start difference. First operand 690 states. Second operand 688 states. [2018-11-23 10:54:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,010 INFO L93 Difference]: Finished difference Result 690 states and 1191 transitions. [2018-11-23 10:54:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1191 transitions. [2018-11-23 10:54:44,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,013 INFO L74 IsIncluded]: Start isIncluded. First operand 688 states. Second operand 690 states. [2018-11-23 10:54:44,013 INFO L87 Difference]: Start difference. First operand 688 states. Second operand 690 states. [2018-11-23 10:54:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,040 INFO L93 Difference]: Finished difference Result 690 states and 1191 transitions. [2018-11-23 10:54:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1191 transitions. [2018-11-23 10:54:44,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:44,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-11-23 10:54:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-11-23 10:54:44,070 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-11-23 10:54:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:44,071 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-11-23 10:54:44,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-11-23 10:54:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:44,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:44,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:44,072 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:44,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:44,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-11-23 10:54:44,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:44,073 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-23 10:54:44,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:44,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {15105#true} call ULTIMATE.init(); {15105#true} is VALID [2018-11-23 10:54:44,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {15105#true} assume true; {15105#true} is VALID [2018-11-23 10:54:44,271 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15105#true} {15105#true} #265#return; {15105#true} is VALID [2018-11-23 10:54:44,271 INFO L256 TraceCheckUtils]: 3: Hoare triple {15105#true} call #t~ret15 := main(); {15105#true} is VALID [2018-11-23 10:54:44,271 INFO L273 TraceCheckUtils]: 4: Hoare triple {15105#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {15105#true} is VALID [2018-11-23 10:54:44,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {15105#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {15105#true} is VALID [2018-11-23 10:54:44,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {15105#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {15105#true} is VALID [2018-11-23 10:54:44,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {15105#true} assume !(0bv32 != ~p1~0); {15105#true} is VALID [2018-11-23 10:54:44,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {15105#true} assume !(0bv32 != ~p2~0); {15105#true} is VALID [2018-11-23 10:54:44,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {15105#true} assume !(0bv32 != ~p3~0); {15105#true} is VALID [2018-11-23 10:54:44,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {15105#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,275 INFO L273 TraceCheckUtils]: 11: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,275 INFO L273 TraceCheckUtils]: 12: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,276 INFO L273 TraceCheckUtils]: 13: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p8~0); {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {15140#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:44,280 INFO L273 TraceCheckUtils]: 24: Hoare triple {15140#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {15106#false} is VALID [2018-11-23 10:54:44,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {15106#false} assume 0bv32 != ~p5~0; {15106#false} is VALID [2018-11-23 10:54:44,281 INFO L273 TraceCheckUtils]: 26: Hoare triple {15106#false} assume 1bv32 != ~lk5~0; {15106#false} is VALID [2018-11-23 10:54:44,281 INFO L273 TraceCheckUtils]: 27: Hoare triple {15106#false} assume !false; {15106#false} is VALID [2018-11-23 10:54:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:44,282 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:44,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:44,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:44,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:44,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:44,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:44,308 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-23 10:54:44,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:44,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:44,309 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-11-23 10:54:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:45,163 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-11-23 10:54:45,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:45,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2018-11-23 10:54:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2018-11-23 10:54:45,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 249 transitions. [2018-11-23 10:54:45,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:45,630 INFO L225 Difference]: With dead ends: 1032 [2018-11-23 10:54:45,630 INFO L226 Difference]: Without dead ends: 698 [2018-11-23 10:54:45,631 INFO L631 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-23 10:54:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-23 10:54:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-23 10:54:46,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:46,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand 696 states. [2018-11-23 10:54:46,041 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand 696 states. [2018-11-23 10:54:46,041 INFO L87 Difference]: Start difference. First operand 698 states. Second operand 696 states. [2018-11-23 10:54:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,063 INFO L93 Difference]: Finished difference Result 698 states and 1191 transitions. [2018-11-23 10:54:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1191 transitions. [2018-11-23 10:54:46,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:46,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:46,065 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand 698 states. [2018-11-23 10:54:46,065 INFO L87 Difference]: Start difference. First operand 696 states. Second operand 698 states. [2018-11-23 10:54:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,086 INFO L93 Difference]: Finished difference Result 698 states and 1191 transitions. [2018-11-23 10:54:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1191 transitions. [2018-11-23 10:54:46,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:46,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:46,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:46,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-23 10:54:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-11-23 10:54:46,105 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-11-23 10:54:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:46,105 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-11-23 10:54:46,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-11-23 10:54:46,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:46,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:46,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:46,106 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:46,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-11-23 10:54:46,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:46,107 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-23 10:54:46,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:46,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:46,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {18369#true} call ULTIMATE.init(); {18369#true} is VALID [2018-11-23 10:54:46,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {18369#true} assume true; {18369#true} is VALID [2018-11-23 10:54:46,216 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {18369#true} {18369#true} #265#return; {18369#true} is VALID [2018-11-23 10:54:46,217 INFO L256 TraceCheckUtils]: 3: Hoare triple {18369#true} call #t~ret15 := main(); {18369#true} is VALID [2018-11-23 10:54:46,217 INFO L273 TraceCheckUtils]: 4: Hoare triple {18369#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {18369#true} is VALID [2018-11-23 10:54:46,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {18369#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {18369#true} is VALID [2018-11-23 10:54:46,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {18369#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {18369#true} is VALID [2018-11-23 10:54:46,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {18369#true} assume !(0bv32 != ~p1~0); {18369#true} is VALID [2018-11-23 10:54:46,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {18369#true} assume !(0bv32 != ~p2~0); {18369#true} is VALID [2018-11-23 10:54:46,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {18369#true} assume !(0bv32 != ~p3~0); {18369#true} is VALID [2018-11-23 10:54:46,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {18369#true} assume !(0bv32 != ~p4~0); {18369#true} is VALID [2018-11-23 10:54:46,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {18369#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,219 INFO L273 TraceCheckUtils]: 13: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,226 INFO L273 TraceCheckUtils]: 19: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,227 INFO L273 TraceCheckUtils]: 21: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:46,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {18407#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {18370#false} is VALID [2018-11-23 10:54:46,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {18370#false} assume !false; {18370#false} is VALID [2018-11-23 10:54:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:46,231 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:46,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:46,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:46,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:46,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:46,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:46,261 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-23 10:54:46,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:46,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:46,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:46,262 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-11-23 10:54:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,732 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-11-23 10:54:46,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:46,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:54:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2018-11-23 10:54:46,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2018-11-23 10:54:46,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:46,949 INFO L225 Difference]: With dead ends: 1292 [2018-11-23 10:54:46,949 INFO L226 Difference]: Without dead ends: 1290 [2018-11-23 10:54:46,949 INFO L631 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-23 10:54:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-11-23 10:54:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-11-23 10:54:47,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:47,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1290 states. Second operand 968 states. [2018-11-23 10:54:47,208 INFO L74 IsIncluded]: Start isIncluded. First operand 1290 states. Second operand 968 states. [2018-11-23 10:54:47,209 INFO L87 Difference]: Start difference. First operand 1290 states. Second operand 968 states. [2018-11-23 10:54:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,261 INFO L93 Difference]: Finished difference Result 1290 states and 2231 transitions. [2018-11-23 10:54:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2231 transitions. [2018-11-23 10:54:47,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:47,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:47,263 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 1290 states. [2018-11-23 10:54:47,263 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 1290 states. [2018-11-23 10:54:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:47,323 INFO L93 Difference]: Finished difference Result 1290 states and 2231 transitions. [2018-11-23 10:54:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2231 transitions. [2018-11-23 10:54:47,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:47,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:47,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:47,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-23 10:54:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-11-23 10:54:47,361 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-11-23 10:54:47,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:47,361 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-11-23 10:54:47,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-11-23 10:54:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:54:47,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:47,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:47,362 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:47,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-11-23 10:54:47,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:47,363 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-23 10:54:47,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:47,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:47,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {23357#true} call ULTIMATE.init(); {23357#true} is VALID [2018-11-23 10:54:47,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {23357#true} assume true; {23357#true} is VALID [2018-11-23 10:54:47,524 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23357#true} {23357#true} #265#return; {23357#true} is VALID [2018-11-23 10:54:47,525 INFO L256 TraceCheckUtils]: 3: Hoare triple {23357#true} call #t~ret15 := main(); {23357#true} is VALID [2018-11-23 10:54:47,525 INFO L273 TraceCheckUtils]: 4: Hoare triple {23357#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {23357#true} is VALID [2018-11-23 10:54:47,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {23357#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {23357#true} is VALID [2018-11-23 10:54:47,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {23357#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {23357#true} is VALID [2018-11-23 10:54:47,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {23357#true} assume !(0bv32 != ~p1~0); {23357#true} is VALID [2018-11-23 10:54:47,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {23357#true} assume !(0bv32 != ~p2~0); {23357#true} is VALID [2018-11-23 10:54:47,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {23357#true} assume !(0bv32 != ~p3~0); {23357#true} is VALID [2018-11-23 10:54:47,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {23357#true} assume !(0bv32 != ~p4~0); {23357#true} is VALID [2018-11-23 10:54:47,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {23357#true} assume !(0bv32 != ~p5~0); {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p8~0); {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {23395#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:47,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {23395#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {23358#false} is VALID [2018-11-23 10:54:47,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {23358#false} assume 1bv32 != ~lk5~0; {23358#false} is VALID [2018-11-23 10:54:47,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {23358#false} assume !false; {23358#false} is VALID [2018-11-23 10:54:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:47,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:47,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:47,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:47,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:47,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:47,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:47,560 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-23 10:54:47,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:47,562 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-11-23 10:54:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,223 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-11-23 10:54:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:48,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 10:54:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2018-11-23 10:54:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2018-11-23 10:54:48,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 251 transitions. [2018-11-23 10:54:48,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,533 INFO L225 Difference]: With dead ends: 2300 [2018-11-23 10:54:48,534 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 10:54:48,535 INFO L631 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-23 10:54:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 10:54:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-23 10:54:49,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:49,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1354 states. Second operand 1352 states. [2018-11-23 10:54:49,366 INFO L74 IsIncluded]: Start isIncluded. First operand 1354 states. Second operand 1352 states. [2018-11-23 10:54:49,366 INFO L87 Difference]: Start difference. First operand 1354 states. Second operand 1352 states. [2018-11-23 10:54:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,428 INFO L93 Difference]: Finished difference Result 1354 states and 2263 transitions. [2018-11-23 10:54:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2263 transitions. [2018-11-23 10:54:49,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,430 INFO L74 IsIncluded]: Start isIncluded. First operand 1352 states. Second operand 1354 states. [2018-11-23 10:54:49,430 INFO L87 Difference]: Start difference. First operand 1352 states. Second operand 1354 states. [2018-11-23 10:54:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,498 INFO L93 Difference]: Finished difference Result 1354 states and 2263 transitions. [2018-11-23 10:54:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 2263 transitions. [2018-11-23 10:54:49,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-23 10:54:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-11-23 10:54:49,559 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-11-23 10:54:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:49,560 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-11-23 10:54:49,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-11-23 10:54:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:54:49,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:49,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:49,561 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:49,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-11-23 10:54:49,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:49,562 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-23 10:54:49,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:49,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {29897#true} call ULTIMATE.init(); {29897#true} is VALID [2018-11-23 10:54:49,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {29897#true} assume true; {29897#true} is VALID [2018-11-23 10:54:49,662 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {29897#true} {29897#true} #265#return; {29897#true} is VALID [2018-11-23 10:54:49,662 INFO L256 TraceCheckUtils]: 3: Hoare triple {29897#true} call #t~ret15 := main(); {29897#true} is VALID [2018-11-23 10:54:49,662 INFO L273 TraceCheckUtils]: 4: Hoare triple {29897#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {29897#true} is VALID [2018-11-23 10:54:49,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {29897#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {29897#true} is VALID [2018-11-23 10:54:49,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {29897#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {29897#true} is VALID [2018-11-23 10:54:49,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {29897#true} assume !(0bv32 != ~p1~0); {29897#true} is VALID [2018-11-23 10:54:49,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {29897#true} assume !(0bv32 != ~p2~0); {29897#true} is VALID [2018-11-23 10:54:49,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {29897#true} assume !(0bv32 != ~p3~0); {29897#true} is VALID [2018-11-23 10:54:49,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {29897#true} assume !(0bv32 != ~p4~0); {29897#true} is VALID [2018-11-23 10:54:49,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {29897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p8~0); {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,670 INFO L273 TraceCheckUtils]: 17: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {29935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {29935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {29898#false} is VALID [2018-11-23 10:54:49,679 INFO L273 TraceCheckUtils]: 26: Hoare triple {29898#false} assume 0bv32 != ~p6~0; {29898#false} is VALID [2018-11-23 10:54:49,679 INFO L273 TraceCheckUtils]: 27: Hoare triple {29898#false} assume 1bv32 != ~lk6~0; {29898#false} is VALID [2018-11-23 10:54:49,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {29898#false} assume !false; {29898#false} is VALID [2018-11-23 10:54:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:49,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:49,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:49,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:49,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:49,708 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-23 10:54:49,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:49,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:49,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:49,709 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-11-23 10:54:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,781 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-11-23 10:54:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:50,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:50,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2018-11-23 10:54:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2018-11-23 10:54:50,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 246 transitions. [2018-11-23 10:54:51,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:51,128 INFO L225 Difference]: With dead ends: 2028 [2018-11-23 10:54:51,128 INFO L226 Difference]: Without dead ends: 1370 [2018-11-23 10:54:51,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-23 10:54:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-11-23 10:54:51,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:51,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1370 states. Second operand 1368 states. [2018-11-23 10:54:51,540 INFO L74 IsIncluded]: Start isIncluded. First operand 1370 states. Second operand 1368 states. [2018-11-23 10:54:51,540 INFO L87 Difference]: Start difference. First operand 1370 states. Second operand 1368 states. [2018-11-23 10:54:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,603 INFO L93 Difference]: Finished difference Result 1370 states and 2263 transitions. [2018-11-23 10:54:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2263 transitions. [2018-11-23 10:54:51,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,605 INFO L74 IsIncluded]: Start isIncluded. First operand 1368 states. Second operand 1370 states. [2018-11-23 10:54:51,605 INFO L87 Difference]: Start difference. First operand 1368 states. Second operand 1370 states. [2018-11-23 10:54:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,671 INFO L93 Difference]: Finished difference Result 1370 states and 2263 transitions. [2018-11-23 10:54:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2263 transitions. [2018-11-23 10:54:51,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:51,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-11-23 10:54:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-11-23 10:54:51,729 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-11-23 10:54:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:51,729 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-11-23 10:54:51,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:51,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-11-23 10:54:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:54:51,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:51,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:51,731 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:51,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-11-23 10:54:51,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:51,732 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-23 10:54:51,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:51,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {36216#true} call ULTIMATE.init(); {36216#true} is VALID [2018-11-23 10:54:51,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {36216#true} assume true; {36216#true} is VALID [2018-11-23 10:54:51,845 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {36216#true} {36216#true} #265#return; {36216#true} is VALID [2018-11-23 10:54:51,845 INFO L256 TraceCheckUtils]: 3: Hoare triple {36216#true} call #t~ret15 := main(); {36216#true} is VALID [2018-11-23 10:54:51,845 INFO L273 TraceCheckUtils]: 4: Hoare triple {36216#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {36216#true} is VALID [2018-11-23 10:54:51,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {36216#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {36216#true} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {36216#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {36216#true} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {36216#true} assume !(0bv32 != ~p1~0); {36216#true} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {36216#true} assume !(0bv32 != ~p2~0); {36216#true} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {36216#true} assume !(0bv32 != ~p3~0); {36216#true} is VALID [2018-11-23 10:54:51,846 INFO L273 TraceCheckUtils]: 10: Hoare triple {36216#true} assume !(0bv32 != ~p4~0); {36216#true} is VALID [2018-11-23 10:54:51,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {36216#true} assume !(0bv32 != ~p5~0); {36216#true} is VALID [2018-11-23 10:54:51,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {36216#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,865 INFO L273 TraceCheckUtils]: 20: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,867 INFO L273 TraceCheckUtils]: 24: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,867 INFO L273 TraceCheckUtils]: 25: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,868 INFO L273 TraceCheckUtils]: 27: Hoare triple {36257#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {36217#false} is VALID [2018-11-23 10:54:51,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {36217#false} assume !false; {36217#false} is VALID [2018-11-23 10:54:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:51,870 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:51,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:51,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:51,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:51,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:51,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:51,905 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-23 10:54:51,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:51,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:51,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,906 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-11-23 10:54:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,097 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-11-23 10:54:53,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:53,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 10:54:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2018-11-23 10:54:53,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2018-11-23 10:54:53,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:53,587 INFO L225 Difference]: With dead ends: 2508 [2018-11-23 10:54:53,587 INFO L226 Difference]: Without dead ends: 2506 [2018-11-23 10:54:53,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-23 10:54:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-11-23 10:54:54,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:54,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2506 states. Second operand 1928 states. [2018-11-23 10:54:54,001 INFO L74 IsIncluded]: Start isIncluded. First operand 2506 states. Second operand 1928 states. [2018-11-23 10:54:54,001 INFO L87 Difference]: Start difference. First operand 2506 states. Second operand 1928 states. [2018-11-23 10:54:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,176 INFO L93 Difference]: Finished difference Result 2506 states and 4199 transitions. [2018-11-23 10:54:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 4199 transitions. [2018-11-23 10:54:54,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,179 INFO L74 IsIncluded]: Start isIncluded. First operand 1928 states. Second operand 2506 states. [2018-11-23 10:54:54,179 INFO L87 Difference]: Start difference. First operand 1928 states. Second operand 2506 states. [2018-11-23 10:54:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,347 INFO L93 Difference]: Finished difference Result 2506 states and 4199 transitions. [2018-11-23 10:54:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 4199 transitions. [2018-11-23 10:54:54,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:54,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-23 10:54:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-11-23 10:54:54,459 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-11-23 10:54:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:54,459 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-11-23 10:54:54,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-11-23 10:54:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:54:54,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:54,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:54,461 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:54,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-11-23 10:54:54,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:54,461 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-23 10:54:54,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:54,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:54,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {45863#true} call ULTIMATE.init(); {45863#true} is VALID [2018-11-23 10:54:54,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {45863#true} assume true; {45863#true} is VALID [2018-11-23 10:54:54,752 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {45863#true} {45863#true} #265#return; {45863#true} is VALID [2018-11-23 10:54:54,752 INFO L256 TraceCheckUtils]: 3: Hoare triple {45863#true} call #t~ret15 := main(); {45863#true} is VALID [2018-11-23 10:54:54,752 INFO L273 TraceCheckUtils]: 4: Hoare triple {45863#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {45863#true} is VALID [2018-11-23 10:54:54,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {45863#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {45863#true} is VALID [2018-11-23 10:54:54,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {45863#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {45863#true} is VALID [2018-11-23 10:54:54,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {45863#true} assume !(0bv32 != ~p1~0); {45863#true} is VALID [2018-11-23 10:54:54,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {45863#true} assume !(0bv32 != ~p2~0); {45863#true} is VALID [2018-11-23 10:54:54,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {45863#true} assume !(0bv32 != ~p3~0); {45863#true} is VALID [2018-11-23 10:54:54,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {45863#true} assume !(0bv32 != ~p4~0); {45863#true} is VALID [2018-11-23 10:54:54,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {45863#true} assume !(0bv32 != ~p5~0); {45863#true} is VALID [2018-11-23 10:54:54,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {45863#true} assume !(0bv32 != ~p6~0); {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,755 INFO L273 TraceCheckUtils]: 13: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p8~0); {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {45904#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:54,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {45904#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {45864#false} is VALID [2018-11-23 10:54:54,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {45864#false} assume 1bv32 != ~lk6~0; {45864#false} is VALID [2018-11-23 10:54:54,759 INFO L273 TraceCheckUtils]: 28: Hoare triple {45864#false} assume !false; {45864#false} is VALID [2018-11-23 10:54:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:54,760 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:54,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:54,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:54,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:54,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:54,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:54,789 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-23 10:54:54,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:54,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:54,789 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-11-23 10:54:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:56,361 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-11-23 10:54:56,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:56,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 10:54:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-23 10:54:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2018-11-23 10:54:56,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 248 transitions. [2018-11-23 10:54:56,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:56,871 INFO L225 Difference]: With dead ends: 4556 [2018-11-23 10:54:56,871 INFO L226 Difference]: Without dead ends: 2666 [2018-11-23 10:54:56,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-23 10:54:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-11-23 10:54:57,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:57,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2666 states. Second operand 2664 states. [2018-11-23 10:54:57,356 INFO L74 IsIncluded]: Start isIncluded. First operand 2666 states. Second operand 2664 states. [2018-11-23 10:54:57,356 INFO L87 Difference]: Start difference. First operand 2666 states. Second operand 2664 states. [2018-11-23 10:54:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:57,608 INFO L93 Difference]: Finished difference Result 2666 states and 4295 transitions. [2018-11-23 10:54:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4295 transitions. [2018-11-23 10:54:57,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:57,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:57,611 INFO L74 IsIncluded]: Start isIncluded. First operand 2664 states. Second operand 2666 states. [2018-11-23 10:54:57,611 INFO L87 Difference]: Start difference. First operand 2664 states. Second operand 2666 states. [2018-11-23 10:54:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:57,852 INFO L93 Difference]: Finished difference Result 2666 states and 4295 transitions. [2018-11-23 10:54:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4295 transitions. [2018-11-23 10:54:57,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:57,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:57,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:57,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-11-23 10:54:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-11-23 10:54:58,093 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-11-23 10:54:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:58,093 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-11-23 10:54:58,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-11-23 10:54:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:54:58,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:58,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:58,096 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:58,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:58,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-11-23 10:54:58,096 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:58,097 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-23 10:54:58,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:58,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:58,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {58678#true} call ULTIMATE.init(); {58678#true} is VALID [2018-11-23 10:54:58,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {58678#true} assume true; {58678#true} is VALID [2018-11-23 10:54:58,198 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {58678#true} {58678#true} #265#return; {58678#true} is VALID [2018-11-23 10:54:58,198 INFO L256 TraceCheckUtils]: 3: Hoare triple {58678#true} call #t~ret15 := main(); {58678#true} is VALID [2018-11-23 10:54:58,199 INFO L273 TraceCheckUtils]: 4: Hoare triple {58678#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {58678#true} is VALID [2018-11-23 10:54:58,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {58678#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {58678#true} is VALID [2018-11-23 10:54:58,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {58678#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {58678#true} is VALID [2018-11-23 10:54:58,199 INFO L273 TraceCheckUtils]: 7: Hoare triple {58678#true} assume !(0bv32 != ~p1~0); {58678#true} is VALID [2018-11-23 10:54:58,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {58678#true} assume !(0bv32 != ~p2~0); {58678#true} is VALID [2018-11-23 10:54:58,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {58678#true} assume !(0bv32 != ~p3~0); {58678#true} is VALID [2018-11-23 10:54:58,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {58678#true} assume !(0bv32 != ~p4~0); {58678#true} is VALID [2018-11-23 10:54:58,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {58678#true} assume !(0bv32 != ~p5~0); {58678#true} is VALID [2018-11-23 10:54:58,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {58678#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p8~0); {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p1~0); {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p2~0); {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p3~0); {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p4~0); {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p5~0); {58719#(not (= (_ bv0 32) main_~p6~0))} is VALID [2018-11-23 10:54:58,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {58719#(not (= (_ bv0 32) main_~p6~0))} assume !(0bv32 != ~p6~0); {58679#false} is VALID [2018-11-23 10:54:58,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {58679#false} assume 0bv32 != ~p7~0; {58679#false} is VALID [2018-11-23 10:54:58,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {58679#false} assume 1bv32 != ~lk7~0; {58679#false} is VALID [2018-11-23 10:54:58,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {58679#false} assume !false; {58679#false} is VALID [2018-11-23 10:54:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:58,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:58,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:58,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:54:58,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:58,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:58,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:58,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:58,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:58,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:58,242 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-11-23 10:54:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:59,969 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-11-23 10:54:59,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:59,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:54:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 10:54:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 10:54:59,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2018-11-23 10:55:00,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:00,447 INFO L225 Difference]: With dead ends: 3996 [2018-11-23 10:55:00,447 INFO L226 Difference]: Without dead ends: 2698 [2018-11-23 10:55:00,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-23 10:55:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-11-23 10:55:01,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:01,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2698 states. Second operand 2696 states. [2018-11-23 10:55:01,211 INFO L74 IsIncluded]: Start isIncluded. First operand 2698 states. Second operand 2696 states. [2018-11-23 10:55:01,211 INFO L87 Difference]: Start difference. First operand 2698 states. Second operand 2696 states. [2018-11-23 10:55:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,470 INFO L93 Difference]: Finished difference Result 2698 states and 4295 transitions. [2018-11-23 10:55:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4295 transitions. [2018-11-23 10:55:01,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:01,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:01,472 INFO L74 IsIncluded]: Start isIncluded. First operand 2696 states. Second operand 2698 states. [2018-11-23 10:55:01,472 INFO L87 Difference]: Start difference. First operand 2696 states. Second operand 2698 states. [2018-11-23 10:55:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:01,670 INFO L93 Difference]: Finished difference Result 2698 states and 4295 transitions. [2018-11-23 10:55:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4295 transitions. [2018-11-23 10:55:01,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:01,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:01,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:01,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-23 10:55:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-11-23 10:55:01,875 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-11-23 10:55:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:01,876 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-11-23 10:55:01,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-11-23 10:55:01,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:55:01,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:01,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:01,877 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:01,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-11-23 10:55:01,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:01,879 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-23 10:55:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:01,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:01,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {71032#true} call ULTIMATE.init(); {71032#true} is VALID [2018-11-23 10:55:01,976 INFO L273 TraceCheckUtils]: 1: Hoare triple {71032#true} assume true; {71032#true} is VALID [2018-11-23 10:55:01,976 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {71032#true} {71032#true} #265#return; {71032#true} is VALID [2018-11-23 10:55:01,977 INFO L256 TraceCheckUtils]: 3: Hoare triple {71032#true} call #t~ret15 := main(); {71032#true} is VALID [2018-11-23 10:55:01,977 INFO L273 TraceCheckUtils]: 4: Hoare triple {71032#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {71032#true} is VALID [2018-11-23 10:55:01,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {71032#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {71032#true} is VALID [2018-11-23 10:55:01,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {71032#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {71032#true} is VALID [2018-11-23 10:55:01,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {71032#true} assume !(0bv32 != ~p1~0); {71032#true} is VALID [2018-11-23 10:55:01,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {71032#true} assume !(0bv32 != ~p2~0); {71032#true} is VALID [2018-11-23 10:55:01,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {71032#true} assume !(0bv32 != ~p3~0); {71032#true} is VALID [2018-11-23 10:55:01,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {71032#true} assume !(0bv32 != ~p4~0); {71032#true} is VALID [2018-11-23 10:55:01,978 INFO L273 TraceCheckUtils]: 11: Hoare triple {71032#true} assume !(0bv32 != ~p5~0); {71032#true} is VALID [2018-11-23 10:55:01,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {71032#true} assume !(0bv32 != ~p6~0); {71032#true} is VALID [2018-11-23 10:55:01,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {71032#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,021 INFO L273 TraceCheckUtils]: 15: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,065 INFO L273 TraceCheckUtils]: 19: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,073 INFO L273 TraceCheckUtils]: 20: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,092 INFO L273 TraceCheckUtils]: 25: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p7~0; {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:55:02,093 INFO L273 TraceCheckUtils]: 28: Hoare triple {71076#(= (bvadd main_~lk7~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk7~0; {71033#false} is VALID [2018-11-23 10:55:02,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {71033#false} assume !false; {71033#false} is VALID [2018-11-23 10:55:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:02,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:02,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:02,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:02,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:02,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:02,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:02,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:02,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:02,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:02,134 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-11-23 10:55:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:04,252 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-11-23 10:55:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:04,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 10:55:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2018-11-23 10:55:04,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2018-11-23 10:55:04,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:05,454 INFO L225 Difference]: With dead ends: 4876 [2018-11-23 10:55:05,455 INFO L226 Difference]: Without dead ends: 4874 [2018-11-23 10:55:05,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-23 10:55:06,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-11-23 10:55:06,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:06,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4874 states. Second operand 3848 states. [2018-11-23 10:55:06,045 INFO L74 IsIncluded]: Start isIncluded. First operand 4874 states. Second operand 3848 states. [2018-11-23 10:55:06,045 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3848 states. [2018-11-23 10:55:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:06,892 INFO L93 Difference]: Finished difference Result 4874 states and 7879 transitions. [2018-11-23 10:55:06,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7879 transitions. [2018-11-23 10:55:06,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:06,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:06,897 INFO L74 IsIncluded]: Start isIncluded. First operand 3848 states. Second operand 4874 states. [2018-11-23 10:55:06,897 INFO L87 Difference]: Start difference. First operand 3848 states. Second operand 4874 states. [2018-11-23 10:55:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:07,777 INFO L93 Difference]: Finished difference Result 4874 states and 7879 transitions. [2018-11-23 10:55:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 7879 transitions. [2018-11-23 10:55:07,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:07,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:07,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:07,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-11-23 10:55:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-11-23 10:55:08,392 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-11-23 10:55:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:08,392 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-11-23 10:55:08,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-11-23 10:55:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:55:08,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:08,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:08,396 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:08,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-11-23 10:55:08,397 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:08,397 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-23 10:55:08,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:08,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:08,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {89802#true} call ULTIMATE.init(); {89802#true} is VALID [2018-11-23 10:55:08,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {89802#true} assume true; {89802#true} is VALID [2018-11-23 10:55:08,509 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {89802#true} {89802#true} #265#return; {89802#true} is VALID [2018-11-23 10:55:08,510 INFO L256 TraceCheckUtils]: 3: Hoare triple {89802#true} call #t~ret15 := main(); {89802#true} is VALID [2018-11-23 10:55:08,510 INFO L273 TraceCheckUtils]: 4: Hoare triple {89802#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {89802#true} is VALID [2018-11-23 10:55:08,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {89802#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {89802#true} is VALID [2018-11-23 10:55:08,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {89802#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {89802#true} is VALID [2018-11-23 10:55:08,510 INFO L273 TraceCheckUtils]: 7: Hoare triple {89802#true} assume !(0bv32 != ~p1~0); {89802#true} is VALID [2018-11-23 10:55:08,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {89802#true} assume !(0bv32 != ~p2~0); {89802#true} is VALID [2018-11-23 10:55:08,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {89802#true} assume !(0bv32 != ~p3~0); {89802#true} is VALID [2018-11-23 10:55:08,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {89802#true} assume !(0bv32 != ~p4~0); {89802#true} is VALID [2018-11-23 10:55:08,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {89802#true} assume !(0bv32 != ~p5~0); {89802#true} is VALID [2018-11-23 10:55:08,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {89802#true} assume !(0bv32 != ~p6~0); {89802#true} is VALID [2018-11-23 10:55:08,512 INFO L273 TraceCheckUtils]: 13: Hoare triple {89802#true} assume !(0bv32 != ~p7~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,512 INFO L273 TraceCheckUtils]: 14: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p8~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,513 INFO L273 TraceCheckUtils]: 16: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,513 INFO L273 TraceCheckUtils]: 18: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,513 INFO L273 TraceCheckUtils]: 19: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,514 INFO L273 TraceCheckUtils]: 20: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,514 INFO L273 TraceCheckUtils]: 21: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p1~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,514 INFO L273 TraceCheckUtils]: 22: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p2~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p3~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p4~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,515 INFO L273 TraceCheckUtils]: 25: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p5~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,516 INFO L273 TraceCheckUtils]: 26: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume !(0bv32 != ~p6~0); {89846#(= (_ bv0 32) main_~p7~0)} is VALID [2018-11-23 10:55:08,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {89846#(= (_ bv0 32) main_~p7~0)} assume 0bv32 != ~p7~0; {89803#false} is VALID [2018-11-23 10:55:08,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {89803#false} assume 1bv32 != ~lk7~0; {89803#false} is VALID [2018-11-23 10:55:08,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {89803#false} assume !false; {89803#false} is VALID [2018-11-23 10:55:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:08,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:08,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:08,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:08,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:08,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:08,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:08,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:08,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:08,546 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-11-23 10:55:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:13,249 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-11-23 10:55:13,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:13,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 10:55:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 10:55:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2018-11-23 10:55:13,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2018-11-23 10:55:13,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:14,744 INFO L225 Difference]: With dead ends: 9036 [2018-11-23 10:55:14,745 INFO L226 Difference]: Without dead ends: 5258 [2018-11-23 10:55:14,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-23 10:55:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-11-23 10:55:16,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:16,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5258 states. Second operand 5256 states. [2018-11-23 10:55:16,270 INFO L74 IsIncluded]: Start isIncluded. First operand 5258 states. Second operand 5256 states. [2018-11-23 10:55:16,270 INFO L87 Difference]: Start difference. First operand 5258 states. Second operand 5256 states. [2018-11-23 10:55:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:17,257 INFO L93 Difference]: Finished difference Result 5258 states and 8135 transitions. [2018-11-23 10:55:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8135 transitions. [2018-11-23 10:55:17,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:17,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:17,263 INFO L74 IsIncluded]: Start isIncluded. First operand 5256 states. Second operand 5258 states. [2018-11-23 10:55:17,263 INFO L87 Difference]: Start difference. First operand 5256 states. Second operand 5258 states. [2018-11-23 10:55:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:18,281 INFO L93 Difference]: Finished difference Result 5258 states and 8135 transitions. [2018-11-23 10:55:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8135 transitions. [2018-11-23 10:55:18,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:18,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:18,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:18,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-11-23 10:55:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-11-23 10:55:19,378 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-11-23 10:55:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:19,379 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-11-23 10:55:19,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-11-23 10:55:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:55:19,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:19,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:19,382 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:19,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-11-23 10:55:19,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:19,382 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-23 10:55:19,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:19,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:19,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {115036#true} call ULTIMATE.init(); {115036#true} is VALID [2018-11-23 10:55:19,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {115036#true} assume true; {115036#true} is VALID [2018-11-23 10:55:19,480 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {115036#true} {115036#true} #265#return; {115036#true} is VALID [2018-11-23 10:55:19,480 INFO L256 TraceCheckUtils]: 3: Hoare triple {115036#true} call #t~ret15 := main(); {115036#true} is VALID [2018-11-23 10:55:19,480 INFO L273 TraceCheckUtils]: 4: Hoare triple {115036#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {115036#true} is VALID [2018-11-23 10:55:19,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {115036#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {115036#true} is VALID [2018-11-23 10:55:19,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {115036#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {115036#true} is VALID [2018-11-23 10:55:19,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {115036#true} assume !(0bv32 != ~p1~0); {115036#true} is VALID [2018-11-23 10:55:19,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {115036#true} assume !(0bv32 != ~p2~0); {115036#true} is VALID [2018-11-23 10:55:19,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {115036#true} assume !(0bv32 != ~p3~0); {115036#true} is VALID [2018-11-23 10:55:19,482 INFO L273 TraceCheckUtils]: 10: Hoare triple {115036#true} assume !(0bv32 != ~p4~0); {115036#true} is VALID [2018-11-23 10:55:19,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {115036#true} assume !(0bv32 != ~p5~0); {115036#true} is VALID [2018-11-23 10:55:19,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {115036#true} assume !(0bv32 != ~p6~0); {115036#true} is VALID [2018-11-23 10:55:19,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {115036#true} assume 0bv32 != ~p7~0;~lk7~0 := 1bv32; {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p8~0); {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,483 INFO L273 TraceCheckUtils]: 15: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,483 INFO L273 TraceCheckUtils]: 16: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p1~0); {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p2~0); {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p3~0); {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p4~0); {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p5~0); {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,487 INFO L273 TraceCheckUtils]: 26: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p6~0); {115080#(not (= (_ bv0 32) main_~p7~0))} is VALID [2018-11-23 10:55:19,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {115080#(not (= (_ bv0 32) main_~p7~0))} assume !(0bv32 != ~p7~0); {115037#false} is VALID [2018-11-23 10:55:19,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {115037#false} assume 0bv32 != ~p8~0; {115037#false} is VALID [2018-11-23 10:55:19,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {115037#false} assume 1bv32 != ~lk8~0; {115037#false} is VALID [2018-11-23 10:55:19,489 INFO L273 TraceCheckUtils]: 30: Hoare triple {115037#false} assume !false; {115037#false} is VALID [2018-11-23 10:55:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:19,490 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:19,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:19,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:19,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:55:19,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:19,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:19,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:19,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:19,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:19,522 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-11-23 10:55:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:23,046 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-11-23 10:55:23,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:23,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:55:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 10:55:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2018-11-23 10:55:23,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2018-11-23 10:55:23,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:25,370 INFO L225 Difference]: With dead ends: 7884 [2018-11-23 10:55:25,370 INFO L226 Difference]: Without dead ends: 5322 [2018-11-23 10:55:25,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-11-23 10:55:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-11-23 10:55:27,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:27,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5322 states. Second operand 5320 states. [2018-11-23 10:55:27,045 INFO L74 IsIncluded]: Start isIncluded. First operand 5322 states. Second operand 5320 states. [2018-11-23 10:55:27,045 INFO L87 Difference]: Start difference. First operand 5322 states. Second operand 5320 states. [2018-11-23 10:55:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:28,047 INFO L93 Difference]: Finished difference Result 5322 states and 8135 transitions. [2018-11-23 10:55:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5322 states and 8135 transitions. [2018-11-23 10:55:28,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:28,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:28,051 INFO L74 IsIncluded]: Start isIncluded. First operand 5320 states. Second operand 5322 states. [2018-11-23 10:55:28,051 INFO L87 Difference]: Start difference. First operand 5320 states. Second operand 5322 states. [2018-11-23 10:55:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:29,101 INFO L93 Difference]: Finished difference Result 5322 states and 8135 transitions. [2018-11-23 10:55:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 5322 states and 8135 transitions. [2018-11-23 10:55:29,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:29,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:29,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:29,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-11-23 10:55:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-11-23 10:55:30,246 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-11-23 10:55:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:55:30,246 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-11-23 10:55:30,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:55:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-11-23 10:55:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:55:30,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:55:30,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:55:30,248 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:55:30,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:55:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-11-23 10:55:30,249 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:55:30,249 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-23 10:55:30,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:55:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:55:30,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:55:30,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {139313#true} call ULTIMATE.init(); {139313#true} is VALID [2018-11-23 10:55:30,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {139313#true} assume true; {139313#true} is VALID [2018-11-23 10:55:30,356 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {139313#true} {139313#true} #265#return; {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L256 TraceCheckUtils]: 3: Hoare triple {139313#true} call #t~ret15 := main(); {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {139313#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {139313#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {139313#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {139313#true} assume !(0bv32 != ~p1~0); {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {139313#true} assume !(0bv32 != ~p2~0); {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {139313#true} assume !(0bv32 != ~p3~0); {139313#true} is VALID [2018-11-23 10:55:30,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {139313#true} assume !(0bv32 != ~p4~0); {139313#true} is VALID [2018-11-23 10:55:30,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {139313#true} assume !(0bv32 != ~p5~0); {139313#true} is VALID [2018-11-23 10:55:30,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {139313#true} assume !(0bv32 != ~p6~0); {139313#true} is VALID [2018-11-23 10:55:30,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {139313#true} assume !(0bv32 != ~p7~0); {139313#true} is VALID [2018-11-23 10:55:30,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {139313#true} assume !(0bv32 != ~p8~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p1~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p2~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p3~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p4~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,362 INFO L273 TraceCheckUtils]: 25: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p5~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,362 INFO L273 TraceCheckUtils]: 26: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p6~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume !(0bv32 != ~p7~0); {139360#(= (_ bv0 32) main_~p8~0)} is VALID [2018-11-23 10:55:30,363 INFO L273 TraceCheckUtils]: 28: Hoare triple {139360#(= (_ bv0 32) main_~p8~0)} assume 0bv32 != ~p8~0; {139314#false} is VALID [2018-11-23 10:55:30,363 INFO L273 TraceCheckUtils]: 29: Hoare triple {139314#false} assume 1bv32 != ~lk8~0; {139314#false} is VALID [2018-11-23 10:55:30,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {139314#false} assume !false; {139314#false} is VALID [2018-11-23 10:55:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:55:30,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:55:30,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:55:30,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:55:30,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:55:30,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:55:30,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:55:30,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:30,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:55:30,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:55:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:30,393 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-11-23 10:55:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:41,727 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-11-23 10:55:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:55:41,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:55:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:55:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 10:55:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:55:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2018-11-23 10:55:41,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2018-11-23 10:55:42,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:55:45,961 INFO L225 Difference]: With dead ends: 15564 [2018-11-23 10:55:45,962 INFO L226 Difference]: Without dead ends: 10378 [2018-11-23 10:55:45,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:55:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-11-23 10:55:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-11-23 10:55:50,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:55:50,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10378 states. Second operand 10376 states. [2018-11-23 10:55:50,758 INFO L74 IsIncluded]: Start isIncluded. First operand 10378 states. Second operand 10376 states. [2018-11-23 10:55:50,758 INFO L87 Difference]: Start difference. First operand 10378 states. Second operand 10376 states. [2018-11-23 10:55:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:54,751 INFO L93 Difference]: Finished difference Result 10378 states and 15495 transitions. [2018-11-23 10:55:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 10378 states and 15495 transitions. [2018-11-23 10:55:54,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:54,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:54,758 INFO L74 IsIncluded]: Start isIncluded. First operand 10376 states. Second operand 10378 states. [2018-11-23 10:55:54,758 INFO L87 Difference]: Start difference. First operand 10376 states. Second operand 10378 states. [2018-11-23 10:55:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:55:58,675 INFO L93 Difference]: Finished difference Result 10378 states and 15495 transitions. [2018-11-23 10:55:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10378 states and 15495 transitions. [2018-11-23 10:55:58,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:55:58,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:55:58,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:55:58,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:55:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-23 10:56:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-11-23 10:56:02,855 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-11-23 10:56:02,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:56:02,855 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-11-23 10:56:02,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:56:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-11-23 10:56:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:56:02,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:56:02,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:56:02,860 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:56:02,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:56:02,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-11-23 10:56:02,863 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:56:02,863 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-23 10:56:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:56:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:02,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:56:02,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {186758#true} call ULTIMATE.init(); {186758#true} is VALID [2018-11-23 10:56:02,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {186758#true} assume true; {186758#true} is VALID [2018-11-23 10:56:02,973 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {186758#true} {186758#true} #265#return; {186758#true} is VALID [2018-11-23 10:56:02,973 INFO L256 TraceCheckUtils]: 3: Hoare triple {186758#true} call #t~ret15 := main(); {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 4: Hoare triple {186758#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {186758#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {186758#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {186758#true} assume !(0bv32 != ~p1~0); {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {186758#true} assume !(0bv32 != ~p2~0); {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {186758#true} assume !(0bv32 != ~p3~0); {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {186758#true} assume !(0bv32 != ~p4~0); {186758#true} is VALID [2018-11-23 10:56:02,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {186758#true} assume !(0bv32 != ~p5~0); {186758#true} is VALID [2018-11-23 10:56:02,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {186758#true} assume !(0bv32 != ~p6~0); {186758#true} is VALID [2018-11-23 10:56:02,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {186758#true} assume !(0bv32 != ~p7~0); {186758#true} is VALID [2018-11-23 10:56:02,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {186758#true} assume 0bv32 != ~p8~0;~lk8~0 := 1bv32; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p8~0; {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:02,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {186805#(= (bvadd main_~lk8~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk8~0; {186759#false} is VALID [2018-11-23 10:56:02,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {186759#false} assume !false; {186759#false} is VALID [2018-11-23 10:56:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:56:02,983 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:56:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:56:02,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:56:02,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:56:02,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:56:02,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:56:03,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:03,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:56:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:56:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:03,014 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-11-23 10:56:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:13,065 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-11-23 10:56:13,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:56:13,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 10:56:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:56:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 10:56:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2018-11-23 10:56:13,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2018-11-23 10:56:13,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:19,429 INFO L225 Difference]: With dead ends: 12172 [2018-11-23 10:56:19,429 INFO L226 Difference]: Without dead ends: 12170 [2018-11-23 10:56:19,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-23 10:56:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-11-23 10:56:22,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:56:22,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12170 states. Second operand 10376 states. [2018-11-23 10:56:22,413 INFO L74 IsIncluded]: Start isIncluded. First operand 12170 states. Second operand 10376 states. [2018-11-23 10:56:22,414 INFO L87 Difference]: Start difference. First operand 12170 states. Second operand 10376 states. [2018-11-23 10:56:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:27,662 INFO L93 Difference]: Finished difference Result 12170 states and 18695 transitions. [2018-11-23 10:56:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 18695 transitions. [2018-11-23 10:56:27,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:27,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:27,673 INFO L74 IsIncluded]: Start isIncluded. First operand 10376 states. Second operand 12170 states. [2018-11-23 10:56:27,673 INFO L87 Difference]: Start difference. First operand 10376 states. Second operand 12170 states. [2018-11-23 10:56:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:32,996 INFO L93 Difference]: Finished difference Result 12170 states and 18695 transitions. [2018-11-23 10:56:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12170 states and 18695 transitions. [2018-11-23 10:56:33,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:56:33,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:56:33,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:56:33,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:56:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-23 10:56:37,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-11-23 10:56:37,382 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-11-23 10:56:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:56:37,382 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-11-23 10:56:37,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:56:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-11-23 10:56:37,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:56:37,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:56:37,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:56:37,387 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:56:37,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:56:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-11-23 10:56:37,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:56:37,387 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:56:37,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:56:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:56:37,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:56:37,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {234395#true} call ULTIMATE.init(); {234395#true} is VALID [2018-11-23 10:56:37,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {234395#true} assume true; {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {234395#true} {234395#true} #265#return; {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L256 TraceCheckUtils]: 3: Hoare triple {234395#true} call #t~ret15 := main(); {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L273 TraceCheckUtils]: 4: Hoare triple {234395#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {234395#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L273 TraceCheckUtils]: 6: Hoare triple {234395#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L273 TraceCheckUtils]: 7: Hoare triple {234395#true} assume !(0bv32 != ~p1~0); {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {234395#true} assume !(0bv32 != ~p2~0); {234395#true} is VALID [2018-11-23 10:56:37,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {234395#true} assume !(0bv32 != ~p3~0); {234395#true} is VALID [2018-11-23 10:56:37,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {234395#true} assume !(0bv32 != ~p4~0); {234395#true} is VALID [2018-11-23 10:56:37,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {234395#true} assume !(0bv32 != ~p5~0); {234395#true} is VALID [2018-11-23 10:56:37,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {234395#true} assume !(0bv32 != ~p6~0); {234395#true} is VALID [2018-11-23 10:56:37,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {234395#true} assume !(0bv32 != ~p7~0); {234395#true} is VALID [2018-11-23 10:56:37,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {234395#true} assume !(0bv32 != ~p8~0); {234395#true} is VALID [2018-11-23 10:56:37,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {234395#true} assume 0bv32 != ~p9~0;~lk9~0 := 1bv32; {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,504 INFO L273 TraceCheckUtils]: 16: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,504 INFO L273 TraceCheckUtils]: 18: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,505 INFO L273 TraceCheckUtils]: 19: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,506 INFO L273 TraceCheckUtils]: 24: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p6~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,531 INFO L273 TraceCheckUtils]: 27: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p7~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p8~0); {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p9~0; {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:56:37,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {234445#(= (bvadd main_~lk9~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk9~0; {234396#false} is VALID [2018-11-23 10:56:37,533 INFO L273 TraceCheckUtils]: 31: Hoare triple {234396#false} assume !false; {234396#false} is VALID [2018-11-23 10:56:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:56:37,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:56:37,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:56:37,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:56:37,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:56:37,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:56:37,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:56:37,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:56:37,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:56:37,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:56:37,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:56:37,568 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-11-23 10:56:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:56:55,977 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-11-23 10:56:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:56:55,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:56:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:56:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:56:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:56:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2018-11-23 10:56:55,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 146 transitions. [2018-11-23 10:56:56,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:57:09,335 INFO L225 Difference]: With dead ends: 18316 [2018-11-23 10:57:09,335 INFO L226 Difference]: Without dead ends: 18314 [2018-11-23 10:57:09,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:57:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-11-23 10:57:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-11-23 10:57:14,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:57:14,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18314 states. Second operand 15240 states. [2018-11-23 10:57:14,210 INFO L74 IsIncluded]: Start isIncluded. First operand 18314 states. Second operand 15240 states. [2018-11-23 10:57:14,211 INFO L87 Difference]: Start difference. First operand 18314 states. Second operand 15240 states. [2018-11-23 10:57:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:57:26,037 INFO L93 Difference]: Finished difference Result 18314 states and 27527 transitions. [2018-11-23 10:57:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 18314 states and 27527 transitions. [2018-11-23 10:57:26,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:57:26,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:57:26,049 INFO L74 IsIncluded]: Start isIncluded. First operand 15240 states. Second operand 18314 states. [2018-11-23 10:57:26,049 INFO L87 Difference]: Start difference. First operand 15240 states. Second operand 18314 states. [2018-11-23 10:57:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:57:38,178 INFO L93 Difference]: Finished difference Result 18314 states and 27527 transitions. [2018-11-23 10:57:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 18314 states and 27527 transitions. [2018-11-23 10:57:38,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:57:38,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:57:38,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:57:38,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:57:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-11-23 10:57:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-11-23 10:57:47,691 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-11-23 10:57:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:57:47,691 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-11-23 10:57:47,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:57:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-11-23 10:57:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:57:47,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:57:47,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:57:47,699 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:57:47,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:57:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-11-23 10:57:47,700 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:57:47,700 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:57:47,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:57:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:57:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:57:47,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:57:47,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {305459#true} call ULTIMATE.init(); {305459#true} is VALID [2018-11-23 10:57:47,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {305459#true} assume true; {305459#true} is VALID [2018-11-23 10:57:47,798 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {305459#true} {305459#true} #265#return; {305459#true} is VALID [2018-11-23 10:57:47,798 INFO L256 TraceCheckUtils]: 3: Hoare triple {305459#true} call #t~ret15 := main(); {305459#true} is VALID [2018-11-23 10:57:47,799 INFO L273 TraceCheckUtils]: 4: Hoare triple {305459#true} ~p1~0 := #t~nondet0;havoc #t~nondet0;havoc ~lk1~0;~p2~0 := #t~nondet1;havoc #t~nondet1;havoc ~lk2~0;~p3~0 := #t~nondet2;havoc #t~nondet2;havoc ~lk3~0;~p4~0 := #t~nondet3;havoc #t~nondet3;havoc ~lk4~0;~p5~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk5~0;~p6~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk6~0;~p7~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk7~0;~p8~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk8~0;~p9~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk9~0;~p10~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk10~0;~p11~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk11~0;~p12~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk12~0;~p13~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk13~0;~p14~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk14~0;havoc ~cond~0; {305459#true} is VALID [2018-11-23 10:57:47,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {305459#true} assume !false;~cond~0 := #t~nondet14;havoc #t~nondet14; {305459#true} is VALID [2018-11-23 10:57:47,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {305459#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32;~lk7~0 := 0bv32;~lk8~0 := 0bv32;~lk9~0 := 0bv32;~lk10~0 := 0bv32;~lk11~0 := 0bv32;~lk12~0 := 0bv32;~lk13~0 := 0bv32;~lk14~0 := 0bv32; {305459#true} is VALID [2018-11-23 10:57:47,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {305459#true} assume !(0bv32 != ~p1~0); {305459#true} is VALID [2018-11-23 10:57:47,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {305459#true} assume !(0bv32 != ~p2~0); {305459#true} is VALID [2018-11-23 10:57:47,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {305459#true} assume !(0bv32 != ~p3~0); {305459#true} is VALID [2018-11-23 10:57:47,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {305459#true} assume !(0bv32 != ~p4~0); {305459#true} is VALID [2018-11-23 10:57:47,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {305459#true} assume !(0bv32 != ~p5~0); {305459#true} is VALID [2018-11-23 10:57:47,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {305459#true} assume !(0bv32 != ~p6~0); {305459#true} is VALID [2018-11-23 10:57:47,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {305459#true} assume !(0bv32 != ~p7~0); {305459#true} is VALID [2018-11-23 10:57:47,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {305459#true} assume !(0bv32 != ~p8~0); {305459#true} is VALID [2018-11-23 10:57:47,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {305459#true} assume !(0bv32 != ~p9~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p10~0;~lk10~0 := 1bv32; {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p11~0;~lk11~0 := 1bv32; {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p12~0;~lk12~0 := 1bv32; {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p13~0;~lk13~0 := 1bv32; {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p14~0;~lk14~0 := 1bv32; {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p1~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p2~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p3~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p4~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p5~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,804 INFO L273 TraceCheckUtils]: 26: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p6~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p7~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume !(0bv32 != ~p8~0); {305509#(= (_ bv0 32) main_~p9~0)} is VALID [2018-11-23 10:57:47,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {305509#(= (_ bv0 32) main_~p9~0)} assume 0bv32 != ~p9~0; {305460#false} is VALID [2018-11-23 10:57:47,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {305460#false} assume 1bv32 != ~lk9~0; {305460#false} is VALID [2018-11-23 10:57:47,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {305460#false} assume !false; {305460#false} is VALID [2018-11-23 10:57:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:57:47,807 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:57:47,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:57:47,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:57:47,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:57:47,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:57:47,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:57:47,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:57:47,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:57:47,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:57:47,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:57:47,837 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states.