/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/ifeqn4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:05,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:05,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:05,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:05,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:05,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:05,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:05,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:05,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:05,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:05,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:05,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:05,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:05,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:05,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:05,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:05,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:05,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:05,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:05,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:05,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:05,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:05,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:05,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:05,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:05,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:05,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:05,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:05,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:05,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:05,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:05,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:05,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:05,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:05,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:05,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:05,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:05,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:05,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:05,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:05,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:05,552 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-17 22:49:05,567 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:05,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:05,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:05,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:05,569 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:05,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:05,569 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:05,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:05,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:05,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:05,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:05,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:05,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:05,571 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:05,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:05,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:05,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:05,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:05,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:05,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:05,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:05,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:05,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:05,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:05,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:05,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:05,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:05,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:05,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:05,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:05,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:05,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:05,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:05,893 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:05,893 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:05,894 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ifeqn4f.c [2020-07-17 22:49:05,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160986c7b/72b58c51ca714582bc01afa730b2475a/FLAG48a199a8d [2020-07-17 22:49:06,460 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:06,461 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn4f.c [2020-07-17 22:49:06,467 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160986c7b/72b58c51ca714582bc01afa730b2475a/FLAG48a199a8d [2020-07-17 22:49:06,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160986c7b/72b58c51ca714582bc01afa730b2475a [2020-07-17 22:49:06,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:06,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:06,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:06,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:06,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:06,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a3df91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06, skipping insertion in model container [2020-07-17 22:49:06,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:06,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:07,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:07,107 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:07,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:07,148 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:07,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07 WrapperNode [2020-07-17 22:49:07,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:07,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:07,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:07,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:07,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (1/1) ... [2020-07-17 22:49:07,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (1/1) ... [2020-07-17 22:49:07,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (1/1) ... [2020-07-17 22:49:07,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (1/1) ... [2020-07-17 22:49:07,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (1/1) ... [2020-07-17 22:49:07,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (1/1) ... [2020-07-17 22:49:07,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (1/1) ... [2020-07-17 22:49:07,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:07,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:07,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:07,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:07,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (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-17 22:49:07,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:07,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:07,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:07,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:07,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:07,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:07,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:07,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:07,780 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:07,781 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:07,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:07 BoogieIcfgContainer [2020-07-17 22:49:07,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:07,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:07,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:07,791 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:07,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:06" (1/3) ... [2020-07-17 22:49:07,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a2885b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:07, skipping insertion in model container [2020-07-17 22:49:07,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:07" (2/3) ... [2020-07-17 22:49:07,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a2885b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:07, skipping insertion in model container [2020-07-17 22:49:07,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:07" (3/3) ... [2020-07-17 22:49:07,795 INFO L109 eAbstractionObserver]: Analyzing ICFG ifeqn4f.c [2020-07-17 22:49:07,806 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:07,814 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:07,829 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:07,850 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:07,850 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:07,850 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:07,851 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:07,851 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:07,851 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:07,851 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:07,851 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-17 22:49:07,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:07,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:07,878 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] [2020-07-17 22:49:07,879 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:07,884 INFO L82 PathProgramCache]: Analyzing trace with hash -294712258, now seen corresponding path program 1 times [2020-07-17 22:49:07,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:07,894 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417856703] [2020-07-17 22:49:07,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#(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; {39#true} is VALID [2020-07-17 22:49:08,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:08,111 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:08,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:08,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:08,124 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:08,126 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:08,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(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; {39#true} is VALID [2020-07-17 22:49:08,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:08,128 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:08,128 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret10 := main(); {39#true} is VALID [2020-07-17 22:49:08,128 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {39#true} is VALID [2020-07-17 22:49:08,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-17 22:49:08,129 INFO L263 TraceCheckUtils]: 7: Hoare triple {39#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {39#true} is VALID [2020-07-17 22:49:08,130 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:08,131 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:08,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:08,132 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:08,132 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:08,133 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-17 22:49:08,133 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:08,133 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-17 22:49:08,134 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:08,134 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {40#false} is VALID [2020-07-17 22:49:08,135 INFO L263 TraceCheckUtils]: 18: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem9 == 1 + (4 * ~i~0 * ~i~0 + 4 * ~i~0) then 1 else 0)); {40#false} is VALID [2020-07-17 22:49:08,135 INFO L280 TraceCheckUtils]: 19: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-17 22:49:08,135 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-17 22:49:08,136 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-17 22:49:08,139 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-17 22:49:08,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417856703] [2020-07-17 22:49:08,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:08,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:08,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413056302] [2020-07-17 22:49:08,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:08,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:08,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:08,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:08,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:08,210 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-17 22:49:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,423 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-17 22:49:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:08,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:08,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-17 22:49:08,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,626 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:49:08,626 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:49:08,630 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-17 22:49:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:49:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-17 22:49:08,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:08,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,704 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,705 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,711 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:49:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:08,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,712 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,713 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,717 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:49:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:08,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:08,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:49:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-17 22:49:08,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-17 22:49:08,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:08,724 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-17 22:49:08,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:08,726 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:08,726 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] [2020-07-17 22:49:08,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:08,727 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2054124171, now seen corresponding path program 1 times [2020-07-17 22:49:08,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:08,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486438368] [2020-07-17 22:49:08,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:08,752 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:08,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847765538] [2020-07-17 22:49:08,753 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-17 22:49:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:49:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:08,949 INFO L263 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2020-07-17 22:49:08,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {233#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {233#true} is VALID [2020-07-17 22:49:08,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#true} assume true; {233#true} is VALID [2020-07-17 22:49:08,950 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} #91#return; {233#true} is VALID [2020-07-17 22:49:08,950 INFO L263 TraceCheckUtils]: 4: Hoare triple {233#true} call #t~ret10 := main(); {233#true} is VALID [2020-07-17 22:49:08,950 INFO L280 TraceCheckUtils]: 5: Hoare triple {233#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {233#true} is VALID [2020-07-17 22:49:08,952 INFO L280 TraceCheckUtils]: 6: Hoare triple {233#true} assume !(~N~0 <= 0); {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,953 INFO L263 TraceCheckUtils]: 7: Hoare triple {256#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,954 INFO L280 TraceCheckUtils]: 8: Hoare triple {256#(< 0 ~N~0)} ~cond := #in~cond; {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,955 INFO L280 TraceCheckUtils]: 9: Hoare triple {256#(< 0 ~N~0)} assume !(0 == ~cond); {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {256#(< 0 ~N~0)} assume true; {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,958 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {256#(< 0 ~N~0)} {256#(< 0 ~N~0)} #87#return; {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,960 INFO L280 TraceCheckUtils]: 12: Hoare triple {256#(< 0 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {275#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-17 22:49:08,961 INFO L280 TraceCheckUtils]: 13: Hoare triple {275#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-17 22:49:08,961 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-17 22:49:08,962 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#false} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-17 22:49:08,962 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-17 22:49:08,962 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {234#false} is VALID [2020-07-17 22:49:08,962 INFO L263 TraceCheckUtils]: 18: Hoare triple {234#false} call __VERIFIER_assert((if #t~mem9 == 1 + (4 * ~i~0 * ~i~0 + 4 * ~i~0) then 1 else 0)); {234#false} is VALID [2020-07-17 22:49:08,963 INFO L280 TraceCheckUtils]: 19: Hoare triple {234#false} ~cond := #in~cond; {234#false} is VALID [2020-07-17 22:49:08,963 INFO L280 TraceCheckUtils]: 20: Hoare triple {234#false} assume 0 == ~cond; {234#false} is VALID [2020-07-17 22:49:08,963 INFO L280 TraceCheckUtils]: 21: Hoare triple {234#false} assume !false; {234#false} is VALID [2020-07-17 22:49:08,968 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-17 22:49:08,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486438368] [2020-07-17 22:49:08,969 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:08,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847765538] [2020-07-17 22:49:08,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:08,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:49:08,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567668494] [2020-07-17 22:49:08,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:49:08,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:08,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:49:09,001 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:09,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:49:09,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:09,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:49:09,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:09,003 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2020-07-17 22:49:09,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,207 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-07-17 22:49:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:49:09,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:49:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-17 22:49:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-17 22:49:09,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-17 22:49:09,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:09,324 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:49:09,324 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:49:09,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:49:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-17 22:49:09,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:09,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:09,371 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:09,371 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,377 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-17 22:49:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-17 22:49:09,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:09,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:09,380 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-17 22:49:09,380 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-17 22:49:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:09,387 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-17 22:49:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-17 22:49:09,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:09,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:09,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:09,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:49:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-17 22:49:09,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2020-07-17 22:49:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:09,398 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-17 22:49:09,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:49:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:49:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:09,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:09,399 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] [2020-07-17 22:49:09,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:49:09,611 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:09,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1477618916, now seen corresponding path program 1 times [2020-07-17 22:49:09,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:09,613 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721664558] [2020-07-17 22:49:09,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:09,648 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:09,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302011492] [2020-07-17 22:49:09,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:49:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:09,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 22:49:09,807 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,812 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:09,812 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,813 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-17 22:49:09,871 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:09,872 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-17 22:49:09,874 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:09,887 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-17 22:49:09,888 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,888 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-17 22:49:09,891 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:09,892 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~b~0.base, main_~b~0.offset]. (let ((.cse0 (select |#memory_int| main_~b~0.base))) (and (= (select .cse0 main_~b~0.offset) 1) (= (select .cse0 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|) (= 0 main_~i~0))) [2020-07-17 22:49:09,892 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:49:09,958 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2020-07-17 22:49:09,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {505#true} is VALID [2020-07-17 22:49:09,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:49:09,959 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #91#return; {505#true} is VALID [2020-07-17 22:49:09,959 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret10 := main(); {505#true} is VALID [2020-07-17 22:49:09,959 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {505#true} is VALID [2020-07-17 22:49:09,960 INFO L280 TraceCheckUtils]: 6: Hoare triple {505#true} assume !(~N~0 <= 0); {505#true} is VALID [2020-07-17 22:49:09,960 INFO L263 TraceCheckUtils]: 7: Hoare triple {505#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {505#true} is VALID [2020-07-17 22:49:09,960 INFO L280 TraceCheckUtils]: 8: Hoare triple {505#true} ~cond := #in~cond; {505#true} is VALID [2020-07-17 22:49:09,961 INFO L280 TraceCheckUtils]: 9: Hoare triple {505#true} assume !(0 == ~cond); {505#true} is VALID [2020-07-17 22:49:09,961 INFO L280 TraceCheckUtils]: 10: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:49:09,961 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {505#true} {505#true} #87#return; {505#true} is VALID [2020-07-17 22:49:09,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {505#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {505#true} is VALID [2020-07-17 22:49:09,962 INFO L280 TraceCheckUtils]: 13: Hoare triple {505#true} assume !!(~i~0 < ~N~0); {505#true} is VALID [2020-07-17 22:49:09,962 INFO L280 TraceCheckUtils]: 14: Hoare triple {505#true} assume 0 == ~i~0;call write~int(4, ~a~0.base, ~a~0.offset, 8); {505#true} is VALID [2020-07-17 22:49:09,962 INFO L280 TraceCheckUtils]: 15: Hoare triple {505#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {505#true} is VALID [2020-07-17 22:49:09,963 INFO L280 TraceCheckUtils]: 16: Hoare triple {505#true} assume !(~i~0 < ~N~0); {505#true} is VALID [2020-07-17 22:49:09,963 INFO L280 TraceCheckUtils]: 17: Hoare triple {505#true} ~i~0 := 0; {505#true} is VALID [2020-07-17 22:49:09,963 INFO L280 TraceCheckUtils]: 18: Hoare triple {505#true} assume !!(~i~0 < ~N~0); {505#true} is VALID [2020-07-17 22:49:09,965 INFO L280 TraceCheckUtils]: 19: Hoare triple {505#true} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:09,966 INFO L280 TraceCheckUtils]: 20: Hoare triple {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:09,967 INFO L280 TraceCheckUtils]: 21: Hoare triple {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:09,968 INFO L280 TraceCheckUtils]: 22: Hoare triple {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 0; {577#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:09,969 INFO L280 TraceCheckUtils]: 23: Hoare triple {577#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {581#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-17 22:49:09,970 INFO L263 TraceCheckUtils]: 24: Hoare triple {581#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (4 * ~i~0 * ~i~0 + 4 * ~i~0) then 1 else 0)); {585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:09,971 INFO L280 TraceCheckUtils]: 25: Hoare triple {585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:09,972 INFO L280 TraceCheckUtils]: 26: Hoare triple {589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {506#false} is VALID [2020-07-17 22:49:09,972 INFO L280 TraceCheckUtils]: 27: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-17 22:49:09,974 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-17 22:49:09,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721664558] [2020-07-17 22:49:09,975 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:09,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302011492] [2020-07-17 22:49:09,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:09,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:49:09,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224864313] [2020-07-17 22:49:09,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:49:09,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:09,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:10,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:10,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:10,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:10,017 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-17 22:49:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:10,450 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-17 22:49:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:49:10,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:49:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-17 22:49:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-17 22:49:10,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-17 22:49:10,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:10,534 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:49:10,535 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:49:10,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:49:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:49:10,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2020-07-17 22:49:10,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:10,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 43 states. [2020-07-17 22:49:10,571 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 43 states. [2020-07-17 22:49:10,571 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 43 states. [2020-07-17 22:49:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:10,575 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-17 22:49:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-17 22:49:10,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:10,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:10,576 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 50 states. [2020-07-17 22:49:10,577 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 50 states. [2020-07-17 22:49:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:10,580 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-17 22:49:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-17 22:49:10,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:10,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:10,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:10,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:49:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-17 22:49:10,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 28 [2020-07-17 22:49:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:10,585 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-17 22:49:10,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-17 22:49:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:10,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:10,587 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] [2020-07-17 22:49:10,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:10,802 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:10,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash -797560546, now seen corresponding path program 1 times [2020-07-17 22:49:10,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:10,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654515260] [2020-07-17 22:49:10,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#(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; {830#true} is VALID [2020-07-17 22:49:10,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,941 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {830#true} {830#true} #91#return; {830#true} is VALID [2020-07-17 22:49:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2020-07-17 22:49:10,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2020-07-17 22:49:10,960 INFO L280 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,960 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #87#return; {830#true} is VALID [2020-07-17 22:49:10,962 INFO L263 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {840#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:10,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#(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; {830#true} is VALID [2020-07-17 22:49:10,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,962 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #91#return; {830#true} is VALID [2020-07-17 22:49:10,963 INFO L263 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret10 := main(); {830#true} is VALID [2020-07-17 22:49:10,963 INFO L280 TraceCheckUtils]: 5: Hoare triple {830#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {830#true} is VALID [2020-07-17 22:49:10,963 INFO L280 TraceCheckUtils]: 6: Hoare triple {830#true} assume !(~N~0 <= 0); {830#true} is VALID [2020-07-17 22:49:10,963 INFO L263 TraceCheckUtils]: 7: Hoare triple {830#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {830#true} is VALID [2020-07-17 22:49:10,964 INFO L280 TraceCheckUtils]: 8: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2020-07-17 22:49:10,964 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2020-07-17 22:49:10,964 INFO L280 TraceCheckUtils]: 10: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,964 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {830#true} {830#true} #87#return; {830#true} is VALID [2020-07-17 22:49:10,965 INFO L280 TraceCheckUtils]: 12: Hoare triple {830#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {830#true} is VALID [2020-07-17 22:49:10,965 INFO L280 TraceCheckUtils]: 13: Hoare triple {830#true} assume !!(~i~0 < ~N~0); {830#true} is VALID [2020-07-17 22:49:10,965 INFO L280 TraceCheckUtils]: 14: Hoare triple {830#true} assume 0 == ~i~0;call write~int(4, ~a~0.base, ~a~0.offset, 8); {830#true} is VALID [2020-07-17 22:49:10,965 INFO L280 TraceCheckUtils]: 15: Hoare triple {830#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {830#true} is VALID [2020-07-17 22:49:10,966 INFO L280 TraceCheckUtils]: 16: Hoare triple {830#true} assume !(~i~0 < ~N~0); {830#true} is VALID [2020-07-17 22:49:10,966 INFO L280 TraceCheckUtils]: 17: Hoare triple {830#true} ~i~0 := 0; {839#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:10,972 INFO L280 TraceCheckUtils]: 18: Hoare triple {839#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {839#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:10,973 INFO L280 TraceCheckUtils]: 19: Hoare triple {839#(= 0 main_~i~0)} assume !(0 == ~i~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {831#false} is VALID [2020-07-17 22:49:10,973 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {831#false} is VALID [2020-07-17 22:49:10,973 INFO L280 TraceCheckUtils]: 21: Hoare triple {831#false} assume !(~i~0 < ~N~0); {831#false} is VALID [2020-07-17 22:49:10,973 INFO L280 TraceCheckUtils]: 22: Hoare triple {831#false} ~i~0 := 0; {831#false} is VALID [2020-07-17 22:49:10,974 INFO L280 TraceCheckUtils]: 23: Hoare triple {831#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {831#false} is VALID [2020-07-17 22:49:10,974 INFO L263 TraceCheckUtils]: 24: Hoare triple {831#false} call __VERIFIER_assert((if #t~mem9 == 1 + (4 * ~i~0 * ~i~0 + 4 * ~i~0) then 1 else 0)); {831#false} is VALID [2020-07-17 22:49:10,974 INFO L280 TraceCheckUtils]: 25: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2020-07-17 22:49:10,974 INFO L280 TraceCheckUtils]: 26: Hoare triple {831#false} assume 0 == ~cond; {831#false} is VALID [2020-07-17 22:49:10,974 INFO L280 TraceCheckUtils]: 27: Hoare triple {831#false} assume !false; {831#false} is VALID [2020-07-17 22:49:10,977 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-17 22:49:10,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654515260] [2020-07-17 22:49:10,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:10,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:49:10,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078242984] [2020-07-17 22:49:10,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-07-17 22:49:10,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:10,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:49:11,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:49:11,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:11,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:49:11,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:11,020 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2020-07-17 22:49:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,277 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2020-07-17 22:49:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:49:11,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-07-17 22:49:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2020-07-17 22:49:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2020-07-17 22:49:11,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2020-07-17 22:49:11,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,379 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:49:11,379 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 22:49:11,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 22:49:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-17 22:49:11,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:11,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2020-07-17 22:49:11,421 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2020-07-17 22:49:11,421 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2020-07-17 22:49:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,424 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-17 22:49:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:49:11,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,425 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2020-07-17 22:49:11,425 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2020-07-17 22:49:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,428 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-17 22:49:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:49:11,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:11,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:49:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-17 22:49:11,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2020-07-17 22:49:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:11,432 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-17 22:49:11,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:49:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-17 22:49:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 22:49:11,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:11,433 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:11,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:49:11,434 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash -622618382, now seen corresponding path program 1 times [2020-07-17 22:49:11,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:11,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522412304] [2020-07-17 22:49:11,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:11,455 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:11,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121631909] [2020-07-17 22:49:11,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,527 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:49:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:11,678 INFO L263 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1090#true} is VALID [2020-07-17 22:49:11,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {1090#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1090#true} is VALID [2020-07-17 22:49:11,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2020-07-17 22:49:11,679 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #91#return; {1090#true} is VALID [2020-07-17 22:49:11,679 INFO L263 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret10 := main(); {1090#true} is VALID [2020-07-17 22:49:11,680 INFO L280 TraceCheckUtils]: 5: Hoare triple {1090#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1090#true} is VALID [2020-07-17 22:49:11,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {1090#true} assume !(~N~0 <= 0); {1090#true} is VALID [2020-07-17 22:49:11,680 INFO L263 TraceCheckUtils]: 7: Hoare triple {1090#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1090#true} is VALID [2020-07-17 22:49:11,680 INFO L280 TraceCheckUtils]: 8: Hoare triple {1090#true} ~cond := #in~cond; {1090#true} is VALID [2020-07-17 22:49:11,681 INFO L280 TraceCheckUtils]: 9: Hoare triple {1090#true} assume !(0 == ~cond); {1090#true} is VALID [2020-07-17 22:49:11,681 INFO L280 TraceCheckUtils]: 10: Hoare triple {1090#true} assume true; {1090#true} is VALID [2020-07-17 22:49:11,681 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1090#true} {1090#true} #87#return; {1090#true} is VALID [2020-07-17 22:49:11,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {1090#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1131#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:11,698 INFO L280 TraceCheckUtils]: 13: Hoare triple {1131#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {1131#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:11,702 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(<= main_~i~0 0)} assume 0 == ~i~0;call write~int(4, ~a~0.base, ~a~0.offset, 8); {1131#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:11,703 INFO L280 TraceCheckUtils]: 15: Hoare triple {1131#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1141#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:11,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {1141#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,704 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#(<= ~N~0 1)} ~i~0 := 0; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#(<= ~N~0 1)} assume !!(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,705 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#(<= ~N~0 1)} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,706 INFO L280 TraceCheckUtils]: 20: Hoare triple {1145#(<= ~N~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,706 INFO L280 TraceCheckUtils]: 21: Hoare triple {1145#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,707 INFO L280 TraceCheckUtils]: 22: Hoare triple {1145#(<= ~N~0 1)} ~i~0 := 0; {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,709 INFO L263 TraceCheckUtils]: 24: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} call __VERIFIER_assert((if #t~mem9 == 1 + (4 * ~i~0 * ~i~0 + 4 * ~i~0) then 1 else 0)); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,710 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#(<= ~N~0 1)} ~cond := #in~cond; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,710 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#(<= ~N~0 1)} assume !(0 == ~cond); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,711 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#(<= ~N~0 1)} assume true; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,712 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1145#(<= ~N~0 1)} {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} #89#return; {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,713 INFO L280 TraceCheckUtils]: 29: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} havoc #t~mem9; {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,714 INFO L280 TraceCheckUtils]: 30: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1189#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:11,715 INFO L280 TraceCheckUtils]: 31: Hoare triple {1189#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1091#false} is VALID [2020-07-17 22:49:11,715 INFO L263 TraceCheckUtils]: 32: Hoare triple {1091#false} call __VERIFIER_assert((if #t~mem9 == 1 + (4 * ~i~0 * ~i~0 + 4 * ~i~0) then 1 else 0)); {1091#false} is VALID [2020-07-17 22:49:11,715 INFO L280 TraceCheckUtils]: 33: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2020-07-17 22:49:11,716 INFO L280 TraceCheckUtils]: 34: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2020-07-17 22:49:11,716 INFO L280 TraceCheckUtils]: 35: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2020-07-17 22:49:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:49:11,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522412304] [2020-07-17 22:49:11,719 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:11,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121631909] [2020-07-17 22:49:11,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:11,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:49:11,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465262265] [2020-07-17 22:49:11,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 22:49:11,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:11,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:11,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:11,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:11,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:11,761 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-07-17 22:49:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,204 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2020-07-17 22:49:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:49:12,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 22:49:12,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-17 22:49:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-17 22:49:12,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2020-07-17 22:49:12,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:12,332 INFO L225 Difference]: With dead ends: 91 [2020-07-17 22:49:12,332 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:49:12,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:49:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:49:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-07-17 22:49:12,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:12,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 45 states. [2020-07-17 22:49:12,374 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 45 states. [2020-07-17 22:49:12,374 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 45 states. [2020-07-17 22:49:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,377 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-17 22:49:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-17 22:49:12,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:12,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:12,379 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 55 states. [2020-07-17 22:49:12,379 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 55 states. [2020-07-17 22:49:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,382 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-17 22:49:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-17 22:49:12,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:12,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:12,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:12,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:49:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-17 22:49:12,385 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2020-07-17 22:49:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:12,386 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-17 22:49:12,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:49:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:49:12,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:12,389 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1] [2020-07-17 22:49:12,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:12,605 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash 60389999, now seen corresponding path program 1 times [2020-07-17 22:49:12,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:12,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377711968] [2020-07-17 22:49:12,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:12,645 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:12,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776878048] [2020-07-17 22:49:12,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:12,748 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:12,749 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:12,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:13,023 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:13,023 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:13,024 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:13,024 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:13,024 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:13,024 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:13,024 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:13,024 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:13,024 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:13,025 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:13,026 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:49:13,027 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-17 22:49:13,028 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:49:13,029 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:49:13,029 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-17 22:49:13,029 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:13,029 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:13,029 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-17 22:49:13,029 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-17 22:49:13,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:13 BoogieIcfgContainer [2020-07-17 22:49:13,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:13,034 INFO L168 Benchmark]: Toolchain (without parser) took 6210.52 ms. Allocated memory was 145.2 MB in the beginning and 277.3 MB in the end (delta: 132.1 MB). Free memory was 104.0 MB in the beginning and 153.6 MB in the end (delta: -49.6 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:13,035 INFO L168 Benchmark]: CDTParser took 1.58 ms. Allocated memory is still 145.2 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:13,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.41 ms. Allocated memory is still 145.2 MB. Free memory was 103.6 MB in the beginning and 92.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:13,036 INFO L168 Benchmark]: Boogie Preprocessor took 144.74 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.6 MB in the beginning and 180.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:13,037 INFO L168 Benchmark]: RCFGBuilder took 490.78 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 154.6 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:13,038 INFO L168 Benchmark]: TraceAbstraction took 5244.94 ms. Allocated memory was 202.9 MB in the beginning and 277.3 MB in the end (delta: 74.4 MB). Free memory was 154.0 MB in the beginning and 153.6 MB in the end (delta: 382.2 kB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:13,042 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 1.58 ms. Allocated memory is still 145.2 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.41 ms. Allocated memory is still 145.2 MB. Free memory was 103.6 MB in the beginning and 92.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.74 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 92.6 MB in the beginning and 180.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 490.78 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 154.6 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5244.94 ms. Allocated memory was 202.9 MB in the beginning and 277.3 MB in the end (delta: 74.4 MB). Free memory was 154.0 MB in the beginning and 153.6 MB in the end (delta: 382.2 kB). Peak memory consumption was 74.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=6, 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 *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] i=0 VAL [\old(N)=0, a={-2:0}, b={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=2] [L29] COND TRUE i