/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-fpi/ss3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:23,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:23,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:23,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:23,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:23,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:23,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:23,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:23,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:23,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:23,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:23,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:23,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:23,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:23,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:23,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:23,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:23,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:23,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:23,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:23,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:23,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:23,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:23,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:23,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:23,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:23,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:23,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:23,838 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:23,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:23,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:23,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:23,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:23,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:23,843 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:23,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:23,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:23,844 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:23,844 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:23,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:23,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:23,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:27:23,856 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:23,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:23,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:23,858 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:23,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:23,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:23,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:23,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:23,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:23,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:23,859 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:23,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:23,860 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:23,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:23,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:23,860 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:23,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:23,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:23,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:23,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:23,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:23,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:23,862 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:27:24,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:24,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:24,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:24,173 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:24,174 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:24,175 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss3f.c [2020-07-11 02:27:24,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7102dfe47/acb9afe751514ed5aba87eaef1328e59/FLAG1c7fbfdf7 [2020-07-11 02:27:24,721 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:24,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss3f.c [2020-07-11 02:27:24,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7102dfe47/acb9afe751514ed5aba87eaef1328e59/FLAG1c7fbfdf7 [2020-07-11 02:27:25,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7102dfe47/acb9afe751514ed5aba87eaef1328e59 [2020-07-11 02:27:25,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:25,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:25,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:25,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:25,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:25,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd80a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25, skipping insertion in model container [2020-07-11 02:27:25,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:25,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:25,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:25,332 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:25,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:25,475 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:25,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25 WrapperNode [2020-07-11 02:27:25,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:25,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:25,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:25,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:25,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (1/1) ... [2020-07-11 02:27:25,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:25,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:25,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:25,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:25,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (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-11 02:27:25,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:27:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:27:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:27:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:27:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:27:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:27:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:27:25,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:27:25,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:27:25,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:27:25,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:25,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:26,133 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:26,134 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-11 02:27:26,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:26 BoogieIcfgContainer [2020-07-11 02:27:26,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:26,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:26,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:26,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:26,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:25" (1/3) ... [2020-07-11 02:27:26,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3082aedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:26, skipping insertion in model container [2020-07-11 02:27:26,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:25" (2/3) ... [2020-07-11 02:27:26,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3082aedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:26, skipping insertion in model container [2020-07-11 02:27:26,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:26" (3/3) ... [2020-07-11 02:27:26,148 INFO L109 eAbstractionObserver]: Analyzing ICFG ss3f.c [2020-07-11 02:27:26,159 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:26,168 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:26,181 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:26,203 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:26,203 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:26,203 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:26,203 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:26,204 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:26,204 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:26,204 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:26,204 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-07-11 02:27:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:27:26,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:26,234 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:26,235 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:26,241 INFO L82 PathProgramCache]: Analyzing trace with hash -464195749, now seen corresponding path program 1 times [2020-07-11 02:27:26,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:26,250 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1813864690] [2020-07-11 02:27:26,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:26,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {97#(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; {85#true} is VALID [2020-07-11 02:27:26,504 INFO L280 TraceCheckUtils]: 1: Hoare triple {85#true} #valid := #valid[0 := 0]; {85#true} is VALID [2020-07-11 02:27:26,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#true} assume 0 < #StackHeapBarrier; {85#true} is VALID [2020-07-11 02:27:26,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {85#true} ~N~0 := 0; {85#true} is VALID [2020-07-11 02:27:26,505 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-11 02:27:26,506 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {85#true} {85#true} #151#return; {85#true} is VALID [2020-07-11 02:27:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:26,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {85#true} ~cond := #in~cond; {85#true} is VALID [2020-07-11 02:27:26,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {85#true} assume !(0 == ~cond); {85#true} is VALID [2020-07-11 02:27:26,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-11 02:27:26,517 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {85#true} {85#true} #147#return; {85#true} is VALID [2020-07-11 02:27:26,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {85#true} call ULTIMATE.init(); {97#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:26,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {97#(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; {85#true} is VALID [2020-07-11 02:27:26,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {85#true} #valid := #valid[0 := 0]; {85#true} is VALID [2020-07-11 02:27:26,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {85#true} assume 0 < #StackHeapBarrier; {85#true} is VALID [2020-07-11 02:27:26,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {85#true} ~N~0 := 0; {85#true} is VALID [2020-07-11 02:27:26,521 INFO L280 TraceCheckUtils]: 5: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-11 02:27:26,521 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {85#true} {85#true} #151#return; {85#true} is VALID [2020-07-11 02:27:26,522 INFO L263 TraceCheckUtils]: 7: Hoare triple {85#true} call #t~ret14 := main(); {85#true} is VALID [2020-07-11 02:27:26,522 INFO L280 TraceCheckUtils]: 8: Hoare triple {85#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {85#true} is VALID [2020-07-11 02:27:26,523 INFO L280 TraceCheckUtils]: 9: Hoare triple {85#true} ~N~0 := #t~nondet0; {85#true} is VALID [2020-07-11 02:27:26,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {85#true} havoc #t~nondet0; {85#true} is VALID [2020-07-11 02:27:26,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {85#true} assume !(~N~0 <= 0); {85#true} is VALID [2020-07-11 02:27:26,524 INFO L263 TraceCheckUtils]: 12: Hoare triple {85#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {85#true} is VALID [2020-07-11 02:27:26,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {85#true} ~cond := #in~cond; {85#true} is VALID [2020-07-11 02:27:26,525 INFO L280 TraceCheckUtils]: 14: Hoare triple {85#true} assume !(0 == ~cond); {85#true} is VALID [2020-07-11 02:27:26,525 INFO L280 TraceCheckUtils]: 15: Hoare triple {85#true} assume true; {85#true} is VALID [2020-07-11 02:27:26,525 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {85#true} {85#true} #147#return; {85#true} is VALID [2020-07-11 02:27:26,526 INFO L280 TraceCheckUtils]: 17: Hoare triple {85#true} havoc ~i~0; {85#true} is VALID [2020-07-11 02:27:26,526 INFO L280 TraceCheckUtils]: 18: Hoare triple {85#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {85#true} is VALID [2020-07-11 02:27:26,527 INFO L280 TraceCheckUtils]: 19: Hoare triple {85#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {85#true} is VALID [2020-07-11 02:27:26,527 INFO L280 TraceCheckUtils]: 20: Hoare triple {85#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {85#true} is VALID [2020-07-11 02:27:26,527 INFO L280 TraceCheckUtils]: 21: Hoare triple {85#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {85#true} is VALID [2020-07-11 02:27:26,528 INFO L280 TraceCheckUtils]: 22: Hoare triple {85#true} ~i~0 := 0; {85#true} is VALID [2020-07-11 02:27:26,529 INFO L280 TraceCheckUtils]: 23: Hoare triple {85#true} assume !true; {86#false} is VALID [2020-07-11 02:27:26,530 INFO L280 TraceCheckUtils]: 24: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-11 02:27:26,530 INFO L280 TraceCheckUtils]: 25: Hoare triple {86#false} assume !true; {86#false} is VALID [2020-07-11 02:27:26,530 INFO L280 TraceCheckUtils]: 26: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-11 02:27:26,531 INFO L280 TraceCheckUtils]: 27: Hoare triple {86#false} assume !(~i~0 < ~N~0); {86#false} is VALID [2020-07-11 02:27:26,531 INFO L280 TraceCheckUtils]: 28: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-11 02:27:26,532 INFO L280 TraceCheckUtils]: 29: Hoare triple {86#false} assume !true; {86#false} is VALID [2020-07-11 02:27:26,532 INFO L280 TraceCheckUtils]: 30: Hoare triple {86#false} ~i~0 := 0; {86#false} is VALID [2020-07-11 02:27:26,532 INFO L280 TraceCheckUtils]: 31: Hoare triple {86#false} assume !true; {86#false} is VALID [2020-07-11 02:27:26,533 INFO L280 TraceCheckUtils]: 32: Hoare triple {86#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L50-6 {86#false} is VALID [2020-07-11 02:27:26,533 INFO L263 TraceCheckUtils]: 33: Hoare triple {86#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 * (1 + ~N~0) then 1 else 0)); {86#false} is VALID [2020-07-11 02:27:26,534 INFO L280 TraceCheckUtils]: 34: Hoare triple {86#false} ~cond := #in~cond; {86#false} is VALID [2020-07-11 02:27:26,534 INFO L280 TraceCheckUtils]: 35: Hoare triple {86#false} assume 0 == ~cond; {86#false} is VALID [2020-07-11 02:27:26,534 INFO L280 TraceCheckUtils]: 36: Hoare triple {86#false} assume !false; {86#false} is VALID [2020-07-11 02:27:26,540 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-11 02:27:26,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1813864690] [2020-07-11 02:27:26,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:26,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:27:26,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498318064] [2020-07-11 02:27:26,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-11 02:27:26,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:26,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:27:26,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:26,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:27:26,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:27:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:27:26,640 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-07-11 02:27:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:27,126 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2020-07-11 02:27:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:27:27,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-11 02:27:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-11 02:27:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2020-07-11 02:27:27,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2020-07-11 02:27:27,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:27,386 INFO L225 Difference]: With dead ends: 147 [2020-07-11 02:27:27,387 INFO L226 Difference]: Without dead ends: 70 [2020-07-11 02:27:27,391 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 02:27:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-11 02:27:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-11 02:27:27,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:27,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-11 02:27:27,490 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 02:27:27,490 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 02:27:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:27,497 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-11 02:27:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-11 02:27:27,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:27,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:27,499 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-11 02:27:27,499 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-11 02:27:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:27,506 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-07-11 02:27:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-11 02:27:27,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:27,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:27,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:27,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:27,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-11 02:27:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-07-11 02:27:27,514 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 37 [2020-07-11 02:27:27,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:27,515 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-07-11 02:27:27,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:27:27,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2020-07-11 02:27:27,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-11 02:27:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:27:27,610 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:27,610 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:27,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:27,611 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 853879691, now seen corresponding path program 1 times [2020-07-11 02:27:27,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:27,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [622542968] [2020-07-11 02:27:27,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:27,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#(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; {674#true} is VALID [2020-07-11 02:27:27,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {674#true} #valid := #valid[0 := 0]; {674#true} is VALID [2020-07-11 02:27:27,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {674#true} assume 0 < #StackHeapBarrier; {674#true} is VALID [2020-07-11 02:27:27,742 INFO L280 TraceCheckUtils]: 3: Hoare triple {674#true} ~N~0 := 0; {674#true} is VALID [2020-07-11 02:27:27,745 INFO L280 TraceCheckUtils]: 4: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-11 02:27:27,745 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {674#true} {674#true} #151#return; {674#true} is VALID [2020-07-11 02:27:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:27,764 INFO L280 TraceCheckUtils]: 0: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2020-07-11 02:27:27,765 INFO L280 TraceCheckUtils]: 1: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2020-07-11 02:27:27,765 INFO L280 TraceCheckUtils]: 2: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-11 02:27:27,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {674#true} {682#(<= 1 ~N~0)} #147#return; {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,769 INFO L263 TraceCheckUtils]: 0: Hoare triple {674#true} call ULTIMATE.init(); {688#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:27,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#(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; {674#true} is VALID [2020-07-11 02:27:27,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {674#true} #valid := #valid[0 := 0]; {674#true} is VALID [2020-07-11 02:27:27,770 INFO L280 TraceCheckUtils]: 3: Hoare triple {674#true} assume 0 < #StackHeapBarrier; {674#true} is VALID [2020-07-11 02:27:27,771 INFO L280 TraceCheckUtils]: 4: Hoare triple {674#true} ~N~0 := 0; {674#true} is VALID [2020-07-11 02:27:27,771 INFO L280 TraceCheckUtils]: 5: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-11 02:27:27,771 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {674#true} {674#true} #151#return; {674#true} is VALID [2020-07-11 02:27:27,772 INFO L263 TraceCheckUtils]: 7: Hoare triple {674#true} call #t~ret14 := main(); {674#true} is VALID [2020-07-11 02:27:27,772 INFO L280 TraceCheckUtils]: 8: Hoare triple {674#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {674#true} is VALID [2020-07-11 02:27:27,772 INFO L280 TraceCheckUtils]: 9: Hoare triple {674#true} ~N~0 := #t~nondet0; {674#true} is VALID [2020-07-11 02:27:27,773 INFO L280 TraceCheckUtils]: 10: Hoare triple {674#true} havoc #t~nondet0; {674#true} is VALID [2020-07-11 02:27:27,776 INFO L280 TraceCheckUtils]: 11: Hoare triple {674#true} assume !(~N~0 <= 0); {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,777 INFO L263 TraceCheckUtils]: 12: Hoare triple {682#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {674#true} is VALID [2020-07-11 02:27:27,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {674#true} ~cond := #in~cond; {674#true} is VALID [2020-07-11 02:27:27,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {674#true} assume !(0 == ~cond); {674#true} is VALID [2020-07-11 02:27:27,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {674#true} assume true; {674#true} is VALID [2020-07-11 02:27:27,780 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {674#true} {682#(<= 1 ~N~0)} #147#return; {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {682#(<= 1 ~N~0)} havoc ~i~0; {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,784 INFO L280 TraceCheckUtils]: 18: Hoare triple {682#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,785 INFO L280 TraceCheckUtils]: 19: Hoare triple {682#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,785 INFO L280 TraceCheckUtils]: 20: Hoare triple {682#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,786 INFO L280 TraceCheckUtils]: 21: Hoare triple {682#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {682#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,787 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#(<= 1 ~N~0)} ~i~0 := 0; {687#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-11 02:27:27,788 INFO L280 TraceCheckUtils]: 23: Hoare triple {687#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-11 02:27:27,788 INFO L280 TraceCheckUtils]: 24: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-11 02:27:27,789 INFO L280 TraceCheckUtils]: 25: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-11 02:27:27,789 INFO L280 TraceCheckUtils]: 26: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-11 02:27:27,789 INFO L280 TraceCheckUtils]: 27: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-11 02:27:27,790 INFO L280 TraceCheckUtils]: 28: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-11 02:27:27,791 INFO L280 TraceCheckUtils]: 29: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-11 02:27:27,791 INFO L280 TraceCheckUtils]: 30: Hoare triple {675#false} ~i~0 := 0; {675#false} is VALID [2020-07-11 02:27:27,792 INFO L280 TraceCheckUtils]: 31: Hoare triple {675#false} assume !(~i~0 < ~N~0); {675#false} is VALID [2020-07-11 02:27:27,792 INFO L280 TraceCheckUtils]: 32: Hoare triple {675#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L50-6 {675#false} is VALID [2020-07-11 02:27:27,792 INFO L263 TraceCheckUtils]: 33: Hoare triple {675#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 * (1 + ~N~0) then 1 else 0)); {675#false} is VALID [2020-07-11 02:27:27,793 INFO L280 TraceCheckUtils]: 34: Hoare triple {675#false} ~cond := #in~cond; {675#false} is VALID [2020-07-11 02:27:27,793 INFO L280 TraceCheckUtils]: 35: Hoare triple {675#false} assume 0 == ~cond; {675#false} is VALID [2020-07-11 02:27:27,795 INFO L280 TraceCheckUtils]: 36: Hoare triple {675#false} assume !false; {675#false} is VALID [2020-07-11 02:27:27,799 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-11 02:27:27,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [622542968] [2020-07-11 02:27:27,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:27,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:27:27,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876134007] [2020-07-11 02:27:27,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-11 02:27:27,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:27,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:27,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:27,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:27,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:27,857 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2020-07-11 02:27:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,492 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2020-07-11 02:27:28,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:27:28,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-11 02:27:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2020-07-11 02:27:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2020-07-11 02:27:28,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 156 transitions. [2020-07-11 02:27:28,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:28,699 INFO L225 Difference]: With dead ends: 144 [2020-07-11 02:27:28,700 INFO L226 Difference]: Without dead ends: 102 [2020-07-11 02:27:28,701 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-11 02:27:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-11 02:27:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2020-07-11 02:27:28,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:28,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 75 states. [2020-07-11 02:27:28,836 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 75 states. [2020-07-11 02:27:28,836 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 75 states. [2020-07-11 02:27:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,849 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2020-07-11 02:27:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2020-07-11 02:27:28,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:28,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:28,850 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 102 states. [2020-07-11 02:27:28,851 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 102 states. [2020-07-11 02:27:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,858 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2020-07-11 02:27:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2020-07-11 02:27:28,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:28,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:28,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:28,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-11 02:27:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2020-07-11 02:27:28,877 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 37 [2020-07-11 02:27:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:28,878 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2020-07-11 02:27:28,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:28,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 79 transitions. [2020-07-11 02:27:28,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2020-07-11 02:27:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-11 02:27:28,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:28,974 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:28,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:28,977 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:28,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:28,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1805527949, now seen corresponding path program 1 times [2020-07-11 02:27:28,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:28,978 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907011300] [2020-07-11 02:27:28,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:29,039 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-11 02:27:29,043 WARN L168 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2020-07-11 02:27:29,043 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:27:29,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:27:29,065 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:29,066 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:27:29,067 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-11 02:27:29,068 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-11 02:27:29,069 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:27:29,070 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-11 02:27:29,071 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:27:29,072 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2020-07-11 02:27:29,073 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L45-6 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-11 02:27:29,074 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L50-6 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-11 02:27:29,075 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-11 02:27:29,076 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-11 02:27:29,077 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-11 02:27:29,077 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-11 02:27:29,077 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-11 02:27:29,077 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-11 02:27:29,077 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-11 02:27:29,077 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-11 02:27:29,080 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-11 02:27:29,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:27:29 BoogieIcfgContainer [2020-07-11 02:27:29,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:27:29,084 INFO L168 Benchmark]: Toolchain (without parser) took 3982.05 ms. Allocated memory was 142.1 MB in the beginning and 252.2 MB in the end (delta: 110.1 MB). Free memory was 100.3 MB in the beginning and 197.7 MB in the end (delta: -97.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:29,085 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:27:29,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.28 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 100.1 MB in the beginning and 179.7 MB in the end (delta: -79.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:29,087 INFO L168 Benchmark]: Boogie Preprocessor took 54.99 ms. Allocated memory is still 200.8 MB. Free memory was 179.7 MB in the beginning and 177.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:29,088 INFO L168 Benchmark]: RCFGBuilder took 604.76 ms. Allocated memory is still 200.8 MB. Free memory was 177.1 MB in the beginning and 142.4 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:29,089 INFO L168 Benchmark]: TraceAbstraction took 2940.81 ms. Allocated memory was 200.8 MB in the beginning and 252.2 MB in the end (delta: 51.4 MB). Free memory was 141.6 MB in the beginning and 197.7 MB in the end (delta: -56.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 02:27:29,092 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.25 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 372.28 ms. Allocated memory was 142.1 MB in the beginning and 200.8 MB in the end (delta: 58.7 MB). Free memory was 100.1 MB in the beginning and 179.7 MB in the end (delta: -79.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.99 ms. Allocated memory is still 200.8 MB. Free memory was 179.7 MB in the beginning and 177.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 604.76 ms. Allocated memory is still 200.8 MB. Free memory was 177.1 MB in the beginning and 142.4 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2940.81 ms. Allocated memory was 200.8 MB in the beginning and 252.2 MB in the end (delta: 51.4 MB). Free memory was 141.6 MB in the beginning and 197.7 MB in the end (delta: -56.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 13]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L17] int N; [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L11] COND FALSE !(!cond) [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L25] int i; [L26] long long sum[1]; [L27] long long *a = malloc(sizeof(long long)*N); [L29] sum[0] = 0 [L30] i=0 [L30] COND TRUE i