java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:35:55,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:35:55,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:35:55,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:35:55,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:35:55,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:35:55,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:35:55,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:35:55,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:35:55,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:35:55,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:35:55,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:35:55,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:35:55,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:35:55,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:35:55,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:35:55,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:35:55,988 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:35:55,995 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:35:55,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:35:55,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:35:55,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:35:56,001 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:35:56,002 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:35:56,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:35:56,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:35:56,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:35:56,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:35:56,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:35:56,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:35:56,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:35:56,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:35:56,008 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:35:56,008 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:35:56,009 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:35:56,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:35:56,010 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:35:56,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:35:56,026 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:35:56,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:35:56,027 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:35:56,027 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:35:56,027 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:35:56,028 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:35:56,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:35:56,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:35:56,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:35:56,029 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:35:56,029 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:35:56,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:35:56,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:35:56,029 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:35:56,030 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:35:56,030 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:35:56,030 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:35:56,030 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:35:56,030 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:35:56,030 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:35:56,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:35:56,031 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:35:56,031 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:35:56,031 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:35:56,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:35:56,032 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:35:56,032 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:35:56,032 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:35:56,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:35:56,032 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:35:56,033 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:35:56,033 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:35:56,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:35:56,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:35:56,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:35:56,114 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:35:56,114 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:35:56,115 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c.v+cfa-reducer.c [2018-11-18 22:35:56,173 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc9ec3e9/d71b3a8d796043d79ec8eab44687db0e/FLAGf23567fdf [2018-11-18 22:35:56,640 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:35:56,641 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3_true-unreach-call.c.v+cfa-reducer.c [2018-11-18 22:35:56,647 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc9ec3e9/d71b3a8d796043d79ec8eab44687db0e/FLAGf23567fdf [2018-11-18 22:35:56,978 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc9ec3e9/d71b3a8d796043d79ec8eab44687db0e [2018-11-18 22:35:56,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:35:56,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:35:56,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:35:56,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:35:56,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:35:56,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:35:56" (1/1) ... [2018-11-18 22:35:57,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dba5026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57, skipping insertion in model container [2018-11-18 22:35:57,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:35:56" (1/1) ... [2018-11-18 22:35:57,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:35:57,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:35:57,245 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:35:57,251 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:35:57,275 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:35:57,293 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:35:57,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57 WrapperNode [2018-11-18 22:35:57,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:35:57,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:35:57,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:35:57,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:35:57,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... [2018-11-18 22:35:57,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... [2018-11-18 22:35:57,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... [2018-11-18 22:35:57,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... [2018-11-18 22:35:57,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... [2018-11-18 22:35:57,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... [2018-11-18 22:35:57,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... [2018-11-18 22:35:57,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:35:57,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:35:57,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:35:57,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:35:57,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:35:57,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:35:57,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:35:57,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:35:57,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:35:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:35:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:35:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:35:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:35:57,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:35:58,171 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:35:58,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:58 BoogieIcfgContainer [2018-11-18 22:35:58,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:35:58,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:35:58,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:35:58,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:35:58,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:35:56" (1/3) ... [2018-11-18 22:35:58,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c810ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:35:58, skipping insertion in model container [2018-11-18 22:35:58,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:57" (2/3) ... [2018-11-18 22:35:58,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c810ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:35:58, skipping insertion in model container [2018-11-18 22:35:58,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:58" (3/3) ... [2018-11-18 22:35:58,183 INFO L112 eAbstractionObserver]: Analyzing ICFG mod3_true-unreach-call.c.v+cfa-reducer.c [2018-11-18 22:35:58,194 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:35:58,203 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:35:58,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:35:58,253 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:35:58,254 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:35:58,254 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:35:58,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:35:58,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:35:58,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:35:58,255 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:35:58,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:35:58,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:35:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-18 22:35:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:35:58,282 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:35:58,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:35:58,286 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:35:58,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:35:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash 964689295, now seen corresponding path program 1 times [2018-11-18 22:35:58,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:35:58,298 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:35:58,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:35:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:35:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:35:58,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:35:58,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-18 22:35:58,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} ~__return_main~0 := 0bv32;~__return_107~0 := 0bv32; {22#true} is VALID [2018-11-18 22:35:58,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-18 22:35:58,470 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2018-11-18 22:35:58,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-18 22:35:58,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~main__x~0;~main__y~0 := 1bv32; {42#(= (_ bv1 32) main_~main__y~0)} is VALID [2018-11-18 22:35:58,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {42#(= (_ bv1 32) main_~main__y~0)} havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {42#(= (_ bv1 32) main_~main__y~0)} is VALID [2018-11-18 22:35:58,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(= (_ bv1 32) main_~main__y~0)} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0); {42#(= (_ bv1 32) main_~main__y~0)} is VALID [2018-11-18 22:35:58,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#(= (_ bv1 32) main_~main__y~0)} assume 0bv32 == ~main__y~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0bv32 == ~bvurem32(~main__x~0, 3bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {23#false} is VALID [2018-11-18 22:35:58,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {23#false} is VALID [2018-11-18 22:35:58,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-18 22:35:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:35:58,494 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:35:58,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:35:58,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:35:58,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 22:35:58,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:35:58,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:35:58,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:35:58,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:35:58,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:35:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:35:58,588 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-11-18 22:35:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:35:59,256 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-11-18 22:35:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:35:59,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-18 22:35:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:35:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:35:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2018-11-18 22:35:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:35:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2018-11-18 22:35:59,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2018-11-18 22:35:59,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:35:59,508 INFO L225 Difference]: With dead ends: 34 [2018-11-18 22:35:59,509 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 22:35:59,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:35:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 22:35:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-18 22:35:59,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:35:59,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 17 states. [2018-11-18 22:35:59,555 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 17 states. [2018-11-18 22:35:59,555 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 17 states. [2018-11-18 22:35:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:35:59,559 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-11-18 22:35:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-11-18 22:35:59,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:35:59,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:35:59,561 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states. [2018-11-18 22:35:59,561 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states. [2018-11-18 22:35:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:35:59,565 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-11-18 22:35:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2018-11-18 22:35:59,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:35:59,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:35:59,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:35:59,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:35:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:35:59,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-18 22:35:59,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2018-11-18 22:35:59,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:35:59,572 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 22:35:59,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:35:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-18 22:35:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:35:59,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:35:59,573 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:35:59,573 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:35:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:35:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2096975293, now seen corresponding path program 1 times [2018-11-18 22:35:59,574 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:35:59,575 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:35:59,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:36:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:36:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 22:36:20,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:36:35,534 WARN L180 SmtUtils]: Spent 10.11 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:36:41,590 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32))))) is different from false [2018-11-18 22:36:43,600 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32))))) is different from true [2018-11-18 22:36:43,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {160#true} call ULTIMATE.init(); {160#true} is VALID [2018-11-18 22:36:43,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {160#true} ~__return_main~0 := 0bv32;~__return_107~0 := 0bv32; {160#true} is VALID [2018-11-18 22:36:43,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {160#true} assume true; {160#true} is VALID [2018-11-18 22:36:43,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {160#true} {160#true} #41#return; {160#true} is VALID [2018-11-18 22:36:43,603 INFO L256 TraceCheckUtils]: 4: Hoare triple {160#true} call #t~ret2 := main(); {160#true} is VALID [2018-11-18 22:36:43,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {160#true} havoc ~main__x~0;~main__y~0 := 1bv32; {160#true} is VALID [2018-11-18 22:36:43,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {160#true} havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {160#true} is VALID [2018-11-18 22:36:43,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {160#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0); {160#true} is VALID [2018-11-18 22:36:45,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {160#true} assume 1bv32 == ~bvurem32(~main__x~0, 3bv32);~main__x~0 := ~bvadd32(2bv32, ~main__x~0);~main__y~0 := 0bv32; {189#(= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))} is UNKNOWN [2018-11-18 22:36:45,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {189#(= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))} havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {189#(= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))} is VALID [2018-11-18 22:36:45,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {189#(= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0); {189#(= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))} is VALID [2018-11-18 22:36:45,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {189#(= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))} assume 0bv32 == ~main__y~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0bv32 == ~bvurem32(~main__x~0, 3bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {199#(or (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32))))) (= main_~__VERIFIER_assert__cond~0 (_ bv0 32))))} is VALID [2018-11-18 22:36:45,688 INFO L273 TraceCheckUtils]: 12: Hoare triple {199#(or (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (and (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32))))) (= main_~__VERIFIER_assert__cond~0 (_ bv0 32))))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {203#(exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))))} is VALID [2018-11-18 22:36:47,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {203#(exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv1 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967294 32)) (_ bv3 32)))))} assume !false; {161#false} is UNKNOWN [2018-11-18 22:36:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:36:47,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:36:47,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:36:47,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:36:47,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 22:36:47,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:36:47,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:36:51,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 12 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-18 22:36:51,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:36:51,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:36:51,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=7, Unknown=2, NotChecked=4, Total=20 [2018-11-18 22:36:51,877 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 5 states. [2018-11-18 22:37:49,592 WARN L180 SmtUtils]: Spent 10.48 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:38:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:38:11,074 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2018-11-18 22:38:11,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:38:11,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-18 22:38:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:38:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:38:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-18 22:38:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:38:11,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-18 22:38:11,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2018-11-18 22:38:16,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-18 22:38:16,965 INFO L225 Difference]: With dead ends: 36 [2018-11-18 22:38:16,965 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 22:38:16,966 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=11, Invalid=11, Unknown=2, NotChecked=6, Total=30 [2018-11-18 22:38:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 22:38:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-18 22:38:16,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:38:16,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-18 22:38:16,977 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-18 22:38:16,977 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-18 22:38:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:38:16,981 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 22:38:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-18 22:38:16,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:38:16,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:38:16,982 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-18 22:38:16,982 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-18 22:38:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:38:16,984 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 22:38:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-18 22:38:16,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:38:16,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:38:16,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:38:16,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:38:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:38:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-18 22:38:16,988 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-11-18 22:38:16,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:38:16,989 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-18 22:38:16,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:38:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-18 22:38:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:38:16,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:38:16,990 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:38:16,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:38:16,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:38:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -726667991, now seen corresponding path program 1 times [2018-11-18 22:38:16,991 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:38:16,991 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:38:17,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:38:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:38:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 22:38:33,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:38:48,252 WARN L180 SmtUtils]: Spent 10.12 s on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:38:54,357 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32))))) is different from false [2018-11-18 22:38:56,369 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32))))) is different from true [2018-11-18 22:38:56,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-18 22:38:56,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} ~__return_main~0 := 0bv32;~__return_107~0 := 0bv32; {325#true} is VALID [2018-11-18 22:38:56,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-18 22:38:56,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #41#return; {325#true} is VALID [2018-11-18 22:38:56,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {325#true} call #t~ret2 := main(); {325#true} is VALID [2018-11-18 22:38:56,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {325#true} havoc ~main__x~0;~main__y~0 := 1bv32; {325#true} is VALID [2018-11-18 22:38:56,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#true} havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {325#true} is VALID [2018-11-18 22:38:56,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#true} assume !(0bv32 == ~main____CPAchecker_TMP_0~0); {325#true} is VALID [2018-11-18 22:38:56,372 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#true} assume !(1bv32 == ~bvurem32(~main__x~0, 3bv32)); {325#true} is VALID [2018-11-18 22:38:58,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {325#true} assume 2bv32 == ~bvurem32(~main__x~0, 3bv32);~main__x~0 := ~bvadd32(1bv32, ~main__x~0);~main__y~0 := 0bv32; {357#(= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))} is UNKNOWN [2018-11-18 22:38:58,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#(= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))} havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet0;havoc #t~nondet0; {357#(= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))} is VALID [2018-11-18 22:38:58,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#(= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))} assume !!(0bv32 == ~main____CPAchecker_TMP_0~0); {357#(= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))} is VALID [2018-11-18 22:38:58,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {357#(= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))} assume 0bv32 == ~main__y~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0bv32 == ~bvurem32(~main__x~0, 3bv32) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {367#(or (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (and (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)) (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))))))} is VALID [2018-11-18 22:38:58,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {367#(or (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (and (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)) (exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))))))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {371#(exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))))} is VALID [2018-11-18 22:39:00,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {371#(exists ((main_~main__x~0 (_ BitVec 32))) (and (not (= (_ bv0 32) (bvurem main_~main__x~0 (_ bv3 32)))) (= (_ bv2 32) (bvurem (bvadd main_~main__x~0 (_ bv4294967295 32)) (_ bv3 32)))))} assume !false; {326#false} is UNKNOWN [2018-11-18 22:39:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:39:00,444 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:39:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:39:00,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:39:00,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 22:39:00,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:39:00,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:39:04,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 13 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-18 22:39:04,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:39:04,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:39:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=7, Unknown=2, NotChecked=4, Total=20 [2018-11-18 22:39:04,622 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states.