java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loops/insertion_sort-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:44:08,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:44:08,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:44:08,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:44:08,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:44:08,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:44:08,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:44:08,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:44:08,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:44:08,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:44:08,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:44:08,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:44:08,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:44:08,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:44:08,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:44:08,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:44:08,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:44:08,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:44:08,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:44:08,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:44:08,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:44:08,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:44:08,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:44:08,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:44:08,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:44:08,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:44:08,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:44:08,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:44:08,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:44:08,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:44:08,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:44:08,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:44:08,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:44:08,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:44:08,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:44:08,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:44:08,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:44:08,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:44:08,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:44:08,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:44:08,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:44:08,383 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 [2019-10-07 13:44:08,397 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:44:08,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:44:08,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:44:08,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:44:08,399 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:44:08,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:44:08,399 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:44:08,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:44:08,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:44:08,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:44:08,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:44:08,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:44:08,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:44:08,401 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:44:08,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:44:08,401 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:44:08,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:44:08,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:44:08,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:44:08,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:44:08,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:44:08,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:44:08,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:44:08,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:44:08,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:44:08,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:44:08,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:44:08,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:44:08,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:44:08,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:44:08,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:44:08,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:44:08,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:44:08,699 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:44:08,700 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort-2.c [2019-10-07 13:44:08,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6b444b6/746111835a7a43e0b72870aa67f0908d/FLAG906e9609c [2019-10-07 13:44:09,245 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:44:09,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort-2.c [2019-10-07 13:44:09,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6b444b6/746111835a7a43e0b72870aa67f0908d/FLAG906e9609c [2019-10-07 13:44:09,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6b444b6/746111835a7a43e0b72870aa67f0908d [2019-10-07 13:44:09,629 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:44:09,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:44:09,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:44:09,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:44:09,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:44:09,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b20f996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09, skipping insertion in model container [2019-10-07 13:44:09,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:09,647 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:44:09,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:44:09,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:44:09,878 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:44:09,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:44:09,998 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:44:09,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09 WrapperNode [2019-10-07 13:44:09,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:44:09,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:44:09,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:44:09,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:44:10,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:10,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:10,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:10,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:10,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:10,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:10,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (1/1) ... [2019-10-07 13:44:10,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:44:10,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:44:10,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:44:10,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:44:10,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (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 [2019-10-07 13:44:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:44:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:44:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:44:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:44:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:44:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:44:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-07 13:44:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:44:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:44:10,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:44:10,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:44:10,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:44:10,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:44:10,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:44:10,478 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:44:10,478 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 13:44:10,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:44:10 BoogieIcfgContainer [2019-10-07 13:44:10,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:44:10,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:44:10,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:44:10,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:44:10,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:44:09" (1/3) ... [2019-10-07 13:44:10,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a137f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:44:10, skipping insertion in model container [2019-10-07 13:44:10,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:44:09" (2/3) ... [2019-10-07 13:44:10,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a137f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:44:10, skipping insertion in model container [2019-10-07 13:44:10,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:44:10" (3/3) ... [2019-10-07 13:44:10,486 INFO L109 eAbstractionObserver]: Analyzing ICFG insertion_sort-2.c [2019-10-07 13:44:10,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:44:10,503 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:44:10,513 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:44:10,537 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:44:10,538 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:44:10,538 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:44:10,538 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:44:10,538 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:44:10,538 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:44:10,538 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:44:10,538 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:44:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-07 13:44:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:44:10,557 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:10,558 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:10,560 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:10,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 369057583, now seen corresponding path program 1 times [2019-10-07 13:44:10,573 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:10,573 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,574 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:10,854 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:10,855 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:44:10,855 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:44:10,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:44:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:44:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:44:10,874 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 4 states. [2019-10-07 13:44:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:10,975 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-10-07 13:44:10,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:44:10,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:44:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:10,989 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:44:10,989 INFO L226 Difference]: Without dead ends: 22 [2019-10-07 13:44:10,996 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:44:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-07 13:44:11,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-10-07 13:44:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 13:44:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-07 13:44:11,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2019-10-07 13:44:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:11,052 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-07 13:44:11,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:44:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-07 13:44:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:44:11,054 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:11,054 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:11,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2062416228, now seen corresponding path program 1 times [2019-10-07 13:44:11,057 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:11,057 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:11,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:11,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:11,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:11,621 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:11,624 INFO L95 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 [2019-10-07 13:44:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:11,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-07 13:44:11,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:11,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:11,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 13:44:11,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-10-07 13:44:11,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:44:11,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:44:11,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 13:44:11,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2019-10-07 13:44:11,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:44:11,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-10-07 13:44:11,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 13:44:11,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:44:11,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:44:11,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-07 13:44:11,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:11,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:12,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-10-07 13:44:12,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:44:12,120 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:44:12,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:44:12,128 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 13:44:12,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-10-07 13:44:12,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 13:44:12,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 13:44:12,135 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:44:12,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2019-10-07 13:44:12,168 INFO L341 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2019-10-07 13:44:12,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 107 [2019-10-07 13:44:12,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:44:12,237 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 5 xjuncts. [2019-10-07 13:44:12,289 INFO L567 ElimStorePlain]: treesize reduction 336, result has 3.4 percent of original size [2019-10-07 13:44:12,290 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:44:12,298 INFO L567 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2019-10-07 13:44:12,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 13:44:12,298 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:7 [2019-10-07 13:44:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:12,349 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:44:12,382 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 13:44:12,382 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:44:12,391 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:44:12,407 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:44:12,407 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:44:12,576 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:44:13,011 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-07 13:44:13,022 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:44:13,027 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:44:13,028 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:44:13,028 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 118#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:13,028 INFO L193 IcfgInterpreter]: Reachable states at location L17-6 satisfy 110#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:13,029 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 159#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:13,029 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 182#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:44:13,029 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 178#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:13,030 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 151#(and (= |#NULL.base| 0) (= main_~k~0 1) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) |main_#t~mem7|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))) (<= |main_~#v~0.offset| 0) (<= main_~k~0 1) (= |#NULL.offset| 0) (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= 1 main_~k~0)) [2019-10-07 13:44:13,030 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 105#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:13,030 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 168#(and (exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:13,030 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:13,031 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:13,031 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 187#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:13,031 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:44:13,031 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 173#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:13,032 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 163#(exists ((|v_main_~#v~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_1) 0) (select (select |#memory_int| v_prenex_1) 4)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 0) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_1|) 4))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:44:13,032 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 126#(and (= |#NULL.base| 0) (= main_~k~0 1) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |main_~#v~0.offset|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#v~0.offset| 0) (<= main_~k~0 1) (= |#NULL.offset| 0) (<= 1 main_~k~0)) [2019-10-07 13:44:13,601 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:44:13,601 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 31 [2019-10-07 13:44:13,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-07 13:44:13,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-07 13:44:13,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2019-10-07 13:44:13,606 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 32 states. [2019-10-07 13:44:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:15,962 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2019-10-07 13:44:15,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-07 13:44:15,963 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 15 [2019-10-07 13:44:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:15,974 INFO L225 Difference]: With dead ends: 74 [2019-10-07 13:44:15,975 INFO L226 Difference]: Without dead ends: 72 [2019-10-07 13:44:15,977 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=468, Invalid=2838, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 13:44:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-07 13:44:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 25. [2019-10-07 13:44:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 13:44:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-07 13:44:16,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 15 [2019-10-07 13:44:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:16,006 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-07 13:44:16,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-07 13:44:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-07 13:44:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:44:16,007 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:44:16,007 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:44:16,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:16,211 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:44:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:44:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash -242389062, now seen corresponding path program 1 times [2019-10-07 13:44:16,212 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:44:16,212 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:16,212 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:16,213 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:44:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:44:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:16,390 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:44:16,390 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:44:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:44:16,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-07 13:44:16,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:44:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:16,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:44:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:44:16,595 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:44:16,597 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 13:44:16,597 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:44:16,598 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:44:16,598 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:44:16,598 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:44:16,635 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:44:17,586 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 35 for LOIs [2019-10-07 13:44:17,598 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:44:17,602 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:44:17,603 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:44:17,603 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 118#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:17,603 INFO L193 IcfgInterpreter]: Reachable states at location L17-6 satisfy 110#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:17,604 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 453#(and (exists ((|v_main_~#v~0.base_BEFORE_CALL_8| Int) (v_main_~k~0_BEFORE_CALL_10 Int) (v_main_~SIZE~0_BEFORE_CALL_10 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10)))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)) (and (= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:17,604 INFO L193 IcfgInterpreter]: Reachable states at location L17-5 satisfy 429#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:17,604 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 462#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:44:17,604 INFO L193 IcfgInterpreter]: Reachable states at location L24-1 satisfy 300#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) |main_#t~mem7|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))) (<= |main_~#v~0.offset| 0) (<= |main_#t~mem7| |main_#t~mem8|) (= |#NULL.offset| 0) (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= 1 main_~k~0)) [2019-10-07 13:44:17,605 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 458#(and (exists ((|v_main_~#v~0.base_BEFORE_CALL_8| Int) (v_main_~k~0_BEFORE_CALL_10 Int) (v_main_~SIZE~0_BEFORE_CALL_10 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10)))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)) (and (= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:17,605 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 448#(and (exists ((|v_main_~#v~0.base_BEFORE_CALL_8| Int) (v_main_~k~0_BEFORE_CALL_10 Int) (v_main_~SIZE~0_BEFORE_CALL_10 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10)))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)) (and (= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:17,606 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 363#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0) (- 4))) |main_#t~mem7|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#v~0.base|) (+ |main_~#v~0.offset| (* 4 main_~k~0)))) (<= |main_~#v~0.offset| 0) (= |#NULL.offset| 0) (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= 1 main_~k~0)) [2019-10-07 13:44:17,606 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 105#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:17,606 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 438#(and (exists ((|v_main_~#v~0.base_BEFORE_CALL_8| Int) (v_main_~k~0_BEFORE_CALL_10 Int) (v_main_~SIZE~0_BEFORE_CALL_10 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10)))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)) (and (= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:17,606 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:17,607 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:17,607 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 467#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:44:17,607 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:44:17,608 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 443#(and (exists ((|v_main_~#v~0.base_BEFORE_CALL_8| Int) (v_main_~k~0_BEFORE_CALL_10 Int) (v_main_~SIZE~0_BEFORE_CALL_10 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10)))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)) (and (= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:44:17,608 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 433#(exists ((|v_main_~#v~0.base_BEFORE_CALL_8| Int) (v_main_~k~0_BEFORE_CALL_10 Int) (v_main_~SIZE~0_BEFORE_CALL_10 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (not (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10)))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)) (and (= |#NULL.base| 0) (<= (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (+ (* 4 v_main_~k~0_BEFORE_CALL_10) (- 4))) (select (select |#memory_int| |v_main_~#v~0.base_BEFORE_CALL_8|) (* 4 v_main_~k~0_BEFORE_CALL_10))) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< (mod v_main_~k~0_BEFORE_CALL_10 4294967296) (mod v_main_~SIZE~0_BEFORE_CALL_10 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~k~0_BEFORE_CALL_10)))) [2019-10-07 13:44:17,608 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 421#(and (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_~#v~0.offset| 0) (<= 0 |main_~#v~0.offset|) (<= |main_~#v~0.offset| 0) (<= 1 main_~j~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~k~0)) [2019-10-07 13:44:18,258 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:44:18,258 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 13] total 24 [2019-10-07 13:44:18,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 13:44:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 13:44:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-10-07 13:44:18,260 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 24 states. [2019-10-07 13:44:19,723 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-10-07 13:44:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:44:20,316 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2019-10-07 13:44:20,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-07 13:44:20,317 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2019-10-07 13:44:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:44:20,318 INFO L225 Difference]: With dead ends: 63 [2019-10-07 13:44:20,318 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:44:20,321 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=377, Invalid=1975, Unknown=0, NotChecked=0, Total=2352 [2019-10-07 13:44:20,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:44:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:44:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:44:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:44:20,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-07 13:44:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:44:20,323 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:44:20,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 13:44:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:44:20,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:44:20,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:44:20,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:44:20,841 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-10-07 13:44:20,994 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2019-10-07 13:44:20,997 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:44:20,997 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:44:20,997 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:44:20,998 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |#NULL.offset|)) [2019-10-07 13:44:20,998 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:44:20,998 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:44:20,998 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 26) no Hoare annotation was computed. [2019-10-07 13:44:20,999 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 24) the Hoare annotation is: (let ((.cse1 (<= 1 main_~j~0)) (.cse2 (= |main_~#v~0.offset| 0)) (.cse3 (= 0 (select |#valid| 0))) (.cse4 (<= 1 main_~k~0))) (or (and (<= main_~j~0 1) (= 1 main_~k~0) (<= (+ main_~SIZE~0 (* 4294967296 (div main_~k~0 4294967296))) (+ (* 4294967296 (div main_~SIZE~0 4294967296)) 1)) (< 0 (+ (div main_~j~0 4294967296) 1))) (not (<= |#NULL.offset| 0)) (and (let ((.cse0 (select |#memory_int| |main_~#v~0.base|))) (<= (select .cse0 0) (select .cse0 (+ |main_~#v~0.offset| 4)))) .cse1 .cse2 .cse3 .cse4) (not (<= 0 |#NULL.base|)) (and .cse1 .cse2 .cse3 (<= main_~k~0 1) .cse4) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)))) [2019-10-07 13:44:20,999 INFO L443 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2019-10-07 13:44:21,000 INFO L439 ceAbstractionStarter]: At program point L17-5(lines 17 20) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= 0 (select |#valid| 0))) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:44:21,002 INFO L443 ceAbstractionStarter]: For program point L17-6(lines 17 20) no Hoare annotation was computed. [2019-10-07 13:44:21,002 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 10 26) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:44:21,002 INFO L439 ceAbstractionStarter]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (* 4 main_~k~0))) (and (= |main_#t~mem8| (select .cse0 (+ |main_~#v~0.offset| .cse1))) (<= (select .cse0 0) (select .cse0 (+ |main_~#v~0.offset| 4))) (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= 0 (select |#valid| 0)) (= (select .cse0 (+ |main_~#v~0.offset| .cse1 (- 4))) |main_#t~mem7|) (< (mod main_~k~0 4294967296) (mod main_~SIZE~0 4294967296)) (<= 1 main_~k~0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:44:21,002 INFO L443 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2019-10-07 13:44:21,003 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 22) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (and (<= 1 main_~j~0) (= |main_~#v~0.offset| 0) (= 0 (select |#valid| 0))) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:44:21,003 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:44:21,003 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:44:21,003 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:44:21,003 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:44:21,003 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:44:21,003 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:44:21,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,015 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,015 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,015 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,022 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,027 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,028 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,029 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,032 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,033 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:44:21 BoogieIcfgContainer [2019-10-07 13:44:21,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:44:21,048 INFO L168 Benchmark]: Toolchain (without parser) took 11417.33 ms. Allocated memory was 138.9 MB in the beginning and 330.3 MB in the end (delta: 191.4 MB). Free memory was 103.6 MB in the beginning and 262.5 MB in the end (delta: -158.9 MB). Peak memory consumption was 200.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:21,049 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-07 13:44:21,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.91 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 182.2 MB in the end (delta: -79.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:21,051 INFO L168 Benchmark]: Boogie Preprocessor took 34.75 ms. Allocated memory is still 202.9 MB. Free memory was 182.2 MB in the beginning and 180.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:21,052 INFO L168 Benchmark]: RCFGBuilder took 445.63 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 160.4 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:21,053 INFO L168 Benchmark]: TraceAbstraction took 10565.69 ms. Allocated memory was 202.9 MB in the beginning and 330.3 MB in the end (delta: 127.4 MB). Free memory was 160.4 MB in the beginning and 262.5 MB in the end (delta: -102.1 MB). Peak memory consumption was 193.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:44:21,057 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 366.91 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 182.2 MB in the end (delta: -79.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.75 ms. Allocated memory is still 202.9 MB. Free memory was 182.2 MB in the beginning and 180.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 445.63 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 160.4 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10565.69 ms. Allocated memory was 202.9 MB in the beginning and 330.3 MB in the end (delta: 127.4 MB). Free memory was 160.4 MB in the beginning and 262.5 MB in the end (delta: -102.1 MB). Peak memory consumption was 193.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2019-10-07 13:44:21,066 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,066 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL <= 0) || ((1 <= j && v == 0) && 0 == \valid[0])) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0) - InvariantResult [Line: 17]: Loop Invariant [2019-10-07 13:44:21,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,070 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,070 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,070 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,070 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL <= 0) || ((1 <= j && v == 0) && 0 == \valid[0])) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-10-07 13:44:21,071 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,071 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:44:21,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:44:21,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((((j <= 1 && 1 == k) && SIZE + 4294967296 * (k / 4294967296) <= 4294967296 * (SIZE / 4294967296) + 1) && 0 < j / 4294967296 + 1) || !(#NULL <= 0)) || ((((unknown-#memory_int-unknown[v][0] <= unknown-#memory_int-unknown[v][v + 4] && 1 <= j) && v == 0) && 0 == \valid[0]) && 1 <= k)) || !(0 <= #NULL)) || ((((1 <= j && v == 0) && 0 == \valid[0]) && k <= 1) && 1 <= k)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Result: SAFE, OverallTime: 10.4s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 35 SDtfs, 319 SDslu, 129 SDs, 0 SdLazy, 648 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 16 PreInvPairs, 42 NumberOfFragments, 312 HoareAnnotationTreeSize, 16 FomulaSimplifications, 7503 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1057 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 115 ConstructedInterpolants, 5 QuantifiedInterpolants, 16690 SizeOfPredicates, 18 NumberOfNonLiveVariables, 148 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 9/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1661, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 129, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 76, TOOLS_POST_TIME[ms]: 139, TOOLS_POST_CALL_APPLICATIONS: 36, TOOLS_POST_CALL_TIME[ms]: 147, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME[ms]: 30, TOOLS_QUANTIFIERELIM_APPLICATIONS: 142, TOOLS_QUANTIFIERELIM_TIME[ms]: 262, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 13, FLUID_QUERY_TIME[ms]: 7, FLUID_QUERIES: 145, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 90, DOMAIN_JOIN_TIME[ms]: 999, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 10, DOMAIN_WIDEN_TIME[ms]: 132, DOMAIN_ISSUBSETEQ_APPLICATIONS: 16, DOMAIN_ISSUBSETEQ_TIME[ms]: 29, DOMAIN_ISBOTTOM_APPLICATIONS: 24, DOMAIN_ISBOTTOM_TIME[ms]: 41, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 742, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 742, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 16, CALL_SUMMARIZER_APPLICATIONS: 30, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME[ms]: 52, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 51, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 7, PATH_EXPR_TIME[ms]: 6, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 31, DAG_COMPRESSION_PROCESSED_NODES: 265, DAG_COMPRESSION_RETAINED_NODES: 126, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...