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_vararg_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:36:37,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:36:37,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:36:37,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:36:37,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:36:37,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:36:37,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:36:37,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:36:37,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:36:37,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:36:37,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:36:37,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:36:37,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:36:37,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:36:37,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:36:37,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:36:37,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:36:37,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:36:37,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:36:37,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:36:37,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:36:37,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:36:37,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:36:37,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:36:37,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:36:37,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:36:37,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:36:37,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:36:37,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:36:37,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:36:37,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:36:37,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:36:37,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:36:37,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:36:37,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:36:37,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:36:37,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:36:37,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:36:37,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:36:37,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:36:37,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:36:37,924 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-13 21:36:37,951 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:36:37,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:36:37,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:36:37,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:36:37,956 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:36:37,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:36:37,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:36:37,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:36:37,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:36:37,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:36:37,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:36:37,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:36:37,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:36:37,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:36:37,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:36:37,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:36:37,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:36:37,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:36:37,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:36:37,961 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:36:37,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:36:37,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:36:37,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:36:37,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:36:37,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:36:37,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:36:37,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:36:37,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:36:37,963 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-13 21:36:38,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:36:38,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:36:38,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:36:38,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:36:38,311 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:36:38,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-10-13 21:36:38,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685eb6ab1/78bc1c4511a140ffbe5fcb9f3dde462f/FLAGeb27b8815 [2019-10-13 21:36:38,809 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:36:38,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-10-13 21:36:38,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685eb6ab1/78bc1c4511a140ffbe5fcb9f3dde462f/FLAGeb27b8815 [2019-10-13 21:36:39,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685eb6ab1/78bc1c4511a140ffbe5fcb9f3dde462f [2019-10-13 21:36:39,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:36:39,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:36:39,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:39,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:36:39,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:36:39,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac730e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39, skipping insertion in model container [2019-10-13 21:36:39,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,249 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:36:39,270 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:36:39,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:39,452 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:36:39,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:39,489 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:36:39,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39 WrapperNode [2019-10-13 21:36:39,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:39,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:36:39,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:36:39,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:36:39,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (1/1) ... [2019-10-13 21:36:39,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:36:39,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:36:39,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:36:39,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:36:39,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (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-13 21:36:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:36:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:36:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:36:39,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:36:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:36:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:36:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:36:39,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:36:39,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:36:39,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:36:39,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:36:39,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:36:39,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:36:39,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:36:40,001 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:36:40,002 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:36:40,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:40 BoogieIcfgContainer [2019-10-13 21:36:40,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:36:40,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:36:40,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:36:40,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:36:40,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:36:39" (1/3) ... [2019-10-13 21:36:40,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30992cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:40, skipping insertion in model container [2019-10-13 21:36:40,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:39" (2/3) ... [2019-10-13 21:36:40,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30992cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:40, skipping insertion in model container [2019-10-13 21:36:40,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:40" (3/3) ... [2019-10-13 21:36:40,015 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_vararg_ground.i [2019-10-13 21:36:40,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:36:40,036 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:36:40,046 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:36:40,067 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:36:40,067 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:36:40,067 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:36:40,067 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:36:40,067 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:36:40,067 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:36:40,067 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:36:40,067 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:36:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:36:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:36:40,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:40,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:40,092 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash -226467410, now seen corresponding path program 1 times [2019-10-13 21:36:40,104 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:40,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345878364] [2019-10-13 21:36:40,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:40,234 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-13 21:36:40,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345878364] [2019-10-13 21:36:40,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:40,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 21:36:40,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382804729] [2019-10-13 21:36:40,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 21:36:40,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 21:36:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:36:40,261 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-13 21:36:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:40,286 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-13 21:36:40,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 21:36:40,287 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-13 21:36:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:40,296 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:36:40,297 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:36:40,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 21:36:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:36:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:36:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:36:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:36:40,350 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:36:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:40,351 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:36:40,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 21:36:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:36:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:36:40,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:40,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:40,354 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash 972942376, now seen corresponding path program 1 times [2019-10-13 21:36:40,355 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:40,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553420196] [2019-10-13 21:36:40,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:40,436 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-13 21:36:40,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553420196] [2019-10-13 21:36:40,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:40,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:40,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682434639] [2019-10-13 21:36:40,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:40,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:40,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:40,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:40,441 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-13 21:36:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:40,479 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-13 21:36:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:40,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:36:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:40,482 INFO L225 Difference]: With dead ends: 31 [2019-10-13 21:36:40,482 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:36:40,484 INFO L600 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-13 21:36:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:36:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:36:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:36:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-13 21:36:40,491 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-13 21:36:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:40,491 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-13 21:36:40,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-13 21:36:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:36:40,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:40,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:40,495 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2103799838, now seen corresponding path program 1 times [2019-10-13 21:36:40,496 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:40,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994575664] [2019-10-13 21:36:40,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,497 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:40,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:40,623 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-13 21:36:40,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994575664] [2019-10-13 21:36:40,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218525712] [2019-10-13 21:36:40,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:40,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:36:40,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:40,767 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-13 21:36:40,768 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:40,814 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-13 21:36:40,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1607935263] [2019-10-13 21:36:40,864 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:36:40,867 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:40,874 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:40,883 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:40,884 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:41,105 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:41,365 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 21:36:41,392 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:41,406 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:41,407 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:41,408 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 83#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:41,408 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 103#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:41,409 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:41,409 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 108#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|))))) (<= 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-13 21:36:41,410 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 117#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:41,410 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 78#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-13 21:36:41,410 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 88#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:41,411 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-13 21:36:41,411 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-13 21:36:41,412 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 122#(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-13 21:36:41,413 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:41,413 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:41,413 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (< main_~x~0 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (not (< main_~i~0 100000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:41,414 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 98#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|))))) [2019-10-13 21:36:41,414 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 113#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* v_main_~a~0_BEFORE_CALL_1 4) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|))))) (<= 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-13 21:36:41,844 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:41,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 19 [2019-10-13 21:36:41,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635976889] [2019-10-13 21:36:41,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:36:41,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:41,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:36:41,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:36:41,849 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 19 states. [2019-10-13 21:36:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:43,017 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-10-13 21:36:43,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:36:43,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-10-13 21:36:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:43,019 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:36:43,019 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:36:43,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:36:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:36:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-13 21:36:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:36:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 21:36:43,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-13 21:36:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:43,029 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 21:36:43,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:36:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 21:36:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:36:43,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:43,030 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:43,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:43,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1715848792, now seen corresponding path program 2 times [2019-10-13 21:36:43,236 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:43,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350760689] [2019-10-13 21:36:43,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:43,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:43,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:43,343 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-13 21:36:43,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350760689] [2019-10-13 21:36:43,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608232916] [2019-10-13 21:36:43,344 INFO L92 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-13 21:36:43,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-13 21:36:43,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:43,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:36:43,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:36:43,408 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:36:43,428 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:36:43,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 10 [2019-10-13 21:36:43,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588610692] [2019-10-13 21:36:43,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:36:43,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:36:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:36:43,430 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-13 21:36:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:43,449 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-10-13 21:36:43,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:36:43,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 21:36:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:43,450 INFO L225 Difference]: With dead ends: 35 [2019-10-13 21:36:43,450 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:36:43,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:36:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:36:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-13 21:36:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:36:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:36:43,457 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2019-10-13 21:36:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:43,458 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:36:43,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:36:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:36:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:36:43,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:43,459 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:43,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:43,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2017594605, now seen corresponding path program 1 times [2019-10-13 21:36:43,663 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:43,663 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799781362] [2019-10-13 21:36:43,664 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:43,664 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:43,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:36:43,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799781362] [2019-10-13 21:36:43,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504017275] [2019-10-13 21:36:43,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 21:36:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:43,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:36:43,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:36:43,826 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:36:43,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [871243224] [2019-10-13 21:36:43,892 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:36:43,892 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:43,892 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:43,893 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:43,894 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:43,934 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:44,076 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 21:36:44,109 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:44,114 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:44,127 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:44,133 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:44,134 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:44,135 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 109#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:44,135 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:44,135 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:44,135 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-13 21:36:44,136 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 98#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:44,136 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-13 21:36:44,137 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-13 21:36:44,138 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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-13 21:36:44,138 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:44,138 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:44,138 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 103#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (< main_~x~0 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (not (< main_~i~0 100000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:44,139 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))))) [2019-10-13 21:36:44,139 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* v_main_~a~0_BEFORE_CALL_2 4) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:44,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:44,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-13 21:36:44,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070473319] [2019-10-13 21:36:44,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:36:44,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:44,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:36:44,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:36:44,585 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 25 states. [2019-10-13 21:36:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:45,363 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-10-13 21:36:45,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:36:45,364 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2019-10-13 21:36:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:45,365 INFO L225 Difference]: With dead ends: 53 [2019-10-13 21:36:45,365 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:36:45,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:36:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:36:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-10-13 21:36:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:36:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-13 21:36:45,373 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 20 [2019-10-13 21:36:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:45,373 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-13 21:36:45,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:36:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-13 21:36:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:36:45,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:45,374 INFO L380 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:45,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:45,578 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:45,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash 174016813, now seen corresponding path program 2 times [2019-10-13 21:36:45,579 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:45,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546797978] [2019-10-13 21:36:45,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:45,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:45,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:36:45,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546797978] [2019-10-13 21:36:45,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952954079] [2019-10-13 21:36:45,780 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:36:45,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:36:45,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:45,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 21:36:45,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:36:45,990 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:36:46,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [930736186] [2019-10-13 21:36:46,140 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:36:46,141 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:46,141 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:46,141 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:46,142 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:46,176 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:46,259 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 21:36:46,268 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:46,273 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:46,273 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:46,274 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:46,274 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:46,274 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 109#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:46,274 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:46,275 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:46,275 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-13 21:36:46,275 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 98#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:46,275 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-13 21:36:46,275 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-13 21:36:46,276 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:46,276 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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-13 21:36:46,276 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:46,276 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:46,277 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 103#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (< main_~x~0 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (not (< main_~i~0 100000)) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:36:46,277 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* v_main_~a~0_BEFORE_CALL_3 4))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:36:46,878 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:46,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9, 13] total 38 [2019-10-13 21:36:46,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801117392] [2019-10-13 21:36:46,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-13 21:36:46,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-13 21:36:46,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 21:36:46,881 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 38 states. [2019-10-13 21:36:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:48,354 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-10-13 21:36:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:36:48,354 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 26 [2019-10-13 21:36:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:48,356 INFO L225 Difference]: With dead ends: 52 [2019-10-13 21:36:48,356 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 21:36:48,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=455, Invalid=3205, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:36:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 21:36:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-13 21:36:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:36:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-13 21:36:48,367 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2019-10-13 21:36:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:48,367 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-13 21:36:48,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-13 21:36:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-13 21:36:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 21:36:48,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:48,369 INFO L380 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:48,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:48,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash 734264083, now seen corresponding path program 1 times [2019-10-13 21:36:48,573 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:48,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411839673] [2019-10-13 21:36:48,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:48,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:48,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:36:48,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411839673] [2019-10-13 21:36:48,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217380717] [2019-10-13 21:36:48,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-13 21:36:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:48,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 21:36:48,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:36:48,826 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:36:49,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1307442554] [2019-10-13 21:36:49,049 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:36:49,049 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:49,050 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:49,050 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:49,050 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:49,078 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:49,340 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:49,372 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:49,378 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:49,378 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:49,379 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:49,379 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_10) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,379 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:49,380 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_10) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,380 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:49,380 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_10) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,380 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-13 21:36:49,381 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:36:49,381 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-13 21:36:49,381 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-13 21:36:49,382 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:49,382 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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-13 21:36:49,383 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:49,383 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:36:49,383 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_10) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,384 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:36:49,384 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_10) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) [2019-10-13 21:36:49,385 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_10) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* v_main_~x~0_BEFORE_CALL_10 4) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:49,852 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:49,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 15] total 41 [2019-10-13 21:36:49,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570839796] [2019-10-13 21:36:49,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-13 21:36:49,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:49,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-13 21:36:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1245, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:36:49,857 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 41 states. [2019-10-13 21:36:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:51,296 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-10-13 21:36:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-13 21:36:51,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 34 [2019-10-13 21:36:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:51,300 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:36:51,301 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 21:36:51,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1138, Invalid=4562, Unknown=0, NotChecked=0, Total=5700 [2019-10-13 21:36:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 21:36:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-13 21:36:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 21:36:51,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-13 21:36:51,312 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 34 [2019-10-13 21:36:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:51,312 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-13 21:36:51,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-13 21:36:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-13 21:36:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 21:36:51,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:51,314 INFO L380 BasicCegarLoop]: trace histogram [24, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:51,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:51,520 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:51,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash -969830519, now seen corresponding path program 2 times [2019-10-13 21:36:51,521 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:51,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842130721] [2019-10-13 21:36:51,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:51,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:51,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 2 proven. 300 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:36:51,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842130721] [2019-10-13 21:36:51,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111949415] [2019-10-13 21:36:51,928 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-13 21:36:51,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:36:51,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:51,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:36:52,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 21:36:52,097 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 21:36:52,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1762607642] [2019-10-13 21:36:52,191 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:36:52,191 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:52,193 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:52,194 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:52,194 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:52,236 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:52,424 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:52,432 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:52,436 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:52,436 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:52,436 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:52,437 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.base_BEFORE_CALL_19| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_19| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:52,437 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:52,437 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.base_BEFORE_CALL_19| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_19| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:52,437 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:52,437 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.base_BEFORE_CALL_19| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_19| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:52,438 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-13 21:36:52,438 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:36:52,438 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-13 21:36:52,438 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-13 21:36:52,439 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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-13 21:36:52,439 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:52,439 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:52,439 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:36:52,439 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.base_BEFORE_CALL_19| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_19| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:52,440 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:36:52,440 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.base_BEFORE_CALL_19| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_19| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|))))))) [2019-10-13 21:36:52,440 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.base_BEFORE_CALL_19| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_19| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_19|) (+ (* v_main_~x~0_BEFORE_CALL_21 4) |v_main_~#aa~0.offset_BEFORE_CALL_19|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:53,200 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:53,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 6, 6, 15] total 47 [2019-10-13 21:36:53,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534417860] [2019-10-13 21:36:53,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-13 21:36:53,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:53,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-13 21:36:53,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1747, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:36:53,204 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 47 states. [2019-10-13 21:36:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:55,944 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2019-10-13 21:36:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-13 21:36:55,945 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-10-13 21:36:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:55,946 INFO L225 Difference]: With dead ends: 78 [2019-10-13 21:36:55,947 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 21:36:55,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1403, Invalid=7153, Unknown=0, NotChecked=0, Total=8556 [2019-10-13 21:36:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 21:36:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-13 21:36:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 21:36:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-13 21:36:55,964 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 47 [2019-10-13 21:36:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:55,964 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-13 21:36:55,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-13 21:36:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-13 21:36:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:36:55,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:55,966 INFO L380 BasicCegarLoop]: trace histogram [25, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:56,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:56,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 204161582, now seen corresponding path program 3 times [2019-10-13 21:36:56,175 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:56,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370476420] [2019-10-13 21:36:56,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:56,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:56,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:36:56,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370476420] [2019-10-13 21:36:56,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708557991] [2019-10-13 21:36:56,551 INFO L92 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 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-13 21:36:56,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:56,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:56,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 21:36:56,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:36:56,674 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 2 proven. 325 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:36:57,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1660786508] [2019-10-13 21:36:57,495 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:36:57,495 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:57,496 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:57,496 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:57,496 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:57,524 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:57,666 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:57,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:57,681 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:57,682 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:57,682 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:57,682 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((v_main_~x~0_BEFORE_CALL_30 Int) (|v_main_~#aa~0.base_BEFORE_CALL_28| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_30) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))) (<= 0 v_main_~x~0_BEFORE_CALL_30)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:57,682 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:57,683 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_30 Int) (|v_main_~#aa~0.base_BEFORE_CALL_28| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_30) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))) (<= 0 v_main_~x~0_BEFORE_CALL_30)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:57,683 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:57,683 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_30 Int) (|v_main_~#aa~0.base_BEFORE_CALL_28| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_30) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))) (<= 0 v_main_~x~0_BEFORE_CALL_30)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:57,683 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-13 21:36:57,683 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:36:57,684 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-13 21:36:57,684 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-13 21:36:57,684 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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-13 21:36:57,684 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:36:57,684 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:57,684 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:36:57,685 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_30 Int) (|v_main_~#aa~0.base_BEFORE_CALL_28| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_30) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))) (<= 0 v_main_~x~0_BEFORE_CALL_30)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:57,685 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:36:57,685 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((v_main_~x~0_BEFORE_CALL_30 Int) (|v_main_~#aa~0.base_BEFORE_CALL_28| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_30) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))) (<= 0 v_main_~x~0_BEFORE_CALL_30)))) [2019-10-13 21:36:57,685 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_30 Int) (|v_main_~#aa~0.base_BEFORE_CALL_28| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_28| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_30) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_28|) (+ (* v_main_~x~0_BEFORE_CALL_30 4) |v_main_~#aa~0.offset_BEFORE_CALL_28|))) (<= 0 v_main_~x~0_BEFORE_CALL_30)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:58,186 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:58,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28, 15] total 69 [2019-10-13 21:36:58,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317423891] [2019-10-13 21:36:58,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:36:58,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:36:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1529, Invalid=3163, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:36:58,191 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 69 states. [2019-10-13 21:37:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:01,355 INFO L93 Difference]: Finished difference Result 102 states and 132 transitions. [2019-10-13 21:37:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-13 21:37:01,355 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 50 [2019-10-13 21:37:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:01,357 INFO L225 Difference]: With dead ends: 102 [2019-10-13 21:37:01,358 INFO L226 Difference]: Without dead ends: 80 [2019-10-13 21:37:01,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4268 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4484, Invalid=12808, Unknown=0, NotChecked=0, Total=17292 [2019-10-13 21:37:01,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-13 21:37:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-13 21:37:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 21:37:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-10-13 21:37:01,374 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 50 [2019-10-13 21:37:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:01,375 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-10-13 21:37:01,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:37:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-10-13 21:37:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 21:37:01,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:01,377 INFO L380 BasicCegarLoop]: trace histogram [52, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:01,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:01,581 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:01,582 INFO L82 PathProgramCache]: Analyzing trace with hash 545033060, now seen corresponding path program 4 times [2019-10-13 21:37:01,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:01,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78498470] [2019-10-13 21:37:01,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:01,583 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:01,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 2 proven. 1378 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:37:02,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78498470] [2019-10-13 21:37:02,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58087642] [2019-10-13 21:37:02,813 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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 [2019-10-13 21:37:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:02,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-13 21:37:02,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:37:02,992 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 2 proven. 1378 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:37:06,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [269153368] [2019-10-13 21:37:06,946 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-13 21:37:06,946 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:06,946 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:06,947 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:06,947 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:06,973 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:07,119 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:37:07,127 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:07,131 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:07,131 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:07,131 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:37:07,132 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.offset_BEFORE_CALL_37| Int) (v_main_~x~0_BEFORE_CALL_39 Int) (|v_main_~#aa~0.base_BEFORE_CALL_37| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4)))) (<= 0 v_main_~x~0_BEFORE_CALL_39)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4))))) (<= 0 v_main_~x~0_BEFORE_CALL_39)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,132 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:37:07,132 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.offset_BEFORE_CALL_37| Int) (v_main_~x~0_BEFORE_CALL_39 Int) (|v_main_~#aa~0.base_BEFORE_CALL_37| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4)))) (<= 0 v_main_~x~0_BEFORE_CALL_39)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4))))) (<= 0 v_main_~x~0_BEFORE_CALL_39)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,132 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:07,132 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.offset_BEFORE_CALL_37| Int) (v_main_~x~0_BEFORE_CALL_39 Int) (|v_main_~#aa~0.base_BEFORE_CALL_37| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4)))) (<= 0 v_main_~x~0_BEFORE_CALL_39)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4))))) (<= 0 v_main_~x~0_BEFORE_CALL_39)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,132 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* main_~a~0 4))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-13 21:37:07,133 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-13 21:37:07,133 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-13 21:37:07,133 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-13 21:37:07,133 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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-13 21:37:07,133 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:37:07,134 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:07,138 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:37:07,141 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.offset_BEFORE_CALL_37| Int) (v_main_~x~0_BEFORE_CALL_39 Int) (|v_main_~#aa~0.base_BEFORE_CALL_37| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4)))) (<= 0 v_main_~x~0_BEFORE_CALL_39)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4))))) (<= 0 v_main_~x~0_BEFORE_CALL_39)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,141 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* main_~x~0 4) |main_~#aa~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:37:07,141 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_37| Int) (v_main_~x~0_BEFORE_CALL_39 Int) (|v_main_~#aa~0.base_BEFORE_CALL_37| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4)))) (<= 0 v_main_~x~0_BEFORE_CALL_39)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4))))) (<= 0 v_main_~x~0_BEFORE_CALL_39)))) [2019-10-13 21:37:07,142 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.offset_BEFORE_CALL_37| Int) (v_main_~x~0_BEFORE_CALL_39 Int) (|v_main_~#aa~0.base_BEFORE_CALL_37| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4)))) (<= 0 v_main_~x~0_BEFORE_CALL_39)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_37|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_37| (* v_main_~x~0_BEFORE_CALL_39 4))))) (<= 0 v_main_~x~0_BEFORE_CALL_39)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:07,843 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:07,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55, 15] total 123 [2019-10-13 21:37:07,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751292564] [2019-10-13 21:37:07,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-10-13 21:37:07,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:07,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-10-13 21:37:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5930, Invalid=9076, Unknown=0, NotChecked=0, Total=15006 [2019-10-13 21:37:07,851 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 123 states. [2019-10-13 21:37:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:17,055 INFO L93 Difference]: Finished difference Result 156 states and 213 transitions. [2019-10-13 21:37:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-10-13 21:37:17,056 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 77 [2019-10-13 21:37:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:17,058 INFO L225 Difference]: With dead ends: 156 [2019-10-13 21:37:17,058 INFO L226 Difference]: Without dead ends: 134 [2019-10-13 21:37:17,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12152 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=17579, Invalid=39781, Unknown=0, NotChecked=0, Total=57360 [2019-10-13 21:37:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-13 21:37:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-10-13 21:37:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-13 21:37:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-10-13 21:37:17,081 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 77 [2019-10-13 21:37:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:17,081 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-10-13 21:37:17,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-10-13 21:37:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-10-13 21:37:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:37:17,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:17,084 INFO L380 BasicCegarLoop]: trace histogram [106, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:17,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:17,289 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash 443004196, now seen corresponding path program 5 times [2019-10-13 21:37:17,290 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:17,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404856471] [2019-10-13 21:37:17,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:17,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:17,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat