/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/indp5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:44:43,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:43,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:43,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:43,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:43,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:43,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:43,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:43,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:43,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:43,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:43,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:43,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:43,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:43,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:43,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:43,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:43,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:43,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:43,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:43,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:43,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:43,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:43,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:43,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:43,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:43,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:43,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:43,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:43,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:43,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:43,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:43,407 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:43,408 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:43,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:43,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:43,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:43,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:43,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:43,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:43,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:43,413 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-08 12:44:43,428 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:43,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:43,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:43,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:43,430 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:43,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:43,430 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:43,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:43,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:43,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:43,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:43,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:43,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:43,434 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:43,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:43,435 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:43,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:43,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:43,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:43,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:43,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:43,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:43,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:43,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:43,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:43,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:43,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:43,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:43,438 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:43,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:43,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:43,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:43,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:43,759 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:43,760 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:43,761 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp5f.c [2020-07-08 12:44:43,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f195625/c602bcf3453c4293ba2460d05a2e3183/FLAG05375755d [2020-07-08 12:44:44,281 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:44,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp5f.c [2020-07-08 12:44:44,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f195625/c602bcf3453c4293ba2460d05a2e3183/FLAG05375755d [2020-07-08 12:44:44,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7f195625/c602bcf3453c4293ba2460d05a2e3183 [2020-07-08 12:44:44,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:44,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:44,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:44,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:44,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:44,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:44,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ae4454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44, skipping insertion in model container [2020-07-08 12:44:44,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:44,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:44,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:44,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:44,928 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:44,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:44,972 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:44:44,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44 WrapperNode [2020-07-08 12:44:44,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:44,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:44:44,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:44:44,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:44:45,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:45,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:45,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:45,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:45,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:45,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:45,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (1/1) ... [2020-07-08 12:44:45,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:44:45,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:44:45,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:44:45,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:44:45,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (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-08 12:44:45,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:44:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:44:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:44:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:44:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:44:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:44:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:44:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:44:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:44:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:44:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:44:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:44:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:44:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:44:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:44:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:44:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:44:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:44:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:44:45,684 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:44:45,684 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-08 12:44:45,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:45 BoogieIcfgContainer [2020-07-08 12:44:45,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:44:45,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:44:45,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:44:45,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:44:45,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:44" (1/3) ... [2020-07-08 12:44:45,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62969333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:45, skipping insertion in model container [2020-07-08 12:44:45,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:44" (2/3) ... [2020-07-08 12:44:45,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62969333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:45, skipping insertion in model container [2020-07-08 12:44:45,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:45" (3/3) ... [2020-07-08 12:44:45,697 INFO L109 eAbstractionObserver]: Analyzing ICFG indp5f.c [2020-07-08 12:44:45,709 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:44:45,717 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:44:45,732 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:44:45,757 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:44:45,758 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:44:45,758 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:44:45,758 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:44:45,758 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:44:45,758 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:44:45,759 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:44:45,759 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:44:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-08 12:44:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:44:45,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:45,788 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] [2020-07-08 12:44:45,789 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash -976607933, now seen corresponding path program 1 times [2020-07-08 12:44:45,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:45,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655799413] [2020-07-08 12:44:45,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:46,035 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-08 12:44:46,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 12:44:46,037 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-08 12:44:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:46,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-08 12:44:46,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-08 12:44:46,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 12:44:46,053 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-08 12:44:46,055 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-08 12:44:46,056 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-08 12:44:46,056 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 12:44:46,056 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-08 12:44:46,057 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret13 := main(); {43#true} is VALID [2020-07-08 12:44:46,057 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-08 12:44:46,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-08 12:44:46,058 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-08 12:44:46,059 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-08 12:44:46,060 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-08 12:44:46,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 12:44:46,061 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-08 12:44:46,061 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:46,062 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-08 12:44:46,062 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:46,063 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-08 12:44:46,063 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:46,064 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-08 12:44:46,064 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:46,064 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-08 12:44:46,065 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:46,065 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-08 12:44:46,066 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#false} call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {44#false} is VALID [2020-07-08 12:44:46,066 INFO L263 TraceCheckUtils]: 23: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 then 1 else 0)); {44#false} is VALID [2020-07-08 12:44:46,067 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-08 12:44:46,067 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-08 12:44:46,067 INFO L280 TraceCheckUtils]: 26: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-08 12:44:46,072 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-08 12:44:46,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655799413] [2020-07-08 12:44:46,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:46,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:46,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9835559] [2020-07-08 12:44:46,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:44:46,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:46,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:46,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:46,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:46,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:46,160 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-08 12:44:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:46,407 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-08 12:44:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:46,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-08 12:44:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-08 12:44:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-08 12:44:46,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-08 12:44:46,585 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-08 12:44:46,598 INFO L225 Difference]: With dead ends: 70 [2020-07-08 12:44:46,598 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 12:44:46,603 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-08 12:44:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 12:44:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-08 12:44:46,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:46,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:46,653 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:46,653 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:46,658 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 12:44:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 12:44:46,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:46,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:46,659 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:46,660 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-08 12:44:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:46,664 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 12:44:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 12:44:46,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:46,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:46,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:46,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:44:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-08 12:44:46,670 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2020-07-08 12:44:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:46,670 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-08 12:44:46,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-08 12:44:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:44:46,672 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:46,672 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] [2020-07-08 12:44:46,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:44:46,673 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash -714487667, now seen corresponding path program 1 times [2020-07-08 12:44:46,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:46,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038035585] [2020-07-08 12:44:46,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:46,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#(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; {257#true} is VALID [2020-07-08 12:44:46,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 12:44:46,850 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #109#return; {257#true} is VALID [2020-07-08 12:44:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:46,861 INFO L280 TraceCheckUtils]: 0: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2020-07-08 12:44:46,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2020-07-08 12:44:46,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 12:44:46,864 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {262#(<= 1 ~N~0)} #105#return; {262#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:46,865 INFO L263 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:44:46,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#(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; {257#true} is VALID [2020-07-08 12:44:46,866 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 12:44:46,866 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #109#return; {257#true} is VALID [2020-07-08 12:44:46,866 INFO L263 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret13 := main(); {257#true} is VALID [2020-07-08 12:44:46,867 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {257#true} is VALID [2020-07-08 12:44:46,868 INFO L280 TraceCheckUtils]: 6: Hoare triple {257#true} assume !(~N~0 <= 0); {262#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:46,868 INFO L263 TraceCheckUtils]: 7: Hoare triple {262#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {257#true} is VALID [2020-07-08 12:44:46,869 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2020-07-08 12:44:46,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2020-07-08 12:44:46,869 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 12:44:46,870 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {257#true} {262#(<= 1 ~N~0)} #105#return; {262#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:46,872 INFO L280 TraceCheckUtils]: 12: Hoare triple {262#(<= 1 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {267#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:44:46,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {267#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-08 12:44:46,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-08 12:44:46,874 INFO L280 TraceCheckUtils]: 15: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-08 12:44:46,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-08 12:44:46,875 INFO L280 TraceCheckUtils]: 17: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-08 12:44:46,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-08 12:44:46,875 INFO L280 TraceCheckUtils]: 19: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-08 12:44:46,876 INFO L280 TraceCheckUtils]: 20: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-08 12:44:46,876 INFO L280 TraceCheckUtils]: 21: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-08 12:44:46,876 INFO L280 TraceCheckUtils]: 22: Hoare triple {258#false} call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {258#false} is VALID [2020-07-08 12:44:46,876 INFO L263 TraceCheckUtils]: 23: Hoare triple {258#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 then 1 else 0)); {258#false} is VALID [2020-07-08 12:44:46,877 INFO L280 TraceCheckUtils]: 24: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2020-07-08 12:44:46,877 INFO L280 TraceCheckUtils]: 25: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2020-07-08 12:44:46,877 INFO L280 TraceCheckUtils]: 26: Hoare triple {258#false} assume !false; {258#false} is VALID [2020-07-08 12:44:46,879 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-08 12:44:46,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038035585] [2020-07-08 12:44:46,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:46,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:44:46,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363530206] [2020-07-08 12:44:46,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 12:44:46,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:46,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:44:46,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:46,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:44:46,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:46,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:44:46,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:44:46,915 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2020-07-08 12:44:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:47,215 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2020-07-08 12:44:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:44:47,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-08 12:44:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2020-07-08 12:44:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2020-07-08 12:44:47,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2020-07-08 12:44:47,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:47,319 INFO L225 Difference]: With dead ends: 61 [2020-07-08 12:44:47,319 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 12:44:47,321 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-08 12:44:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 12:44:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-07-08 12:44:47,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:47,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 38 states. [2020-07-08 12:44:47,359 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 38 states. [2020-07-08 12:44:47,359 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 38 states. [2020-07-08 12:44:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:47,363 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-08 12:44:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-08 12:44:47,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:47,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:47,365 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 43 states. [2020-07-08 12:44:47,365 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 43 states. [2020-07-08 12:44:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:47,369 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-08 12:44:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-08 12:44:47,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:47,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:47,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:47,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 12:44:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-07-08 12:44:47,375 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2020-07-08 12:44:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:47,375 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-07-08 12:44:47,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:44:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-08 12:44:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 12:44:47,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:47,377 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, 1, 1, 1] [2020-07-08 12:44:47,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:44:47,378 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:47,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1064141225, now seen corresponding path program 1 times [2020-07-08 12:44:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:47,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504345521] [2020-07-08 12:44:47,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:47,396 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:47,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915860532] [2020-07-08 12:44:47,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:44:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:47,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:44:47,537 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:44:47,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:44:47,801 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:44:47,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:47,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:47,802 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:44:47,802 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:44:47,802 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:44:47,803 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:44:47,803 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:47,803 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:47,803 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:47,803 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:47,803 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:47,804 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:47,804 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:47,804 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:47,804 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:44:47,804 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:44:47,804 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:44:47,805 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:44:47,805 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:47,805 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:47,805 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:47,805 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:47,805 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:44:47,816 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:44:47,817 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:44:47,817 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:44:47,817 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:44:47,819 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:44:47,819 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:44:47,819 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 12:44:47,820 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-08 12:44:47,821 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 12:44:47,822 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-08 12:44:47,822 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-08 12:44:47,822 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-08 12:44:47,822 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-08 12:44:47,822 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-08 12:44:47,822 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-08 12:44:47,822 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-08 12:44:47,822 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-08 12:44:47,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:44:47 BoogieIcfgContainer [2020-07-08 12:44:47,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:44:47,831 INFO L168 Benchmark]: Toolchain (without parser) took 3183.58 ms. Allocated memory was 135.3 MB in the beginning and 255.3 MB in the end (delta: 120.1 MB). Free memory was 99.9 MB in the beginning and 227.9 MB in the end (delta: -128.1 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:47,832 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 135.3 MB. Free memory is still 118.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:44:47,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.95 ms. Allocated memory is still 135.3 MB. Free memory was 99.9 MB in the beginning and 87.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:47,835 INFO L168 Benchmark]: Boogie Preprocessor took 120.25 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 87.9 MB in the beginning and 176.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:47,836 INFO L168 Benchmark]: RCFGBuilder took 594.87 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 147.9 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:47,839 INFO L168 Benchmark]: TraceAbstraction took 2136.20 ms. Allocated memory was 198.7 MB in the beginning and 255.3 MB in the end (delta: 56.6 MB). Free memory was 146.8 MB in the beginning and 227.9 MB in the end (delta: -81.1 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:47,843 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.48 ms. Allocated memory is still 135.3 MB. Free memory is still 118.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.95 ms. Allocated memory is still 135.3 MB. Free memory was 99.9 MB in the beginning and 87.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.25 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 87.9 MB in the beginning and 176.0 MB in the end (delta: -88.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 594.87 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 147.9 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2136.20 ms. Allocated memory was 198.7 MB in the beginning and 255.3 MB in the end (delta: 56.6 MB). Free memory was 146.8 MB in the beginning and 227.9 MB in the end (delta: -81.1 MB). Peak memory consumption was 101.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)=6, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long sum[1]; [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={1:0}, i=0, malloc(sizeof(long long)*N)={1:0}, N=1, sum={3:0}] [L30] COND TRUE i