/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/sina4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:56,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:56,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:56,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:56,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:56,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:56,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:56,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:56,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:56,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:56,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:56,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:56,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:56,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:56,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:56,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:56,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:56,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:56,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:56,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:56,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:56,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:56,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:56,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:56,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:56,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:56,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:56,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:56,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:56,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:56,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:56,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:56,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:56,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:56,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:56,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:56,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:56,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:56,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:56,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:56,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:56,921 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:56,935 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:56,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:56,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:56,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:56,937 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:56,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:56,937 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:56,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:56,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:56,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:56,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:56,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:56,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:56,939 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:56,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:56,939 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:56,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:56,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:56,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:56,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:56,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:56,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:56,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:56,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:56,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:56,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:56,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:56,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:56,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:56,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:57,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:57,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:57,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:57,274 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:57,274 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:57,275 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina4f.c [2020-07-17 22:49:57,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a24307c/f862f8322aa84cea8b8731a86dac82a0/FLAG858fb2b4e [2020-07-17 22:49:57,778 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:57,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina4f.c [2020-07-17 22:49:57,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a24307c/f862f8322aa84cea8b8731a86dac82a0/FLAG858fb2b4e [2020-07-17 22:49:58,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a24307c/f862f8322aa84cea8b8731a86dac82a0 [2020-07-17 22:49:58,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:58,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:58,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:58,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:58,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:58,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:58" (1/1) ... [2020-07-17 22:49:58,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5162972a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:58, skipping insertion in model container [2020-07-17 22:49:58,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:58" (1/1) ... [2020-07-17 22:49:58,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:58,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:58,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:58,391 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:58,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:58,431 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:58,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:58 WrapperNode [2020-07-17 22:49:58,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:58,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:58,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:58,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:58,525 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:58" (1/1) ... [2020-07-17 22:49:58,526 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:58" (1/1) ... [2020-07-17 22:49:58,546 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:58" (1/1) ... [2020-07-17 22:49:58,546 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:58" (1/1) ... [2020-07-17 22:49:58,558 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:58" (1/1) ... [2020-07-17 22:49:58,568 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:58" (1/1) ... [2020-07-17 22:49:58,570 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:58" (1/1) ... [2020-07-17 22:49:58,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:58,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:58,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:58,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:58,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:58" (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:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:58,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:58,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:58,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:58,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:58,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:58,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:58,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:59,049 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:59,050 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-17 22:49:59,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:59 BoogieIcfgContainer [2020-07-17 22:49:59,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:59,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:59,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:59,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:59,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:58" (1/3) ... [2020-07-17 22:49:59,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bedb5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:59, skipping insertion in model container [2020-07-17 22:49:59,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:58" (2/3) ... [2020-07-17 22:49:59,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bedb5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:59, skipping insertion in model container [2020-07-17 22:49:59,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:59" (3/3) ... [2020-07-17 22:49:59,063 INFO L109 eAbstractionObserver]: Analyzing ICFG sina4f.c [2020-07-17 22:49:59,081 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:59,097 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:59,112 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:59,151 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:59,151 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:59,152 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:59,152 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:59,152 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:59,152 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:59,152 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:59,152 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-17 22:49:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:49:59,180 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:59,181 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-17 22:49:59,182 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash -173101897, now seen corresponding path program 1 times [2020-07-17 22:49:59,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:59,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916748648] [2020-07-17 22:49:59,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:59,414 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-17 22:49:59,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:49:59,416 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-17 22:49:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:59,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-17 22:49:59,441 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-17 22:49:59,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:49:59,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-17 22:49:59,448 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-17 22:49:59,449 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-17 22:49:59,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:49:59,450 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-17 22:49:59,451 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret14 := main(); {43#true} is VALID [2020-07-17 22:49:59,453 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-17 22:49:59,453 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-17 22:49:59,454 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-17 22:49:59,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-17 22:49:59,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-17 22:49:59,459 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:49:59,460 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-17 22:49:59,461 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(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:59,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-17 22:49:59,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:59,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-17 22:49:59,464 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:59,465 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-17 22:49:59,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:59,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-17 22:49:59,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:59,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {44#false} is VALID [2020-07-17 22:49:59,468 INFO L263 TraceCheckUtils]: 22: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 then 1 else 0)); {44#false} is VALID [2020-07-17 22:49:59,468 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-17 22:49:59,469 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-17 22:49:59,469 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-17 22:49:59,475 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:59,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916748648] [2020-07-17 22:49:59,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:59,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:59,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021946885] [2020-07-17 22:49:59,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:49:59,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:59,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:59,599 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-17 22:49:59,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:59,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:59,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:59,615 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-17 22:49:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:59,889 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-17 22:49:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:59,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-17 22:49:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-17 22:49:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-17 22:49:59,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-17 22:50:00,085 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-17 22:50:00,111 INFO L225 Difference]: With dead ends: 70 [2020-07-17 22:50:00,111 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:50:00,118 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:50:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:50:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 22:50:00,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:00,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:00,182 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:00,183 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:00,189 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:50:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:50:00,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:00,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:00,192 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:00,192 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:50:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:00,202 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:50:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:50:00,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:00,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:00,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:00,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:50:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-17 22:50:00,216 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2020-07-17 22:50:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:00,217 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-17 22:50:00,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:50:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:50:00,226 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:00,226 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-17 22:50:00,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:00,227 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:00,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1503462707, now seen corresponding path program 1 times [2020-07-17 22:50:00,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:00,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825110263] [2020-07-17 22:50:00,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:00,387 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-17 22:50:00,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-17 22:50:00,388 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {263#true} {263#true} #109#return; {263#true} is VALID [2020-07-17 22:50:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:00,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {263#true} ~cond := #in~cond; {263#true} is VALID [2020-07-17 22:50:00,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#true} assume !(0 == ~cond); {263#true} is VALID [2020-07-17 22:50:00,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-17 22:50:00,399 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {263#true} {268#(<= 1 ~N~0)} #105#return; {268#(<= 1 ~N~0)} is VALID [2020-07-17 22:50:00,400 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-17 22:50:00,401 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-17 22:50:00,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-17 22:50:00,402 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} #109#return; {263#true} is VALID [2020-07-17 22:50:00,402 INFO L263 TraceCheckUtils]: 4: Hoare triple {263#true} call #t~ret14 := main(); {263#true} is VALID [2020-07-17 22:50:00,402 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-17 22:50:00,403 INFO L280 TraceCheckUtils]: 6: Hoare triple {263#true} assume !(~N~0 <= 0); {268#(<= 1 ~N~0)} is VALID [2020-07-17 22:50:00,404 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-17 22:50:00,404 INFO L280 TraceCheckUtils]: 8: Hoare triple {263#true} ~cond := #in~cond; {263#true} is VALID [2020-07-17 22:50:00,404 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#true} assume !(0 == ~cond); {263#true} is VALID [2020-07-17 22:50:00,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-17 22:50:00,406 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {263#true} {268#(<= 1 ~N~0)} #105#return; {268#(<= 1 ~N~0)} is VALID [2020-07-17 22:50:00,407 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(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {273#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:50:00,409 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-17 22:50:00,409 INFO L280 TraceCheckUtils]: 14: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-17 22:50:00,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-17 22:50:00,410 INFO L280 TraceCheckUtils]: 16: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-17 22:50:00,410 INFO L280 TraceCheckUtils]: 17: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-17 22:50:00,410 INFO L280 TraceCheckUtils]: 18: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-17 22:50:00,411 INFO L280 TraceCheckUtils]: 19: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-17 22:50:00,411 INFO L280 TraceCheckUtils]: 20: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-17 22:50:00,411 INFO L280 TraceCheckUtils]: 21: Hoare triple {264#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {264#false} is VALID [2020-07-17 22:50:00,411 INFO L263 TraceCheckUtils]: 22: Hoare triple {264#false} call __VERIFIER_assert((if #t~mem13 == ~N~0 then 1 else 0)); {264#false} is VALID [2020-07-17 22:50:00,412 INFO L280 TraceCheckUtils]: 23: Hoare triple {264#false} ~cond := #in~cond; {264#false} is VALID [2020-07-17 22:50:00,412 INFO L280 TraceCheckUtils]: 24: Hoare triple {264#false} assume 0 == ~cond; {264#false} is VALID [2020-07-17 22:50:00,412 INFO L280 TraceCheckUtils]: 25: Hoare triple {264#false} assume !false; {264#false} is VALID [2020-07-17 22:50:00,414 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:50:00,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825110263] [2020-07-17 22:50:00,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:00,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:50:00,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255698900] [2020-07-17 22:50:00,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-17 22:50:00,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:00,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:00,452 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-17 22:50:00,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:00,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:00,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:00,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:00,454 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2020-07-17 22:50:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:00,843 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-17 22:50:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:50:00,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-17 22:50:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-17 22:50:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-17 22:50:00,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-17 22:50:00,969 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-17 22:50:00,972 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:50:00,972 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 22:50:00,973 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:50:00,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 22:50:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2020-07-17 22:50:01,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:01,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 39 states. [2020-07-17 22:50:01,011 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 39 states. [2020-07-17 22:50:01,012 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 39 states. [2020-07-17 22:50:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:01,017 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-17 22:50:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-17 22:50:01,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:01,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:01,019 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 47 states. [2020-07-17 22:50:01,019 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 47 states. [2020-07-17 22:50:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:01,023 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-17 22:50:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-17 22:50:01,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:01,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:01,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:01,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:01,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:50:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-17 22:50:01,028 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2020-07-17 22:50:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:01,029 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-17 22:50:01,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-17 22:50:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:50:01,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:01,031 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-17 22:50:01,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:01,031 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:01,032 INFO L82 PathProgramCache]: Analyzing trace with hash -260192085, now seen corresponding path program 1 times [2020-07-17 22:50:01,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:01,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275606664] [2020-07-17 22:50:01,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:01,226 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:50:01,226 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:50:01,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:50:01,289 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:50:01,289 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:01,289 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:01,289 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:50:01,289 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:50:01,290 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:50:01,291 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:50:01,291 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:50:01,291 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:01,291 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:01,291 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:50:01,291 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:01,291 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:50:01,292 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-17 22:50:01,293 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:50:01,294 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:50:01,294 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-17 22:50:01,294 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-17 22:50:01,294 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-17 22:50:01,294 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-17 22:50:01,294 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-17 22:50:01,294 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-17 22:50:01,295 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-17 22:50:01,295 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:50:01,295 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:50:01,295 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:50:01,295 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:50:01,295 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-17 22:50:01,295 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-17 22:50:01,296 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-17 22:50:01,296 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:50:01,296 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:50:01,296 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-17 22:50:01,296 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-17 22:50:01,296 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-17 22:50:01,296 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:50:01,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:01 BoogieIcfgContainer [2020-07-17 22:50:01,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:01,303 INFO L168 Benchmark]: Toolchain (without parser) took 3141.96 ms. Allocated memory was 143.7 MB in the beginning and 250.6 MB in the end (delta: 107.0 MB). Free memory was 101.1 MB in the beginning and 219.1 MB in the end (delta: -118.0 MB). Peak memory consumption was 110.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:01,304 INFO L168 Benchmark]: CDTParser took 1.46 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:01,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.44 ms. Allocated memory is still 143.7 MB. Free memory was 100.7 MB in the beginning and 89.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:50:01,305 INFO L168 Benchmark]: Boogie Preprocessor took 140.60 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 89.3 MB in the beginning and 177.0 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:01,306 INFO L168 Benchmark]: RCFGBuilder took 480.63 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 147.1 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:01,307 INFO L168 Benchmark]: TraceAbstraction took 2244.22 ms. Allocated memory was 199.8 MB in the beginning and 250.6 MB in the end (delta: 50.9 MB). Free memory was 146.4 MB in the beginning and 219.1 MB in the end (delta: -72.7 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:01,311 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 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: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.44 ms. Allocated memory is still 143.7 MB. Free memory was 100.7 MB in the beginning and 89.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 140.60 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 89.3 MB in the beginning and 177.0 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 480.63 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 147.1 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2244.22 ms. Allocated memory was 199.8 MB in the beginning and 250.6 MB in the end (delta: 50.9 MB). Free memory was 146.4 MB in the beginning and 219.1 MB in the end (delta: -72.7 MB). Peak memory consumption was 99.9 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] long long *b = malloc(sizeof(long long)*N); [L30] sum[0] = 0 [L31] i=0 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=1, sum={4:0}] [L31] COND TRUE i