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_6_true-unreach-call_true-valid-memsafety_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:54:32,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:54:32,927 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:54:32,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:54:32,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:54:32,948 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:54:32,949 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:54:32,952 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:54:32,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:54:32,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:54:32,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:54:32,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:54:32,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:54:32,968 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:54:32,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:54:32,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:54:32,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:54:32,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:54:32,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:54:32,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:54:32,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:54:32,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:54:32,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:54:32,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:54:32,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:54:32,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:54:32,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:54:32,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:54:32,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:54:32,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:54:32,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:54:32,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:54:32,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:54:32,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:54:32,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:54:32,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:54:32,990 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:33,014 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:54:33,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:54:33,015 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:54:33,016 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:54:33,016 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:54:33,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:54:33,017 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:54:33,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:54:33,017 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:54:33,017 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:54:33,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:54:33,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:54:33,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:54:33,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:54:33,020 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:54:33,020 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:54:33,020 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:54:33,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:54:33,020 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:54:33,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:54:33,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:54:33,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:54:33,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:54:33,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:54:33,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:54:33,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:54:33,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:54:33,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:54:33,022 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:54:33,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:54:33,024 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:54:33,024 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:54:33,024 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:54:33,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:54:33,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:54:33,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:54:33,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:54:33,100 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:54:33,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:33,156 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7849a0f2/f6611e0bdf8140528e55ebc752f00f0e/FLAGc3f638c40 [2018-11-23 10:54:33,557 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:54:33,558 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:33,565 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7849a0f2/f6611e0bdf8140528e55ebc752f00f0e/FLAGc3f638c40 [2018-11-23 10:54:33,934 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7849a0f2/f6611e0bdf8140528e55ebc752f00f0e [2018-11-23 10:54:33,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:54:33,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:54:33,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:33,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:54:33,951 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:54:33,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0be90c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:33, skipping insertion in model container [2018-11-23 10:54:33,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:54:33" (1/1) ... [2018-11-23 10:54:33,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:54:33,991 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:54:34,246 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:34,252 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:54:34,284 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:54:34,301 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:54:34,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:34 WrapperNode [2018-11-23 10:54:34,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:54:34,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:34,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:54:34,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:54:34,313 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:34" (1/1) ... [2018-11-23 10:54:34,321 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:34" (1/1) ... [2018-11-23 10:54:34,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:54:34,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:54:34,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:54:34,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:54:34,340 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:34" (1/1) ... [2018-11-23 10:54:34,341 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:34" (1/1) ... [2018-11-23 10:54:34,342 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:34" (1/1) ... [2018-11-23 10:54:34,343 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:34" (1/1) ... [2018-11-23 10:54:34,353 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:34" (1/1) ... [2018-11-23 10:54:34,364 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:34" (1/1) ... [2018-11-23 10:54:34,365 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:34" (1/1) ... [2018-11-23 10:54:34,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:54:34,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:54:34,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:54:34,369 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:54:34,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:34" (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:34,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:54:34,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:54:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:54:34,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:54:34,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:54:34,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:54:35,091 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:54:35,092 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 10:54:35,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:35 BoogieIcfgContainer [2018-11-23 10:54:35,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:54:35,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:54:35,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:54:35,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:54:35,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:54:33" (1/3) ... [2018-11-23 10:54:35,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83eb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:35, skipping insertion in model container [2018-11-23 10:54:35,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:54:34" (2/3) ... [2018-11-23 10:54:35,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b83eb31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:54:35, skipping insertion in model container [2018-11-23 10:54:35,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:35" (3/3) ... [2018-11-23 10:54:35,101 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 10:54:35,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:54:35,120 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:54:35,135 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:54:35,168 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:54:35,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:54:35,169 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:54:35,169 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:54:35,170 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:54:35,170 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:54:35,170 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:54:35,171 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:54:35,171 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:54:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 10:54:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:54:35,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:35,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:35,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:35,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2018-11-23 10:54:35,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:35,212 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:35,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:35,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:35,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 10:54:35,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 10:54:35,609 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #129#return; {35#true} is VALID [2018-11-23 10:54:35,610 INFO L256 TraceCheckUtils]: 3: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2018-11-23 10:54:35,610 INFO L273 TraceCheckUtils]: 4: Hoare triple {35#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;havoc ~cond~0; {35#true} is VALID [2018-11-23 10:54:35,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {35#true} is VALID [2018-11-23 10:54:35,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {35#true} is VALID [2018-11-23 10:54:35,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p1~0; {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:35,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#(= (bvadd main_~lk1~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk1~0; {36#false} is VALID [2018-11-23 10:54:35,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 10:54:35,629 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:35,629 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:35,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:35,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:35,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:35,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:35,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:35,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:35,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:35,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:35,724 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 10:54:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,219 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2018-11-23 10:54:36,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:36,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:36,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 10:54:36,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:36,862 INFO L225 Difference]: With dead ends: 63 [2018-11-23 10:54:36,862 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 10:54:36,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 10:54:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-23 10:54:36,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:36,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 34 states. [2018-11-23 10:54:36,927 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 34 states. [2018-11-23 10:54:36,927 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 34 states. [2018-11-23 10:54:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,935 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2018-11-23 10:54:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-11-23 10:54:36,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:36,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:36,936 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 48 states. [2018-11-23 10:54:36,936 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 48 states. [2018-11-23 10:54:36,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:36,943 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2018-11-23 10:54:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-11-23 10:54:36,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:36,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:36,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:36,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:54:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-11-23 10:54:36,951 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2018-11-23 10:54:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:36,951 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-11-23 10:54:36,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-11-23 10:54:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:54:36,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:36,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:36,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:36,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2018-11-23 10:54:36,954 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:36,954 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:36,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:37,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {296#true} call ULTIMATE.init(); {296#true} is VALID [2018-11-23 10:54:37,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {296#true} assume true; {296#true} is VALID [2018-11-23 10:54:37,056 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {296#true} {296#true} #129#return; {296#true} is VALID [2018-11-23 10:54:37,056 INFO L256 TraceCheckUtils]: 3: Hoare triple {296#true} call #t~ret7 := main(); {296#true} is VALID [2018-11-23 10:54:37,056 INFO L273 TraceCheckUtils]: 4: Hoare triple {296#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;havoc ~cond~0; {296#true} is VALID [2018-11-23 10:54:37,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {296#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {296#true} is VALID [2018-11-23 10:54:37,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {296#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {296#true} is VALID [2018-11-23 10:54:37,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {296#true} assume !(0bv32 != ~p1~0); {322#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:37,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {322#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:37,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {322#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {322#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:37,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {322#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {322#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:37,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {322#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {322#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:37,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {322#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {322#(= (_ bv0 32) main_~p1~0)} is VALID [2018-11-23 10:54:37,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {322#(= (_ bv0 32) main_~p1~0)} assume 0bv32 != ~p1~0; {297#false} is VALID [2018-11-23 10:54:37,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {297#false} assume 1bv32 != ~lk1~0; {297#false} is VALID [2018-11-23 10:54:37,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {297#false} assume !false; {297#false} is VALID [2018-11-23 10:54:37,070 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,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:37,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:37,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:37,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:37,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:37,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:37,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:37,111 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-11-23 10:54:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,476 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-11-23 10:54:37,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:37,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:54:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2018-11-23 10:54:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2018-11-23 10:54:37,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2018-11-23 10:54:37,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:37,837 INFO L225 Difference]: With dead ends: 77 [2018-11-23 10:54:37,838 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 10:54:37,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 10:54:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-23 10:54:37,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:37,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2018-11-23 10:54:37,852 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2018-11-23 10:54:37,852 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2018-11-23 10:54:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,857 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2018-11-23 10:54:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2018-11-23 10:54:37,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,858 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2018-11-23 10:54:37,858 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2018-11-23 10:54:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:37,862 INFO L93 Difference]: Finished difference Result 48 states and 78 transitions. [2018-11-23 10:54:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 78 transitions. [2018-11-23 10:54:37,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:37,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:37,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:37,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 10:54:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-11-23 10:54:37,867 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2018-11-23 10:54:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:37,868 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-11-23 10:54:37,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-11-23 10:54:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:37,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:37,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:37,870 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:37,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2018-11-23 10:54:37,870 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:37,871 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:37,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:37,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:37,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {582#true} is VALID [2018-11-23 10:54:37,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {582#true} assume true; {582#true} is VALID [2018-11-23 10:54:37,978 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} #129#return; {582#true} is VALID [2018-11-23 10:54:37,978 INFO L256 TraceCheckUtils]: 3: Hoare triple {582#true} call #t~ret7 := main(); {582#true} is VALID [2018-11-23 10:54:37,978 INFO L273 TraceCheckUtils]: 4: Hoare triple {582#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;havoc ~cond~0; {582#true} is VALID [2018-11-23 10:54:37,978 INFO L273 TraceCheckUtils]: 5: Hoare triple {582#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {582#true} is VALID [2018-11-23 10:54:37,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {582#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {582#true} is VALID [2018-11-23 10:54:37,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {582#true} assume 0bv32 != ~p1~0;~lk1~0 := 1bv32; {608#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {608#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {608#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {608#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {608#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {608#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {608#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {608#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {608#(not (= (_ bv0 32) main_~p1~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {608#(not (= (_ bv0 32) main_~p1~0))} is VALID [2018-11-23 10:54:37,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {608#(not (= (_ bv0 32) main_~p1~0))} assume !(0bv32 != ~p1~0); {583#false} is VALID [2018-11-23 10:54:37,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {583#false} assume 0bv32 != ~p2~0; {583#false} is VALID [2018-11-23 10:54:37,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {583#false} assume 1bv32 != ~lk2~0; {583#false} is VALID [2018-11-23 10:54:37,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {583#false} assume !false; {583#false} is VALID [2018-11-23 10:54:37,989 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,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:37,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:37,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:37,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:37,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:37,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:38,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:38,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:38,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:38,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:38,028 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-11-23 10:54:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,351 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-11-23 10:54:38,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:38,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:54:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2018-11-23 10:54:38,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2018-11-23 10:54:38,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:38,504 INFO L225 Difference]: With dead ends: 72 [2018-11-23 10:54:38,505 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 10:54:38,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 10:54:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 10:54:38,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:38,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-23 10:54:38,533 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-23 10:54:38,534 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-23 10:54:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,537 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2018-11-23 10:54:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2018-11-23 10:54:38,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,539 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-23 10:54:38,539 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-23 10:54:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,542 INFO L93 Difference]: Finished difference Result 51 states and 80 transitions. [2018-11-23 10:54:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 80 transitions. [2018-11-23 10:54:38,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:38,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:38,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:38,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 10:54:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-11-23 10:54:38,546 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2018-11-23 10:54:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:38,547 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2018-11-23 10:54:38,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2018-11-23 10:54:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:38,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:38,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:38,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:38,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2018-11-23 10:54:38,549 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:38,550 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:38,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:38,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:38,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2018-11-23 10:54:38,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {877#true} assume true; {877#true} is VALID [2018-11-23 10:54:38,711 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {877#true} {877#true} #129#return; {877#true} is VALID [2018-11-23 10:54:38,711 INFO L256 TraceCheckUtils]: 3: Hoare triple {877#true} call #t~ret7 := main(); {877#true} is VALID [2018-11-23 10:54:38,711 INFO L273 TraceCheckUtils]: 4: Hoare triple {877#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;havoc ~cond~0; {877#true} is VALID [2018-11-23 10:54:38,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {877#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {877#true} is VALID [2018-11-23 10:54:38,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {877#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {877#true} is VALID [2018-11-23 10:54:38,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {877#true} assume !(0bv32 != ~p1~0); {877#true} is VALID [2018-11-23 10:54:38,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {877#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,752 INFO L273 TraceCheckUtils]: 11: Hoare triple {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,760 INFO L273 TraceCheckUtils]: 13: Hoare triple {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p2~0; {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:38,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {906#(= (bvadd main_~lk2~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk2~0; {878#false} is VALID [2018-11-23 10:54:38,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {878#false} assume !false; {878#false} is VALID [2018-11-23 10:54:38,762 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:38,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:38,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:38,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:38,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:38,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:38,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:38,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:38,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:38,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:38,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:38,788 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2018-11-23 10:54:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:38,947 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2018-11-23 10:54:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:38,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 10:54:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-23 10:54:38,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-23 10:54:39,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,045 INFO L225 Difference]: With dead ends: 88 [2018-11-23 10:54:39,046 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 10:54:39,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 10:54:39,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-11-23 10:54:39,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:39,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 64 states. [2018-11-23 10:54:39,096 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 64 states. [2018-11-23 10:54:39,096 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 64 states. [2018-11-23 10:54:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,100 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2018-11-23 10:54:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2018-11-23 10:54:39,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,102 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 86 states. [2018-11-23 10:54:39,102 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 86 states. [2018-11-23 10:54:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,107 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2018-11-23 10:54:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 141 transitions. [2018-11-23 10:54:39,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:39,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 10:54:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2018-11-23 10:54:39,112 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2018-11-23 10:54:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:39,113 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2018-11-23 10:54:39,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-11-23 10:54:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:54:39,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:39,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:39,115 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:39,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2018-11-23 10:54:39,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:39,115 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:39,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:39,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {1274#true} call ULTIMATE.init(); {1274#true} is VALID [2018-11-23 10:54:39,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {1274#true} assume true; {1274#true} is VALID [2018-11-23 10:54:39,263 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1274#true} {1274#true} #129#return; {1274#true} is VALID [2018-11-23 10:54:39,263 INFO L256 TraceCheckUtils]: 3: Hoare triple {1274#true} call #t~ret7 := main(); {1274#true} is VALID [2018-11-23 10:54:39,264 INFO L273 TraceCheckUtils]: 4: Hoare triple {1274#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;havoc ~cond~0; {1274#true} is VALID [2018-11-23 10:54:39,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {1274#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {1274#true} is VALID [2018-11-23 10:54:39,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {1274#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {1274#true} is VALID [2018-11-23 10:54:39,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {1274#true} assume !(0bv32 != ~p1~0); {1274#true} is VALID [2018-11-23 10:54:39,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {1274#true} assume !(0bv32 != ~p2~0); {1303#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:39,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {1303#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1303#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:39,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {1303#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1303#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:39,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {1303#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1303#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:39,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {1303#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1303#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:39,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {1303#(= (_ bv0 32) main_~p2~0)} assume !(0bv32 != ~p1~0); {1303#(= (_ bv0 32) main_~p2~0)} is VALID [2018-11-23 10:54:39,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {1303#(= (_ bv0 32) main_~p2~0)} assume 0bv32 != ~p2~0; {1275#false} is VALID [2018-11-23 10:54:39,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {1275#false} assume 1bv32 != ~lk2~0; {1275#false} is VALID [2018-11-23 10:54:39,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2018-11-23 10:54:39,270 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,270 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:39,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:39,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:39,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:39,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:39,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:39,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:39,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:39,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:39,354 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2018-11-23 10:54:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,522 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2018-11-23 10:54:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:39,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:54:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 10:54:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:39,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2018-11-23 10:54:39,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2018-11-23 10:54:39,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,671 INFO L225 Difference]: With dead ends: 144 [2018-11-23 10:54:39,671 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 10:54:39,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 10:54:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-11-23 10:54:39,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:39,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 86 states. [2018-11-23 10:54:39,711 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 86 states. [2018-11-23 10:54:39,711 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 86 states. [2018-11-23 10:54:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,715 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2018-11-23 10:54:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2018-11-23 10:54:39,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,716 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 88 states. [2018-11-23 10:54:39,716 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 88 states. [2018-11-23 10:54:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:39,720 INFO L93 Difference]: Finished difference Result 88 states and 139 transitions. [2018-11-23 10:54:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2018-11-23 10:54:39,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:39,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:39,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:39,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 10:54:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2018-11-23 10:54:39,725 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2018-11-23 10:54:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:39,726 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2018-11-23 10:54:39,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-11-23 10:54:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:39,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:39,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:39,727 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:39,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:39,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2018-11-23 10:54:39,728 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:39,728 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:39,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:39,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:39,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {1757#true} call ULTIMATE.init(); {1757#true} is VALID [2018-11-23 10:54:39,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {1757#true} assume true; {1757#true} is VALID [2018-11-23 10:54:39,811 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1757#true} {1757#true} #129#return; {1757#true} is VALID [2018-11-23 10:54:39,811 INFO L256 TraceCheckUtils]: 3: Hoare triple {1757#true} call #t~ret7 := main(); {1757#true} is VALID [2018-11-23 10:54:39,811 INFO L273 TraceCheckUtils]: 4: Hoare triple {1757#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;havoc ~cond~0; {1757#true} is VALID [2018-11-23 10:54:39,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {1757#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {1757#true} is VALID [2018-11-23 10:54:39,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {1757#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {1757#true} is VALID [2018-11-23 10:54:39,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {1757#true} assume !(0bv32 != ~p1~0); {1757#true} is VALID [2018-11-23 10:54:39,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {1757#true} assume 0bv32 != ~p2~0;~lk2~0 := 1bv32; {1786#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {1786#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {1786#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {1786#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {1786#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {1786#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {1786#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {1786#(not (= (_ bv0 32) main_~p2~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {1786#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {1786#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p1~0); {1786#(not (= (_ bv0 32) main_~p2~0))} is VALID [2018-11-23 10:54:39,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {1786#(not (= (_ bv0 32) main_~p2~0))} assume !(0bv32 != ~p2~0); {1758#false} is VALID [2018-11-23 10:54:39,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {1758#false} assume 0bv32 != ~p3~0; {1758#false} is VALID [2018-11-23 10:54:39,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {1758#false} assume 1bv32 != ~lk3~0; {1758#false} is VALID [2018-11-23 10:54:39,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {1758#false} assume !false; {1758#false} is VALID [2018-11-23 10:54:39,821 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,822 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:39,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:39,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:39,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:39,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:39,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:39,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:39,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:39,853 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2018-11-23 10:54:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,134 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2018-11-23 10:54:40,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:40,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:40,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 10:54:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2018-11-23 10:54:40,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2018-11-23 10:54:40,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,321 INFO L225 Difference]: With dead ends: 129 [2018-11-23 10:54:40,321 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 10:54:40,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 10:54:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 10:54:40,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:40,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 88 states. [2018-11-23 10:54:40,349 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 88 states. [2018-11-23 10:54:40,349 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 88 states. [2018-11-23 10:54:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,352 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2018-11-23 10:54:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-11-23 10:54:40,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,353 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 90 states. [2018-11-23 10:54:40,353 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 90 states. [2018-11-23 10:54:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,356 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2018-11-23 10:54:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2018-11-23 10:54:40,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:40,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 10:54:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-11-23 10:54:40,361 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2018-11-23 10:54:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:40,361 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-11-23 10:54:40,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2018-11-23 10:54:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:40,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:40,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:40,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:40,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:40,363 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2018-11-23 10:54:40,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:40,364 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:40,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:40,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {2234#true} call ULTIMATE.init(); {2234#true} is VALID [2018-11-23 10:54:40,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {2234#true} assume true; {2234#true} is VALID [2018-11-23 10:54:40,449 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2234#true} {2234#true} #129#return; {2234#true} is VALID [2018-11-23 10:54:40,450 INFO L256 TraceCheckUtils]: 3: Hoare triple {2234#true} call #t~ret7 := main(); {2234#true} is VALID [2018-11-23 10:54:40,450 INFO L273 TraceCheckUtils]: 4: Hoare triple {2234#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;havoc ~cond~0; {2234#true} is VALID [2018-11-23 10:54:40,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {2234#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {2234#true} is VALID [2018-11-23 10:54:40,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {2234#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {2234#true} is VALID [2018-11-23 10:54:40,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {2234#true} assume !(0bv32 != ~p1~0); {2234#true} is VALID [2018-11-23 10:54:40,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {2234#true} assume !(0bv32 != ~p2~0); {2234#true} is VALID [2018-11-23 10:54:40,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {2234#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:40,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:40,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:40,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:40,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:40,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:40,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p3~0; {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:40,463 INFO L273 TraceCheckUtils]: 16: Hoare triple {2266#(= (bvadd main_~lk3~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk3~0; {2235#false} is VALID [2018-11-23 10:54:40,463 INFO L273 TraceCheckUtils]: 17: Hoare triple {2235#false} assume !false; {2235#false} is VALID [2018-11-23 10:54:40,465 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:40,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:40,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:40,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:40,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:40,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:40,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:40,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:40,493 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2018-11-23 10:54:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,651 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2018-11-23 10:54:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:40,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 10:54:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-23 10:54:40,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-23 10:54:40,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,759 INFO L225 Difference]: With dead ends: 156 [2018-11-23 10:54:40,759 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 10:54:40,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 10:54:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2018-11-23 10:54:40,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:40,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 120 states. [2018-11-23 10:54:40,830 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 120 states. [2018-11-23 10:54:40,830 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 120 states. [2018-11-23 10:54:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,835 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2018-11-23 10:54:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2018-11-23 10:54:40,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,836 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand 154 states. [2018-11-23 10:54:40,836 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 154 states. [2018-11-23 10:54:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:40,842 INFO L93 Difference]: Finished difference Result 154 states and 243 transitions. [2018-11-23 10:54:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2018-11-23 10:54:40,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:40,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:40,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:40,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 10:54:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-11-23 10:54:40,848 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2018-11-23 10:54:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:40,848 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2018-11-23 10:54:40,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2018-11-23 10:54:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:54:40,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:40,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:40,850 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:40,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:40,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2018-11-23 10:54:40,851 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:40,851 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:40,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:40,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:40,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2018-11-23 10:54:40,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {2900#true} assume true; {2900#true} is VALID [2018-11-23 10:54:40,950 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2900#true} {2900#true} #129#return; {2900#true} is VALID [2018-11-23 10:54:40,950 INFO L256 TraceCheckUtils]: 3: Hoare triple {2900#true} call #t~ret7 := main(); {2900#true} is VALID [2018-11-23 10:54:40,951 INFO L273 TraceCheckUtils]: 4: Hoare triple {2900#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;havoc ~cond~0; {2900#true} is VALID [2018-11-23 10:54:40,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {2900#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {2900#true} is VALID [2018-11-23 10:54:40,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {2900#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {2900#true} is VALID [2018-11-23 10:54:40,952 INFO L273 TraceCheckUtils]: 7: Hoare triple {2900#true} assume !(0bv32 != ~p1~0); {2900#true} is VALID [2018-11-23 10:54:40,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {2900#true} assume !(0bv32 != ~p2~0); {2900#true} is VALID [2018-11-23 10:54:40,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {2900#true} assume !(0bv32 != ~p3~0); {2932#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {2932#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {2932#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {2932#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {2932#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {2932#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {2932#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {2932#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p1~0); {2932#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {2932#(= (_ bv0 32) main_~p3~0)} assume !(0bv32 != ~p2~0); {2932#(= (_ bv0 32) main_~p3~0)} is VALID [2018-11-23 10:54:40,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {2932#(= (_ bv0 32) main_~p3~0)} assume 0bv32 != ~p3~0; {2901#false} is VALID [2018-11-23 10:54:40,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {2901#false} assume 1bv32 != ~lk3~0; {2901#false} is VALID [2018-11-23 10:54:40,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2018-11-23 10:54:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:40,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:40,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:40,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:40,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:40,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:40,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:40,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:40,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:40,996 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2018-11-23 10:54:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,198 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2018-11-23 10:54:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:41,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 10:54:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 10:54:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 10:54:41,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-23 10:54:41,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:41,634 INFO L225 Difference]: With dead ends: 272 [2018-11-23 10:54:41,634 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 10:54:41,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 10:54:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-23 10:54:41,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:41,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 160 states. [2018-11-23 10:54:41,740 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 160 states. [2018-11-23 10:54:41,740 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 160 states. [2018-11-23 10:54:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,746 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2018-11-23 10:54:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2018-11-23 10:54:41,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:41,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:41,747 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 162 states. [2018-11-23 10:54:41,747 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 162 states. [2018-11-23 10:54:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:41,754 INFO L93 Difference]: Finished difference Result 162 states and 243 transitions. [2018-11-23 10:54:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 243 transitions. [2018-11-23 10:54:41,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:41,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:41,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:41,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 10:54:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2018-11-23 10:54:41,761 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2018-11-23 10:54:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:41,762 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2018-11-23 10:54:41,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-11-23 10:54:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:41,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:41,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:41,763 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:41,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2018-11-23 10:54:41,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:41,764 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:41,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:41,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:42,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {3746#true} call ULTIMATE.init(); {3746#true} is VALID [2018-11-23 10:54:42,026 INFO L273 TraceCheckUtils]: 1: Hoare triple {3746#true} assume true; {3746#true} is VALID [2018-11-23 10:54:42,026 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3746#true} {3746#true} #129#return; {3746#true} is VALID [2018-11-23 10:54:42,026 INFO L256 TraceCheckUtils]: 3: Hoare triple {3746#true} call #t~ret7 := main(); {3746#true} is VALID [2018-11-23 10:54:42,028 INFO L273 TraceCheckUtils]: 4: Hoare triple {3746#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;havoc ~cond~0; {3746#true} is VALID [2018-11-23 10:54:42,028 INFO L273 TraceCheckUtils]: 5: Hoare triple {3746#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {3746#true} is VALID [2018-11-23 10:54:42,028 INFO L273 TraceCheckUtils]: 6: Hoare triple {3746#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {3746#true} is VALID [2018-11-23 10:54:42,029 INFO L273 TraceCheckUtils]: 7: Hoare triple {3746#true} assume !(0bv32 != ~p1~0); {3746#true} is VALID [2018-11-23 10:54:42,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {3746#true} assume !(0bv32 != ~p2~0); {3746#true} is VALID [2018-11-23 10:54:42,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {3746#true} assume 0bv32 != ~p3~0;~lk3~0 := 1bv32; {3778#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:42,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {3778#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {3778#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:42,033 INFO L273 TraceCheckUtils]: 11: Hoare triple {3778#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {3778#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:42,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {3778#(not (= (_ bv0 32) main_~p3~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {3778#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:42,034 INFO L273 TraceCheckUtils]: 13: Hoare triple {3778#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p1~0); {3778#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:42,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {3778#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p2~0); {3778#(not (= (_ bv0 32) main_~p3~0))} is VALID [2018-11-23 10:54:42,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {3778#(not (= (_ bv0 32) main_~p3~0))} assume !(0bv32 != ~p3~0); {3747#false} is VALID [2018-11-23 10:54:42,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {3747#false} assume 0bv32 != ~p4~0; {3747#false} is VALID [2018-11-23 10:54:42,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {3747#false} assume 1bv32 != ~lk4~0; {3747#false} is VALID [2018-11-23 10:54:42,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {3747#false} assume !false; {3747#false} is VALID [2018-11-23 10:54:42,036 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:42,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:42,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:42,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:42,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:42,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:42,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:42,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:42,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:42,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:42,061 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2018-11-23 10:54:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,279 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2018-11-23 10:54:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:42,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-23 10:54:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2018-11-23 10:54:42,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2018-11-23 10:54:42,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:42,516 INFO L225 Difference]: With dead ends: 240 [2018-11-23 10:54:42,516 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 10:54:42,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 10:54:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-11-23 10:54:42,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:42,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 164 states. [2018-11-23 10:54:42,605 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 164 states. [2018-11-23 10:54:42,605 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 164 states. [2018-11-23 10:54:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,612 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2018-11-23 10:54:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2018-11-23 10:54:42,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:42,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:42,613 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 166 states. [2018-11-23 10:54:42,613 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 166 states. [2018-11-23 10:54:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:42,619 INFO L93 Difference]: Finished difference Result 166 states and 243 transitions. [2018-11-23 10:54:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 243 transitions. [2018-11-23 10:54:42,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:42,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:42,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:42,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-23 10:54:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2018-11-23 10:54:42,627 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2018-11-23 10:54:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:42,628 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2018-11-23 10:54:42,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2018-11-23 10:54:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:42,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:42,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:42,629 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:42,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2018-11-23 10:54:42,630 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:42,630 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:42,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:42,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:42,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {4575#true} call ULTIMATE.init(); {4575#true} is VALID [2018-11-23 10:54:42,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {4575#true} assume true; {4575#true} is VALID [2018-11-23 10:54:42,747 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4575#true} {4575#true} #129#return; {4575#true} is VALID [2018-11-23 10:54:42,747 INFO L256 TraceCheckUtils]: 3: Hoare triple {4575#true} call #t~ret7 := main(); {4575#true} is VALID [2018-11-23 10:54:42,747 INFO L273 TraceCheckUtils]: 4: Hoare triple {4575#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;havoc ~cond~0; {4575#true} is VALID [2018-11-23 10:54:42,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {4575#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {4575#true} is VALID [2018-11-23 10:54:42,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {4575#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {4575#true} is VALID [2018-11-23 10:54:42,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {4575#true} assume !(0bv32 != ~p1~0); {4575#true} is VALID [2018-11-23 10:54:42,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {4575#true} assume !(0bv32 != ~p2~0); {4575#true} is VALID [2018-11-23 10:54:42,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {4575#true} assume !(0bv32 != ~p3~0); {4575#true} is VALID [2018-11-23 10:54:42,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {4575#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:42,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:42,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:42,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:42,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:42,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:42,796 INFO L273 TraceCheckUtils]: 16: Hoare triple {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p4~0; {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:42,796 INFO L273 TraceCheckUtils]: 17: Hoare triple {4610#(= (bvadd main_~lk4~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk4~0; {4576#false} is VALID [2018-11-23 10:54:42,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {4576#false} assume !false; {4576#false} is VALID [2018-11-23 10:54:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:54:42,797 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:42,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:42,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:42,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:42,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:42,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:42,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:42,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:42,829 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2018-11-23 10:54:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:43,004 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2018-11-23 10:54:43,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:43,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 10:54:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-23 10:54:43,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-23 10:54:43,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:43,112 INFO L225 Difference]: With dead ends: 284 [2018-11-23 10:54:43,112 INFO L226 Difference]: Without dead ends: 282 [2018-11-23 10:54:43,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-23 10:54:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2018-11-23 10:54:43,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:43,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand 232 states. [2018-11-23 10:54:43,183 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand 232 states. [2018-11-23 10:54:43,183 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 232 states. [2018-11-23 10:54:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:43,192 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2018-11-23 10:54:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2018-11-23 10:54:43,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:43,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:43,193 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand 282 states. [2018-11-23 10:54:43,193 INFO L87 Difference]: Start difference. First operand 232 states. Second operand 282 states. [2018-11-23 10:54:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:43,201 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2018-11-23 10:54:43,201 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2018-11-23 10:54:43,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:43,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:43,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:43,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 10:54:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2018-11-23 10:54:43,208 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2018-11-23 10:54:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:43,208 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2018-11-23 10:54:43,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2018-11-23 10:54:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:54:43,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:43,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:43,210 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:43,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2018-11-23 10:54:43,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:43,211 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:43,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:43,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:43,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {5752#true} call ULTIMATE.init(); {5752#true} is VALID [2018-11-23 10:54:43,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {5752#true} assume true; {5752#true} is VALID [2018-11-23 10:54:43,559 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5752#true} {5752#true} #129#return; {5752#true} is VALID [2018-11-23 10:54:43,559 INFO L256 TraceCheckUtils]: 3: Hoare triple {5752#true} call #t~ret7 := main(); {5752#true} is VALID [2018-11-23 10:54:43,560 INFO L273 TraceCheckUtils]: 4: Hoare triple {5752#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;havoc ~cond~0; {5752#true} is VALID [2018-11-23 10:54:43,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {5752#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {5752#true} is VALID [2018-11-23 10:54:43,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {5752#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {5752#true} is VALID [2018-11-23 10:54:43,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {5752#true} assume !(0bv32 != ~p1~0); {5752#true} is VALID [2018-11-23 10:54:43,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {5752#true} assume !(0bv32 != ~p2~0); {5752#true} is VALID [2018-11-23 10:54:43,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {5752#true} assume !(0bv32 != ~p3~0); {5752#true} is VALID [2018-11-23 10:54:43,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {5752#true} assume !(0bv32 != ~p4~0); {5787#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {5787#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {5787#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {5787#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {5787#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,564 INFO L273 TraceCheckUtils]: 13: Hoare triple {5787#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p1~0); {5787#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {5787#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p2~0); {5787#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {5787#(= (_ bv0 32) main_~p4~0)} assume !(0bv32 != ~p3~0); {5787#(= (_ bv0 32) main_~p4~0)} is VALID [2018-11-23 10:54:43,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {5787#(= (_ bv0 32) main_~p4~0)} assume 0bv32 != ~p4~0; {5753#false} is VALID [2018-11-23 10:54:43,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {5753#false} assume 1bv32 != ~lk4~0; {5753#false} is VALID [2018-11-23 10:54:43,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {5753#false} assume !false; {5753#false} is VALID [2018-11-23 10:54:43,567 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,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:43,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:43,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:43,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:43,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:43,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:43,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:43,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:43,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:43,593 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2018-11-23 10:54:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:43,865 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2018-11-23 10:54:43,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:43,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 10:54:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:54:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2018-11-23 10:54:43,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2018-11-23 10:54:44,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:44,563 INFO L225 Difference]: With dead ends: 524 [2018-11-23 10:54:44,564 INFO L226 Difference]: Without dead ends: 306 [2018-11-23 10:54:44,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-23 10:54:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 10:54:44,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:44,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand 304 states. [2018-11-23 10:54:44,718 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand 304 states. [2018-11-23 10:54:44,718 INFO L87 Difference]: Start difference. First operand 306 states. Second operand 304 states. [2018-11-23 10:54:44,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,726 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2018-11-23 10:54:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2018-11-23 10:54:44,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,727 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 306 states. [2018-11-23 10:54:44,727 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 306 states. [2018-11-23 10:54:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:44,736 INFO L93 Difference]: Finished difference Result 306 states and 423 transitions. [2018-11-23 10:54:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 423 transitions. [2018-11-23 10:54:44,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:44,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:44,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:44,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 10:54:44,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2018-11-23 10:54:44,746 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2018-11-23 10:54:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:44,746 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2018-11-23 10:54:44,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2018-11-23 10:54:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:44,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:44,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:44,748 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:44,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2018-11-23 10:54:44,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:44,749 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,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:44,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:45,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {7305#true} call ULTIMATE.init(); {7305#true} is VALID [2018-11-23 10:54:45,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {7305#true} assume true; {7305#true} is VALID [2018-11-23 10:54:45,189 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7305#true} {7305#true} #129#return; {7305#true} is VALID [2018-11-23 10:54:45,189 INFO L256 TraceCheckUtils]: 3: Hoare triple {7305#true} call #t~ret7 := main(); {7305#true} is VALID [2018-11-23 10:54:45,189 INFO L273 TraceCheckUtils]: 4: Hoare triple {7305#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;havoc ~cond~0; {7305#true} is VALID [2018-11-23 10:54:45,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {7305#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {7305#true} is VALID [2018-11-23 10:54:45,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {7305#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {7305#true} is VALID [2018-11-23 10:54:45,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {7305#true} assume !(0bv32 != ~p1~0); {7305#true} is VALID [2018-11-23 10:54:45,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {7305#true} assume !(0bv32 != ~p2~0); {7305#true} is VALID [2018-11-23 10:54:45,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {7305#true} assume !(0bv32 != ~p3~0); {7305#true} is VALID [2018-11-23 10:54:45,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {7305#true} assume 0bv32 != ~p4~0;~lk4~0 := 1bv32; {7340#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,191 INFO L273 TraceCheckUtils]: 11: Hoare triple {7340#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {7340#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {7340#(not (= (_ bv0 32) main_~p4~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {7340#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {7340#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p1~0); {7340#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {7340#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p2~0); {7340#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,233 INFO L273 TraceCheckUtils]: 15: Hoare triple {7340#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p3~0); {7340#(not (= (_ bv0 32) main_~p4~0))} is VALID [2018-11-23 10:54:45,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {7340#(not (= (_ bv0 32) main_~p4~0))} assume !(0bv32 != ~p4~0); {7306#false} is VALID [2018-11-23 10:54:45,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {7306#false} assume 0bv32 != ~p5~0; {7306#false} is VALID [2018-11-23 10:54:45,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {7306#false} assume 1bv32 != ~lk5~0; {7306#false} is VALID [2018-11-23 10:54:45,242 INFO L273 TraceCheckUtils]: 19: Hoare triple {7306#false} assume !false; {7306#false} is VALID [2018-11-23 10:54:45,243 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:45,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:45,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:45,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:45,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:45,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:45,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:45,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:45,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:45,284 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2018-11-23 10:54:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:45,734 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2018-11-23 10:54:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:45,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2018-11-23 10:54:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2018-11-23 10:54:45,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2018-11-23 10:54:46,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:46,348 INFO L225 Difference]: With dead ends: 456 [2018-11-23 10:54:46,349 INFO L226 Difference]: Without dead ends: 314 [2018-11-23 10:54:46,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:46,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-23 10:54:46,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-11-23 10:54:46,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:46,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand 312 states. [2018-11-23 10:54:46,698 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand 312 states. [2018-11-23 10:54:46,698 INFO L87 Difference]: Start difference. First operand 314 states. Second operand 312 states. [2018-11-23 10:54:46,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,708 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2018-11-23 10:54:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2018-11-23 10:54:46,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:46,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:46,709 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 314 states. [2018-11-23 10:54:46,709 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 314 states. [2018-11-23 10:54:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:46,720 INFO L93 Difference]: Finished difference Result 314 states and 423 transitions. [2018-11-23 10:54:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2018-11-23 10:54:46,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:46,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:46,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:46,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-23 10:54:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2018-11-23 10:54:46,732 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2018-11-23 10:54:46,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:46,733 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2018-11-23 10:54:46,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2018-11-23 10:54:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:46,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:46,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:46,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:46,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:46,735 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2018-11-23 10:54:46,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:46,736 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,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:46,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:47,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {8817#true} call ULTIMATE.init(); {8817#true} is VALID [2018-11-23 10:54:47,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {8817#true} assume true; {8817#true} is VALID [2018-11-23 10:54:47,246 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8817#true} {8817#true} #129#return; {8817#true} is VALID [2018-11-23 10:54:47,246 INFO L256 TraceCheckUtils]: 3: Hoare triple {8817#true} call #t~ret7 := main(); {8817#true} is VALID [2018-11-23 10:54:47,246 INFO L273 TraceCheckUtils]: 4: Hoare triple {8817#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;havoc ~cond~0; {8817#true} is VALID [2018-11-23 10:54:47,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {8817#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {8817#true} is VALID [2018-11-23 10:54:47,247 INFO L273 TraceCheckUtils]: 6: Hoare triple {8817#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {8817#true} is VALID [2018-11-23 10:54:47,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {8817#true} assume !(0bv32 != ~p1~0); {8817#true} is VALID [2018-11-23 10:54:47,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {8817#true} assume !(0bv32 != ~p2~0); {8817#true} is VALID [2018-11-23 10:54:47,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {8817#true} assume !(0bv32 != ~p3~0); {8817#true} is VALID [2018-11-23 10:54:47,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {8817#true} assume !(0bv32 != ~p4~0); {8817#true} is VALID [2018-11-23 10:54:47,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {8817#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,249 INFO L273 TraceCheckUtils]: 14: Hoare triple {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,249 INFO L273 TraceCheckUtils]: 15: Hoare triple {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p5~0; {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:47,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {8855#(= (bvadd main_~lk5~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk5~0; {8818#false} is VALID [2018-11-23 10:54:47,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {8818#false} assume !false; {8818#false} is VALID [2018-11-23 10:54:47,253 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,253 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:47,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:47,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:47,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:47,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:47,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:47,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:47,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:47,280 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2018-11-23 10:54:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,058 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2018-11-23 10:54:48,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:48,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:54:48,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-23 10:54:48,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-23 10:54:48,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,174 INFO L225 Difference]: With dead ends: 524 [2018-11-23 10:54:48,174 INFO L226 Difference]: Without dead ends: 522 [2018-11-23 10:54:48,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-23 10:54:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2018-11-23 10:54:48,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:48,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand 456 states. [2018-11-23 10:54:48,341 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand 456 states. [2018-11-23 10:54:48,341 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 456 states. [2018-11-23 10:54:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,355 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2018-11-23 10:54:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2018-11-23 10:54:48,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:48,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:48,356 INFO L74 IsIncluded]: Start isIncluded. First operand 456 states. Second operand 522 states. [2018-11-23 10:54:48,357 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 522 states. [2018-11-23 10:54:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:48,373 INFO L93 Difference]: Finished difference Result 522 states and 695 transitions. [2018-11-23 10:54:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 695 transitions. [2018-11-23 10:54:48,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:48,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:48,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:48,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:48,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 10:54:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2018-11-23 10:54:48,387 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2018-11-23 10:54:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:48,388 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2018-11-23 10:54:48,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2018-11-23 10:54:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:54:48,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:48,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:48,389 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:48,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2018-11-23 10:54:48,390 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:48,390 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:48,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:48,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:48,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {10965#true} call ULTIMATE.init(); {10965#true} is VALID [2018-11-23 10:54:48,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {10965#true} assume true; {10965#true} is VALID [2018-11-23 10:54:48,469 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10965#true} {10965#true} #129#return; {10965#true} is VALID [2018-11-23 10:54:48,469 INFO L256 TraceCheckUtils]: 3: Hoare triple {10965#true} call #t~ret7 := main(); {10965#true} is VALID [2018-11-23 10:54:48,469 INFO L273 TraceCheckUtils]: 4: Hoare triple {10965#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;havoc ~cond~0; {10965#true} is VALID [2018-11-23 10:54:48,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {10965#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {10965#true} is VALID [2018-11-23 10:54:48,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {10965#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {10965#true} is VALID [2018-11-23 10:54:48,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {10965#true} assume !(0bv32 != ~p1~0); {10965#true} is VALID [2018-11-23 10:54:48,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {10965#true} assume !(0bv32 != ~p2~0); {10965#true} is VALID [2018-11-23 10:54:48,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {10965#true} assume !(0bv32 != ~p3~0); {10965#true} is VALID [2018-11-23 10:54:48,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {10965#true} assume !(0bv32 != ~p4~0); {10965#true} is VALID [2018-11-23 10:54:48,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {10965#true} assume !(0bv32 != ~p5~0); {11003#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {11003#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {11003#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {11003#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p1~0); {11003#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {11003#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p2~0); {11003#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {11003#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p3~0); {11003#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {11003#(= (_ bv0 32) main_~p5~0)} assume !(0bv32 != ~p4~0); {11003#(= (_ bv0 32) main_~p5~0)} is VALID [2018-11-23 10:54:48,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {11003#(= (_ bv0 32) main_~p5~0)} assume 0bv32 != ~p5~0; {10966#false} is VALID [2018-11-23 10:54:48,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {10966#false} assume 1bv32 != ~lk5~0; {10966#false} is VALID [2018-11-23 10:54:48,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {10966#false} assume !false; {10966#false} is VALID [2018-11-23 10:54:48,476 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:48,476 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:48,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:48,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:48,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:48,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:48,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:48,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:48,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:48,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:48,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:48,495 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2018-11-23 10:54:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,105 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2018-11-23 10:54:49,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:49,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 10:54:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2018-11-23 10:54:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2018-11-23 10:54:49,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2018-11-23 10:54:49,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,309 INFO L225 Difference]: With dead ends: 1020 [2018-11-23 10:54:49,309 INFO L226 Difference]: Without dead ends: 586 [2018-11-23 10:54:49,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-23 10:54:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2018-11-23 10:54:49,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:49,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand 584 states. [2018-11-23 10:54:49,545 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand 584 states. [2018-11-23 10:54:49,545 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 584 states. [2018-11-23 10:54:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,563 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2018-11-23 10:54:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2018-11-23 10:54:49,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,565 INFO L74 IsIncluded]: Start isIncluded. First operand 584 states. Second operand 586 states. [2018-11-23 10:54:49,565 INFO L87 Difference]: Start difference. First operand 584 states. Second operand 586 states. [2018-11-23 10:54:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:49,584 INFO L93 Difference]: Finished difference Result 586 states and 727 transitions. [2018-11-23 10:54:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 727 transitions. [2018-11-23 10:54:49,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:49,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:49,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:49,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 10:54:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2018-11-23 10:54:49,607 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2018-11-23 10:54:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:49,607 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2018-11-23 10:54:49,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2018-11-23 10:54:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:49,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:49,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:49,609 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:49,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2018-11-23 10:54:49,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:49,610 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,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:49,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:49,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {13897#true} call ULTIMATE.init(); {13897#true} is VALID [2018-11-23 10:54:49,725 INFO L273 TraceCheckUtils]: 1: Hoare triple {13897#true} assume true; {13897#true} is VALID [2018-11-23 10:54:49,726 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13897#true} {13897#true} #129#return; {13897#true} is VALID [2018-11-23 10:54:49,726 INFO L256 TraceCheckUtils]: 3: Hoare triple {13897#true} call #t~ret7 := main(); {13897#true} is VALID [2018-11-23 10:54:49,726 INFO L273 TraceCheckUtils]: 4: Hoare triple {13897#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;havoc ~cond~0; {13897#true} is VALID [2018-11-23 10:54:49,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {13897#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {13897#true} is VALID [2018-11-23 10:54:49,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {13897#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {13897#true} is VALID [2018-11-23 10:54:49,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {13897#true} assume !(0bv32 != ~p1~0); {13897#true} is VALID [2018-11-23 10:54:49,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {13897#true} assume !(0bv32 != ~p2~0); {13897#true} is VALID [2018-11-23 10:54:49,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {13897#true} assume !(0bv32 != ~p3~0); {13897#true} is VALID [2018-11-23 10:54:49,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {13897#true} assume !(0bv32 != ~p4~0); {13897#true} is VALID [2018-11-23 10:54:49,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {13897#true} assume 0bv32 != ~p5~0;~lk5~0 := 1bv32; {13935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {13935#(not (= (_ bv0 32) main_~p5~0))} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {13935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {13935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p1~0); {13935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {13935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p2~0); {13935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {13935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p3~0); {13935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {13935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p4~0); {13935#(not (= (_ bv0 32) main_~p5~0))} is VALID [2018-11-23 10:54:49,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {13935#(not (= (_ bv0 32) main_~p5~0))} assume !(0bv32 != ~p5~0); {13898#false} is VALID [2018-11-23 10:54:49,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {13898#false} assume 0bv32 != ~p6~0; {13898#false} is VALID [2018-11-23 10:54:49,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {13898#false} assume 1bv32 != ~lk6~0; {13898#false} is VALID [2018-11-23 10:54:49,733 INFO L273 TraceCheckUtils]: 20: Hoare triple {13898#false} assume !false; {13898#false} is VALID [2018-11-23 10:54:49,734 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,734 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:49,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:49,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:49,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:49,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:49,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:49,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:49,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:49,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:49,759 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2018-11-23 10:54:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:50,876 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2018-11-23 10:54:50,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:50,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:50,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 10:54:50,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:51,002 INFO L225 Difference]: With dead ends: 876 [2018-11-23 10:54:51,002 INFO L226 Difference]: Without dead ends: 602 [2018-11-23 10:54:51,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-23 10:54:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-23 10:54:51,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:51,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 602 states. Second operand 600 states. [2018-11-23 10:54:51,421 INFO L74 IsIncluded]: Start isIncluded. First operand 602 states. Second operand 600 states. [2018-11-23 10:54:51,421 INFO L87 Difference]: Start difference. First operand 602 states. Second operand 600 states. [2018-11-23 10:54:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,439 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2018-11-23 10:54:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2018-11-23 10:54:51,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,441 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand 602 states. [2018-11-23 10:54:51,441 INFO L87 Difference]: Start difference. First operand 600 states. Second operand 602 states. [2018-11-23 10:54:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:51,463 INFO L93 Difference]: Finished difference Result 602 states and 727 transitions. [2018-11-23 10:54:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 727 transitions. [2018-11-23 10:54:51,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:51,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:51,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:51,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-23 10:54:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2018-11-23 10:54:51,486 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2018-11-23 10:54:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:51,486 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2018-11-23 10:54:51,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2018-11-23 10:54:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:51,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:51,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:51,489 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:51,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2018-11-23 10:54:51,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:51,490 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,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:51,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:51,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {16736#true} call ULTIMATE.init(); {16736#true} is VALID [2018-11-23 10:54:51,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {16736#true} assume true; {16736#true} is VALID [2018-11-23 10:54:51,586 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16736#true} {16736#true} #129#return; {16736#true} is VALID [2018-11-23 10:54:51,586 INFO L256 TraceCheckUtils]: 3: Hoare triple {16736#true} call #t~ret7 := main(); {16736#true} is VALID [2018-11-23 10:54:51,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {16736#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;havoc ~cond~0; {16736#true} is VALID [2018-11-23 10:54:51,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {16736#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {16736#true} is VALID [2018-11-23 10:54:51,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {16736#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {16736#true} is VALID [2018-11-23 10:54:51,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {16736#true} assume !(0bv32 != ~p1~0); {16736#true} is VALID [2018-11-23 10:54:51,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {16736#true} assume !(0bv32 != ~p2~0); {16736#true} is VALID [2018-11-23 10:54:51,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {16736#true} assume !(0bv32 != ~p3~0); {16736#true} is VALID [2018-11-23 10:54:51,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {16736#true} assume !(0bv32 != ~p4~0); {16736#true} is VALID [2018-11-23 10:54:51,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {16736#true} assume !(0bv32 != ~p5~0); {16736#true} is VALID [2018-11-23 10:54:51,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {16736#true} assume 0bv32 != ~p6~0;~lk6~0 := 1bv32; {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p1~0); {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p2~0); {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p3~0); {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p4~0); {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != ~p5~0); {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != ~p6~0; {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:54:51,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {16777#(= (bvadd main_~lk6~0 (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != ~lk6~0; {16737#false} is VALID [2018-11-23 10:54:51,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {16737#false} assume !false; {16737#false} is VALID [2018-11-23 10:54:51,594 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,595 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:51,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:51,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:51,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:51,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:51,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:51,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:51,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:51,621 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2018-11-23 10:54:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:52,607 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2018-11-23 10:54:52,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:52,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 10:54:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-23 10:54:52,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-23 10:54:52,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:52,758 INFO L225 Difference]: With dead ends: 970 [2018-11-23 10:54:52,758 INFO L226 Difference]: Without dead ends: 968 [2018-11-23 10:54:52,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-23 10:54:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2018-11-23 10:54:53,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:53,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 968 states. Second operand 904 states. [2018-11-23 10:54:53,470 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand 904 states. [2018-11-23 10:54:53,471 INFO L87 Difference]: Start difference. First operand 968 states. Second operand 904 states. [2018-11-23 10:54:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,504 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2018-11-23 10:54:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2018-11-23 10:54:53,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:53,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:53,506 INFO L74 IsIncluded]: Start isIncluded. First operand 904 states. Second operand 968 states. [2018-11-23 10:54:53,506 INFO L87 Difference]: Start difference. First operand 904 states. Second operand 968 states. [2018-11-23 10:54:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:53,540 INFO L93 Difference]: Finished difference Result 968 states and 1126 transitions. [2018-11-23 10:54:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1126 transitions. [2018-11-23 10:54:53,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:53,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:53,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:53,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 10:54:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2018-11-23 10:54:53,573 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2018-11-23 10:54:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:53,574 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2018-11-23 10:54:53,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2018-11-23 10:54:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:54:53,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:54:53,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:54:53,575 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:54:53,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:54:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2018-11-23 10:54:53,576 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:54:53,576 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:53,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:54:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:54:53,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:54:53,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {20720#true} call ULTIMATE.init(); {20720#true} is VALID [2018-11-23 10:54:53,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {20720#true} assume true; {20720#true} is VALID [2018-11-23 10:54:53,657 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20720#true} {20720#true} #129#return; {20720#true} is VALID [2018-11-23 10:54:53,657 INFO L256 TraceCheckUtils]: 3: Hoare triple {20720#true} call #t~ret7 := main(); {20720#true} is VALID [2018-11-23 10:54:53,657 INFO L273 TraceCheckUtils]: 4: Hoare triple {20720#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;havoc ~cond~0; {20720#true} is VALID [2018-11-23 10:54:53,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {20720#true} assume !false;~cond~0 := #t~nondet6;havoc #t~nondet6; {20720#true} is VALID [2018-11-23 10:54:53,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {20720#true} assume !(0bv32 == ~cond~0);~lk1~0 := 0bv32;~lk2~0 := 0bv32;~lk3~0 := 0bv32;~lk4~0 := 0bv32;~lk5~0 := 0bv32;~lk6~0 := 0bv32; {20720#true} is VALID [2018-11-23 10:54:53,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {20720#true} assume !(0bv32 != ~p1~0); {20720#true} is VALID [2018-11-23 10:54:53,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {20720#true} assume !(0bv32 != ~p2~0); {20720#true} is VALID [2018-11-23 10:54:53,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {20720#true} assume !(0bv32 != ~p3~0); {20720#true} is VALID [2018-11-23 10:54:53,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {20720#true} assume !(0bv32 != ~p4~0); {20720#true} is VALID [2018-11-23 10:54:53,659 INFO L273 TraceCheckUtils]: 11: Hoare triple {20720#true} assume !(0bv32 != ~p5~0); {20720#true} is VALID [2018-11-23 10:54:53,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {20720#true} assume !(0bv32 != ~p6~0); {20761#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:53,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {20761#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p1~0); {20761#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:53,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {20761#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p2~0); {20761#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:53,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {20761#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p3~0); {20761#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:53,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {20761#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p4~0); {20761#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:53,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {20761#(= (_ bv0 32) main_~p6~0)} assume !(0bv32 != ~p5~0); {20761#(= (_ bv0 32) main_~p6~0)} is VALID [2018-11-23 10:54:53,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {20761#(= (_ bv0 32) main_~p6~0)} assume 0bv32 != ~p6~0; {20721#false} is VALID [2018-11-23 10:54:53,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {20721#false} assume 1bv32 != ~lk6~0; {20721#false} is VALID [2018-11-23 10:54:53,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {20721#false} assume !false; {20721#false} is VALID [2018-11-23 10:54:53,681 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:53,682 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:54:53,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:54:53,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:54:53,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:53,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:54:53,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:54:53,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:53,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:54:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:54:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:53,732 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2018-11-23 10:54:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,576 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2018-11-23 10:54:54,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:54:54,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 10:54:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:54:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:54:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 10:54:54,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 10:54:54,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:54:54,692 INFO L225 Difference]: With dead ends: 1992 [2018-11-23 10:54:54,692 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 10:54:54,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:54:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 10:54:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 10:54:54,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:54:54,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:54,696 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:54,696 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,696 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:54:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:54:54,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,696 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:54,696 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 10:54:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:54:54,697 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 10:54:54,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:54:54,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:54:54,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:54:54,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:54:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 10:54:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 10:54:54,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-23 10:54:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:54:54,698 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 10:54:54,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:54:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 10:54:54,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:54:54,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 10:54:55,034 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 10:54:55,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:54:55,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 10:54:55,034 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 10:54:55,034 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 10:54:55,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 10:54:55,034 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-23 10:54:55,035 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,036 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,037 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-23 10:54:55,037 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,037 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-23 10:54:55,038 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 10:54:55,039 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 10:54:55,040 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2018-11-23 10:54:55,041 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2018-11-23 10:54:55,042 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-23 10:54:55,042 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2018-11-23 10:54:55,042 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2018-11-23 10:54:55,042 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2018-11-23 10:54:55,042 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-23 10:54:55,042 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2018-11-23 10:54:55,042 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 10:54:55,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:54:55 BoogieIcfgContainer [2018-11-23 10:54:55,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 10:54:55,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 10:54:55,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 10:54:55,049 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 10:54:55,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:54:35" (3/4) ... [2018-11-23 10:54:55,052 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 10:54:55,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 10:54:55,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 10:54:55,064 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 10:54:55,064 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 10:54:55,064 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 10:54:55,130 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c-witness.graphml [2018-11-23 10:54:55,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 10:54:55,132 INFO L168 Benchmark]: Toolchain (without parser) took 21186.98 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.6 MB). Peak memory consumption was 202.0 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:55,134 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:54:55,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:55,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:54:55,135 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:54:55,135 INFO L168 Benchmark]: RCFGBuilder took 724.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:55,135 INFO L168 Benchmark]: TraceAbstraction took 19954.68 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 276.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -47.7 MB). Peak memory consumption was 228.6 MB. Max. memory is 7.1 GB. [2018-11-23 10:54:55,136 INFO L168 Benchmark]: Witness Printer took 82.18 ms. Allocated memory is still 2.6 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 10:54:55,138 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 355.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 724.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19954.68 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 276.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -47.7 MB). Peak memory consumption was 228.6 MB. Max. memory is 7.1 GB. * Witness Printer took 82.18 ms. Allocated memory is still 2.6 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 19.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 11160 SizeOfPredicates, 6 NumberOfNonLiveVariables, 662 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...