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/array-examples/standard_init1_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:53:44,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:53:44,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:53:44,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:53:44,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:53:44,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:53:44,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:53:44,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:53:44,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:53:44,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:53:44,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:53:44,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:53:44,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:53:44,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:53:44,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:53:44,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:53:44,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:53:44,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:53:44,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:53:44,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:53:44,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:53:44,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:53:44,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:53:44,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:53:44,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:53:44,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:53:44,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:53:44,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:53:44,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:53:44,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:53:44,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:53:44,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:53:44,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:53:44,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:53:44,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:53:44,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:53:44,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:53:44,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:53:44,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:53:44,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:53:44,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:53:44,814 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-06 23:53:44,829 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:53:44,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:53:44,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:53:44,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:53:44,831 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:53:44,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:53:44,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:53:44,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:53:44,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:53:44,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:53:44,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:53:44,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:53:44,833 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:53:44,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:53:44,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:53:44,833 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:53:44,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:53:44,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:53:44,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:53:44,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:53:44,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:53:44,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:53:44,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:53:44,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:53:44,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:53:44,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:53:44,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:53:44,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:53:44,836 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-06 23:53:45,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:53:45,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:53:45,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:53:45,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:53:45,166 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:53:45,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init1_ground-2.i [2019-10-06 23:53:45,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d61d87cd/60abb7549fd1435989757afa83a69660/FLAG724b3ffd2 [2019-10-06 23:53:45,705 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:53:45,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_ground-2.i [2019-10-06 23:53:45,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d61d87cd/60abb7549fd1435989757afa83a69660/FLAG724b3ffd2 [2019-10-06 23:53:46,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d61d87cd/60abb7549fd1435989757afa83a69660 [2019-10-06 23:53:46,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:53:46,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:53:46,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:53:46,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:53:46,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:53:46,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc689a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46, skipping insertion in model container [2019-10-06 23:53:46,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,134 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:53:46,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:53:46,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:53:46,391 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:53:46,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:53:46,428 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:53:46,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46 WrapperNode [2019-10-06 23:53:46,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:53:46,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:53:46,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:53:46,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:53:46,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (1/1) ... [2019-10-06 23:53:46,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:53:46,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:53:46,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:53:46,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:53:46,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (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-06 23:53:46,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:53:46,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:53:46,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:53:46,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:53:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:53:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:53:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:53:46,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:53:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:53:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:53:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:53:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:53:46,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:53:46,995 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:53:46,996 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-06 23:53:46,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:53:46 BoogieIcfgContainer [2019-10-06 23:53:46,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:53:46,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:53:46,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:53:47,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:53:47,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:53:46" (1/3) ... [2019-10-06 23:53:47,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd44662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:53:47, skipping insertion in model container [2019-10-06 23:53:47,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:53:46" (2/3) ... [2019-10-06 23:53:47,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd44662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:53:47, skipping insertion in model container [2019-10-06 23:53:47,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:53:46" (3/3) ... [2019-10-06 23:53:47,006 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init1_ground-2.i [2019-10-06 23:53:47,017 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:53:47,026 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:53:47,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:53:47,066 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:53:47,067 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:53:47,067 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:53:47,067 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:53:47,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:53:47,068 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:53:47,068 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:53:47,069 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:53:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-06 23:53:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-06 23:53:47,090 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:53:47,091 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:53:47,093 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:53:47,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:53:47,099 INFO L82 PathProgramCache]: Analyzing trace with hash 243563535, now seen corresponding path program 1 times [2019-10-06 23:53:47,107 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:53:47,107 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:47,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:47,108 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:47,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:53:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:47,315 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:47,315 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:53:47,318 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:53:47,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:53:47,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:53:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:53:47,347 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-06 23:53:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:53:47,403 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-06 23:53:47,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:53:47,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-06 23:53:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:53:47,417 INFO L225 Difference]: With dead ends: 31 [2019-10-06 23:53:47,417 INFO L226 Difference]: Without dead ends: 16 [2019-10-06 23:53:47,424 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:53:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-06 23:53:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-06 23:53:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-06 23:53:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-06 23:53:47,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-06 23:53:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:53:47,475 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-06 23:53:47,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:53:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-06 23:53:47,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-06 23:53:47,479 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:53:47,479 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:53:47,479 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:53:47,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:53:47,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1400307069, now seen corresponding path program 1 times [2019-10-06 23:53:47,482 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:53:47,482 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:47,482 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:47,483 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:53:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:47,604 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:47,604 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:53:47,605 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-06 23:53:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:47,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:53:47,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:53:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:47,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:53:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:47,735 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:53:47,762 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-06 23:53:47,762 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:53:47,769 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:53:47,778 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:53:47,779 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:53:47,983 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:53:48,395 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:53:48,420 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:53:48,429 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:53:48,430 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:53:48,430 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:48,431 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:48,431 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:48,431 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:48,432 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:48,433 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:48,433 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:53:48,433 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:53:48,435 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:48,436 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:53:48,438 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:48,439 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_1) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:48,958 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:53:48,959 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 10] total 17 [2019-10-06 23:53:48,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:53:48,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:53:48,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:53:48,963 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 17 states. [2019-10-06 23:53:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:53:49,747 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-06 23:53:49,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-06 23:53:49,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-10-06 23:53:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:53:49,749 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:53:49,750 INFO L226 Difference]: Without dead ends: 28 [2019-10-06 23:53:49,753 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:53:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-06 23:53:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2019-10-06 23:53:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-06 23:53:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-06 23:53:49,766 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2019-10-06 23:53:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:53:49,768 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-06 23:53:49,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:53:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-06 23:53:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:53:49,771 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:53:49,771 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:53:49,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:53:49,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:53:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:53:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1364428529, now seen corresponding path program 2 times [2019-10-06 23:53:49,985 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:53:49,985 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:49,985 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:49,986 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:49,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:53:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:50,055 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:50,055 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:53:50,055 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-06 23:53:50,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:53:50,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:53:50,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:53:50,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:53:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:50,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:53:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:50,255 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:53:50,258 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-06 23:53:50,258 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:53:50,259 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:53:50,259 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:53:50,260 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:53:50,326 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:53:50,581 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:53:50,596 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:53:50,606 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:53:50,606 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:53:50,607 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:50,607 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:50,608 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:50,608 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:50,608 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:50,609 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:50,609 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:53:50,609 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:53:50,610 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:50,611 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:53:50,611 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:50,612 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 42 (select (select |#memory_int| v_prenex_2) 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 42 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:51,032 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:53:51,032 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 10] total 23 [2019-10-06 23:53:51,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:53:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:53:51,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:53:51,037 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 23 states. [2019-10-06 23:53:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:53:51,936 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-10-06 23:53:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:53:51,937 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2019-10-06 23:53:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:53:51,938 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:53:51,938 INFO L226 Difference]: Without dead ends: 34 [2019-10-06 23:53:51,940 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:53:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-06 23:53:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-06 23:53:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-06 23:53:51,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-10-06 23:53:51,948 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-10-06 23:53:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:53:51,948 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-10-06 23:53:51,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:53:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-10-06 23:53:51,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:53:51,950 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:53:51,950 INFO L385 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:53:52,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:53:52,157 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:53:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:53:52,157 INFO L82 PathProgramCache]: Analyzing trace with hash 883442831, now seen corresponding path program 3 times [2019-10-06 23:53:52,158 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:53:52,158 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:52,158 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:52,158 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:52,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:53:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:52,343 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:52,343 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:53:52,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:53:52,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:53:52,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:53:52,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:53:52,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:53:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:52,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:53:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:52,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:53:52,651 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-06 23:53:52,652 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:53:52,652 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:53:52,652 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:53:52,653 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:53:52,690 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:53:52,866 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:53:52,895 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:53:52,904 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:53:52,905 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:53:52,905 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:52,905 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:52,906 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:52,906 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:52,907 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:52,911 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:52,912 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:53:52,912 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:53:52,912 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:52,913 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:53:52,914 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:52,914 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 0) 42)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_3) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:53,392 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:53:53,393 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 10] total 35 [2019-10-06 23:53:53,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:53:53,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:53:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:53:53,394 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-10-06 23:53:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:53:54,913 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-10-06 23:53:54,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:53:54,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 21 [2019-10-06 23:53:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:53:54,915 INFO L225 Difference]: With dead ends: 55 [2019-10-06 23:53:54,915 INFO L226 Difference]: Without dead ends: 46 [2019-10-06 23:53:54,917 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:53:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-06 23:53:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-06 23:53:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-06 23:53:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-10-06 23:53:54,928 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 21 [2019-10-06 23:53:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:53:54,929 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-10-06 23:53:54,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:53:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-10-06 23:53:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-06 23:53:54,930 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:53:54,930 INFO L385 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:53:55,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:53:55,131 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:53:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:53:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1549534321, now seen corresponding path program 4 times [2019-10-06 23:53:55,132 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:53:55,132 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:55,132 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:55,132 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:53:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:53:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:55,474 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:53:55,474 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:53:55,475 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:53:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:53:55,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:53:55,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:53:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:55,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:53:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:53:56,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:53:56,197 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-06 23:53:56,197 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:53:56,197 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:53:56,197 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:53:56,198 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:53:56,227 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:53:56,352 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:53:56,359 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:53:56,363 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:53:56,364 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:53:56,364 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:56,364 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:56,364 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:56,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:56,365 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:56,365 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:56,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:53:56,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:53:56,366 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:53:56,366 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:53:56,368 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:53:56,369 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_4 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_4) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:53:56,845 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:53:56,845 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 10] total 59 [2019-10-06 23:53:56,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-06 23:53:56,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-06 23:53:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2019-10-06 23:53:56,851 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 59 states. [2019-10-06 23:54:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:54:00,197 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2019-10-06 23:54:00,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-06 23:54:00,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 33 [2019-10-06 23:54:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:54:00,203 INFO L225 Difference]: With dead ends: 79 [2019-10-06 23:54:00,203 INFO L226 Difference]: Without dead ends: 70 [2019-10-06 23:54:00,209 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2753 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3606, Invalid=8826, Unknown=0, NotChecked=0, Total=12432 [2019-10-06 23:54:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-06 23:54:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-10-06 23:54:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-06 23:54:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-10-06 23:54:00,222 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 33 [2019-10-06 23:54:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:54:00,222 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-10-06 23:54:00,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-06 23:54:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-10-06 23:54:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-06 23:54:00,224 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:54:00,225 INFO L385 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:54:00,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:54:00,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:54:00,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:54:00,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1865684593, now seen corresponding path program 5 times [2019-10-06 23:54:00,430 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:54:00,431 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:54:00,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:54:00,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:54:00,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:54:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:54:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:54:01,524 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:54:01,524 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:54:01,525 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:54:49,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-06 23:54:49,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:54:49,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-06 23:54:49,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:54:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:54:49,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:54:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:54:51,927 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:54:51,928 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-06 23:54:51,928 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:54:51,928 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:54:51,929 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:54:51,929 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:54:51,957 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:54:52,057 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:54:52,066 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:54:52,070 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:54:52,070 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:54:52,071 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:54:52,071 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:54:52,076 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:54:52,076 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:54:52,077 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:54:52,077 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:54:52,077 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:54:52,077 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:54:52,077 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:54:52,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:54:52,078 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:54:52,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 0) 42)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_5) 0) 42) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:54:52,705 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:54:52,706 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 10] total 107 [2019-10-06 23:54:52,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-10-06 23:54:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-10-06 23:54:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4685, Invalid=6657, Unknown=0, NotChecked=0, Total=11342 [2019-10-06 23:54:52,713 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 107 states. [2019-10-06 23:55:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:55:01,255 INFO L93 Difference]: Finished difference Result 127 states and 176 transitions. [2019-10-06 23:55:01,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-10-06 23:55:01,255 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 57 [2019-10-06 23:55:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:55:01,257 INFO L225 Difference]: With dead ends: 127 [2019-10-06 23:55:01,257 INFO L226 Difference]: Without dead ends: 118 [2019-10-06 23:55:01,266 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8405 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14046, Invalid=29010, Unknown=0, NotChecked=0, Total=43056 [2019-10-06 23:55:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-06 23:55:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2019-10-06 23:55:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-06 23:55:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-10-06 23:55:01,283 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 57 [2019-10-06 23:55:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:55:01,283 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-10-06 23:55:01,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-10-06 23:55:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-10-06 23:55:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-06 23:55:01,287 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:01,287 INFO L385 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:01,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:01,493 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1893582223, now seen corresponding path program 6 times [2019-10-06 23:55:01,495 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:01,495 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:01,495 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:01,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:55:04,957 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:04,957 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:55:04,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:05,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:55:05,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:55:05,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-06 23:55:05,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:55:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:55:05,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:55:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:55:14,862 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:55:14,863 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-06 23:55:14,864 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:55:14,864 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:55:14,864 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:55:14,864 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:55:14,892 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:55:14,993 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:55:15,002 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:55:15,006 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:55:15,007 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:55:15,007 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:15,007 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:15,008 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:15,008 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:15,008 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:15,010 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:55:15,010 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:15,010 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:55:15,011 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:55:15,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:55:15,011 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:55:15,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) 0) 42) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_6) 0) 42)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:55:15,976 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:55:15,977 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 10] total 203 [2019-10-06 23:55:15,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 203 states [2019-10-06 23:55:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2019-10-06 23:55:15,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18557, Invalid=22449, Unknown=0, NotChecked=0, Total=41006 [2019-10-06 23:55:15,986 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 203 states. [2019-10-06 23:55:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:55:42,770 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2019-10-06 23:55:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2019-10-06 23:55:42,770 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 105 [2019-10-06 23:55:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:55:42,773 INFO L225 Difference]: With dead ends: 223 [2019-10-06 23:55:42,774 INFO L226 Difference]: Without dead ends: 214 [2019-10-06 23:55:42,779 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28349 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=55662, Invalid=103938, Unknown=0, NotChecked=0, Total=159600 [2019-10-06 23:55:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-06 23:55:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2019-10-06 23:55:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-06 23:55:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-10-06 23:55:42,811 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 105 [2019-10-06 23:55:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:55:42,812 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-10-06 23:55:42,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 203 states. [2019-10-06 23:55:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-10-06 23:55:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-06 23:55:42,816 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:55:42,816 INFO L385 BasicCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:55:43,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:43,021 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:55:43,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:55:43,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1878426225, now seen corresponding path program 7 times [2019-10-06 23:55:43,022 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:55:43,022 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:43,022 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:43,022 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:55:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:55:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:55:56,364 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:55:56,364 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:55:56,364 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:55:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:55:56,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-06 23:55:56,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:55:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:55:56,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:56:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:56:35,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:56:35,584 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-06 23:56:35,585 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:56:35,585 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:56:35,585 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:56:35,585 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:56:35,618 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:56:35,710 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-06 23:56:35,716 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:56:35,719 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:56:35,719 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:56:35,719 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:56:35,720 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:56:35,720 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 91#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:56:35,720 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 110#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:56:35,720 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:56:35,721 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 81#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem1|) (< main_~x~0 100000) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:56:35,721 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 96#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:56:35,721 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 105#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:56:35,721 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 76#(and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 main_~x~0) (= main_~x~0 0) (<= 100000 main_~i~0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) [2019-10-06 23:56:35,721 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 86#(exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-06 23:56:35,722 INFO L193 IcfgInterpreter]: Reachable states at location L6-2 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (= |#NULL.offset| 0) (= |main_~#a~0.offset| 0)) (and (< |main_~#a~0.base| |#StackHeapBarrier|) (= |#length| (store |old(#length)| |main_~#a~0.base| 400000)) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |main_~#a~0.offset|) (<= 0 |#NULL.base|) (<= |main_~#a~0.offset| 0) (not (= 0 |main_~#a~0.base|)) (= 0 (select |old(#valid)| |main_~#a~0.base|)) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (= |#valid| (store |old(#valid)| |main_~#a~0.base| 1)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:56:35,722 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 101#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 0) 42))) (and (= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_7) 0) 42) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:56:37,195 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:56:37,196 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 10] total 395 [2019-10-06 23:56:37,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 395 states [2019-10-06 23:56:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 395 interpolants. [2019-10-06 23:56:37,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73949, Invalid=81681, Unknown=0, NotChecked=0, Total=155630 [2019-10-06 23:56:37,212 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 395 states. [2019-10-06 23:58:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:58:15,674 INFO L93 Difference]: Finished difference Result 415 states and 608 transitions. [2019-10-06 23:58:15,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 394 states. [2019-10-06 23:58:15,675 INFO L78 Accepts]: Start accepts. Automaton has 395 states. Word has length 201 [2019-10-06 23:58:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:58:15,678 INFO L225 Difference]: With dead ends: 415 [2019-10-06 23:58:15,678 INFO L226 Difference]: Without dead ends: 406 [2019-10-06 23:58:15,689 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1185 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102797 ImplicationChecksByTransitivity, 145.9s TimeCoverageRelationStatistics Valid=221838, Invalid=392034, Unknown=0, NotChecked=0, Total=613872 [2019-10-06 23:58:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-06 23:58:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 397. [2019-10-06 23:58:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-06 23:58:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2019-10-06 23:58:15,739 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 201 [2019-10-06 23:58:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:58:15,740 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2019-10-06 23:58:15,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 395 states. [2019-10-06 23:58:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2019-10-06 23:58:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-06 23:58:15,749 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:58:15,749 INFO L385 BasicCegarLoop]: trace histogram [382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:58:15,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:58:15,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:58:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:58:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1971262065, now seen corresponding path program 8 times [2019-10-06 23:58:15,960 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:58:15,961 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:58:15,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:58:15,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:58:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:58:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:59:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:59:08,704 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:59:08,704 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:59:08,705 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true