/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/sina3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:06,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:06,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:06,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:06,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:06,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:06,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:06,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:06,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:06,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:06,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:06,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:06,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:06,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:06,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:06,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:06,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:06,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:06,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:06,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:06,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:06,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:06,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:06,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:06,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:06,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:06,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:06,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:06,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:06,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:06,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:06,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:06,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:06,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:06,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:06,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:06,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:06,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:06,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:06,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:06,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:06,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:06,233 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:06,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:06,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:06,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:06,236 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:06,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:06,237 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:06,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:06,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:06,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:06,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:06,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:06,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:06,238 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:06,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:06,238 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:06,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:06,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:06,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:06,239 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:06,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:06,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:06,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:06,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:06,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:06,241 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:06,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:06,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:06,242 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:06,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:06,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:06,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:06,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:06,586 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:06,586 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:06,587 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina3f.c [2020-07-10 15:27:06,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc187d971/57685987e2e646a1bdde88a89ec06d22/FLAG5aefff06c [2020-07-10 15:27:07,237 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:07,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina3f.c [2020-07-10 15:27:07,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc187d971/57685987e2e646a1bdde88a89ec06d22/FLAG5aefff06c [2020-07-10 15:27:07,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc187d971/57685987e2e646a1bdde88a89ec06d22 [2020-07-10 15:27:07,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:07,607 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:07,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:07,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:07,612 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:07,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:07,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a431c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07, skipping insertion in model container [2020-07-10 15:27:07,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:07,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:07,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:07,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:07,938 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:07,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:07,996 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:07,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07 WrapperNode [2020-07-10 15:27:07,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:07,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:07,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:07,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:08,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:08,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:08,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:08,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:08,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:08,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:08,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... [2020-07-10 15:27:08,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:08,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:08,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:08,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:08,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:08,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:08,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:08,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:08,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:08,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:08,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:27:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:08,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:27:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:08,874 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:08,874 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 15:27:08,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:08 BoogieIcfgContainer [2020-07-10 15:27:08,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:08,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:08,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:08,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:08,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:07" (1/3) ... [2020-07-10 15:27:08,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fb0195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:08, skipping insertion in model container [2020-07-10 15:27:08,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:07" (2/3) ... [2020-07-10 15:27:08,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fb0195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:08, skipping insertion in model container [2020-07-10 15:27:08,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:08" (3/3) ... [2020-07-10 15:27:08,890 INFO L109 eAbstractionObserver]: Analyzing ICFG sina3f.c [2020-07-10 15:27:08,902 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:08,911 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:08,929 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:08,955 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:08,956 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:08,956 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:08,957 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:08,957 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:08,957 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:08,958 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:08,958 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 15:27:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:27:08,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:08,993 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] [2020-07-10 15:27:08,994 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -173101897, now seen corresponding path program 1 times [2020-07-10 15:27:09,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:09,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048758084] [2020-07-10 15:27:09,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:09,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(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; {43#true} is VALID [2020-07-10 15:27:09,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 15:27:09,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-10 15:27:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:09,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-10 15:27:09,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-10 15:27:09,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 15:27:09,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-10 15:27:09,281 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {52#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:09,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#(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; {43#true} is VALID [2020-07-10 15:27:09,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 15:27:09,282 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-10 15:27:09,283 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret13 := main(); {43#true} is VALID [2020-07-10 15:27:09,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {43#true} is VALID [2020-07-10 15:27:09,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-10 15:27:09,284 INFO L263 TraceCheckUtils]: 7: Hoare triple {43#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {43#true} is VALID [2020-07-10 15:27:09,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-10 15:27:09,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-10 15:27:09,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 15:27:09,287 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-10 15:27:09,288 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#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 #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {44#false} is VALID [2020-07-10 15:27:09,289 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:27:09,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:27:09,290 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:27:09,290 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:27:09,291 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:27:09,291 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:27:09,291 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-10 15:27:09,292 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:27:09,292 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume !!(~i~0 < ~N~0);call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {44#false} is VALID [2020-07-10 15:27:09,293 INFO L263 TraceCheckUtils]: 22: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem12 == 1 + ~N~0 then 1 else 0)); {44#false} is VALID [2020-07-10 15:27:09,293 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-10 15:27:09,293 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-10 15:27:09,294 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 15:27:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:09,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048758084] [2020-07-10 15:27:09,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:09,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:09,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921952174] [2020-07-10 15:27:09,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:27:09,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:09,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:09,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:09,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:09,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:09,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:09,392 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-10 15:27:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:09,774 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-10 15:27:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:09,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-10 15:27:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:27:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:27:09,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-10 15:27:09,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:09,990 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:27:09,991 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:09,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:10,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:10,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-10 15:27:10,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:10,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:10,059 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:10,059 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:10,064 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:10,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:10,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:10,066 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:10,066 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 15:27:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:10,071 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:10,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:10,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:10,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:10,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:10,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:27:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 15:27:10,078 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2020-07-10 15:27:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:10,078 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 15:27:10,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:10,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:27:10,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:10,080 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] [2020-07-10 15:27:10,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:10,081 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1503462707, now seen corresponding path program 1 times [2020-07-10 15:27:10,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:10,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768541457] [2020-07-10 15:27:10,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {274#(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; {263#true} is VALID [2020-07-10 15:27:10,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-10 15:27:10,293 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {263#true} {263#true} #109#return; {263#true} is VALID [2020-07-10 15:27:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,304 INFO L280 TraceCheckUtils]: 0: Hoare triple {263#true} ~cond := #in~cond; {263#true} is VALID [2020-07-10 15:27:10,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#true} assume !(0 == ~cond); {263#true} is VALID [2020-07-10 15:27:10,305 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-10 15:27:10,306 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {263#true} {268#(<= 1 ~N~0)} #105#return; {268#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:10,307 INFO L263 TraceCheckUtils]: 0: Hoare triple {263#true} call ULTIMATE.init(); {274#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:10,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {274#(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; {263#true} is VALID [2020-07-10 15:27:10,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-10 15:27:10,309 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} #109#return; {263#true} is VALID [2020-07-10 15:27:10,309 INFO L263 TraceCheckUtils]: 4: Hoare triple {263#true} call #t~ret13 := main(); {263#true} is VALID [2020-07-10 15:27:10,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {263#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {263#true} is VALID [2020-07-10 15:27:10,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {263#true} assume !(~N~0 <= 0); {268#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:10,311 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {263#true} is VALID [2020-07-10 15:27:10,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {263#true} ~cond := #in~cond; {263#true} is VALID [2020-07-10 15:27:10,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#true} assume !(0 == ~cond); {263#true} is VALID [2020-07-10 15:27:10,312 INFO L280 TraceCheckUtils]: 10: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-10 15:27:10,313 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {263#true} {268#(<= 1 ~N~0)} #105#return; {268#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:10,315 INFO L280 TraceCheckUtils]: 12: Hoare triple {268#(<= 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 #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {273#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:27:10,317 INFO L280 TraceCheckUtils]: 13: Hoare triple {273#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:27:10,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:27:10,318 INFO L280 TraceCheckUtils]: 15: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:27:10,318 INFO L280 TraceCheckUtils]: 16: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:27:10,318 INFO L280 TraceCheckUtils]: 17: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:27:10,319 INFO L280 TraceCheckUtils]: 18: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:27:10,319 INFO L280 TraceCheckUtils]: 19: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-10 15:27:10,319 INFO L280 TraceCheckUtils]: 20: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-10 15:27:10,319 INFO L280 TraceCheckUtils]: 21: Hoare triple {264#false} assume !!(~i~0 < ~N~0);call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {264#false} is VALID [2020-07-10 15:27:10,320 INFO L263 TraceCheckUtils]: 22: Hoare triple {264#false} call __VERIFIER_assert((if #t~mem12 == 1 + ~N~0 then 1 else 0)); {264#false} is VALID [2020-07-10 15:27:10,320 INFO L280 TraceCheckUtils]: 23: Hoare triple {264#false} ~cond := #in~cond; {264#false} is VALID [2020-07-10 15:27:10,320 INFO L280 TraceCheckUtils]: 24: Hoare triple {264#false} assume 0 == ~cond; {264#false} is VALID [2020-07-10 15:27:10,321 INFO L280 TraceCheckUtils]: 25: Hoare triple {264#false} assume !false; {264#false} is VALID [2020-07-10 15:27:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:10,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768541457] [2020-07-10 15:27:10,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:10,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:27:10,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430629069] [2020-07-10 15:27:10,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-10 15:27:10,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:10,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:10,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:10,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:10,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:10,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:10,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:10,365 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2020-07-10 15:27:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:10,851 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-10 15:27:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:10,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-10 15:27:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 15:27:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 15:27:10,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-10 15:27:11,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:11,022 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:27:11,023 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 15:27:11,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:27:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 15:27:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2020-07-10 15:27:11,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:11,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 39 states. [2020-07-10 15:27:11,074 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 39 states. [2020-07-10 15:27:11,074 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 39 states. [2020-07-10 15:27:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,081 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-10 15:27:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-10 15:27:11,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:11,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:11,083 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 47 states. [2020-07-10 15:27:11,083 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 47 states. [2020-07-10 15:27:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:11,088 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-10 15:27:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-10 15:27:11,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:11,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:11,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:11,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 15:27:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-10 15:27:11,094 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2020-07-10 15:27:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:11,095 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-10 15:27:11,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-10 15:27:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:27:11,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:11,097 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, 1, 1, 1] [2020-07-10 15:27:11,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:11,098 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash -260192085, now seen corresponding path program 1 times [2020-07-10 15:27:11,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:11,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730429580] [2020-07-10 15:27:11,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:11,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:11,304 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:11,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:27:11,395 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:11,395 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:11,395 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:11,395 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:11,395 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:11,395 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:11,396 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:11,396 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:11,396 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:11,396 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:11,396 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:11,396 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:11,396 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:11,397 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:11,397 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:11,397 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:11,397 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:11,397 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:11,397 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:11,398 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:11,398 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:11,398 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:11,398 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:11,398 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:11,398 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-10 15:27:11,399 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:27:11,400 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-10 15:27:11,400 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-10 15:27:11,400 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:27:11,400 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:27:11,400 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:27:11,400 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-10 15:27:11,400 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-10 15:27:11,401 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-10 15:27:11,401 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:27:11,401 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 15:27:11,401 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-10 15:27:11,401 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:27:11,401 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:27:11,401 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:27:11,402 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:27:11,402 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:27:11,402 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-10 15:27:11,402 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:27:11,402 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:27:11,402 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:27:11,402 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:27:11,403 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-10 15:27:11,403 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:27:11,403 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:11,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:11 BoogieIcfgContainer [2020-07-10 15:27:11,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:11,411 INFO L168 Benchmark]: Toolchain (without parser) took 3803.91 ms. Allocated memory was 143.7 MB in the beginning and 250.6 MB in the end (delta: 107.0 MB). Free memory was 102.0 MB in the beginning and 221.2 MB in the end (delta: -119.2 MB). Peak memory consumption was 111.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,413 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.07 ms. Allocated memory is still 143.7 MB. Free memory was 101.6 MB in the beginning and 90.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,414 INFO L168 Benchmark]: Boogie Preprocessor took 172.81 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.4 MB in the beginning and 178.7 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,415 INFO L168 Benchmark]: RCFGBuilder took 708.43 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 148.3 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,417 INFO L168 Benchmark]: TraceAbstraction took 2525.81 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 147.6 MB in the beginning and 221.2 MB in the end (delta: -73.6 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,421 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.07 ms. Allocated memory is still 143.7 MB. Free memory was 101.6 MB in the beginning and 90.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 172.81 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 90.4 MB in the beginning and 178.7 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 708.43 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 148.3 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2525.81 ms. Allocated memory was 201.3 MB in the beginning and 250.6 MB in the end (delta: 49.3 MB). Free memory was 147.6 MB in the beginning and 221.2 MB in the end (delta: -73.6 MB). Peak memory consumption was 99.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=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); [L28] int *b = malloc(sizeof(int)*N); [L30] sum[0] = 1 [L31] i=0 VAL [\old(N)=0, a={-2:0}, b={5:0}, i=0, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(long long)*N)={-2:0}, N=1, sum={7:0}] [L31] COND TRUE i