/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/s32iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:41,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:41,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:41,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:41,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:41,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:41,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:41,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:41,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:41,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:41,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:41,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:41,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:41,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:41,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:41,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:41,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:41,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:41,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:41,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:41,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:41,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:41,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:41,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:41,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:41,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:41,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:41,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:41,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:41,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:41,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:41,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:41,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:41,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:41,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:41,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:41,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:41,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:41,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:41,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:41,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:41,583 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:41,597 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:41,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:41,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:41,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:41,599 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:41,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:41,600 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:41,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:41,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:41,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:41,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:41,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:41,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:41,601 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:41,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:41,602 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:41,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:41,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:41,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:41,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:41,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:41,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:41,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:41,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:41,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:41,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:41,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:41,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:41,604 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:41,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:41,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:41,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:41,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:41,912 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:41,913 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:41,914 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s32iff.c [2020-07-17 22:49:42,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ed85be2/e162eb60080548f2a51b994d30ccab86/FLAGa4180ee1f [2020-07-17 22:49:42,487 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:42,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s32iff.c [2020-07-17 22:49:42,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ed85be2/e162eb60080548f2a51b994d30ccab86/FLAGa4180ee1f [2020-07-17 22:49:42,816 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ed85be2/e162eb60080548f2a51b994d30ccab86 [2020-07-17 22:49:42,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:42,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:42,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:42,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:42,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:42,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:42" (1/1) ... [2020-07-17 22:49:42,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab124d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:42, skipping insertion in model container [2020-07-17 22:49:42,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:42" (1/1) ... [2020-07-17 22:49:42,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:42,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:43,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:43,130 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:43,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:43,186 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:43,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:43 WrapperNode [2020-07-17 22:49:43,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:43,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:43,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:43,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:43,295 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:43" (1/1) ... [2020-07-17 22:49:43,295 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:43" (1/1) ... [2020-07-17 22:49:43,329 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:43" (1/1) ... [2020-07-17 22:49:43,329 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:43" (1/1) ... [2020-07-17 22:49:43,360 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:43" (1/1) ... [2020-07-17 22:49:43,374 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:43" (1/1) ... [2020-07-17 22:49:43,376 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:43" (1/1) ... [2020-07-17 22:49:43,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:43,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:43,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:43,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:43,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:43" (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:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:43,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:43,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:43,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:43,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:43,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:44,065 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:44,065 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:44,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:44 BoogieIcfgContainer [2020-07-17 22:49:44,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:44,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:44,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:44,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:44,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:42" (1/3) ... [2020-07-17 22:49:44,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369f0ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:44, skipping insertion in model container [2020-07-17 22:49:44,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:43" (2/3) ... [2020-07-17 22:49:44,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369f0ddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:44, skipping insertion in model container [2020-07-17 22:49:44,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:44" (3/3) ... [2020-07-17 22:49:44,082 INFO L109 eAbstractionObserver]: Analyzing ICFG s32iff.c [2020-07-17 22:49:44,092 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:44,102 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:44,120 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:44,149 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:44,149 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:44,150 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:44,150 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:44,151 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:44,152 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:44,152 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:44,152 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-17 22:49:44,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:49:44,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:44,203 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] [2020-07-17 22:49:44,204 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2033030480, now seen corresponding path program 1 times [2020-07-17 22:49:44,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:44,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744144224] [2020-07-17 22:49:44,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:44,483 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:44,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:44,485 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:44,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:44,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:44,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:44,499 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:44,502 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:44,503 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:44,504 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:44,505 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:44,506 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret14 := main(); {39#true} is VALID [2020-07-17 22:49:44,506 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:44,507 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-17 22:49:44,507 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:44,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:44,509 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:44,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:44,509 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:44,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:44,511 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-17 22:49:44,512 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:44,513 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-17 22:49:44,513 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:44,514 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-17 22:49:44,514 INFO L280 TraceCheckUtils]: 18: Hoare triple {40#false} call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {40#false} is VALID [2020-07-17 22:49:44,514 INFO L263 TraceCheckUtils]: 19: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem13 == 4 * ~N~0 then 1 else 0)); {40#false} is VALID [2020-07-17 22:49:44,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-17 22:49:44,515 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-17 22:49:44,516 INFO L280 TraceCheckUtils]: 22: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-17 22:49:44,519 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:44,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744144224] [2020-07-17 22:49:44,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:44,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:44,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147121146] [2020-07-17 22:49:44,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:49:44,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:44,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:44,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:44,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:44,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:44,613 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-17 22:49:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:44,887 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-17 22:49:44,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:44,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:49:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:44,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-17 22:49:45,052 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:45,067 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:49:45,067 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:49:45,073 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:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:49:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:49:45,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:45,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:45,156 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:45,156 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,160 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-17 22:49:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:49:45,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,162 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:45,162 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:49:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,166 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-17 22:49:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:49:45,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:45,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:49:45,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-17 22:49:45,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2020-07-17 22:49:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:45,173 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-17 22:49:45,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:49:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:49:45,175 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:45,175 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] [2020-07-17 22:49:45,175 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:45,176 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:45,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:45,176 INFO L82 PathProgramCache]: Analyzing trace with hash 706992569, now seen corresponding path program 1 times [2020-07-17 22:49:45,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:45,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136171346] [2020-07-17 22:49:45,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,295 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(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; {227#true} is VALID [2020-07-17 22:49:45,296 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:45,296 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-17 22:49:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-17 22:49:45,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-17 22:49:45,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:45,325 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:45,326 INFO L263 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {238#(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:45,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#(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; {227#true} is VALID [2020-07-17 22:49:45,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:45,327 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-17 22:49:45,327 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret14 := main(); {227#true} is VALID [2020-07-17 22:49:45,328 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {227#true} is VALID [2020-07-17 22:49:45,329 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:45,329 INFO L263 TraceCheckUtils]: 7: Hoare triple {232#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {227#true} is VALID [2020-07-17 22:49:45,329 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-17 22:49:45,330 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-17 22:49:45,330 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-17 22:49:45,331 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:45,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:45,334 INFO L280 TraceCheckUtils]: 13: Hoare triple {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-17 22:49:45,334 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-17 22:49:45,335 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-17 22:49:45,335 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-17 22:49:45,335 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-17 22:49:45,336 INFO L280 TraceCheckUtils]: 18: Hoare triple {228#false} call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {228#false} is VALID [2020-07-17 22:49:45,336 INFO L263 TraceCheckUtils]: 19: Hoare triple {228#false} call __VERIFIER_assert((if #t~mem13 == 4 * ~N~0 then 1 else 0)); {228#false} is VALID [2020-07-17 22:49:45,336 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-17 22:49:45,336 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-17 22:49:45,337 INFO L280 TraceCheckUtils]: 22: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-17 22:49:45,338 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:45,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136171346] [2020-07-17 22:49:45,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14260657] [2020-07-17 22:49:45,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:49:45,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:45,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:45,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:45,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:45,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:45,378 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2020-07-17 22:49:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,726 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2020-07-17 22:49:45,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:45,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:49:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:49:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-17 22:49:45,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-17 22:49:45,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:45,836 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:49:45,836 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:49:45,837 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:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:49:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-07-17 22:49:45,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:45,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2020-07-17 22:49:45,870 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2020-07-17 22:49:45,870 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2020-07-17 22:49:45,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,873 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-17 22:49:45,873 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-17 22:49:45,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,874 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2020-07-17 22:49:45,874 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2020-07-17 22:49:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,877 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-17 22:49:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-17 22:49:45,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:45,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:49:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-17 22:49:45,880 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2020-07-17 22:49:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:45,881 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-17 22:49:45,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-17 22:49:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:49:45,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:45,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:45,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:45,885 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:45,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash 284203188, now seen corresponding path program 1 times [2020-07-17 22:49:45,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:45,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846949763] [2020-07-17 22:49:45,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:46,027 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:46,028 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:46,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:46,114 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:46,114 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:46,116 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:46,117 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:46,117 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:46,117 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:46,117 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:46,118 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:46,118 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:46,118 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:46,118 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:46,119 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:46,119 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:46,119 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:46,119 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:46,119 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:46,119 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:46,119 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:46,120 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:46,120 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:46,120 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:46,120 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:46,123 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:46,124 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:46,125 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-17 22:49:46,125 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:46,125 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:46,125 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:49:46,126 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:49:46,127 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:49:46,127 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-17 22:49:46,127 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:49:46,127 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:49:46,127 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:49:46,127 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:49:46,127 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-17 22:49:46,128 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:46,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:46 BoogieIcfgContainer [2020-07-17 22:49:46,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:46,136 INFO L168 Benchmark]: Toolchain (without parser) took 3304.85 ms. Allocated memory was 142.1 MB in the beginning and 227.0 MB in the end (delta: 84.9 MB). Free memory was 99.1 MB in the beginning and 99.0 MB in the end (delta: 92.7 kB). Peak memory consumption was 85.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:46,138 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:46,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.91 ms. Allocated memory is still 142.1 MB. Free memory was 98.7 MB in the beginning and 87.3 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:46,140 INFO L168 Benchmark]: Boogie Preprocessor took 196.66 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 87.3 MB in the beginning and 177.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:46,142 INFO L168 Benchmark]: RCFGBuilder took 685.19 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 150.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:46,144 INFO L168 Benchmark]: TraceAbstraction took 2059.82 ms. Allocated memory was 200.3 MB in the beginning and 227.0 MB in the end (delta: 26.7 MB). Free memory was 149.9 MB in the beginning and 99.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:46,156 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.54 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.91 ms. Allocated memory is still 142.1 MB. Free memory was 98.7 MB in the beginning and 87.3 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 196.66 ms. Allocated memory was 142.1 MB in the beginning and 200.3 MB in the end (delta: 58.2 MB). Free memory was 87.3 MB in the beginning and 177.5 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 685.19 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 150.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2059.82 ms. Allocated memory was 200.3 MB in the beginning and 227.0 MB in the end (delta: 26.7 MB). Free memory was 149.9 MB in the beginning and 99.0 MB in the end (delta: 50.9 MB). Peak memory consumption was 77.6 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] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i