/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s5liff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:04,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:04,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:04,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:04,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:04,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:04,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:04,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:04,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:04,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:04,791 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:04,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:04,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:04,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:04,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:04,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:04,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:04,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:04,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:04,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:04,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:04,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:04,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:04,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:04,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:04,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:04,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:04,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:04,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:04,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:04,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:04,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:04,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:04,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:04,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:04,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:04,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:04,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:04,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:04,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:04,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:04,840 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:04,864 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:04,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:04,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:04,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:04,867 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:04,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:04,867 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:04,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:04,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:04,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:04,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:04,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:04,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:04,870 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:04,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:04,870 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:04,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:04,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:04,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:04,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:04,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:04,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:04,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:04,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:04,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:04,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:04,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:04,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:04,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:04,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:05,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:05,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:05,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:05,192 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:05,192 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:05,193 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s5liff.c [2020-07-10 15:27:05,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03df37e4/4f06a9bddbc14824ba36bdc390e4c17f/FLAG764835e1e [2020-07-10 15:27:05,666 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:05,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s5liff.c [2020-07-10 15:27:05,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03df37e4/4f06a9bddbc14824ba36bdc390e4c17f/FLAG764835e1e [2020-07-10 15:27:06,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03df37e4/4f06a9bddbc14824ba36bdc390e4c17f [2020-07-10 15:27:06,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:06,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:06,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:06,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:06,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:06,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e86deec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06, skipping insertion in model container [2020-07-10 15:27:06,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:06,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:06,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:06,271 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:06,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:06,315 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:06,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06 WrapperNode [2020-07-10 15:27:06,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:06,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:06,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:06,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:06,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (1/1) ... [2020-07-10 15:27:06,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:06,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:06,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:06,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:06,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (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 [2020-07-10 15:27:06,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:06,571 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:06,571 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:27:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:06,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:27:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:06,967 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:06,967 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:27:06,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:06 BoogieIcfgContainer [2020-07-10 15:27:06,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:06,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:06,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:06,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:06,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:06" (1/3) ... [2020-07-10 15:27:06,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67992a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:06, skipping insertion in model container [2020-07-10 15:27:06,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:06" (2/3) ... [2020-07-10 15:27:06,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67992a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:06, skipping insertion in model container [2020-07-10 15:27:06,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:06" (3/3) ... [2020-07-10 15:27:06,979 INFO L109 eAbstractionObserver]: Analyzing ICFG s5liff.c [2020-07-10 15:27:06,990 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:06,997 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:07,012 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:07,039 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:07,040 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:07,040 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:07,040 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:07,040 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:07,041 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:07,041 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:07,041 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-10 15:27:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:27:07,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:07,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:07,080 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash -88121349, now seen corresponding path program 1 times [2020-07-10 15:27:07,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:07,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226972589] [2020-07-10 15:27:07,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:07,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID [2020-07-10 15:27:07,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:27:07,376 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-10 15:27:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:07,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-10 15:27:07,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-10 15:27:07,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-10 15:27:07,397 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-10 15:27:07,401 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:07,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID [2020-07-10 15:27:07,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-10 15:27:07,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-10 15:27:07,404 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret11 := main(); {38#true} is VALID [2020-07-10 15:27:07,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-10 15:27:07,405 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-10 15:27:07,406 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-10 15:27:07,406 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-10 15:27:07,407 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-10 15:27:07,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-10 15:27:07,408 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-10 15:27:07,409 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(~N~0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {39#false} is VALID [2020-07-10 15:27:07,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:27:07,411 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-10 15:27:07,411 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:27:07,412 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-10 15:27:07,412 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-10 15:27:07,413 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {39#false} is VALID [2020-07-10 15:27:07,413 INFO L263 TraceCheckUtils]: 19: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem10 == 6 * ~N~0 then 1 else 0)); {39#false} is VALID [2020-07-10 15:27:07,414 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-10 15:27:07,414 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-10 15:27:07,414 INFO L280 TraceCheckUtils]: 22: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-10 15:27:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:07,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226972589] [2020-07-10 15:27:07,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:07,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:07,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911997232] [2020-07-10 15:27:07,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:27:07,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:07,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:07,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:07,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:07,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:07,495 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-10 15:27:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:07,697 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-10 15:27:07,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:07,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:27:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:27:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-10 15:27:07,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-10 15:27:07,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:07,887 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:27:07,887 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 15:27:07,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 15:27:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-10 15:27:08,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:08,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-10 15:27:08,025 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:27:08,026 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:27:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,031 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:27:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:27:08,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,032 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-10 15:27:08,032 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-10 15:27:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,037 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-10 15:27:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:27:08,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:08,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:27:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-10 15:27:08,043 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2020-07-10 15:27:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:08,044 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-10 15:27:08,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-10 15:27:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:27:08,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:08,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:08,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:08,046 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1099238599, now seen corresponding path program 1 times [2020-07-10 15:27:08,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:08,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906138611] [2020-07-10 15:27:08,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-10 15:27:08,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:27:08,159 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-10 15:27:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:27:08,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:27:08,170 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:27:08,171 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:08,172 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:08,173 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-10 15:27:08,173 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:27:08,173 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-10 15:27:08,174 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret11 := main(); {221#true} is VALID [2020-07-10 15:27:08,174 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-10 15:27:08,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:08,175 INFO L263 TraceCheckUtils]: 7: Hoare triple {226#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-10 15:27:08,176 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-10 15:27:08,176 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-10 15:27:08,176 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-10 15:27:08,177 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:08,179 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(~N~0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:27:08,180 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:27:08,180 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:27:08,181 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:27:08,181 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-10 15:27:08,181 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-10 15:27:08,181 INFO L280 TraceCheckUtils]: 18: Hoare triple {222#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {222#false} is VALID [2020-07-10 15:27:08,182 INFO L263 TraceCheckUtils]: 19: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem10 == 6 * ~N~0 then 1 else 0)); {222#false} is VALID [2020-07-10 15:27:08,182 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-10 15:27:08,182 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-10 15:27:08,183 INFO L280 TraceCheckUtils]: 22: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-10 15:27:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:08,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906138611] [2020-07-10 15:27:08,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:08,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:27:08,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948199141] [2020-07-10 15:27:08,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:27:08,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:08,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:08,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:08,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:08,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:08,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:08,222 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2020-07-10 15:27:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,486 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-07-10 15:27:08,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:08,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:27:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:27:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-10 15:27:08,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-10 15:27:08,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:08,582 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:27:08,583 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:08,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-10 15:27:08,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:08,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-10 15:27:08,613 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-10 15:27:08,613 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-10 15:27:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,616 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:08,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,618 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-10 15:27:08,618 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-10 15:27:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,621 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:08,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:08,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:27:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-10 15:27:08,625 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2020-07-10 15:27:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:08,626 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-10 15:27:08,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-10 15:27:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:27:08,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:08,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:08,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:08,628 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:08,628 INFO L82 PathProgramCache]: Analyzing trace with hash 188437731, now seen corresponding path program 1 times [2020-07-10 15:27:08,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:08,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398193161] [2020-07-10 15:27:08,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:08,792 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:08,792 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:08,793 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:27:08,831 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:08,831 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:08,831 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:08,831 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:08,832 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:08,832 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:08,832 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:08,832 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:08,832 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:08,833 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:08,833 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:08,833 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:08,833 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:08,833 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:08,833 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:08,834 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:08,834 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:08,834 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:08,834 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:08,834 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:08,834 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:08,835 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:08,835 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:08,835 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:08,835 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:08,835 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:08,836 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:08,836 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:08,836 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:08,836 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:08,836 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:08,837 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:27:08,837 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:27:08,837 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:27:08,837 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:08,837 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:08,837 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:08,838 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:08,838 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:08,838 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:08,838 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:08,838 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:08,838 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:08,839 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:27:08,839 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:27:08,839 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:27:08,839 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:27:08,839 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:27:08,839 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. [2020-07-10 15:27:08,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:08 BoogieIcfgContainer [2020-07-10 15:27:08,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:08,846 INFO L168 Benchmark]: Toolchain (without parser) took 2813.22 ms. Allocated memory was 138.4 MB in the beginning and 235.9 MB in the end (delta: 97.5 MB). Free memory was 103.0 MB in the beginning and 108.8 MB in the end (delta: -5.8 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:08,847 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:08,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.90 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 91.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:08,848 INFO L168 Benchmark]: Boogie Preprocessor took 179.53 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 180.2 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:08,849 INFO L168 Benchmark]: RCFGBuilder took 474.56 ms. Allocated memory is still 202.9 MB. Free memory was 180.2 MB in the beginning and 154.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:08,850 INFO L168 Benchmark]: TraceAbstraction took 1870.41 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 153.5 MB in the beginning and 108.8 MB in the end (delta: 44.7 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:08,854 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.90 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 91.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 179.53 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 91.6 MB in the beginning and 180.2 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 474.56 ms. Allocated memory is still 202.9 MB. Free memory was 180.2 MB in the beginning and 154.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1870.41 ms. Allocated memory was 202.9 MB in the beginning and 235.9 MB in the end (delta: 33.0 MB). Free memory was 153.5 MB in the beginning and 108.8 MB in the end (delta: 44.7 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = N [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i