/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/brs3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:55,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:55,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:55,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:55,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:55,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:55,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:55,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:55,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:55,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:55,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:55,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:55,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:55,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:55,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:55,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:55,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:55,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:55,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:55,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:55,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:55,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:55,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:55,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:55,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:55,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:55,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:55,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:55,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:55,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:55,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:55,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:55,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:55,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:55,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:55,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:55,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:55,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:55,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:55,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:55,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:55,245 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:25:55,262 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:55,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:55,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:55,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:55,265 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:55,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:55,266 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:55,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:55,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:55,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:55,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:55,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:55,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:55,268 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:55,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:55,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:55,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:55,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:55,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:55,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:55,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:55,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:55,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:55,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:55,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:55,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:55,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:55,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:55,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:55,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:55,551 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:55,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:55,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:55,573 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:55,573 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:55,573 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/brs3f.c [2020-07-10 15:25:55,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d835c1ad/afc4c55cb6864d1ba9332f028b2359ef/FLAG1fec85d7e [2020-07-10 15:25:56,037 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:56,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/brs3f.c [2020-07-10 15:25:56,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d835c1ad/afc4c55cb6864d1ba9332f028b2359ef/FLAG1fec85d7e [2020-07-10 15:25:56,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d835c1ad/afc4c55cb6864d1ba9332f028b2359ef [2020-07-10 15:25:56,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:56,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:56,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:56,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:56,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:56,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57470489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56, skipping insertion in model container [2020-07-10 15:25:56,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:56,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:56,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:56,648 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:56,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:56,689 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:56,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56 WrapperNode [2020-07-10 15:25:56,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:56,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:56,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:56,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:56,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (1/1) ... [2020-07-10 15:25:56,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:56,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:56,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:56,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:56,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (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:25:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:25:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:25:56,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:25:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:25:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:25:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:25:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:25:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:25:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:25:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:25:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:56,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:57,286 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:57,287 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:25:57,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:57 BoogieIcfgContainer [2020-07-10 15:25:57,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:57,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:57,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:57,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:57,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:56" (1/3) ... [2020-07-10 15:25:57,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a55329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:57, skipping insertion in model container [2020-07-10 15:25:57,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:56" (2/3) ... [2020-07-10 15:25:57,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a55329 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:57, skipping insertion in model container [2020-07-10 15:25:57,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:57" (3/3) ... [2020-07-10 15:25:57,298 INFO L109 eAbstractionObserver]: Analyzing ICFG brs3f.c [2020-07-10 15:25:57,308 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:57,315 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:57,329 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:57,350 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:57,350 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:57,351 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:57,351 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:57,351 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:57,351 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:57,351 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:57,351 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 15:25:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:25:57,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,373 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] [2020-07-10 15:25:57,374 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:57,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1824292310, now seen corresponding path program 1 times [2020-07-10 15:25:57,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:57,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107271935] [2020-07-10 15:25:57,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#(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; {36#true} is VALID [2020-07-10 15:25:57,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:57,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #77#return; {36#true} is VALID [2020-07-10 15:25:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2020-07-10 15:25:57,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2020-07-10 15:25:57,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2020-07-10 15:25:57,613 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #73#return; {37#false} is VALID [2020-07-10 15:25:57,615 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {45#(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:25:57,616 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(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; {36#true} is VALID [2020-07-10 15:25:57,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:57,617 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #77#return; {36#true} is VALID [2020-07-10 15:25:57,617 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2020-07-10 15:25:57,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {36#true} is VALID [2020-07-10 15:25:57,618 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#true} assume !(~N~0 <= 0); {36#true} is VALID [2020-07-10 15:25:57,619 INFO L263 TraceCheckUtils]: 7: Hoare triple {36#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {36#true} is VALID [2020-07-10 15:25:57,619 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2020-07-10 15:25:57,620 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2020-07-10 15:25:57,620 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#false} assume true; {37#false} is VALID [2020-07-10 15:25:57,621 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {37#false} {36#true} #73#return; {37#false} is VALID [2020-07-10 15:25:57,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {37#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;~i~0 := 0; {37#false} is VALID [2020-07-10 15:25:57,622 INFO L280 TraceCheckUtils]: 13: Hoare triple {37#false} assume !(~i~0 < ~N~0); {37#false} is VALID [2020-07-10 15:25:57,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2020-07-10 15:25:57,623 INFO L280 TraceCheckUtils]: 15: Hoare triple {37#false} assume !true; {37#false} is VALID [2020-07-10 15:25:57,623 INFO L280 TraceCheckUtils]: 16: Hoare triple {37#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {37#false} is VALID [2020-07-10 15:25:57,624 INFO L263 TraceCheckUtils]: 17: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {37#false} is VALID [2020-07-10 15:25:57,624 INFO L280 TraceCheckUtils]: 18: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2020-07-10 15:25:57,624 INFO L280 TraceCheckUtils]: 19: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2020-07-10 15:25:57,625 INFO L280 TraceCheckUtils]: 20: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 15:25:57,628 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:25:57,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107271935] [2020-07-10 15:25:57,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:57,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:25:57,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148349979] [2020-07-10 15:25:57,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:25:57,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:57,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:57,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:25:57,707 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2020-07-10 15:25:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,961 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2020-07-10 15:25:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:57,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:25:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 15:25:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2020-07-10 15:25:57,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2020-07-10 15:25:58,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,126 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:25:58,126 INFO L226 Difference]: Without dead ends: 26 [2020-07-10 15:25:58,130 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:25:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-10 15:25:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-10 15:25:58,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:58,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:58,179 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:58,179 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,183 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:25:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:25:58,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,184 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:58,184 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-10 15:25:58,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,188 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-07-10 15:25:58,188 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:25:58,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:58,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-10 15:25:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-07-10 15:25:58,194 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2020-07-10 15:25:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:58,194 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-10 15:25:58,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-07-10 15:25:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:25:58,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:58,196 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] [2020-07-10 15:25:58,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:25:58,196 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1767537087, now seen corresponding path program 1 times [2020-07-10 15:25:58,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894876619] [2020-07-10 15:25:58,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,310 INFO L280 TraceCheckUtils]: 0: Hoare triple {217#(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; {206#true} is VALID [2020-07-10 15:25:58,311 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:58,311 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #77#return; {206#true} is VALID [2020-07-10 15:25:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-10 15:25:58,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-10 15:25:58,320 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:58,321 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {206#true} {211#(<= 1 ~N~0)} #73#return; {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:58,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {217#(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:25:58,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {217#(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; {206#true} is VALID [2020-07-10 15:25:58,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:58,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #77#return; {206#true} is VALID [2020-07-10 15:25:58,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret7 := main(); {206#true} is VALID [2020-07-10 15:25:58,324 INFO L280 TraceCheckUtils]: 5: Hoare triple {206#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {206#true} is VALID [2020-07-10 15:25:58,325 INFO L280 TraceCheckUtils]: 6: Hoare triple {206#true} assume !(~N~0 <= 0); {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:58,326 INFO L263 TraceCheckUtils]: 7: Hoare triple {211#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {206#true} is VALID [2020-07-10 15:25:58,326 INFO L280 TraceCheckUtils]: 8: Hoare triple {206#true} ~cond := #in~cond; {206#true} is VALID [2020-07-10 15:25:58,326 INFO L280 TraceCheckUtils]: 9: Hoare triple {206#true} assume !(0 == ~cond); {206#true} is VALID [2020-07-10 15:25:58,327 INFO L280 TraceCheckUtils]: 10: Hoare triple {206#true} assume true; {206#true} is VALID [2020-07-10 15:25:58,328 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {206#true} {211#(<= 1 ~N~0)} #73#return; {211#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:58,329 INFO L280 TraceCheckUtils]: 12: Hoare triple {211#(<= 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;~i~0 := 0; {216#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:25:58,330 INFO L280 TraceCheckUtils]: 13: Hoare triple {216#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {207#false} is VALID [2020-07-10 15:25:58,331 INFO L280 TraceCheckUtils]: 14: Hoare triple {207#false} ~i~0 := 0; {207#false} is VALID [2020-07-10 15:25:58,331 INFO L280 TraceCheckUtils]: 15: Hoare triple {207#false} assume !(~i~0 < ~N~0); {207#false} is VALID [2020-07-10 15:25:58,331 INFO L280 TraceCheckUtils]: 16: Hoare triple {207#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {207#false} is VALID [2020-07-10 15:25:58,331 INFO L263 TraceCheckUtils]: 17: Hoare triple {207#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {207#false} is VALID [2020-07-10 15:25:58,332 INFO L280 TraceCheckUtils]: 18: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2020-07-10 15:25:58,332 INFO L280 TraceCheckUtils]: 19: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2020-07-10 15:25:58,332 INFO L280 TraceCheckUtils]: 20: Hoare triple {207#false} assume !false; {207#false} is VALID [2020-07-10 15:25:58,334 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:25:58,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894876619] [2020-07-10 15:25:58,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:58,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:25:58,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046857798] [2020-07-10 15:25:58,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:25:58,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:58,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:25:58,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:25:58,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:58,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:25:58,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:25:58,391 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2020-07-10 15:25:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,626 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2020-07-10 15:25:58,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:25:58,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:25:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:25:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:25:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:25:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-10 15:25:58,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-10 15:25:58,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,707 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:25:58,707 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:25:58,708 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:25:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:25:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-10 15:25:58,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:58,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2020-07-10 15:25:58,733 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2020-07-10 15:25:58,733 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2020-07-10 15:25:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,736 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:25:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:25:58,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,737 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2020-07-10 15:25:58,737 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2020-07-10 15:25:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,740 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:25:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:25:58,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:58,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:25:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:25:58,744 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2020-07-10 15:25:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:58,744 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:25:58,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:25:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:25:58,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:58,746 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] [2020-07-10 15:25:58,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:25:58,746 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash -395878216, now seen corresponding path program 1 times [2020-07-10 15:25:58,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612703969] [2020-07-10 15:25:58,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {404#(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; {390#true} is VALID [2020-07-10 15:25:58,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:58,979 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {390#true} {390#true} #77#return; {390#true} is VALID [2020-07-10 15:25:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#true} ~cond := #in~cond; {390#true} is VALID [2020-07-10 15:25:58,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {390#true} assume !(0 == ~cond); {390#true} is VALID [2020-07-10 15:25:58,999 INFO L280 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:59,001 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {390#true} {395#(<= 1 ~N~0)} #73#return; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,003 INFO L263 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {404#(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:25:59,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {404#(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; {390#true} is VALID [2020-07-10 15:25:59,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:59,004 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #77#return; {390#true} is VALID [2020-07-10 15:25:59,005 INFO L263 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret7 := main(); {390#true} is VALID [2020-07-10 15:25:59,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {390#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {390#true} is VALID [2020-07-10 15:25:59,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {390#true} assume !(~N~0 <= 0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,007 INFO L263 TraceCheckUtils]: 7: Hoare triple {395#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {390#true} is VALID [2020-07-10 15:25:59,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {390#true} ~cond := #in~cond; {390#true} is VALID [2020-07-10 15:25:59,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {390#true} assume !(0 == ~cond); {390#true} is VALID [2020-07-10 15:25:59,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {390#true} assume true; {390#true} is VALID [2020-07-10 15:25:59,009 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {390#true} {395#(<= 1 ~N~0)} #73#return; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,014 INFO L280 TraceCheckUtils]: 12: Hoare triple {395#(<= 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;~i~0 := 0; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,015 INFO L280 TraceCheckUtils]: 13: Hoare triple {395#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,016 INFO L280 TraceCheckUtils]: 14: Hoare triple {395#(<= 1 ~N~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,017 INFO L280 TraceCheckUtils]: 15: Hoare triple {395#(<= 1 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,024 INFO L280 TraceCheckUtils]: 16: Hoare triple {395#(<= 1 ~N~0)} assume !(~i~0 < ~N~0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,025 INFO L280 TraceCheckUtils]: 17: Hoare triple {395#(<= 1 ~N~0)} ~i~0 := 0; {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,026 INFO L280 TraceCheckUtils]: 18: Hoare triple {395#(<= 1 ~N~0)} assume !!(~i~0 < ~N~0); {395#(<= 1 ~N~0)} is VALID [2020-07-10 15:25:59,027 INFO L280 TraceCheckUtils]: 19: Hoare triple {395#(<= 1 ~N~0)} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:25:59,029 INFO L280 TraceCheckUtils]: 20: Hoare triple {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:25:59,030 INFO L280 TraceCheckUtils]: 21: Hoare triple {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-10 15:25:59,031 INFO L280 TraceCheckUtils]: 22: Hoare triple {400#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {401#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} is VALID [2020-07-10 15:25:59,033 INFO L263 TraceCheckUtils]: 23: Hoare triple {401#(and (= 0 |main_#t~mem6|) (<= 1 ~N~0))} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {402#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:25:59,034 INFO L280 TraceCheckUtils]: 24: Hoare triple {402#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {403#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:25:59,035 INFO L280 TraceCheckUtils]: 25: Hoare triple {403#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {391#false} is VALID [2020-07-10 15:25:59,035 INFO L280 TraceCheckUtils]: 26: Hoare triple {391#false} assume !false; {391#false} is VALID [2020-07-10 15:25:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:59,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612703969] [2020-07-10 15:25:59,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:59,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:25:59,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071973331] [2020-07-10 15:25:59,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:25:59,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:59,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:25:59,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:59,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:25:59,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:25:59,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:59,089 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 8 states. [2020-07-10 15:25:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,633 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-10 15:25:59,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:25:59,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-10 15:25:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:25:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 15:25:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:25:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2020-07-10 15:25:59,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2020-07-10 15:25:59,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:59,696 INFO L225 Difference]: With dead ends: 39 [2020-07-10 15:25:59,697 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 15:25:59,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:25:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 15:25:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-10 15:25:59,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:59,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-10 15:25:59,741 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-10 15:25:59,741 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-10 15:25:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,743 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:25:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:25:59,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,746 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-10 15:25:59,746 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-10 15:25:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,753 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:25:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:25:59,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:59,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:25:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-10 15:25:59,757 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 27 [2020-07-10 15:25:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:59,758 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-10 15:25:59,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:25:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:25:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:25:59,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:59,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:59,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:25:59,762 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1239476407, now seen corresponding path program 1 times [2020-07-10 15:25:59,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:59,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073477535] [2020-07-10 15:25:59,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {595#(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; {581#true} is VALID [2020-07-10 15:25:59,916 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:59,916 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2020-07-10 15:25:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,921 INFO L280 TraceCheckUtils]: 0: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-10 15:25:59,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-10 15:25:59,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:59,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #73#return; {581#true} is VALID [2020-07-10 15:25:59,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {581#true} call ULTIMATE.init(); {595#(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:25:59,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {595#(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; {581#true} is VALID [2020-07-10 15:25:59,923 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:59,923 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2020-07-10 15:25:59,924 INFO L263 TraceCheckUtils]: 4: Hoare triple {581#true} call #t~ret7 := main(); {581#true} is VALID [2020-07-10 15:25:59,924 INFO L280 TraceCheckUtils]: 5: Hoare triple {581#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {581#true} is VALID [2020-07-10 15:25:59,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#true} assume !(~N~0 <= 0); {581#true} is VALID [2020-07-10 15:25:59,924 INFO L263 TraceCheckUtils]: 7: Hoare triple {581#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {581#true} is VALID [2020-07-10 15:25:59,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-10 15:25:59,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-10 15:25:59,925 INFO L280 TraceCheckUtils]: 10: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:25:59,925 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {581#true} {581#true} #73#return; {581#true} is VALID [2020-07-10 15:25:59,927 INFO L280 TraceCheckUtils]: 12: Hoare triple {581#true} 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;~i~0 := 0; {590#(= 0 main_~i~0)} is VALID [2020-07-10 15:25:59,927 INFO L280 TraceCheckUtils]: 13: Hoare triple {590#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {590#(= 0 main_~i~0)} is VALID [2020-07-10 15:25:59,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {590#(= 0 main_~i~0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {590#(= 0 main_~i~0)} is VALID [2020-07-10 15:25:59,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {590#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {591#(<= main_~i~0 1)} is VALID [2020-07-10 15:25:59,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {591#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {592#(<= ~N~0 1)} is VALID [2020-07-10 15:25:59,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {592#(<= ~N~0 1)} ~i~0 := 0; {593#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:25:59,931 INFO L280 TraceCheckUtils]: 18: Hoare triple {593#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {593#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:25:59,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {593#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {593#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:25:59,932 INFO L280 TraceCheckUtils]: 20: Hoare triple {593#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {594#(<= ~N~0 main_~i~0)} is VALID [2020-07-10 15:25:59,933 INFO L280 TraceCheckUtils]: 21: Hoare triple {594#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:25:59,933 INFO L280 TraceCheckUtils]: 22: Hoare triple {582#false} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {582#false} is VALID [2020-07-10 15:25:59,934 INFO L280 TraceCheckUtils]: 23: Hoare triple {582#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {582#false} is VALID [2020-07-10 15:25:59,934 INFO L280 TraceCheckUtils]: 24: Hoare triple {582#false} assume !(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:25:59,934 INFO L280 TraceCheckUtils]: 25: Hoare triple {582#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {582#false} is VALID [2020-07-10 15:25:59,935 INFO L263 TraceCheckUtils]: 26: Hoare triple {582#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {582#false} is VALID [2020-07-10 15:25:59,935 INFO L280 TraceCheckUtils]: 27: Hoare triple {582#false} ~cond := #in~cond; {582#false} is VALID [2020-07-10 15:25:59,935 INFO L280 TraceCheckUtils]: 28: Hoare triple {582#false} assume 0 == ~cond; {582#false} is VALID [2020-07-10 15:25:59,935 INFO L280 TraceCheckUtils]: 29: Hoare triple {582#false} assume !false; {582#false} is VALID [2020-07-10 15:25:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:59,937 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073477535] [2020-07-10 15:25:59,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582978912] [2020-07-10 15:25:59,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:26:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:00,202 INFO L263 TraceCheckUtils]: 0: Hoare triple {581#true} call ULTIMATE.init(); {581#true} is VALID [2020-07-10 15:26:00,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {581#true} is VALID [2020-07-10 15:26:00,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:26:00,203 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {581#true} {581#true} #77#return; {581#true} is VALID [2020-07-10 15:26:00,203 INFO L263 TraceCheckUtils]: 4: Hoare triple {581#true} call #t~ret7 := main(); {581#true} is VALID [2020-07-10 15:26:00,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {581#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {581#true} is VALID [2020-07-10 15:26:00,204 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#true} assume !(~N~0 <= 0); {581#true} is VALID [2020-07-10 15:26:00,204 INFO L263 TraceCheckUtils]: 7: Hoare triple {581#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {581#true} is VALID [2020-07-10 15:26:00,209 INFO L280 TraceCheckUtils]: 8: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-10 15:26:00,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-10 15:26:00,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-10 15:26:00,210 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {581#true} {581#true} #73#return; {581#true} is VALID [2020-07-10 15:26:00,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {581#true} 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;~i~0 := 0; {635#(<= main_~i~0 0)} is VALID [2020-07-10 15:26:00,215 INFO L280 TraceCheckUtils]: 13: Hoare triple {635#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {635#(<= main_~i~0 0)} is VALID [2020-07-10 15:26:00,215 INFO L280 TraceCheckUtils]: 14: Hoare triple {635#(<= main_~i~0 0)} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 3 then ~i~0 % 3 - 3 else ~i~0 % 3);call write~int(3, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {635#(<= main_~i~0 0)} is VALID [2020-07-10 15:26:00,216 INFO L280 TraceCheckUtils]: 15: Hoare triple {635#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {591#(<= main_~i~0 1)} is VALID [2020-07-10 15:26:00,217 INFO L280 TraceCheckUtils]: 16: Hoare triple {591#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {592#(<= ~N~0 1)} is VALID [2020-07-10 15:26:00,218 INFO L280 TraceCheckUtils]: 17: Hoare triple {592#(<= ~N~0 1)} ~i~0 := 0; {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:26:00,219 INFO L280 TraceCheckUtils]: 18: Hoare triple {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0); {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:26:00,219 INFO L280 TraceCheckUtils]: 19: Hoare triple {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume 0 == ~i~0;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:26:00,220 INFO L280 TraceCheckUtils]: 20: Hoare triple {651#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {661#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:26:00,221 INFO L280 TraceCheckUtils]: 21: Hoare triple {661#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:26:00,221 INFO L280 TraceCheckUtils]: 22: Hoare triple {582#false} assume !(0 == ~i~0);call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem4;havoc #t~mem5; {582#false} is VALID [2020-07-10 15:26:00,222 INFO L280 TraceCheckUtils]: 23: Hoare triple {582#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {582#false} is VALID [2020-07-10 15:26:00,222 INFO L280 TraceCheckUtils]: 24: Hoare triple {582#false} assume !(~i~0 < ~N~0); {582#false} is VALID [2020-07-10 15:26:00,222 INFO L280 TraceCheckUtils]: 25: Hoare triple {582#false} call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {582#false} is VALID [2020-07-10 15:26:00,222 INFO L263 TraceCheckUtils]: 26: Hoare triple {582#false} call __VERIFIER_assert((if #t~mem6 <= 3 * ~N~0 then 1 else 0)); {582#false} is VALID [2020-07-10 15:26:00,223 INFO L280 TraceCheckUtils]: 27: Hoare triple {582#false} ~cond := #in~cond; {582#false} is VALID [2020-07-10 15:26:00,223 INFO L280 TraceCheckUtils]: 28: Hoare triple {582#false} assume 0 == ~cond; {582#false} is VALID [2020-07-10 15:26:00,223 INFO L280 TraceCheckUtils]: 29: Hoare triple {582#false} assume !false; {582#false} is VALID [2020-07-10 15:26:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:00,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:00,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:26:00,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373354407] [2020-07-10 15:26:00,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:26:00,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:00,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:26:00,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:00,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:26:00,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:26:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:00,282 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 11 states. [2020-07-10 15:26:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,718 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-10 15:26:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:26:00,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:26:00,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2020-07-10 15:26:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2020-07-10 15:26:00,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2020-07-10 15:26:00,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:00,796 INFO L225 Difference]: With dead ends: 55 [2020-07-10 15:26:00,797 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:26:00,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:26:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-07-10 15:26:00,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:00,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2020-07-10 15:26:00,830 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2020-07-10 15:26:00,831 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2020-07-10 15:26:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,833 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:26:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:26:00,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,835 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2020-07-10 15:26:00,835 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2020-07-10 15:26:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,837 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:26:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:26:00,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:00,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:26:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 15:26:00,840 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 30 [2020-07-10 15:26:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:00,841 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 15:26:00,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:26:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:26:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:26:00,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:00,842 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:01,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:01,053 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:01,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:01,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1492634651, now seen corresponding path program 1 times [2020-07-10 15:26:01,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:01,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836445934] [2020-07-10 15:26:01,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:01,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:01,229 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:01,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:26:01,267 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:01,267 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:01,267 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:01,267 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:01,267 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:01,268 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:01,269 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:01,270 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:26:01,271 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 15:26:01,272 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:01,272 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:01,272 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:01,272 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:01,272 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 15:26:01,272 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:26:01,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:01 BoogieIcfgContainer [2020-07-10 15:26:01,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:01,278 INFO L168 Benchmark]: Toolchain (without parser) took 4864.18 ms. Allocated memory was 146.3 MB in the beginning and 271.6 MB in the end (delta: 125.3 MB). Free memory was 104.3 MB in the beginning and 238.4 MB in the end (delta: -134.1 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:01,278 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:26:01,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.54 ms. Allocated memory is still 146.3 MB. Free memory was 103.9 MB in the beginning and 93.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:01,280 INFO L168 Benchmark]: Boogie Preprocessor took 160.10 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:01,281 INFO L168 Benchmark]: RCFGBuilder took 439.72 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 156.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:01,282 INFO L168 Benchmark]: TraceAbstraction took 3983.23 ms. Allocated memory was 203.9 MB in the beginning and 271.6 MB in the end (delta: 67.6 MB). Free memory was 155.6 MB in the beginning and 238.4 MB in the end (delta: -82.8 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:01,285 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.18 ms. Allocated memory is still 146.3 MB. Free memory is still 122.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.54 ms. Allocated memory is still 146.3 MB. Free memory was 103.9 MB in the beginning and 93.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.10 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 93.1 MB in the beginning and 181.5 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.72 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 156.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3983.23 ms. Allocated memory was 203.9 MB in the beginning and 271.6 MB in the end (delta: 67.6 MB). Free memory was 155.6 MB in the beginning and 238.4 MB in the end (delta: -82.8 MB). Peak memory consumption was 97.3 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)=32, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=2, sum={2:0}] [L29] COND TRUE i