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_Default-Const.epf -i ../../../trunk/examples/svcomp/loops/sum_array_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:18:22,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:18:22,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:18:22,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:18:22,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:18:22,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:18:22,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:18:22,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:18:22,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:18:22,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:18:22,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:18:22,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:18:22,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:18:22,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:18:22,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:18:22,675 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:18:22,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:18:22,679 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:18:22,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:18:22,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:18:22,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:18:22,698 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:18:22,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:18:22,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:18:22,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:18:22,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:18:22,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:18:22,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:18:22,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:18:22,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:18:22,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:18:22,715 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:18:22,716 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:18:22,716 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:18:22,718 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:18:22,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:18:22,719 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:18:22,746 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:18:22,746 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:18:22,750 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:18:22,750 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:18:22,751 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:18:22,751 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:18:22,751 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:18:22,751 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:18:22,751 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:18:22,752 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:18:22,752 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:18:22,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:18:22,752 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:18:22,752 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:18:22,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:18:22,753 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:18:22,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:18:22,753 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:18:22,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:18:22,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:18:22,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:18:22,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:18:22,754 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:18:22,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:18:22,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:18:22,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:18:22,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:18:22,755 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:18:22,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:18:22,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:18:22,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:18:22,822 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:18:22,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:18:22,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:18:22,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:18:22,851 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:18:22,852 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-11-14 19:18:22,922 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2777ae9/999ab10a29394d83b63f4f4eac948246/FLAGa8382afbe [2018-11-14 19:18:23,409 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:18:23,410 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-11-14 19:18:23,416 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2777ae9/999ab10a29394d83b63f4f4eac948246/FLAGa8382afbe [2018-11-14 19:18:23,430 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2777ae9/999ab10a29394d83b63f4f4eac948246 [2018-11-14 19:18:23,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:18:23,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:18:23,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:23,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:18:23,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:18:23,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba1e25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23, skipping insertion in model container [2018-11-14 19:18:23,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:18:23,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:18:23,689 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:23,694 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:18:23,726 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:18:23,755 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:18:23,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23 WrapperNode [2018-11-14 19:18:23,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:18:23,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:18:23,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:18:23,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:18:23,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (1/1) ... [2018-11-14 19:18:23,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:18:23,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:18:23,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:18:23,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:18:23,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (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 19:18:24,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:18:24,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:18:24,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:18:24,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:18:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:18:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:18:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:18:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:18:24,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 19:18:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:18:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:18:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:18:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:18:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:18:24,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:18:24,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:18:24,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:18:24,886 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:18:24,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:24 BoogieIcfgContainer [2018-11-14 19:18:24,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:18:24,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:18:24,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:18:24,892 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:18:24,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:18:23" (1/3) ... [2018-11-14 19:18:24,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307e77c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:24, skipping insertion in model container [2018-11-14 19:18:24,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:18:23" (2/3) ... [2018-11-14 19:18:24,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307e77c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:18:24, skipping insertion in model container [2018-11-14 19:18:24,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:18:24" (3/3) ... [2018-11-14 19:18:24,897 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array_true-unreach-call.i [2018-11-14 19:18:24,908 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:18:24,918 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:18:24,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:18:24,980 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:18:24,981 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:18:24,981 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:18:24,981 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:18:24,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:18:24,982 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:18:24,982 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:18:24,982 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:18:24,983 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:18:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 19:18:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 19:18:25,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:25,022 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:25,025 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:25,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash -22757593, now seen corresponding path program 1 times [2018-11-14 19:18:25,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:25,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:25,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:25,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:25,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:25,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 19:18:25,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-14 19:18:25,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 19:18:25,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2018-11-14 19:18:25,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret15 := main(); {39#true} is VALID [2018-11-14 19:18:25,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);havoc ~i~0;~i~0 := 0; {39#true} is VALID [2018-11-14 19:18:25,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 19:18:25,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-14 19:18:25,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 19:18:25,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-14 19:18:25,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 19:18:25,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2018-11-14 19:18:25,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 19:18:25,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {40#false} is VALID [2018-11-14 19:18:25,270 INFO L256 TraceCheckUtils]: 14: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {40#false} is VALID [2018-11-14 19:18:25,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-14 19:18:25,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume ~cond == 0; {40#false} is VALID [2018-11-14 19:18:25,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 19:18:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:25,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:25,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:18:25,283 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 19:18:25,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:25,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:18:25,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:25,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:18:25,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:18:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:18:25,535 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 19:18:25,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:25,715 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-14 19:18:25,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:18:25,715 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 19:18:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2018-11-14 19:18:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:18:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2018-11-14 19:18:25,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 80 transitions. [2018-11-14 19:18:26,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:26,046 INFO L225 Difference]: With dead ends: 62 [2018-11-14 19:18:26,047 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 19:18:26,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 19:18:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 19:18:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 19:18:26,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:26,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 19:18:26,093 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 19:18:26,093 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 19:18:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:26,099 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 19:18:26,099 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 19:18:26,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:26,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:26,100 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 19:18:26,101 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 19:18:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:26,105 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 19:18:26,106 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 19:18:26,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:26,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:26,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:26,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 19:18:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 19:18:26,112 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2018-11-14 19:18:26,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:26,113 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 19:18:26,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:18:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 19:18:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 19:18:26,114 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:26,115 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:18:26,115 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:26,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash -437499402, now seen corresponding path program 1 times [2018-11-14 19:18:26,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:26,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:26,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:26,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:26,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {223#true} call ULTIMATE.init(); {223#true} is VALID [2018-11-14 19:18:26,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {223#true} is VALID [2018-11-14 19:18:26,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2018-11-14 19:18:26,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} #91#return; {223#true} is VALID [2018-11-14 19:18:26,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {223#true} call #t~ret15 := main(); {223#true} is VALID [2018-11-14 19:18:26,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {223#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);havoc ~i~0;~i~0 := 0; {225#(= main_~i~0 0)} is VALID [2018-11-14 19:18:26,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(= main_~i~0 0)} assume true; {225#(= main_~i~0 0)} is VALID [2018-11-14 19:18:26,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {225#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume true; {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume true; {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume true; {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-14 19:18:26,418 INFO L273 TraceCheckUtils]: 16: Hoare triple {226#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {224#false} is VALID [2018-11-14 19:18:26,418 INFO L256 TraceCheckUtils]: 17: Hoare triple {224#false} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {224#false} is VALID [2018-11-14 19:18:26,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {224#false} ~cond := #in~cond; {224#false} is VALID [2018-11-14 19:18:26,419 INFO L273 TraceCheckUtils]: 19: Hoare triple {224#false} assume ~cond == 0; {224#false} is VALID [2018-11-14 19:18:26,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {224#false} assume !false; {224#false} is VALID [2018-11-14 19:18:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:18:26,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:18:26,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 19:18:26,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 19:18:26,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:18:26,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 19:18:26,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:26,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 19:18:26,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 19:18:26,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 19:18:26,514 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-11-14 19:18:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:27,279 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 19:18:27,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:18:27,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 19:18:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:18:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:18:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 19:18:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 19:18:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 19:18:27,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-14 19:18:27,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:18:27,467 INFO L225 Difference]: With dead ends: 76 [2018-11-14 19:18:27,467 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 19:18:27,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:18:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 19:18:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-14 19:18:27,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:18:27,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 37 states. [2018-11-14 19:18:27,495 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 37 states. [2018-11-14 19:18:27,495 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 37 states. [2018-11-14 19:18:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:27,500 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 19:18:27,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 19:18:27,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:27,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:27,502 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 47 states. [2018-11-14 19:18:27,502 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 47 states. [2018-11-14 19:18:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:18:27,506 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 19:18:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 19:18:27,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:18:27,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:18:27,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:18:27,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:18:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 19:18:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-14 19:18:27,511 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 21 [2018-11-14 19:18:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:18:27,511 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-14 19:18:27,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 19:18:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 19:18:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 19:18:27,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:18:27,513 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-14 19:18:27,513 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:18:27,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:18:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash -629873798, now seen corresponding path program 1 times [2018-11-14 19:18:27,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:18:27,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:18:27,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:27,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:18:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:28,558 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-14 19:18:29,570 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 36 [2018-11-14 19:18:30,083 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 35 [2018-11-14 19:18:30,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-14 19:18:30,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {474#true} is VALID [2018-11-14 19:18:30,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-14 19:18:30,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #91#return; {474#true} is VALID [2018-11-14 19:18:30,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret15 := main(); {474#true} is VALID [2018-11-14 19:18:30,133 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc((if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296) * 4);havoc ~i~0;~i~0 := 0; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume true; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#A~0.base, ~#A~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);havoc #t~nondet3;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume !!(#t~mem4 <= 1000000);havoc #t~mem4; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume true; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} ~i~0 := 0; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume true; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#B~0.base, ~#B~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);havoc #t~nondet6;call #t~mem7 := read~int(~#B~0.base, ~#B~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume !!(#t~mem7 <= 1000000);havoc #t~mem7; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} #t~post5 := ~i~0;~i~0 := #t~post5 + 1;havoc #t~post5; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume true; {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {476#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} ~i~0 := 0; {477#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:30,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {477#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} assume true; {477#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:30,175 INFO L273 TraceCheckUtils]: 21: Hoare triple {477#(and (= |main_~#C~0.offset| 0) (not (= |main_~#A~0.base| |main_~#C~0.base|)) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call write~int(#t~mem9 + #t~mem10, ~#C~0.base, ~#C~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);havoc #t~mem9;havoc #t~mem10; {478#(and (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* 4 main_~i~0) |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (+ (select (select |#memory_int| |main_~#B~0.base|) (+ (* 4 main_~i~0) |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) (* (- 17179869184) (div main_~i~0 4294967296)) |main_~#A~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:30,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {478#(and (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* 4 main_~i~0) |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (+ (select (select |#memory_int| |main_~#B~0.base|) (+ (* 4 main_~i~0) |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) (* (- 17179869184) (div main_~i~0 4294967296)) |main_~#A~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} #t~post8 := ~i~0;~i~0 := #t~post8 + 1;havoc #t~post8; {479#(and (= |main_~#C~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= (select (select |#memory_int| |main_~#C~0.base|) 0) (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,180 INFO L273 TraceCheckUtils]: 23: Hoare triple {479#(and (= |main_~#C~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= (select (select |#memory_int| |main_~#C~0.base|) 0) (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume true; {479#(and (= |main_~#C~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= (select (select |#memory_int| |main_~#C~0.base|) 0) (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {479#(and (= |main_~#C~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= (select (select |#memory_int| |main_~#C~0.base|) 0) (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {479#(and (= |main_~#C~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= (select (select |#memory_int| |main_~#C~0.base|) 0) (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} is VALID [2018-11-14 19:18:30,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {479#(and (= |main_~#C~0.offset| 0) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= (select (select |#memory_int| |main_~#C~0.base|) 0) (+ (select (select |#memory_int| |main_~#A~0.base|) 0) (select (select |#memory_int| |main_~#B~0.base|) 0))) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0))} ~i~0 := 0; {480#(and (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* 4 main_~i~0) |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (+ (select (select |#memory_int| |main_~#B~0.base|) (+ (* 4 main_~i~0) |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) (* (- 17179869184) (div main_~i~0 4294967296)) |main_~#A~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:30,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {480#(and (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* 4 main_~i~0) |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (+ (select (select |#memory_int| |main_~#B~0.base|) (+ (* 4 main_~i~0) |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) (* (- 17179869184) (div main_~i~0 4294967296)) |main_~#A~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} assume true; {480#(and (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* 4 main_~i~0) |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (+ (select (select |#memory_int| |main_~#B~0.base|) (+ (* 4 main_~i~0) |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) (* (- 17179869184) (div main_~i~0 4294967296)) |main_~#A~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 19:18:30,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {480#(and (= |main_~#C~0.offset| 0) (= (select (select |#memory_int| |main_~#C~0.base|) (+ (* 4 main_~i~0) |main_~#C~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (+ (select (select |#memory_int| |main_~#B~0.base|) (+ (* 4 main_~i~0) |main_~#B~0.offset| (* (- 17179869184) (div main_~i~0 4294967296)))) (select (select |#memory_int| |main_~#A~0.base|) (+ (* 4 main_~i~0) (* (- 17179869184) (div main_~i~0 4294967296)) |main_~#A~0.offset|)))) (not (= |main_~#B~0.base| |main_~#C~0.base|)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem14 := read~int(~#C~0.base, ~#C~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call #t~mem12 := read~int(~#A~0.base, ~#A~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4);call #t~mem13 := read~int(~#B~0.base, ~#B~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 4, 4); {481#(= (+ |main_#t~mem13| |main_#t~mem12|) |main_#t~mem14|)} is VALID [2018-11-14 19:18:30,188 INFO L256 TraceCheckUtils]: 28: Hoare triple {481#(= (+ |main_#t~mem13| |main_#t~mem12|) |main_#t~mem14|)} call __VERIFIER_assert((if #t~mem14 == #t~mem12 + #t~mem13 then 1 else 0)); {482#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 19:18:30,189 INFO L273 TraceCheckUtils]: 29: Hoare triple {482#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {483#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 19:18:30,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {483#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {475#false} is VALID [2018-11-14 19:18:30,189 INFO L273 TraceCheckUtils]: 31: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-14 19:18:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 19:18:30,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:18:30,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:18:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:18:30,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:18:30,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:18:30,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-14 19:18:30,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:18:30,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:18:30,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 19:18:30,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:30,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:30,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:30,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-14 19:18:30,683 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:18:30,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2018-11-14 19:18:30,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 17 [2018-11-14 19:18:30,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:30,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:30,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:18:30,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-14 19:18:31,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-11-14 19:18:31,299 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 17 treesize of output 10 [2018-11-14 19:18:31,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:18:31,516 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:18:31,518 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus select at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:111) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 19:18:31,522 INFO L168 Benchmark]: Toolchain (without parser) took 8081.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -384.2 MB). Peak memory consumption was 376.6 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:31,524 INFO L168 Benchmark]: CDTParser took 0.19 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 19:18:31,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.63 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 19:18:31,525 INFO L168 Benchmark]: Boogie Preprocessor took 73.96 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 19:18:31,526 INFO L168 Benchmark]: RCFGBuilder took 1056.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:31,527 INFO L168 Benchmark]: TraceAbstraction took 6632.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 384.0 MB). Peak memory consumption was 384.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:18:31,531 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.19 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 313.63 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 73.96 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 1056.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.7 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6632.50 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 384.0 MB). Peak memory consumption was 384.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus select de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus select: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:111) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...