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-Const.epf -i ../../../trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:14:03,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:14:03,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:14:03,854 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:14:03,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:14:03,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:14:03,857 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:14:03,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:14:03,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:14:03,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:14:03,862 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:14:03,862 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:14:03,863 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:14:03,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:14:03,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:14:03,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:14:03,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:14:03,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:14:03,872 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:14:03,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:14:03,875 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:14:03,877 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:14:03,879 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:14:03,880 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:14:03,880 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:14:03,881 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:14:03,882 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:14:03,883 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:14:03,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:14:03,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:14:03,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:14:03,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:14:03,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:14:03,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:14:03,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:14:03,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:14:03,889 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:14:03,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:14:03,905 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:14:03,906 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:14:03,906 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:14:03,907 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:14:03,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:14:03,907 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:14:03,907 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:14:03,908 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:14:03,908 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:14:03,908 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:14:03,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:14:03,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:14:03,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:14:03,909 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:14:03,909 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:14:03,909 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:14:03,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:14:03,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:14:03,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:14:03,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:14:03,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:14:03,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:14:03,911 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:14:03,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:14:03,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:14:03,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:14:03,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:14:03,912 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:14:03,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:14:03,912 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:14:03,913 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:14:03,913 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:14:03,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:14:03,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:14:03,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:14:04,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:14:04,001 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:14:04,002 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c [2018-11-14 18:14:04,072 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acef03624/535b4705f7df45329cda3bc06d575563/FLAGb49453e6b [2018-11-14 18:14:04,600 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:14:04,600 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22_false-unreach-call.c [2018-11-14 18:14:04,607 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acef03624/535b4705f7df45329cda3bc06d575563/FLAGb49453e6b [2018-11-14 18:14:04,622 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acef03624/535b4705f7df45329cda3bc06d575563 [2018-11-14 18:14:04,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:14:04,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:14:04,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:04,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:14:04,641 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:14:04,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:04" (1/1) ... [2018-11-14 18:14:04,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e140542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:04, skipping insertion in model container [2018-11-14 18:14:04,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:14:04" (1/1) ... [2018-11-14 18:14:04,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:14:04,679 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:14:04,938 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:04,959 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:14:04,984 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:14:05,007 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:14:05,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05 WrapperNode [2018-11-14 18:14:05,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:14:05,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:14:05,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:14:05,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:14:05,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... [2018-11-14 18:14:05,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... [2018-11-14 18:14:05,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... [2018-11-14 18:14:05,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... [2018-11-14 18:14:05,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... [2018-11-14 18:14:05,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... [2018-11-14 18:14:05,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... [2018-11-14 18:14:05,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:14:05,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:14:05,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:14:05,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:14:05,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:14:05,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:14:05,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:14:05,240 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-14 18:14:05,240 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-14 18:14:05,240 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-14 18:14:05,240 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:14:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:14:05,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:14:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-14 18:14:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-14 18:14:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:14:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-14 18:14:05,241 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-14 18:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:14:05,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:14:06,007 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:14:06,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:06 BoogieIcfgContainer [2018-11-14 18:14:06,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:14:06,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:14:06,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:14:06,013 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:14:06,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:14:04" (1/3) ... [2018-11-14 18:14:06,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5bc7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:06, skipping insertion in model container [2018-11-14 18:14:06,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:14:05" (2/3) ... [2018-11-14 18:14:06,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5bc7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:14:06, skipping insertion in model container [2018-11-14 18:14:06,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:14:06" (3/3) ... [2018-11-14 18:14:06,017 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_false-unreach-call.c [2018-11-14 18:14:06,027 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:14:06,035 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:14:06,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:14:06,086 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:14:06,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:14:06,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:14:06,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:14:06,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:14:06,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:14:06,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:14:06,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:14:06,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:14:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 18:14:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:14:06,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:06,115 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:06,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:06,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:06,123 INFO L82 PathProgramCache]: Analyzing trace with hash -593112403, now seen corresponding path program 1 times [2018-11-14 18:14:06,128 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:06,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:06,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:06,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 18:14:06,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32); {39#true} is VALID [2018-11-14 18:14:06,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:14:06,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #71#return; {39#true} is VALID [2018-11-14 18:14:06,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret17 := main(); {39#true} is VALID [2018-11-14 18:14:06,636 INFO L256 TraceCheckUtils]: 5: Hoare triple {39#true} call init(); {39#true} is VALID [2018-11-14 18:14:06,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {39#true} is VALID [2018-11-14 18:14:06,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:14:06,637 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {39#true} {39#true} #61#return; {39#true} is VALID [2018-11-14 18:14:06,638 INFO L256 TraceCheckUtils]: 9: Hoare triple {39#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {39#true} is VALID [2018-11-14 18:14:06,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {39#true} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2018-11-14 18:14:06,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {39#true} is VALID [2018-11-14 18:14:06,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:14:06,639 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {39#true} {39#true} #63#return; {39#true} is VALID [2018-11-14 18:14:06,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {39#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {39#true} is VALID [2018-11-14 18:14:06,640 INFO L256 TraceCheckUtils]: 15: Hoare triple {39#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {39#true} is VALID [2018-11-14 18:14:06,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {39#true} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2018-11-14 18:14:06,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {39#true} is VALID [2018-11-14 18:14:06,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:14:06,641 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {39#true} {39#true} #65#return; {39#true} is VALID [2018-11-14 18:14:06,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {39#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {39#true} is VALID [2018-11-14 18:14:06,642 INFO L256 TraceCheckUtils]: 21: Hoare triple {39#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {39#true} is VALID [2018-11-14 18:14:06,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {39#true} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {39#true} is VALID [2018-11-14 18:14:06,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {39#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {39#true} is VALID [2018-11-14 18:14:06,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:14:06,643 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {39#true} {39#true} #67#return; {39#true} is VALID [2018-11-14 18:14:06,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {39#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {39#true} is VALID [2018-11-14 18:14:06,644 INFO L273 TraceCheckUtils]: 27: Hoare triple {39#true} assume #t~short12;call #t~mem11 := read~intINTTYPE4(~pd2~0.base, ~pd2~0.offset, 4bv32);#t~short12 := ~bvsgt32(#t~mem11, 0bv32); {39#true} is VALID [2018-11-14 18:14:06,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {39#true} assume #t~short12;havoc #t~mem11;havoc #t~short12;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~intINTTYPE4(~pd3~0.base, ~pd3~0.offset, 4bv32);~i~0 := ~bvsub32(#t~mem13, 10bv32);havoc #t~mem13; {39#true} is VALID [2018-11-14 18:14:06,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 18:14:06,660 INFO L256 TraceCheckUtils]: 30: Hoare triple {40#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {40#false} is VALID [2018-11-14 18:14:06,660 INFO L273 TraceCheckUtils]: 31: Hoare triple {40#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~s1.offset, 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {40#false} is VALID [2018-11-14 18:14:06,660 INFO L273 TraceCheckUtils]: 32: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 18:14:06,661 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {40#false} {40#false} #69#return; {40#false} is VALID [2018-11-14 18:14:06,661 INFO L273 TraceCheckUtils]: 34: Hoare triple {40#false} assume #t~ret16 == 0bv32;havoc #t~ret16; {40#false} is VALID [2018-11-14 18:14:06,662 INFO L273 TraceCheckUtils]: 35: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 18:14:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:14:06,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:06,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:06,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:14:06,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 18:14:06,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:06,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:14:06,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:06,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:14:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:14:06,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:14:06,901 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 18:14:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:07,033 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-14 18:14:07,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:14:07,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 18:14:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:14:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2018-11-14 18:14:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:14:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2018-11-14 18:14:07,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 55 transitions. [2018-11-14 18:14:07,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:07,299 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:14:07,300 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 18:14:07,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:14:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 18:14:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 18:14:07,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:07,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 18:14:07,501 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:14:07,502 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:14:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:07,518 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 18:14:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:14:07,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:07,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:07,520 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:14:07,520 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:14:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:07,536 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 18:14:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:14:07,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:07,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:07,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:07,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:14:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 18:14:07,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 36 [2018-11-14 18:14:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:07,553 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 18:14:07,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:14:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:14:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 18:14:07,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:07,557 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:07,557 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:07,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash 145129159, now seen corresponding path program 1 times [2018-11-14 18:14:07,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:07,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:07,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:07,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:08,181 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-14 18:14:09,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-14 18:14:09,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-14 18:14:09,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:14:09,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:09,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:14:09,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-14 18:14:09,117 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:14:09,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-14 18:14:09,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32); {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {326#(= (_ bv0 32) |~#d1~0.offset|)} {318#true} #71#return; {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret17 := main(); {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,336 INFO L256 TraceCheckUtils]: 5: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} call init(); {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,351 INFO L273 TraceCheckUtils]: 6: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,379 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {326#(= (_ bv0 32) |~#d1~0.offset|)} {326#(= (_ bv0 32) |~#d1~0.offset|)} #61#return; {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,388 INFO L256 TraceCheckUtils]: 9: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {354#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {354#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,432 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {326#(= (_ bv0 32) |~#d1~0.offset|)} #63#return; {365#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {365#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= (_ bv0 32) |~#d1~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {369#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,453 INFO L256 TraceCheckUtils]: 15: Hoare triple {369#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {354#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {354#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,471 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {369#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} #65#return; {385#(and (= |~#d1~0.base| main_~pd1~0.base) (= |~#d1~0.offset| |main_#t~ret8.offset|) (= |~#d1~0.base| |main_#t~ret8.base|) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {385#(and (= |~#d1~0.base| main_~pd1~0.base) (= |~#d1~0.offset| |main_#t~ret8.offset|) (= |~#d1~0.base| |main_#t~ret8.base|) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {389#(and (= |~#d1~0.base| main_~pd1~0.base) (= |~#d1~0.base| main_~pd2~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|) (= main_~pd2~0.offset |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,489 INFO L256 TraceCheckUtils]: 21: Hoare triple {389#(and (= |~#d1~0.base| main_~pd1~0.base) (= |~#d1~0.base| main_~pd2~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|) (= main_~pd2~0.offset |~#d1~0.offset|))} call #t~ret9.base, #t~ret9.offset := get_dummy(); {326#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-14 18:14:09,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {326#(= (_ bv0 32) |~#d1~0.offset|)} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {354#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {354#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,494 INFO L273 TraceCheckUtils]: 24: Hoare triple {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-14 18:14:09,496 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {358#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {389#(and (= |~#d1~0.base| main_~pd1~0.base) (= |~#d1~0.base| main_~pd2~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|) (= main_~pd2~0.offset |~#d1~0.offset|))} #67#return; {405#(and (= main_~pd2~0.offset |main_#t~ret9.offset|) (= main_~pd1~0.base |main_#t~ret9.base|) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|) (= (_ bv0 32) |main_#t~ret9.offset|))} is VALID [2018-11-14 18:14:09,500 INFO L273 TraceCheckUtils]: 26: Hoare triple {405#(and (= main_~pd2~0.offset |main_#t~ret9.offset|) (= main_~pd1~0.base |main_#t~ret9.base|) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset |main_#t~ret9.offset|) (= (_ bv0 32) |main_#t~ret9.offset|))} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {409#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset) (= main_~pd1~0.offset main_~pd3~0.offset))} is VALID [2018-11-14 18:14:09,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {409#(and (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset) (= main_~pd1~0.offset main_~pd3~0.offset))} assume #t~short12;call #t~mem11 := read~intINTTYPE4(~pd2~0.base, ~pd2~0.offset, 4bv32);#t~short12 := ~bvsgt32(#t~mem11, 0bv32); {413#(and (or (and (bvsgt (select (select |#memory_int| main_~pd1~0.base) main_~pd1~0.offset) (_ bv0 32)) |main_#t~short12|) (and (not (bvsgt (select (select |#memory_int| main_~pd1~0.base) main_~pd1~0.offset) (_ bv0 32))) (not |main_#t~short12|))) (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd3~0.offset))} is VALID [2018-11-14 18:14:09,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {413#(and (or (and (bvsgt (select (select |#memory_int| main_~pd1~0.base) main_~pd1~0.offset) (_ bv0 32)) |main_#t~short12|) (and (not (bvsgt (select (select |#memory_int| main_~pd1~0.base) main_~pd1~0.offset) (_ bv0 32))) (not |main_#t~short12|))) (= main_~pd3~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd3~0.offset))} assume #t~short12;havoc #t~mem11;havoc #t~short12;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~intINTTYPE4(~pd3~0.base, ~pd3~0.offset, 4bv32);~i~0 := ~bvsub32(#t~mem13, 10bv32);havoc #t~mem13; {417#(and (bvsgt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (_ bv0 32) main_~pa~0.offset))} is VALID [2018-11-14 18:14:09,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {417#(and (bvsgt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (_ bv0 32) main_~pa~0.offset))} assume true; {417#(and (bvsgt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (_ bv0 32) main_~pa~0.offset))} is VALID [2018-11-14 18:14:09,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {417#(and (bvsgt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (_ bv0 32) main_~pa~0.offset))} call #t~mem14 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {424#(and (= (bvadd |main_#t~mem14| (_ bv4294967286 32)) main_~i~0) (bvsgt (bvadd main_~i~0 (_ bv10 32)) (_ bv0 32)))} is VALID [2018-11-14 18:14:09,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {424#(and (= (bvadd |main_#t~mem14| (_ bv4294967286 32)) main_~i~0) (bvsgt (bvadd main_~i~0 (_ bv10 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, #t~mem14);havoc #t~mem14; {319#false} is VALID [2018-11-14 18:14:09,536 INFO L256 TraceCheckUtils]: 32: Hoare triple {319#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {319#false} is VALID [2018-11-14 18:14:09,536 INFO L273 TraceCheckUtils]: 33: Hoare triple {319#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~s1.offset, 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {319#false} is VALID [2018-11-14 18:14:09,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {319#false} assume true; {319#false} is VALID [2018-11-14 18:14:09,537 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {319#false} {319#false} #69#return; {319#false} is VALID [2018-11-14 18:14:09,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {319#false} assume #t~ret16 == 0bv32;havoc #t~ret16; {319#false} is VALID [2018-11-14 18:14:09,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-14 18:14:09,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:14:09,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:09,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:09,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-14 18:14:09,551 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-14 18:14:09,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:09,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:14:09,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:09,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:14:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:14:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:14:09,667 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2018-11-14 18:14:11,782 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-14 18:14:12,524 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-11-14 18:14:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:13,470 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2018-11-14 18:14:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:14:13,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-14 18:14:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:14:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 99 transitions. [2018-11-14 18:14:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:14:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 99 transitions. [2018-11-14 18:14:13,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 99 transitions. [2018-11-14 18:14:13,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:13,747 INFO L225 Difference]: With dead ends: 81 [2018-11-14 18:14:13,747 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 18:14:13,749 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:14:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 18:14:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2018-11-14 18:14:13,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:13,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 44 states. [2018-11-14 18:14:13,902 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 44 states. [2018-11-14 18:14:13,903 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 44 states. [2018-11-14 18:14:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:13,916 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-14 18:14:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2018-11-14 18:14:13,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:13,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:13,919 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 74 states. [2018-11-14 18:14:13,919 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 74 states. [2018-11-14 18:14:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:13,936 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-14 18:14:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2018-11-14 18:14:13,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:13,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:13,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:13,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:14:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-14 18:14:13,943 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 38 [2018-11-14 18:14:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:13,944 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-14 18:14:13,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:14:13,944 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-14 18:14:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 18:14:13,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:13,946 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:13,946 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:13,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:13,947 INFO L82 PathProgramCache]: Analyzing trace with hash 846193737, now seen corresponding path program 1 times [2018-11-14 18:14:13,948 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:13,948 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:13,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:14:14,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:14:14,097 INFO L256 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {773#true} is VALID [2018-11-14 18:14:14,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {773#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32); {773#true} is VALID [2018-11-14 18:14:14,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {773#true} assume true; {773#true} is VALID [2018-11-14 18:14:14,099 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {773#true} {773#true} #71#return; {773#true} is VALID [2018-11-14 18:14:14,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {773#true} call #t~ret17 := main(); {773#true} is VALID [2018-11-14 18:14:14,099 INFO L256 TraceCheckUtils]: 5: Hoare triple {773#true} call init(); {773#true} is VALID [2018-11-14 18:14:14,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {773#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {773#true} is VALID [2018-11-14 18:14:14,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {773#true} assume true; {773#true} is VALID [2018-11-14 18:14:14,100 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {773#true} {773#true} #61#return; {773#true} is VALID [2018-11-14 18:14:14,101 INFO L256 TraceCheckUtils]: 9: Hoare triple {773#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {773#true} is VALID [2018-11-14 18:14:14,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {773#true} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {773#true} is VALID [2018-11-14 18:14:14,101 INFO L273 TraceCheckUtils]: 11: Hoare triple {773#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {773#true} is VALID [2018-11-14 18:14:14,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {773#true} assume true; {773#true} is VALID [2018-11-14 18:14:14,102 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {773#true} {773#true} #63#return; {773#true} is VALID [2018-11-14 18:14:14,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {773#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {773#true} is VALID [2018-11-14 18:14:14,102 INFO L256 TraceCheckUtils]: 15: Hoare triple {773#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {773#true} is VALID [2018-11-14 18:14:14,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {773#true} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {773#true} is VALID [2018-11-14 18:14:14,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {773#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {773#true} is VALID [2018-11-14 18:14:14,103 INFO L273 TraceCheckUtils]: 18: Hoare triple {773#true} assume true; {773#true} is VALID [2018-11-14 18:14:14,104 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {773#true} {773#true} #65#return; {773#true} is VALID [2018-11-14 18:14:14,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {773#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset; {773#true} is VALID [2018-11-14 18:14:14,104 INFO L256 TraceCheckUtils]: 21: Hoare triple {773#true} call #t~ret9.base, #t~ret9.offset := get_dummy(); {773#true} is VALID [2018-11-14 18:14:14,105 INFO L273 TraceCheckUtils]: 22: Hoare triple {773#true} assume #t~nondet4 != 0bv8;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {773#true} is VALID [2018-11-14 18:14:14,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {773#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {773#true} is VALID [2018-11-14 18:14:14,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {773#true} assume true; {773#true} is VALID [2018-11-14 18:14:14,105 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {773#true} {773#true} #67#return; {773#true} is VALID [2018-11-14 18:14:14,106 INFO L273 TraceCheckUtils]: 26: Hoare triple {773#true} ~pd3~0.base, ~pd3~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;~i~0 := #t~nondet10;havoc #t~nondet10;#t~short12 := (~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset; {773#true} is VALID [2018-11-14 18:14:14,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {773#true} assume !#t~short12; {859#(not |main_#t~short12|)} is VALID [2018-11-14 18:14:14,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {859#(not |main_#t~short12|)} assume #t~short12;havoc #t~mem11;havoc #t~short12;~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~pd1~0.offset;call #t~mem13 := read~intINTTYPE4(~pd3~0.base, ~pd3~0.offset, 4bv32);~i~0 := ~bvsub32(#t~mem13, 10bv32);havoc #t~mem13; {774#false} is VALID [2018-11-14 18:14:14,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {774#false} assume true; {774#false} is VALID [2018-11-14 18:14:14,109 INFO L273 TraceCheckUtils]: 30: Hoare triple {774#false} call #t~mem14 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {774#false} is VALID [2018-11-14 18:14:14,109 INFO L273 TraceCheckUtils]: 31: Hoare triple {774#false} assume !~bvslt32(~i~0, #t~mem14);havoc #t~mem14; {774#false} is VALID [2018-11-14 18:14:14,110 INFO L256 TraceCheckUtils]: 32: Hoare triple {774#false} call #t~ret16 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {774#false} is VALID [2018-11-14 18:14:14,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {774#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~s1.offset, 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {774#false} is VALID [2018-11-14 18:14:14,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {774#false} assume true; {774#false} is VALID [2018-11-14 18:14:14,110 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {774#false} {774#false} #69#return; {774#false} is VALID [2018-11-14 18:14:14,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {774#false} assume #t~ret16 == 0bv32;havoc #t~ret16; {774#false} is VALID [2018-11-14 18:14:14,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {774#false} assume !false; {774#false} is VALID [2018-11-14 18:14:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 18:14:14,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:14:14,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:14:14,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:14:14,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-14 18:14:14,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:14:14,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:14:14,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:14:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:14:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:14:14,169 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-11-14 18:14:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:14,406 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-14 18:14:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:14:14,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-14 18:14:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:14:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:14:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2018-11-14 18:14:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:14:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2018-11-14 18:14:14,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2018-11-14 18:14:14,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:14:14,488 INFO L225 Difference]: With dead ends: 55 [2018-11-14 18:14:14,488 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 18:14:14,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:14:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 18:14:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 18:14:14,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:14:14,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 18:14:14,542 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 18:14:14,543 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 18:14:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:14,547 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-14 18:14:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-14 18:14:14,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:14,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:14,549 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 18:14:14,549 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 18:14:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:14:14,553 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-14 18:14:14,553 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-14 18:14:14,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:14:14,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:14:14,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:14:14,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:14:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:14:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-14 18:14:14,558 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 38 [2018-11-14 18:14:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:14:14,559 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-14 18:14:14,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:14:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-14 18:14:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 18:14:14,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:14:14,561 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:14:14,561 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:14:14,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:14:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -875939195, now seen corresponding path program 1 times [2018-11-14 18:14:14,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:14:14,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:14:14,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:14:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 18:14:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:14:14,828 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 18:14:14,922 WARN L170 areAnnotationChecker]: initENTRY has no Hoare annotation [2018-11-14 18:14:14,923 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 18:14:14,923 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:14:14,923 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 18:14:14,923 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2018-11-14 18:14:14,923 WARN L170 areAnnotationChecker]: get_dummyENTRY has no Hoare annotation [2018-11-14 18:14:14,924 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 18:14:14,924 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 18:14:14,924 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2018-11-14 18:14:14,924 WARN L170 areAnnotationChecker]: initFINAL has no Hoare annotation [2018-11-14 18:14:14,924 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 18:14:14,925 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:14:14,925 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 18:14:14,925 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2018-11-14 18:14:14,925 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 18:14:14,925 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 18:14:14,926 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-14 18:14:14,926 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2018-11-14 18:14:14,926 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:14:14,926 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:14:14,926 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-14 18:14:14,926 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 18:14:14,927 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-14 18:14:14,927 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-14 18:14:14,927 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-14 18:14:14,927 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-14 18:14:14,927 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 18:14:14,928 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2018-11-14 18:14:14,928 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 18:14:14,928 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 18:14:14,928 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2018-11-14 18:14:14,928 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2018-11-14 18:14:14,929 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 18:14:14,929 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2018-11-14 18:14:14,929 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2018-11-14 18:14:14,929 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-14 18:14:14,929 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2018-11-14 18:14:14,930 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 18:14:14,936 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 18:14:14,936 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:14:14,936 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2018-11-14 18:14:14,936 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2018-11-14 18:14:14,936 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:14:14,937 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2018-11-14 18:14:14,937 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2018-11-14 18:14:14,937 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-14 18:14:14,937 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2018-11-14 18:14:14,937 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2018-11-14 18:14:14,937 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2018-11-14 18:14:14,938 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2018-11-14 18:14:14,938 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:14:14,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:14:14 BoogieIcfgContainer [2018-11-14 18:14:14,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:14:14,942 INFO L168 Benchmark]: Toolchain (without parser) took 10308.29 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -138.3 MB). Peak memory consumption was 583.7 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:14,943 INFO L168 Benchmark]: CDTParser took 0.25 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-14 18:14:14,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.32 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-14 18:14:14,945 INFO L168 Benchmark]: Boogie Preprocessor took 102.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-14 18:14:14,945 INFO L168 Benchmark]: RCFGBuilder took 896.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:14,948 INFO L168 Benchmark]: TraceAbstraction took 8931.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 592.3 MB). Peak memory consumption was 592.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:14:14,958 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.25 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 372.32 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 Preprocessor took 102.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. * RCFGBuilder took 896.78 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -741.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8931.39 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 592.3 MB). Peak memory consumption was 592.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 48]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] FCALL struct dummy d1, d2; VAL [\old(d1)=0, \old(d1)=0, \old(d2)=0, \old(d2)=0, d1={1:0}, d2={-2:0}] [L32] CALL init() VAL [d1={1:0}, d2={-2:0}] [L13] FCALL d1.a = __VERIFIER_nondet_int() [L14] FCALL d1.b = __VERIFIER_nondet_int() [L16] FCALL d2.a = __VERIFIER_nondet_int() [L17] RET, FCALL d2.b = __VERIFIER_nondet_int() [L32] init() VAL [d1={1:0}, d2={-2:0}] [L33] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={-2:0}] [L22] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={-2:0}] [L22] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] EXPR get_dummy() VAL [d1={1:0}, d2={-2:0}, get_dummy()={1:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={-2:0}] [L22] COND TRUE, EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={1:0}, d1={1:0}, d2={-2:0}] [L22] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] EXPR get_dummy() VAL [d1={1:0}, d2={-2:0}, get_dummy()={1:0}, pd1={1:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L33] CALL, EXPR get_dummy() VAL [d1={1:0}, d2={-2:0}] [L22] COND FALSE, EXPR !(__VERIFIER_nondet_bool() ? &d1 : &d2) VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={-2:0}, d1={1:0}, d2={-2:0}] [L22] RET return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L33] EXPR get_dummy() VAL [d1={1:0}, d2={-2:0}, get_dummy()={-2:0}, pd1={1:0}, pd2={1:0}] [L33] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L34] int i = __VERIFIER_nondet_int(); [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L35] EXPR, FCALL (*pd2).a [L35] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=1, d1={1:0}, d2={-2:0}, i=0, pd1={1:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={1:0}, pd3={-2:0}] [L35] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L36] int *pa = &pd1->a; [L37] EXPR, FCALL pd3->a [L37] i = pd3->a - 10 [L38] EXPR, FCALL \read(*pa) VAL [\read(*pa)=1, d1={1:0}, d2={-2:0}, i=2, pa={1:0}, pd1={1:0}, pd2={1:0}, pd3={-2:0}] [L38] COND FALSE !(i < *pa) [L41] CALL, EXPR check(pd2, i) VAL [\old(i)=2, d1={1:0}, d2={-2:0}, s1={1:0}] [L27] EXPR, FCALL s1->a [L27] RET return s1->a == i; [L41] EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={1:0}, d2={-2:0}, i=2, pa={1:0}, pd1={1:0}, pd2={1:0}, pd3={-2:0}] [L41] COND TRUE !check(pd2, i) [L48] __VERIFIER_error() VAL [d1={1:0}, d2={-2:0}, i=2, pa={1:0}, pd1={1:0}, pd2={1:0}, pd3={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. UNSAFE Result, 8.8s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 108 SDtfs, 72 SDslu, 270 SDs, 0 SdLazy, 284 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, 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: 0.4s AutomataMinimizationTime, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 13583 SizeOfPredicates, 13 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...