/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/ifeqn1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:04,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:04,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:04,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:04,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:04,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:04,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:04,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:04,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:04,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:04,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:04,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:04,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:04,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:04,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:04,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:04,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:04,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:04,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:04,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:04,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:04,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:04,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:04,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:04,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:04,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:04,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:04,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:04,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:04,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:04,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:04,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:04,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:04,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:04,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:04,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:04,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:04,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:04,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:04,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:04,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:04,704 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:04,741 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:04,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:04,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:04,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:04,744 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:04,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:04,746 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:04,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:04,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:04,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:04,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:04,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:04,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:04,748 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:04,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:04,748 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:04,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:04,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:04,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:04,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:04,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:04,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:04,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:04,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:04,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:04,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:04,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:04,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:04,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:04,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:05,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:05,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:05,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:05,046 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:05,047 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:05,047 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ifeqn1f.c [2020-07-17 22:49:05,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397986af8/adff3a849c534f0393aab2b6254270f4/FLAGedb39b6d5 [2020-07-17 22:49:05,521 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:05,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn1f.c [2020-07-17 22:49:05,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397986af8/adff3a849c534f0393aab2b6254270f4/FLAGedb39b6d5 [2020-07-17 22:49:05,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/397986af8/adff3a849c534f0393aab2b6254270f4 [2020-07-17 22:49:05,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:05,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:05,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:05,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:05,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:05,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:05" (1/1) ... [2020-07-17 22:49:05,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c79713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:05, skipping insertion in model container [2020-07-17 22:49:05,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:05" (1/1) ... [2020-07-17 22:49:05,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:05,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:06,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:06,227 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:06,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:06,290 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:06,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06 WrapperNode [2020-07-17 22:49:06,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:06,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:06,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:06,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:06,395 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:06" (1/1) ... [2020-07-17 22:49:06,396 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:06" (1/1) ... [2020-07-17 22:49:06,407 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:06" (1/1) ... [2020-07-17 22:49:06,407 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:06" (1/1) ... [2020-07-17 22:49:06,423 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:06" (1/1) ... [2020-07-17 22:49:06,430 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:06" (1/1) ... [2020-07-17 22:49:06,432 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:06" (1/1) ... [2020-07-17 22:49:06,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:06,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:06,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:06,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:06,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:06,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:06,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:06,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:06,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:06,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:06,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:06,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:06,952 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:06,953 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:06,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:06 BoogieIcfgContainer [2020-07-17 22:49:06,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:06,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:06,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:06,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:06,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:05" (1/3) ... [2020-07-17 22:49:06,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448e87c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:06, skipping insertion in model container [2020-07-17 22:49:06,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (2/3) ... [2020-07-17 22:49:06,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448e87c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:06, skipping insertion in model container [2020-07-17 22:49:06,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:06" (3/3) ... [2020-07-17 22:49:06,969 INFO L109 eAbstractionObserver]: Analyzing ICFG ifeqn1f.c [2020-07-17 22:49:06,979 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:06,987 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:07,000 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:07,024 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:07,025 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:07,025 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:07,025 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:07,025 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:07,025 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:07,026 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:07,026 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-17 22:49:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:07,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:07,052 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,052 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -294712258, now seen corresponding path program 1 times [2020-07-17 22:49:07,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:07,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291866907] [2020-07-17 22:49:07,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,283 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:07,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:07,285 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:07,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:07,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:07,297 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:07,301 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:07,301 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:07,302 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:07,302 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:07,302 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret10 := main(); {39#true} is VALID [2020-07-17 22:49:07,303 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:07,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-17 22:49:07,304 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:07,304 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:07,308 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:07,308 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:07,309 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:07,309 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:07,310 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-17 22:49:07,310 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:07,310 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-17 22:49:07,311 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:07,311 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:07,312 INFO L263 TraceCheckUtils]: 18: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem9 == 1 + (~i~0 * ~i~0 + ~i~0) then 1 else 0)); {40#false} is VALID [2020-07-17 22:49:07,312 INFO L280 TraceCheckUtils]: 19: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-17 22:49:07,312 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-17 22:49:07,313 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-17 22:49:07,316 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:07,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291866907] [2020-07-17 22:49:07,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:07,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:07,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338752680] [2020-07-17 22:49:07,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:07,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:07,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:07,381 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:07,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:07,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:07,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:07,395 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-17 22:49:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,614 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-17 22:49:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:07,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:07,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-17 22:49:07,777 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:07,791 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:49:07,792 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:49:07,799 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:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:49:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-17 22:49:07,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:07,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:07,875 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:07,875 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,884 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:49:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:07,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,888 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:07,888 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:07,897 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:49:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:07,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:07,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:07,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:07,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:49:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-17 22:49:07,909 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-17 22:49:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:07,910 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-17 22:49:07,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:07,916 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:07,916 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,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:07,923 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2054124171, now seen corresponding path program 1 times [2020-07-17 22:49:07,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:07,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020909376] [2020-07-17 22:49:07,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:07,979 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:07,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1983720959] [2020-07-17 22:49:07,979 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,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:49:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:08,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2020-07-17 22:49:08,159 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,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#true} assume true; {233#true} is VALID [2020-07-17 22:49:08,160 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} #91#return; {233#true} is VALID [2020-07-17 22:49:08,160 INFO L263 TraceCheckUtils]: 4: Hoare triple {233#true} call #t~ret10 := main(); {233#true} is VALID [2020-07-17 22:49:08,161 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,163 INFO L280 TraceCheckUtils]: 6: Hoare triple {233#true} assume !(~N~0 <= 0); {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,164 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,165 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,166 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,168 INFO L280 TraceCheckUtils]: 10: Hoare triple {256#(< 0 ~N~0)} assume true; {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,169 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,171 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,172 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,173 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-17 22:49:08,173 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#false} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-17 22:49:08,173 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-17 22:49:08,174 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,174 INFO L263 TraceCheckUtils]: 18: Hoare triple {234#false} call __VERIFIER_assert((if #t~mem9 == 1 + (~i~0 * ~i~0 + ~i~0) then 1 else 0)); {234#false} is VALID [2020-07-17 22:49:08,174 INFO L280 TraceCheckUtils]: 19: Hoare triple {234#false} ~cond := #in~cond; {234#false} is VALID [2020-07-17 22:49:08,175 INFO L280 TraceCheckUtils]: 20: Hoare triple {234#false} assume 0 == ~cond; {234#false} is VALID [2020-07-17 22:49:08,175 INFO L280 TraceCheckUtils]: 21: Hoare triple {234#false} assume !false; {234#false} is VALID [2020-07-17 22:49:08,181 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,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020909376] [2020-07-17 22:49:08,182 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:08,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983720959] [2020-07-17 22:49:08,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:08,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:49:08,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149416786] [2020-07-17 22:49:08,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:49:08,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:08,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:49:08,218 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,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:49:08,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:08,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:49:08,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:08,219 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2020-07-17 22:49:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,429 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-07-17 22:49:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:49:08,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:49:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-17 22:49:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-17 22:49:08,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-17 22:49:08,546 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:08,550 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:49:08,550 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:49:08,553 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:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:49:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-17 22:49:08,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:08,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:08,596 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:08,596 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,603 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-17 22:49:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-17 22:49:08,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,606 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-17 22:49:08,606 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-17 22:49:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,610 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-17 22:49:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-17 22:49:08,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:08,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:49:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-17 22:49:08,614 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2020-07-17 22:49:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:08,615 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-17 22:49:08,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:49:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:49:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:08,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:08,616 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:08,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:49:08,833 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1477618916, now seen corresponding path program 1 times [2020-07-17 22:49:08,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:08,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748791965] [2020-07-17 22:49:08,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:08,864 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:08,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656291243] [2020-07-17 22:49:08,865 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:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:08,950 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:08,950 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:09,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:09,210 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:09,211 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:09,211 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:09,211 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:09,211 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:09,211 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:09,212 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:09,212 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:09,212 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:09,212 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:09,212 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:09,212 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:09,212 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:09,213 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:09,213 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:09,213 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:09,213 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:09,213 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:09,213 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:09,214 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:09,214 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:09,214 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:09,214 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:09,214 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:09,214 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:09,214 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:09,215 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:09,215 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:09,215 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:09,215 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:09,215 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:09,215 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-17 22:49:09,216 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-17 22:49:09,216 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:49:09,216 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:49:09,216 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-17 22:49:09,216 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:09,216 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:09,216 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:09,217 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-17 22:49:09,217 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:09,217 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:09,217 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:09,217 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-17 22:49:09,217 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:49:09,218 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:49:09,218 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-17 22:49:09,218 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:09,218 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:09,218 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-17 22:49:09,218 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:09,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:09 BoogieIcfgContainer [2020-07-17 22:49:09,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:09,224 INFO L168 Benchmark]: Toolchain (without parser) took 3305.18 ms. Allocated memory was 137.9 MB in the beginning and 235.4 MB in the end (delta: 97.5 MB). Free memory was 102.7 MB in the beginning and 99.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 101.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:09,225 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:09,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.79 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 91.3 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:09,227 INFO L168 Benchmark]: Boogie Preprocessor took 143.35 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.3 MB in the beginning and 180.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:09,227 INFO L168 Benchmark]: RCFGBuilder took 525.82 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 154.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:09,228 INFO L168 Benchmark]: TraceAbstraction took 2259.64 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 154.0 MB in the beginning and 99.1 MB in the end (delta: 54.9 MB). Peak memory consumption was 87.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:09,232 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 369.79 ms. Allocated memory is still 137.9 MB. Free memory was 102.3 MB in the beginning and 91.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.35 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 91.3 MB in the beginning and 180.3 MB in the end (delta: -89.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 525.82 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 154.7 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2259.64 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 154.0 MB in the beginning and 99.1 MB in the end (delta: 54.9 MB). Peak memory consumption was 87.4 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)=3, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] i=0 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=1] [L29] COND TRUE i