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/ldv-regression/test23-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 12:48:39,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 12:48:39,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 12:48:39,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 12:48:39,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 12:48:39,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 12:48:39,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 12:48:39,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 12:48:39,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 12:48:39,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 12:48:39,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 12:48:39,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 12:48:39,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 12:48:39,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 12:48:39,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 12:48:39,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 12:48:39,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 12:48:39,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 12:48:39,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 12:48:39,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 12:48:39,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 12:48:39,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 12:48:39,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 12:48:39,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 12:48:39,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 12:48:39,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 12:48:39,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 12:48:39,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 12:48:39,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 12:48:39,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 12:48:39,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 12:48:39,469 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 12:48:39,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 12:48:39,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 12:48:39,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 12:48:39,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 12:48:39,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 12:48:39,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 12:48:39,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 12:48:39,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 12:48:39,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 12:48:39,477 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 12:48:39,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 12:48:39,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 12:48:39,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 12:48:39,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 12:48:39,512 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 12:48:39,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 12:48:39,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 12:48:39,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 12:48:39,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 12:48:39,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 12:48:39,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 12:48:39,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 12:48:39,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 12:48:39,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 12:48:39,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 12:48:39,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 12:48:39,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 12:48:39,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 12:48:39,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 12:48:39,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 12:48:39,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 12:48:39,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 12:48:39,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 12:48:39,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 12:48:39,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 12:48:39,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 12:48:39,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 12:48:39,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 12:48:39,521 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 12:48:39,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 12:48:39,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 12:48:39,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 12:48:39,818 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 12:48:39,818 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 12:48:39,819 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-2.c [2019-10-07 12:48:39,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f198925b/a9bb3ab7093d46a6992ea84c47d33471/FLAG5dc2eb7fb [2019-10-07 12:48:40,365 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 12:48:40,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-2.c [2019-10-07 12:48:40,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f198925b/a9bb3ab7093d46a6992ea84c47d33471/FLAG5dc2eb7fb [2019-10-07 12:48:40,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f198925b/a9bb3ab7093d46a6992ea84c47d33471 [2019-10-07 12:48:40,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 12:48:40,788 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 12:48:40,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 12:48:40,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 12:48:40,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 12:48:40,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:48:40" (1/1) ... [2019-10-07 12:48:40,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175279dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:40, skipping insertion in model container [2019-10-07 12:48:40,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:48:40" (1/1) ... [2019-10-07 12:48:40,808 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 12:48:40,826 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 12:48:41,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:48:41,067 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 12:48:41,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 12:48:41,186 INFO L192 MainTranslator]: Completed translation [2019-10-07 12:48:41,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41 WrapperNode [2019-10-07 12:48:41,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 12:48:41,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 12:48:41,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 12:48:41,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 12:48:41,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (1/1) ... [2019-10-07 12:48:41,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (1/1) ... [2019-10-07 12:48:41,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (1/1) ... [2019-10-07 12:48:41,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (1/1) ... [2019-10-07 12:48:41,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (1/1) ... [2019-10-07 12:48:41,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (1/1) ... [2019-10-07 12:48:41,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (1/1) ... [2019-10-07 12:48:41,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 12:48:41,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 12:48:41,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 12:48:41,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 12:48:41,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (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 12:48:41,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 12:48:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 12:48:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-07 12:48:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2019-10-07 12:48:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 12:48:41,288 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 12:48:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 12:48:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 12:48:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 12:48:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 12:48:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 12:48:41,289 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2019-10-07 12:48:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 12:48:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 12:48:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 12:48:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 12:48:41,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 12:48:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 12:48:41,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 12:48:41,640 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 12:48:41,641 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 12:48:41,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:48:41 BoogieIcfgContainer [2019-10-07 12:48:41,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 12:48:41,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 12:48:41,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 12:48:41,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 12:48:41,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:48:40" (1/3) ... [2019-10-07 12:48:41,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bfcfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:48:41, skipping insertion in model container [2019-10-07 12:48:41,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:48:41" (2/3) ... [2019-10-07 12:48:41,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bfcfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:48:41, skipping insertion in model container [2019-10-07 12:48:41,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:48:41" (3/3) ... [2019-10-07 12:48:41,650 INFO L109 eAbstractionObserver]: Analyzing ICFG test23-2.c [2019-10-07 12:48:41,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 12:48:41,667 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 12:48:41,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 12:48:41,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 12:48:41,697 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 12:48:41,698 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 12:48:41,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 12:48:41,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 12:48:41,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 12:48:41,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 12:48:41,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 12:48:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-07 12:48:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-07 12:48:41,718 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:48:41,719 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:48:41,720 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:48:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:48:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -384501524, now seen corresponding path program 1 times [2019-10-07 12:48:41,733 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:48:41,733 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:48:41,734 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:48:41,734 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:48:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:48:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:48:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:48:41,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:48:41,909 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:48:41,910 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 12:48:41,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 12:48:41,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 12:48:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 12:48:41,930 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-07 12:48:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:48:41,954 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-07 12:48:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 12:48:41,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2019-10-07 12:48:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:48:41,965 INFO L225 Difference]: With dead ends: 40 [2019-10-07 12:48:41,966 INFO L226 Difference]: Without dead ends: 23 [2019-10-07 12:48:41,969 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 12:48:41,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-07 12:48:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-07 12:48:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-07 12:48:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-07 12:48:42,007 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 23 [2019-10-07 12:48:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:48:42,008 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-07 12:48:42,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 12:48:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-07 12:48:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 12:48:42,010 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:48:42,011 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:48:42,011 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:48:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:48:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -543446048, now seen corresponding path program 1 times [2019-10-07 12:48:42,012 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:48:42,012 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:48:42,012 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:48:42,013 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:48:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:48:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:48:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:48:42,377 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:48:42,378 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 12:48:42,379 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 12:48:42,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 12:48:42,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 12:48:42,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-07 12:48:42,382 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2019-10-07 12:48:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:48:42,677 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-10-07 12:48:42,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 12:48:42,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-10-07 12:48:42,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:48:42,681 INFO L225 Difference]: With dead ends: 32 [2019-10-07 12:48:42,681 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 12:48:42,682 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-07 12:48:42,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 12:48:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-07 12:48:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-07 12:48:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-07 12:48:42,697 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2019-10-07 12:48:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:48:42,699 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-07 12:48:42,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 12:48:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-07 12:48:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 12:48:42,700 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:48:42,701 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:48:42,701 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:48:42,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:48:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash -8538139, now seen corresponding path program 1 times [2019-10-07 12:48:42,704 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:48:42,704 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:48:42,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:48:42,704 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:48:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:48:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:48:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:48:43,050 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:48:43,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:48:43,053 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 12:48:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:48:43,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 12:48:43,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:48:43,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-10-07 12:48:43,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:48:43,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:48:43,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-07 12:48:43,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:54 [2019-10-07 12:48:53,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 12:48:53,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:48:53,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 21 [2019-10-07 12:48:53,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 12:48:53,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 12:48:53,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-07 12:48:53,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:30 [2019-10-07 12:48:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:48:57,576 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:48:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:48:57,713 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 12:48:57,735 INFO L162 IcfgInterpreter]: Started Sifa with 23 locations of interest [2019-10-07 12:48:57,735 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 12:48:57,740 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 12:48:57,746 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 12:48:57,746 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 12:48:58,025 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 51 for LOIs [2019-10-07 12:48:58,274 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-10-07 12:48:59,022 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:00,092 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:00,614 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:00,967 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:01,386 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:01,673 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:01,895 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:02,446 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:02,898 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:49:03,039 INFO L199 IcfgInterpreter]: Interpreting procedure check with input of size 21 for LOIs [2019-10-07 12:49:03,047 INFO L199 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 43 for LOIs [2019-10-07 12:49:03,066 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 28 for LOIs [2019-10-07 12:49:03,073 INFO L199 IcfgInterpreter]: Interpreting procedure init with input of size 51 for LOIs [2019-10-07 12:49:03,082 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 12:49:03,082 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 12:49:03,083 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 1298#(and (or (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_#t~ret13| 0) (<= 0 |main_#t~ret13|) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |~#d2~0.offset| 0) (= |#NULL.offset| 0)) (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_#t~ret13| 1) (<= 0 |main_#t~ret13|) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |~#d2~0.offset| 0) (= |#NULL.offset| 0))) (<= 0 main_~pd1~0.offset) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset)) [2019-10-07 12:49:03,083 INFO L193 IcfgInterpreter]: Reachable states at location L34-1 satisfy 1202#(and (or (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d2~0.base| main_~pd1~0.base) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (= main_~pd1~0.offset |~#d2~0.offset|) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 main_~pd1~0.offset) (not (= 0 |~#d2~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 main_~pd1~0.offset) (not (= 0 |~#d2~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= main_~pd1~0.offset |~#d1~0.offset|))) (<= |#NULL.base| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:49:03,083 INFO L193 IcfgInterpreter]: Reachable states at location initENTRY satisfy 1330#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,084 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 76#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (<= |~#d1~0.offset| 0) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,084 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 1160#(and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,084 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1321#(and (= |old(~#d2~0.base)| |~#d2~0.base|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |old(~#d2~0.offset)| |~#d2~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#d1~0.base)| |~#d1~0.base|) (= |old(~#d1~0.offset)| |~#d1~0.offset|) (= |old(#length)| |#length|)) [2019-10-07 12:49:03,084 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 1193#(and (<= |main_#t~ret7.offset| 0) (or (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (= |~#d2~0.base| |main_#t~ret7.base|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= |main_#t~ret7.offset| |~#d1~0.offset|) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0))) (<= 0 |main_#t~ret7.offset|)) [2019-10-07 12:49:03,085 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 1237#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= main_~pd2~0.offset 0) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (<= main_~i~0 2147483647) (= |~#d2~0.offset| 0) (<= 0 (+ main_~i~0 2147483648)) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,085 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 1286#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,085 INFO L193 IcfgInterpreter]: Reachable states at location get_dummyENTRY satisfy 1312#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,085 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1242#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,086 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#d1~0.base|)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (= 1 (select |#valid| |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,086 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,086 INFO L193 IcfgInterpreter]: Reachable states at location get_dummyEXIT satisfy 1317#(and (<= |get_dummy_#res.offset| 0) (<= 0 |get_dummy_#res.offset|) (or (and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0) (= |get_dummy_#res.base| |~#d2~0.base|)) (and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (= |get_dummy_#res.offset| |~#d1~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0) (= |~#d1~0.base| |get_dummy_#res.base|)))) [2019-10-07 12:49:03,086 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1326#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (= |#length| (store (store |old(#length)| |~#d1~0.base| 72) |~#d2~0.base| 72)) (= |#memory_int| (store (store |old(#memory_int)| |~#d1~0.base| ((as const (Array Int Int)) 0)) |~#d2~0.base| ((as const (Array Int Int)) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store (store (store |old(#valid)| 0 0) |~#d1~0.base| 1) |~#d2~0.base| 1)) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| 0 0) |~#d1~0.base|) 0) (= (select (store (store |old(#valid)| 0 0) |~#d1~0.base| 1) |~#d2~0.base|) 0) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,087 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 682#(and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (not (= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (+ (* 4 main_~i~0) main_~pd2~0.offset 8)))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,087 INFO L193 IcfgInterpreter]: Reachable states at location checkEXIT satisfy 1308#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (= |check_#in~i| check_~i) (<= check_~s1.offset 0) (<= |#NULL.base| 0) (<= |check_#in~s1.offset| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |check_#res|) (<= 0 |check_#in~s1.offset|) (<= |check_#res| 1) (= (ite (= (select (select |#memory_int| check_~s1.base) (+ (* 4 check_~i) check_~s1.offset 8)) check_~i) 1 0) |check_#res|) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (= |check_#in~s1.base| check_~s1.base) (<= 0 check_~s1.offset) (= check_~s1.offset |check_#in~s1.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,087 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 12:49:03,087 INFO L193 IcfgInterpreter]: Reachable states at location L40-1 satisfy 1281#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,088 INFO L193 IcfgInterpreter]: Reachable states at location initEXIT satisfy 1335#(exists ((|v_init_#t~nondet2_11| Int) (|v_init_#t~nondet0_11| Int) (|v_init_#t~nondet3_11| Int) (|v_init_#t~nondet1_11| Int)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= |v_init_#t~nondet2_11| 2147483647) (<= 0 |#NULL.offset|) (<= 0 (+ |v_init_#t~nondet0_11| 2147483648)) (<= |v_init_#t~nondet3_11| 2147483647) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (<= 0 (+ |v_init_#t~nondet3_11| 2147483648)) (= 0 |~#d1~0.offset|) (<= 0 (+ |v_init_#t~nondet2_11| 2147483648)) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (<= |v_init_#t~nondet0_11| 2147483647) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (<= 0 (+ |v_init_#t~nondet1_11| 2147483648)) (<= |v_init_#t~nondet1_11| 2147483647) (= |#NULL.offset| 0) (= |#memory_int| (store (store |old(#memory_int)| |~#d1~0.base| (store (store (select |old(#memory_int)| |~#d1~0.base|) |~#d1~0.offset| |v_init_#t~nondet0_11|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_11|)) |~#d2~0.base| (store (store (select (store |old(#memory_int)| |~#d1~0.base| (store (store (select |old(#memory_int)| |~#d1~0.base|) |~#d1~0.offset| |v_init_#t~nondet0_11|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_11|)) |~#d2~0.base|) |~#d2~0.offset| |v_init_#t~nondet2_11|) (+ |~#d2~0.offset| 4) |v_init_#t~nondet3_11|))))) [2019-10-07 12:49:03,088 INFO L193 IcfgInterpreter]: Reachable states at location checkENTRY satisfy 1303#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (<= |check_#in~s1.offset| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |check_#in~s1.offset|) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (= |#NULL.offset| 0)) [2019-10-07 12:49:03,088 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 1155#(and (or (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_#t~ret13| 1) (<= 0 |main_#t~ret13|) (= |~#d1~0.offset| 0) (<= 0 (+ |main_#t~ret13| 2147483648)) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= |main_#t~ret13| 2147483647) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (= |#NULL.offset| 0)) (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_#t~ret13| 0) (<= 0 |main_#t~ret13|) (= |~#d1~0.offset| 0) (<= 0 (+ |main_#t~ret13| 2147483648)) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= |main_#t~ret13| 2147483647) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (= |#NULL.offset| 0))) (<= 0 main_~pd2~0.offset)) [2019-10-07 12:49:03,088 INFO L193 IcfgInterpreter]: Reachable states at location L34-2 satisfy 1224#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= |main_#t~ret8.offset| 0) (= |#NULL.offset| 0) (<= 0 |main_#t~ret8.offset|)) [2019-10-07 12:49:16,352 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-10-07 12:49:18,755 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-07 12:49:21,076 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-07 12:49:21,688 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-10-07 12:49:21,793 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 12:49:21,794 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5, 16] total 34 [2019-10-07 12:49:21,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 12:49:21,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 12:49:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1043, Unknown=13, NotChecked=0, Total=1190 [2019-10-07 12:49:21,797 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-10-07 12:49:37,524 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-07 12:49:39,763 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-10-07 12:49:41,976 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-10-07 12:49:48,249 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-10-07 12:49:52,490 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2019-10-07 12:50:00,865 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-10-07 12:50:11,807 WARN L191 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-10-07 12:50:18,151 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-07 12:50:26,534 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-10-07 12:50:32,850 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-10-07 12:50:39,135 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-10-07 12:50:45,424 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-10-07 12:50:51,712 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-10-07 12:50:57,993 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-10-07 12:51:08,184 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-07 12:51:12,397 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-10-07 12:51:18,732 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-10-07 12:51:29,049 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-10-07 12:51:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:51:29,051 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-07 12:51:29,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-07 12:51:29,051 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 26 [2019-10-07 12:51:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:51:29,052 INFO L225 Difference]: With dead ends: 38 [2019-10-07 12:51:29,052 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 12:51:29,054 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 111.1s TimeCoverageRelationStatistics Valid=380, Invalid=2548, Unknown=42, NotChecked=0, Total=2970 [2019-10-07 12:51:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 12:51:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-07 12:51:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 12:51:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-10-07 12:51:29,062 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2019-10-07 12:51:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:51:29,063 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-10-07 12:51:29,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 12:51:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-10-07 12:51:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 12:51:29,064 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 12:51:29,064 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 12:51:29,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:51:29,270 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 12:51:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 12:51:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1191736204, now seen corresponding path program 2 times [2019-10-07 12:51:29,271 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 12:51:29,271 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:29,271 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:29,272 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 12:51:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 12:51:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 12:51:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 12:51:29,616 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 12:51:29,616 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 12:51:29,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 12:51:29,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 12:51:29,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 12:51:29,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-07 12:51:29,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 12:51:32,086 WARN L860 $PredicateComparison]: unable to prove that (exists ((main_~pa~0.offset Int) (v_main_~pd2~0.base_BEFORE_CALL_10 Int)) (and (let ((.cse0 (div (+ main_~pa~0.offset (- 8)) 4))) (= .cse0 (select (select |c_#memory_int| v_main_~pd2~0.base_BEFORE_CALL_10) (+ (* 4 .cse0) 8)))) (= 0 (mod main_~pa~0.offset 4)))) is different from true [2019-10-07 12:51:38,196 WARN L191 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-10-07 12:51:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 12:51:38,233 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 12:51:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-07 12:51:38,698 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 12:51:38,700 INFO L162 IcfgInterpreter]: Started Sifa with 23 locations of interest [2019-10-07 12:51:38,700 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 12:51:38,700 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 12:51:38,701 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 12:51:38,701 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 12:51:38,796 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 51 for LOIs [2019-10-07 12:51:39,258 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:39,796 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:40,149 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:40,427 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:40,763 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:41,024 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:41,279 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:41,949 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:42,391 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 12:51:42,530 INFO L199 IcfgInterpreter]: Interpreting procedure check with input of size 21 for LOIs [2019-10-07 12:51:42,535 INFO L199 IcfgInterpreter]: Interpreting procedure get_dummy with input of size 43 for LOIs [2019-10-07 12:51:42,550 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 28 for LOIs [2019-10-07 12:51:42,554 INFO L199 IcfgInterpreter]: Interpreting procedure init with input of size 51 for LOIs [2019-10-07 12:51:42,567 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 12:51:42,567 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 12:51:42,567 INFO L193 IcfgInterpreter]: Reachable states at location L43 satisfy 1290#(and (or (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_#t~ret13| 0) (<= 0 |main_#t~ret13|) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |~#d2~0.offset| 0) (= |#NULL.offset| 0)) (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |main_#t~ret13| 1) (= |#NULL.base| 0) (<= |#NULL.base| 0) (= |main_#t~ret13| 1) (<= 0 |main_#t~ret13|) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |~#d2~0.offset| 0) (= |#NULL.offset| 0))) (<= 0 main_~pd1~0.offset) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset)) [2019-10-07 12:51:42,568 INFO L193 IcfgInterpreter]: Reachable states at location L34-1 satisfy 1191#(and (or (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (= |~#d2~0.base| main_~pd1~0.base) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (<= main_~pd1~0.offset 0) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= main_~pd1~0.offset |~#d2~0.offset|) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= 0 main_~pd1~0.offset) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (<= main_~pd1~0.offset 0) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (= |~#d1~0.base| main_~pd1~0.base) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= 0 main_~pd1~0.offset) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= main_~pd1~0.offset |~#d1~0.offset|))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 12:51:42,568 INFO L193 IcfgInterpreter]: Reachable states at location initENTRY satisfy 1322#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,568 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 76#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (<= |~#d1~0.offset| 0) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,568 INFO L193 IcfgInterpreter]: Reachable states at location L44 satisfy 1149#(and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (= |#NULL.base| 0) (not (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 main_~i~0) 8)) main_~i~0)) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,568 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 1313#(and (= |old(~#d2~0.base)| |~#d2~0.base|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |old(~#d2~0.offset)| |~#d2~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(~#d1~0.base)| |~#d1~0.base|) (= |old(~#d1~0.offset)| |~#d1~0.offset|) (= |old(#length)| |#length|)) [2019-10-07 12:51:42,569 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 1182#(and (<= |main_#t~ret7.offset| 0) (or (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (= |~#d2~0.base| |main_#t~ret7.base|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= |main_#t~ret7.offset| |~#d1~0.offset|) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0))) (<= 0 |main_#t~ret7.offset|)) [2019-10-07 12:51:42,569 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 1226#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= main_~pd2~0.offset 0) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (<= main_~i~0 2147483647) (= |~#d2~0.offset| 0) (<= 0 (+ main_~i~0 2147483648)) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,569 INFO L193 IcfgInterpreter]: Reachable states at location L40-4 satisfy 1274#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,569 INFO L193 IcfgInterpreter]: Reachable states at location get_dummyENTRY satisfy 1304#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,569 INFO L193 IcfgInterpreter]: Reachable states at location L40-3 satisfy 1231#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,570 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#d1~0.base|)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (= 1 (select |#valid| |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,570 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,570 INFO L193 IcfgInterpreter]: Reachable states at location get_dummyEXIT satisfy 1309#(and (<= |get_dummy_#res.offset| 0) (<= 0 |get_dummy_#res.offset|) (or (and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0) (= |get_dummy_#res.base| |~#d2~0.base|)) (and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (= |get_dummy_#res.offset| |~#d1~0.offset|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= 1 (select |#valid| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0) (= |~#d1~0.base| |get_dummy_#res.base|)))) [2019-10-07 12:51:42,570 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 1318#(and (<= 0 |~#d1~0.offset|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (= |#length| (store (store |old(#length)| |~#d1~0.base| 72) |~#d2~0.base| 72)) (= |#memory_int| (store (store |old(#memory_int)| |~#d1~0.base| ((as const (Array Int Int)) 0)) |~#d2~0.base| ((as const (Array Int Int)) 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store (store (store |old(#valid)| 0 0) |~#d1~0.base| 1) |~#d2~0.base| 1)) (< |~#d2~0.base| |#StackHeapBarrier|) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (= (select (store |old(#valid)| 0 0) |~#d1~0.base|) 0) (< |~#d1~0.base| |#StackHeapBarrier|) (= (select (store (store |old(#valid)| 0 0) |~#d1~0.base| 1) |~#d2~0.base|) 0) (= 0 |~#d1~0.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,571 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 681#(and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (= |#NULL.base| 0) (not (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 main_~i~0) 8)) main_~i~0)) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,571 INFO L193 IcfgInterpreter]: Reachable states at location checkEXIT satisfy 1300#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (= |check_#in~i| check_~i) (<= check_~s1.offset 0) (<= |#NULL.base| 0) (<= |check_#in~s1.offset| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |check_#res|) (<= 0 |check_#in~s1.offset|) (<= |check_#res| 1) (= (ite (= (select (select |#memory_int| check_~s1.base) (+ (* 4 check_~i) check_~s1.offset 8)) check_~i) 1 0) |check_#res|) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (= |check_#in~s1.base| check_~s1.base) (<= 0 check_~s1.offset) (= check_~s1.offset |check_#in~s1.offset|) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,571 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 12:51:42,571 INFO L193 IcfgInterpreter]: Reachable states at location L40-1 satisfy 1269#(and (= |#NULL.base| 0) (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,571 INFO L193 IcfgInterpreter]: Reachable states at location initEXIT satisfy 1327#(exists ((|v_init_#t~nondet0_16| Int) (|v_init_#t~nondet1_16| Int) (|v_init_#t~nondet3_16| Int) (|v_init_#t~nondet2_16| Int)) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) ((as const (Array Int Int)) 0)) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (<= 0 (+ |v_init_#t~nondet2_16| 2147483648)) (not (= |~#d1~0.base| 0)) (<= |v_init_#t~nondet3_16| 2147483647) (<= 0 (+ |v_init_#t~nondet3_16| 2147483648)) (= 0 |~#d2~0.offset|) (<= |v_init_#t~nondet1_16| 2147483647) (<= 0 |#NULL.base|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#d1~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (<= 0 (+ |v_init_#t~nondet1_16| 2147483648)) (= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |v_init_#t~nondet0_16| 2147483647) (<= |#NULL.offset| 0) (not (= 0 |~#d2~0.base|)) (<= |~#d1~0.offset| 0) (<= 0 (+ |v_init_#t~nondet0_16| 2147483648)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (<= |v_init_#t~nondet2_16| 2147483647) (= (store (store |old(#memory_int)| |~#d1~0.base| (store (store (select |old(#memory_int)| |~#d1~0.base|) |~#d1~0.offset| |v_init_#t~nondet0_16|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_16|)) |~#d2~0.base| (store (store (select (store |old(#memory_int)| |~#d1~0.base| (store (store (select |old(#memory_int)| |~#d1~0.base|) |~#d1~0.offset| |v_init_#t~nondet0_16|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_16|)) |~#d2~0.base|) |~#d2~0.offset| |v_init_#t~nondet2_16|) (+ |~#d2~0.offset| 4) |v_init_#t~nondet3_16|)) |#memory_int|) (= |#NULL.offset| 0))) [2019-10-07 12:51:42,572 INFO L193 IcfgInterpreter]: Reachable states at location checkENTRY satisfy 1295#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (<= |check_#in~s1.offset| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |check_#in~s1.offset|) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (= |#NULL.offset| 0)) [2019-10-07 12:51:42,572 INFO L193 IcfgInterpreter]: Reachable states at location L43-1 satisfy 1144#(and (or (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (= |#NULL.base| 0) (<= |main_#t~ret13| 1) (not (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 main_~i~0) 8)) main_~i~0)) (= |main_#t~ret13| 0) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |main_#t~ret13|) (<= 0 (+ |main_#t~ret13| 2147483648)) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= |main_#t~ret13| 2147483647) (= |~#d2~0.offset| 0) (= |#NULL.offset| 0)) (and (<= main_~pd2~0.offset 0) (<= 0 |~#d1~0.offset|) (= |#NULL.base| 0) (<= |main_#t~ret13| 1) (<= |#NULL.base| 0) (= |main_#t~ret13| 1) (= |~#d1~0.offset| 0) (<= 0 |main_#t~ret13|) (<= 0 (+ |main_#t~ret13| 2147483648)) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= |main_#t~ret13| 2147483647) (= |~#d2~0.offset| 0) (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 main_~i~0) 8)) main_~i~0) (= |#NULL.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= 0 main_~pd2~0.offset)) [2019-10-07 12:51:42,572 INFO L193 IcfgInterpreter]: Reachable states at location L34-2 satisfy 1213#(and (= |#NULL.base| 0) (<= 0 |~#d1~0.offset|) (<= |#NULL.base| 0) (= |~#d1~0.offset| 0) (<= 0 |~#d2~0.offset|) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~pd1~0.offset) (= |~#d2~0.offset| 0) (<= |~#d1~0.offset| 0) (<= main_~pd1~0.offset 0) (<= |main_#t~ret8.offset| 0) (= |#NULL.offset| 0) (<= 0 |main_#t~ret8.offset|)) [2019-10-07 12:51:55,874 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-10-07 12:51:58,247 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-07 12:52:00,628 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-10-07 12:52:03,314 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2019-10-07 12:52:03,532 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-10-07 12:52:03,533 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 12:52:03,533 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 9, 18] total 52 [2019-10-07 12:52:03,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-07 12:52:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-07 12:52:03,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2318, Unknown=8, NotChecked=98, Total=2652 [2019-10-07 12:52:03,537 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 52 states. [2019-10-07 12:52:22,330 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-07 12:52:24,588 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 90 [2019-10-07 12:52:26,850 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2019-10-07 12:52:31,182 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2019-10-07 12:52:33,500 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2019-10-07 12:52:36,176 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-07 12:52:36,425 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-07 12:52:36,698 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-07 12:52:39,544 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 53 [2019-10-07 12:52:50,245 WARN L191 SmtUtils]: Spent 10.63 s on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-07 12:52:50,470 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-07 12:52:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 12:52:50,511 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-10-07 12:52:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-07 12:52:50,512 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 32 [2019-10-07 12:52:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 12:52:50,513 INFO L225 Difference]: With dead ends: 38 [2019-10-07 12:52:50,513 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 12:52:50,517 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 59.6s TimeCoverageRelationStatistics Valid=591, Invalid=4802, Unknown=13, NotChecked=144, Total=5550 [2019-10-07 12:52:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 12:52:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 12:52:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 12:52:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 12:52:50,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-10-07 12:52:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 12:52:50,519 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 12:52:50,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-07 12:52:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 12:52:50,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 12:52:50,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 12:52:50,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 12:52:50,992 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-07 12:54:13,123 WARN L191 SmtUtils]: Spent 1.37 m on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2019-10-07 12:54:17,309 WARN L191 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 139 DAG size of output: 106 [2019-10-07 12:54:17,446 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-10-07 12:54:17,834 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 94 [2019-10-07 12:54:18,318 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 92 [2019-10-07 12:54:18,320 INFO L443 ceAbstractionStarter]: For program point initEXIT(lines 12 19) no Hoare annotation was computed. [2019-10-07 12:54:18,321 INFO L439 ceAbstractionStarter]: At program point initENTRY(lines 12 19) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (< |~#d2~0.base| |#StackHeapBarrier|)) (not (< |~#d1~0.base| |#StackHeapBarrier|)) (not (= 0 (select |#valid| 0))) (not (<= 0 |~#d2~0.offset|)) (not (= 72 (select |#length| |~#d2~0.base|))) (not (<= |#NULL.base| 0)) (not (= .cse0 (select |old(#memory_int)| |~#d1~0.base|))) (not (= 1 (select |#valid| |~#d2~0.base|))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |#NULL.offset| 0)) (not (= (select |#valid| |~#d1~0.base|) 1)) (= |#memory_int| |old(#memory_int)|) (not (<= 0 |#NULL.base|)) (not (= 72 (select |#length| |~#d1~0.base|))) (not (= 0 |~#d1~0.offset|)) (not (= .cse0 (select |old(#memory_int)| |~#d2~0.base|))) (not (<= |~#d2~0.offset| 0)))) [2019-10-07 12:54:18,321 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~#d2~0.base)| |~#d2~0.base|) (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~#d2~0.offset)| |~#d2~0.offset|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#d1~0.base)| |~#d1~0.base|) (= |old(~#d1~0.offset)| |~#d1~0.offset|) (= |old(#length)| |#length|)) [2019-10-07 12:54:18,321 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 12:54:18,321 INFO L446 ceAbstractionStarter]: At program point get_dummyENTRY(lines 21 24) the Hoare annotation is: true [2019-10-07 12:54:18,321 INFO L443 ceAbstractionStarter]: For program point get_dummyEXIT(lines 21 24) no Hoare annotation was computed. [2019-10-07 12:54:18,321 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 12:54:18,322 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#length| |~#d2~0.base|) 72) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (= .cse0 (select |#memory_int| |~#d1~0.base|)) (< |~#d2~0.base| |#StackHeapBarrier|) (= 1 (select |#valid| |~#d2~0.base|)) (= .cse0 (select |#memory_int| |~#d2~0.base|)) (= 72 (select |#length| |~#d1~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= 0 |~#d1~0.offset|))) [2019-10-07 12:54:18,322 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 12:54:18,322 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 12:54:18,322 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (< |~#d2~0.base| |#StackHeapBarrier|)) (not (< |~#d1~0.base| |#StackHeapBarrier|)) (not (= 0 (select |#valid| 0))) (not (<= 0 |~#d2~0.offset|)) (not (= 72 (select |#length| |~#d2~0.base|))) (not (<= |#NULL.base| 0)) (not (= .cse0 (select |old(#memory_int)| |~#d1~0.base|))) (not (= 1 (select |#valid| |~#d2~0.base|))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |#NULL.offset| 0)) (not (= (select |#valid| |~#d1~0.base|) 1)) (exists ((|v_init_#t~nondet2_11| Int) (|v_init_#t~nondet0_11| Int) (|v_init_#t~nondet3_11| Int) (|v_init_#t~nondet1_11| Int)) (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |old(#memory_int)| |~#d1~0.base|))) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) .cse1) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |v_init_#t~nondet2_11| 2147483647) (<= 0 (+ |v_init_#t~nondet0_11| 2147483648)) (< |~#d2~0.base| |#StackHeapBarrier|) (<= |v_init_#t~nondet3_11| 2147483647) (= 1 (select |#valid| |~#d2~0.base|)) (= .cse1 .cse2) (= 72 (select |#length| |~#d1~0.base|)) (<= 0 (+ |v_init_#t~nondet3_11| 2147483648)) (= 0 |~#d1~0.offset|) (<= 0 (+ |v_init_#t~nondet2_11| 2147483648)) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (<= |v_init_#t~nondet0_11| 2147483647) (<= |~#d1~0.offset| 0) (not (= 0 |~#d2~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (<= 0 (+ |v_init_#t~nondet1_11| 2147483648)) (<= |v_init_#t~nondet1_11| 2147483647) (= |#NULL.offset| 0) (= |#memory_int| (let ((.cse3 (store |old(#memory_int)| |~#d1~0.base| (store (store .cse2 |~#d1~0.offset| |v_init_#t~nondet0_11|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_11|)))) (store .cse3 |~#d2~0.base| (store (store (select .cse3 |~#d2~0.base|) |~#d2~0.offset| |v_init_#t~nondet2_11|) (+ |~#d2~0.offset| 4) |v_init_#t~nondet3_11|))))))) (not (<= 0 |#NULL.base|)) (not (= 72 (select |#length| |~#d1~0.base|))) (not (= 0 |~#d1~0.offset|)) (not (= .cse0 (select |old(#memory_int)| |~#d2~0.base|))) (not (<= |~#d2~0.offset| 0)))) [2019-10-07 12:54:18,323 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 31 52) no Hoare annotation was computed. [2019-10-07 12:54:18,323 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 31 52) no Hoare annotation was computed. [2019-10-07 12:54:18,323 INFO L439 ceAbstractionStarter]: At program point L44(lines 32 52) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (< |~#d2~0.base| |#StackHeapBarrier|)) (not (< |~#d1~0.base| |#StackHeapBarrier|)) (not (= 0 (select |#valid| 0))) (not (<= 0 |~#d2~0.offset|)) (not (= 72 (select |#length| |~#d2~0.base|))) (not (<= |#NULL.base| 0)) (not (= .cse0 (select |old(#memory_int)| |~#d1~0.base|))) (not (= 1 (select |#valid| |~#d2~0.base|))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |#NULL.offset| 0)) (not (= (select |#valid| |~#d1~0.base|) 1)) (not (<= 0 |#NULL.base|)) (not (= 72 (select |#length| |~#d1~0.base|))) (not (= 0 |~#d1~0.offset|)) (not (= .cse0 (select |old(#memory_int)| |~#d2~0.base|))) (not (<= |~#d2~0.offset| 0)))) [2019-10-07 12:54:18,323 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2019-10-07 12:54:18,323 INFO L439 ceAbstractionStarter]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0))) (or (not (< |~#d2~0.base| |#StackHeapBarrier|)) (not (< |~#d1~0.base| |#StackHeapBarrier|)) (and (= (mod (+ main_~pa~0.offset (* 3 main_~pd2~0.offset)) 4) 0) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (or (and (<= 0 main_~pd1~0.offset) (= |~#d2~0.base| main_~pd1~0.base)) (and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))) (<= main_~pd1~0.offset 0) (let ((.cse0 (div (+ (* (- 1) main_~pd2~0.offset) main_~pa~0.offset (- 8)) 4))) (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 .cse0) 8)) .cse0))) (not (= 0 (select |#valid| 0))) (not (<= 0 |~#d2~0.offset|)) (not (= 72 (select |#length| |~#d2~0.base|))) (not (<= |#NULL.base| 0)) (not (= .cse1 (select |old(#memory_int)| |~#d1~0.base|))) (not (= 1 (select |#valid| |~#d2~0.base|))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |#NULL.offset| 0)) (not (= (select |#valid| |~#d1~0.base|) 1)) (not (<= 0 |#NULL.base|)) (not (= 72 (select |#length| |~#d1~0.base|))) (not (= 0 |~#d1~0.offset|)) (not (= .cse1 (select |old(#memory_int)| |~#d2~0.base|))) (not (<= |~#d2~0.offset| 0)))) [2019-10-07 12:54:18,324 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 46) no Hoare annotation was computed. [2019-10-07 12:54:18,324 INFO L439 ceAbstractionStarter]: At program point L40-4(lines 40 42) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (or (not (< |~#d2~0.base| |#StackHeapBarrier|)) (and (= (mod (+ main_~pa~0.offset (* 3 main_~pd2~0.offset)) 4) 0) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset 0) (exists ((main_~pa~0.offset Int)) (let ((.cse0 (select |#memory_int| main_~pd2~0.base))) (let ((.cse2 (select .cse0 main_~pa~0.offset))) (and (= (mod (+ main_~pa~0.offset (* 3 main_~pd2~0.offset)) 4) 0) (let ((.cse1 (div (+ (* (- 1) main_~pd2~0.offset) main_~pa~0.offset (- 8)) 4))) (= (select .cse0 (+ main_~pd2~0.offset (* 4 .cse1) 8)) .cse1)) (<= .cse2 main_~i~0) (<= main_~i~0 .cse2))))) (<= 0 main_~pd1~0.offset) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (<= main_~pd1~0.offset 0) (let ((.cse3 (div (+ (* (- 1) main_~pd2~0.offset) main_~pa~0.offset (- 8)) 4))) (= (select (select |#memory_int| main_~pd2~0.base) (+ main_~pd2~0.offset (* 4 .cse3) 8)) .cse3)) (or (= |~#d1~0.base| main_~pd1~0.base) (= |~#d2~0.base| main_~pd1~0.base))) (not (< |~#d1~0.base| |#StackHeapBarrier|)) (not (= 0 (select |#valid| 0))) (not (<= 0 |~#d2~0.offset|)) (not (= 72 (select |#length| |~#d2~0.base|))) (not (<= |#NULL.base| 0)) (not (= .cse4 (select |old(#memory_int)| |~#d1~0.base|))) (not (= 1 (select |#valid| |~#d2~0.base|))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |#NULL.offset| 0)) (not (= (select |#valid| |~#d1~0.base|) 1)) (not (<= 0 |#NULL.base|)) (not (= 72 (select |#length| |~#d1~0.base|))) (not (= 0 |~#d1~0.offset|)) (not (= .cse4 (select |old(#memory_int)| |~#d2~0.base|))) (not (<= |~#d2~0.offset| 0)))) [2019-10-07 12:54:18,324 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-07 12:54:18,324 INFO L443 ceAbstractionStarter]: For program point L36-2(lines 36 46) no Hoare annotation was computed. [2019-10-07 12:54:18,325 INFO L439 ceAbstractionStarter]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (< |~#d2~0.base| |#StackHeapBarrier|)) (not (< |~#d1~0.base| |#StackHeapBarrier|)) (not (= 0 (select |#valid| 0))) (not (<= 0 |~#d2~0.offset|)) (not (= 72 (select |#length| |~#d2~0.base|))) (not (<= |#NULL.base| 0)) (not (= .cse0 (select |old(#memory_int)| |~#d1~0.base|))) (not (= 1 (select |#valid| |~#d2~0.base|))) (and (or (= |~#d2~0.base| main_~pd1~0.base) (= |~#d1~0.base| main_~pd1~0.base)) (= main_~pd1~0.offset 0) (exists ((|v_init_#t~nondet2_11| Int) (|v_init_#t~nondet0_11| Int) (|v_init_#t~nondet3_11| Int) (|v_init_#t~nondet1_11| Int)) (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |old(#memory_int)| |~#d1~0.base|))) (and (<= 0 |~#d1~0.offset|) (= (select |old(#memory_int)| |~#d2~0.base|) .cse1) (= 0 |#NULL.base|) (= (select |#length| |~#d2~0.base|) 72) (not (= |~#d1~0.base| 0)) (= 0 |~#d2~0.offset|) (not (= |~#d1~0.base| |~#d2~0.base|)) (<= 0 |#NULL.base|) (<= |~#d2~0.offset| 0) (<= 0 |#NULL.offset|) (<= |v_init_#t~nondet2_11| 2147483647) (<= 0 (+ |v_init_#t~nondet0_11| 2147483648)) (< |~#d2~0.base| |#StackHeapBarrier|) (<= |v_init_#t~nondet3_11| 2147483647) (= 1 (select |#valid| |~#d2~0.base|)) (= .cse1 .cse2) (= 72 (select |#length| |~#d1~0.base|)) (<= 0 (+ |v_init_#t~nondet3_11| 2147483648)) (= 0 |~#d1~0.offset|) (<= 0 (+ |v_init_#t~nondet2_11| 2147483648)) (<= |#NULL.base| 0) (= 1 (select |#valid| |~#d1~0.base|)) (<= 0 |~#d2~0.offset|) (<= |#NULL.offset| 0) (<= |v_init_#t~nondet0_11| 2147483647) (<= |~#d1~0.offset| 0) (not (= 0 |~#d2~0.base|)) (< |~#d1~0.base| |#StackHeapBarrier|) (= 0 (select |#valid| 0)) (<= 0 (+ |v_init_#t~nondet1_11| 2147483648)) (<= |v_init_#t~nondet1_11| 2147483647) (= |#NULL.offset| 0) (= |#memory_int| (let ((.cse3 (store |old(#memory_int)| |~#d1~0.base| (store (store .cse2 |~#d1~0.offset| |v_init_#t~nondet0_11|) (+ |~#d1~0.offset| 4) |v_init_#t~nondet1_11|)))) (store .cse3 |~#d2~0.base| (store (store (select .cse3 |~#d2~0.base|) |~#d2~0.offset| |v_init_#t~nondet2_11|) (+ |~#d2~0.offset| 4) |v_init_#t~nondet3_11|)))))))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |#NULL.offset| 0)) (not (= (select |#valid| |~#d1~0.base|) 1)) (not (<= 0 |#NULL.base|)) (not (= 72 (select |#length| |~#d1~0.base|))) (not (= 0 |~#d1~0.offset|)) (not (= .cse0 (select |old(#memory_int)| |~#d2~0.base|))) (not (<= |~#d2~0.offset| 0)))) [2019-10-07 12:54:18,325 INFO L443 ceAbstractionStarter]: For program point L34-2(line 34) no Hoare annotation was computed. [2019-10-07 12:54:18,325 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 31 52) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (< |~#d2~0.base| |#StackHeapBarrier|)) (not (< |~#d1~0.base| |#StackHeapBarrier|)) (not (= 0 (select |#valid| 0))) (not (<= 0 |~#d2~0.offset|)) (not (= 72 (select |#length| |~#d2~0.base|))) (not (<= |#NULL.base| 0)) (not (= .cse0 (select |old(#memory_int)| |~#d1~0.base|))) (not (= 1 (select |#valid| |~#d2~0.base|))) (= |~#d1~0.base| |~#d2~0.base|) (not (= |#NULL.offset| 0)) (not (= (select |#valid| |~#d1~0.base|) 1)) (= |#memory_int| |old(#memory_int)|) (not (<= 0 |#NULL.base|)) (not (= 72 (select |#length| |~#d1~0.base|))) (not (= 0 |~#d1~0.offset|)) (not (= .cse0 (select |old(#memory_int)| |~#d2~0.base|))) (not (<= |~#d2~0.offset| 0)))) [2019-10-07 12:54:18,325 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2019-10-07 12:54:18,326 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-07 12:54:18,326 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2019-10-07 12:54:18,326 INFO L446 ceAbstractionStarter]: At program point checkENTRY(lines 26 29) the Hoare annotation is: true [2019-10-07 12:54:18,326 INFO L443 ceAbstractionStarter]: For program point checkEXIT(lines 26 29) no Hoare annotation was computed. [2019-10-07 12:54:18,331 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 12:54:18,335 INFO L168 Benchmark]: Toolchain (without parser) took 337547.38 ms. Allocated memory was 137.9 MB in the beginning and 446.7 MB in the end (delta: 308.8 MB). Free memory was 101.9 MB in the beginning and 328.9 MB in the end (delta: -227.0 MB). Peak memory consumption was 348.1 MB. Max. memory is 7.1 GB. [2019-10-07 12:54:18,335 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 12:54:18,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.47 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 179.0 MB in the end (delta: -77.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-10-07 12:54:18,336 INFO L168 Benchmark]: Boogie Preprocessor took 34.56 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 177.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-10-07 12:54:18,336 INFO L168 Benchmark]: RCFGBuilder took 420.63 ms. Allocated memory is still 201.3 MB. Free memory was 177.0 MB in the beginning and 156.4 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-10-07 12:54:18,336 INFO L168 Benchmark]: TraceAbstraction took 336689.46 ms. Allocated memory was 201.3 MB in the beginning and 446.7 MB in the end (delta: 245.4 MB). Free memory was 155.8 MB in the beginning and 328.9 MB in the end (delta: -173.1 MB). Peak memory consumption was 338.5 MB. Max. memory is 7.1 GB. [2019-10-07 12:54:18,338 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.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 398.47 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 179.0 MB in the end (delta: -77.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.56 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 177.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.63 ms. Allocated memory is still 201.3 MB. Free memory was 177.0 MB in the beginning and 156.4 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 336689.46 ms. Allocated memory was 201.3 MB in the beginning and 446.7 MB in the end (delta: 245.4 MB). Free memory was 155.8 MB in the beginning and 328.9 MB in the end (delta: -173.1 MB). Peak memory consumption was 338.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...