/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/sina2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:55,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:55,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:55,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:55,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:55,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:55,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:55,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:55,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:55,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:55,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:55,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:55,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:55,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:55,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:55,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:55,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:55,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:55,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:55,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:55,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:55,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:55,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:55,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:55,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:55,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:55,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:55,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:55,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:55,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:55,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:55,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:55,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:55,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:55,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:55,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:55,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:55,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:55,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:55,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:55,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:55,091 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:55,106 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:55,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:55,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:55,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:55,108 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:55,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:55,108 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:55,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:55,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:55,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:55,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:55,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:55,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:55,109 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:55,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:55,110 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:55,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:55,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:55,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:55,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:55,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:55,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:55,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:55,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:55,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:55,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:55,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:55,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:55,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:55,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:55,385 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:55,397 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:55,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:55,403 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:55,404 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:55,405 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina2f.c [2020-07-17 22:49:55,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0a64293/abadaac51f074919bf0f2e0519454e02/FLAG9f24a6d03 [2020-07-17 22:49:56,012 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:56,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina2f.c [2020-07-17 22:49:56,020 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0a64293/abadaac51f074919bf0f2e0519454e02/FLAG9f24a6d03 [2020-07-17 22:49:56,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0a64293/abadaac51f074919bf0f2e0519454e02 [2020-07-17 22:49:56,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:56,378 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:56,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:56,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:56,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:56,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:56" (1/1) ... [2020-07-17 22:49:56,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c3269e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:56, skipping insertion in model container [2020-07-17 22:49:56,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:56" (1/1) ... [2020-07-17 22:49:56,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:56,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:56,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:56,669 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:56,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:56,807 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:56,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:56 WrapperNode [2020-07-17 22:49:56,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:56,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:56,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:56,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:56,821 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:56" (1/1) ... [2020-07-17 22:49:56,821 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:56" (1/1) ... [2020-07-17 22:49:56,829 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:56" (1/1) ... [2020-07-17 22:49:56,829 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:56" (1/1) ... [2020-07-17 22:49:56,841 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:56" (1/1) ... [2020-07-17 22:49:56,848 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:56" (1/1) ... [2020-07-17 22:49:56,850 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:56" (1/1) ... [2020-07-17 22:49:56,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:56,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:56,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:56,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:56,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:56,920 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:56,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:56,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:57,332 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:57,332 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:49:57,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:57 BoogieIcfgContainer [2020-07-17 22:49:57,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:57,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:57,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:57,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:57,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:56" (1/3) ... [2020-07-17 22:49:57,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5765aea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:57, skipping insertion in model container [2020-07-17 22:49:57,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:56" (2/3) ... [2020-07-17 22:49:57,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5765aea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:57, skipping insertion in model container [2020-07-17 22:49:57,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:57" (3/3) ... [2020-07-17 22:49:57,346 INFO L109 eAbstractionObserver]: Analyzing ICFG sina2f.c [2020-07-17 22:49:57,359 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:57,374 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:57,409 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:57,434 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:57,435 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:57,435 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:57,435 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:57,436 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:57,436 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:57,436 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:57,436 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-17 22:49:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:57,464 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:57,466 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] [2020-07-17 22:49:57,466 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:57,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1155719453, now seen corresponding path program 1 times [2020-07-17 22:49:57,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:57,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831392368] [2020-07-17 22:49:57,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:57,765 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(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; {40#true} is VALID [2020-07-17 22:49:57,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:49:57,768 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-17 22:49:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:57,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-17 22:49:57,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-17 22:49:57,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:49:57,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-17 22:49:57,800 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(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:57,800 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(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; {40#true} is VALID [2020-07-17 22:49:57,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-17 22:49:57,801 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-17 22:49:57,802 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret11 := main(); {40#true} is VALID [2020-07-17 22:49:57,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {40#true} is VALID [2020-07-17 22:49:57,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~N~0 <= 0); {40#true} is VALID [2020-07-17 22:49:57,803 INFO L263 TraceCheckUtils]: 7: Hoare triple {40#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {40#true} is VALID [2020-07-17 22:49:57,804 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-17 22:49:57,806 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-17 22:49:57,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-17 22:49:57,807 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-17 22:49:57,808 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);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 write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:57,808 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-17 22:49:57,809 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:57,809 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-17 22:49:57,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:57,811 INFO L280 TraceCheckUtils]: 17: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-17 22:49:57,811 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-17 22:49:57,812 INFO L280 TraceCheckUtils]: 19: Hoare triple {41#false} assume !!(~i~0 < ~N~0);call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {41#false} is VALID [2020-07-17 22:49:57,812 INFO L263 TraceCheckUtils]: 20: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem10 == ~N~0 then 1 else 0)); {41#false} is VALID [2020-07-17 22:49:57,813 INFO L280 TraceCheckUtils]: 21: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-17 22:49:57,813 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-17 22:49:57,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-17 22:49:57,819 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:57,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831392368] [2020-07-17 22:49:57,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:57,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141264058] [2020-07-17 22:49:57,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:49:57,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:57,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:57,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:57,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:57,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:57,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:57,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:57,940 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-17 22:49:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:58,265 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-17 22:49:58,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:58,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:49:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-17 22:49:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-17 22:49:58,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2020-07-17 22:49:58,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:58,473 INFO L225 Difference]: With dead ends: 64 [2020-07-17 22:49:58,473 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:49:58,479 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:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:49:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-17 22:49:58,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:58,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-17 22:49:58,564 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:49:58,565 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:49:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:58,573 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-17 22:49:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:49:58,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:58,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:58,577 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-17 22:49:58,577 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-17 22:49:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:58,592 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-17 22:49:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:49:58,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:58,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:58,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:58,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:49:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-17 22:49:58,603 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2020-07-17 22:49:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:58,606 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-17 22:49:58,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:49:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:58,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:58,608 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] [2020-07-17 22:49:58,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:58,610 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash -124144225, now seen corresponding path program 1 times [2020-07-17 22:49:58,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:58,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142993326] [2020-07-17 22:49:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:58,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#(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; {242#true} is VALID [2020-07-17 22:49:58,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-17 22:49:58,792 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {242#true} {242#true} #95#return; {242#true} is VALID [2020-07-17 22:49:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:58,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2020-07-17 22:49:58,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2020-07-17 22:49:58,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-17 22:49:58,803 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {242#true} {247#(<= 1 ~N~0)} #91#return; {247#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:58,804 INFO L263 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {253#(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:58,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#(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; {242#true} is VALID [2020-07-17 22:49:58,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-17 22:49:58,805 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #95#return; {242#true} is VALID [2020-07-17 22:49:58,805 INFO L263 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret11 := main(); {242#true} is VALID [2020-07-17 22:49:58,806 INFO L280 TraceCheckUtils]: 5: Hoare triple {242#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {242#true} is VALID [2020-07-17 22:49:58,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {242#true} assume !(~N~0 <= 0); {247#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:58,807 INFO L263 TraceCheckUtils]: 7: Hoare triple {247#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {242#true} is VALID [2020-07-17 22:49:58,807 INFO L280 TraceCheckUtils]: 8: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2020-07-17 22:49:58,808 INFO L280 TraceCheckUtils]: 9: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2020-07-17 22:49:58,808 INFO L280 TraceCheckUtils]: 10: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-17 22:49:58,809 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {242#true} {247#(<= 1 ~N~0)} #91#return; {247#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:58,810 INFO L280 TraceCheckUtils]: 12: Hoare triple {247#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {252#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:58,811 INFO L280 TraceCheckUtils]: 13: Hoare triple {252#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {243#false} is VALID [2020-07-17 22:49:58,812 INFO L280 TraceCheckUtils]: 14: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID [2020-07-17 22:49:58,812 INFO L280 TraceCheckUtils]: 15: Hoare triple {243#false} assume !(~i~0 < ~N~0); {243#false} is VALID [2020-07-17 22:49:58,812 INFO L280 TraceCheckUtils]: 16: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID [2020-07-17 22:49:58,813 INFO L280 TraceCheckUtils]: 17: Hoare triple {243#false} assume !(~i~0 < ~N~0); {243#false} is VALID [2020-07-17 22:49:58,813 INFO L280 TraceCheckUtils]: 18: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID [2020-07-17 22:49:58,813 INFO L280 TraceCheckUtils]: 19: Hoare triple {243#false} assume !!(~i~0 < ~N~0);call #t~mem10 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {243#false} is VALID [2020-07-17 22:49:58,813 INFO L263 TraceCheckUtils]: 20: Hoare triple {243#false} call __VERIFIER_assert((if #t~mem10 == ~N~0 then 1 else 0)); {243#false} is VALID [2020-07-17 22:49:58,814 INFO L280 TraceCheckUtils]: 21: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2020-07-17 22:49:58,814 INFO L280 TraceCheckUtils]: 22: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2020-07-17 22:49:58,814 INFO L280 TraceCheckUtils]: 23: Hoare triple {243#false} assume !false; {243#false} is VALID [2020-07-17 22:49:58,816 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:58,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142993326] [2020-07-17 22:49:58,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:58,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:58,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414624396] [2020-07-17 22:49:58,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:58,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:58,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:58,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:58,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:58,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:58,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:58,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:58,854 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2020-07-17 22:49:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:59,187 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-17 22:49:59,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:59,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-07-17 22:49:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2020-07-17 22:49:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2020-07-17 22:49:59,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2020-07-17 22:49:59,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:59,315 INFO L225 Difference]: With dead ends: 59 [2020-07-17 22:49:59,315 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:49:59,317 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:49:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:49:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-17 22:49:59,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:59,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states. [2020-07-17 22:49:59,362 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states. [2020-07-17 22:49:59,362 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 35 states. [2020-07-17 22:49:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:59,368 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-17 22:49:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-17 22:49:59,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:59,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:59,369 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states. [2020-07-17 22:49:59,370 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 42 states. [2020-07-17 22:49:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:59,374 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-17 22:49:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-17 22:49:59,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:59,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:59,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:59,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:49:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-17 22:49:59,379 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2020-07-17 22:49:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:59,380 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-17 22:49:59,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-17 22:49:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:49:59,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:59,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:59,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:59,382 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash -191015719, now seen corresponding path program 1 times [2020-07-17 22:49:59,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:59,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084166021] [2020-07-17 22:49:59,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:59,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:59,551 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:59,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:59,593 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:59,593 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:59,594 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:59,595 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:59,595 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:59,595 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:59,595 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:59,595 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:59,595 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:59,596 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:59,596 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:59,596 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:59,596 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:59,596 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:59,597 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:59,597 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:59,597 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:59,597 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:59,597 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:59,597 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:59,598 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:59,598 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:59,598 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:59,598 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:59,598 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-17 22:49:59,598 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:59,599 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:59,599 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-17 22:49:59,599 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:59,599 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:59,599 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:59,599 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-17 22:49:59,599 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-17 22:49:59,600 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-17 22:49:59,600 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:49:59,600 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:49:59,600 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-17 22:49:59,600 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:49:59,600 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:49:59,601 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:59,601 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:59,601 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-17 22:49:59,601 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-17 22:49:59,601 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-17 22:49:59,601 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:59,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:59 BoogieIcfgContainer [2020-07-17 22:49:59,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:59,608 INFO L168 Benchmark]: Toolchain (without parser) took 3231.47 ms. Allocated memory was 136.3 MB in the beginning and 229.6 MB in the end (delta: 93.3 MB). Free memory was 101.0 MB in the beginning and 92.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:59,609 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 136.3 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:49:59,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.37 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 178.7 MB in the end (delta: -78.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:59,610 INFO L168 Benchmark]: Boogie Preprocessor took 44.35 ms. Allocated memory is still 200.8 MB. Free memory was 178.7 MB in the beginning and 176.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:59,611 INFO L168 Benchmark]: RCFGBuilder took 483.82 ms. Allocated memory is still 200.8 MB. Free memory was 176.3 MB in the beginning and 150.0 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:59,612 INFO L168 Benchmark]: TraceAbstraction took 2266.05 ms. Allocated memory was 200.8 MB in the beginning and 229.6 MB in the end (delta: 28.8 MB). Free memory was 150.0 MB in the beginning and 92.1 MB in the end (delta: 57.9 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:59,616 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.53 ms. Allocated memory is still 136.3 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 426.37 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 178.7 MB in the end (delta: -78.1 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.35 ms. Allocated memory is still 200.8 MB. Free memory was 178.7 MB in the beginning and 176.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 483.82 ms. Allocated memory is still 200.8 MB. Free memory was 176.3 MB in the beginning and 150.0 MB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2266.05 ms. Allocated memory was 200.8 MB in the beginning and 229.6 MB in the end (delta: 28.8 MB). Free memory was 150.0 MB in the beginning and 92.1 MB in the end (delta: 57.9 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] long long *a = malloc(sizeof(long long)*N); [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={-2:0}, i=0, malloc(sizeof(long long)*N)={-2:0}, N=1, sum={4:0}] [L30] COND TRUE i