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_copy4_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:26,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:26,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:26,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:26,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:26,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:26,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:26,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:26,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:26,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:26,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:26,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:26,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:26,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:26,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:26,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:26,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:26,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:26,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:26,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:26,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:26,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:26,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:26,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:26,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:26,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:26,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:26,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:26,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:26,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:26,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:26,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:26,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:26,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:26,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:26,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:26,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:26,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:26,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:26,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:26,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:26,807 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:33:26,823 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:26,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:26,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:26,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:26,824 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:26,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:26,825 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:26,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:26,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:26,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:26,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:26,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:26,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:26,826 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:26,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:26,826 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:26,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:26,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:26,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:26,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:26,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:26,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:26,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:26,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:26,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:26,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:26,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:26,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:26,829 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:33:27,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:27,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:27,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:27,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:27,145 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:27,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_ground-1.i [2019-10-13 21:33:27,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795570f6a/9d0637da68714dc6878840212a71dfbe/FLAG0450883c0 [2019-10-13 21:33:27,707 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:27,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_ground-1.i [2019-10-13 21:33:27,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795570f6a/9d0637da68714dc6878840212a71dfbe/FLAG0450883c0 [2019-10-13 21:33:28,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795570f6a/9d0637da68714dc6878840212a71dfbe [2019-10-13 21:33:28,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:28,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:28,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:28,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:28,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:28,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1afe6458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28, skipping insertion in model container [2019-10-13 21:33:28,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,040 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:28,061 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:28,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:28,245 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:28,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:28,288 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:28,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28 WrapperNode [2019-10-13 21:33:28,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:28,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:28,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:28,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:28,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (1/1) ... [2019-10-13 21:33:28,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:28,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:28,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:28,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:28,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (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:33:28,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:28,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:28,929 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:28,929 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 21:33:28,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:28 BoogieIcfgContainer [2019-10-13 21:33:28,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:28,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:28,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:28,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:28,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:28" (1/3) ... [2019-10-13 21:33:28,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680f6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:28, skipping insertion in model container [2019-10-13 21:33:28,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:28" (2/3) ... [2019-10-13 21:33:28,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680f6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:28, skipping insertion in model container [2019-10-13 21:33:28,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:28" (3/3) ... [2019-10-13 21:33:28,939 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy4_ground-1.i [2019-10-13 21:33:28,950 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:28,958 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:28,973 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:29,010 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:29,010 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:29,010 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:29,011 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:29,011 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:29,011 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:29,012 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:29,012 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:33:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:33:29,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:29,038 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:29,040 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:29,045 INFO L82 PathProgramCache]: Analyzing trace with hash -215443945, now seen corresponding path program 1 times [2019-10-13 21:33:29,052 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:29,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088888572] [2019-10-13 21:33:29,052 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,222 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:33:29,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088888572] [2019-10-13 21:33:29,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:29,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:29,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41179624] [2019-10-13 21:33:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:29,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:29,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:29,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:29,256 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-13 21:33:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:29,320 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2019-10-13 21:33:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:29,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-13 21:33:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:29,335 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:33:29,336 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:33:29,342 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:33:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:33:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:33:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:33:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-13 21:33:29,399 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2019-10-13 21:33:29,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:29,401 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-13 21:33:29,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-10-13 21:33:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:33:29,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:29,405 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:29,405 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:29,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 251755986, now seen corresponding path program 1 times [2019-10-13 21:33:29,407 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:29,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110743082] [2019-10-13 21:33:29,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:29,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110743082] [2019-10-13 21:33:29,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:29,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:29,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414125015] [2019-10-13 21:33:29,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:29,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:29,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:29,514 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 3 states. [2019-10-13 21:33:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:29,552 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-10-13 21:33:29,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:29,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:33:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:29,554 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:33:29,555 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:33:29,556 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:33:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:33:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-13 21:33:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:33:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-13 21:33:29,577 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2019-10-13 21:33:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:29,578 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-13 21:33:29,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-13 21:33:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:33:29,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:29,580 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:29,581 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash -173046538, now seen corresponding path program 1 times [2019-10-13 21:33:29,582 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:29,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257664865] [2019-10-13 21:33:29,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,584 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:29,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:33:29,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257664865] [2019-10-13 21:33:29,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875355050] [2019-10-13 21:33:29,693 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:33:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:29,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:29,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:33:29,854 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:33:29,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [101416934] [2019-10-13 21:33:29,925 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:29,925 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:29,932 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:29,941 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:29,941 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:30,100 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:30,635 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:31,573 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:31,660 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:31,678 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:31,691 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:31,692 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:31,692 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,692 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,693 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,693 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 274#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:31,693 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,693 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(and (<= 100000 main_~a~0) (<= 0 main_~i~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:33:31,694 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,694 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:33:31,694 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:33:31,694 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 279#(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:33:31,695 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:31,695 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,696 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:31,696 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:31,696 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((|v_main_~#a5~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_1| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_1|) |v_main_~#a5~0.offset_BEFORE_CALL_1|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_4)))))) [2019-10-13 21:33:31,696 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:32,031 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:32,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:32,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285356868] [2019-10-13 21:33:32,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:32,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:32,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:32,041 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 18 states. [2019-10-13 21:33:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,766 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2019-10-13 21:33:32,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:32,766 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-10-13 21:33:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,767 INFO L225 Difference]: With dead ends: 57 [2019-10-13 21:33:32,768 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 21:33:32,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 21:33:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-10-13 21:33:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 21:33:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-13 21:33:32,778 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2019-10-13 21:33:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,778 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-13 21:33:32,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-13 21:33:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 21:33:32,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,780 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:32,989 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1320114153, now seen corresponding path program 2 times [2019-10-13 21:33:32,990 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139558394] [2019-10-13 21:33:32,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:33:33,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139558394] [2019-10-13 21:33:33,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763190724] [2019-10-13 21:33:33,119 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:33:33,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:33,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:33,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:33,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:33:33,223 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:33:33,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1916173425] [2019-10-13 21:33:33,271 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:33,271 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:33,271 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:33,272 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:33,272 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:33,307 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:34,292 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:34,384 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:34,397 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:34,403 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:34,404 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:34,404 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,405 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (<= __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:33:34,405 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,405 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 274#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:34,406 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) (<= __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:33:34,406 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(and (<= 100000 main_~a~0) (<= 0 main_~i~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:33:34,408 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,410 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:33:34,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:33:34,411 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 279#(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:33:34,411 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:34,412 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,412 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:34,417 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:34,417 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((v_prenex_6 Int) (|v_main_~#a5~0.base_BEFORE_CALL_2| Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_5) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_2|) |v_main_~#a5~0.offset_BEFORE_CALL_2|))))) [2019-10-13 21:33:34,420 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:34,746 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:34,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:34,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475349381] [2019-10-13 21:33:34,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:34,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:34,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:34,748 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 23 states. [2019-10-13 21:33:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:35,650 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-10-13 21:33:35,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:33:35,651 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-10-13 21:33:35,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:35,652 INFO L225 Difference]: With dead ends: 78 [2019-10-13 21:33:35,653 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 21:33:35,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:33:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 21:33:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-10-13 21:33:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-13 21:33:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2019-10-13 21:33:35,665 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 27 [2019-10-13 21:33:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:35,666 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2019-10-13 21:33:35,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2019-10-13 21:33:35,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:33:35,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:35,667 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:35,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:35,872 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1984188370, now seen corresponding path program 3 times [2019-10-13 21:33:35,873 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:35,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342617416] [2019-10-13 21:33:35,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:35,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:35,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:35,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342617416] [2019-10-13 21:33:35,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771482670] [2019-10-13 21:33:35,998 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 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:33:36,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:36,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:36,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:36,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 21:33:36,150 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 21:33:36,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2081198951] [2019-10-13 21:33:36,270 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:36,270 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:36,270 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:36,271 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:36,271 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:36,306 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:37,122 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:37,130 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:37,135 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:37,135 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:37,135 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:37,136 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) (<= __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:33:37,136 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,136 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 274#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:37,136 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) (<= __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:33:37,137 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(and (<= 100000 main_~a~0) (<= 0 main_~i~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:33:37,137 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,137 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:33:37,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:33:37,137 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 279#(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:33:37,137 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:37,138 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,138 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:37,138 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:37,138 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a5~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_12) (select (select |#memory_int| v_prenex_10) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_3|) |v_main_~#a5~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:33:37,138 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:37,490 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:37,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-13 21:33:37,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580159627] [2019-10-13 21:33:37,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:37,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:37,494 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 31 states. [2019-10-13 21:33:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:38,691 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2019-10-13 21:33:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:33:38,691 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2019-10-13 21:33:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:38,693 INFO L225 Difference]: With dead ends: 105 [2019-10-13 21:33:38,693 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:33:38,697 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:33:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:33:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2019-10-13 21:33:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:33:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2019-10-13 21:33:38,716 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 44 [2019-10-13 21:33:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:38,716 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2019-10-13 21:33:38,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2019-10-13 21:33:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:33:38,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:38,722 INFO L380 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:38,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:38,934 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:38,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:38,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1778924741, now seen corresponding path program 4 times [2019-10-13 21:33:38,935 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:38,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100613986] [2019-10-13 21:33:38,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:39,147 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-13 21:33:39,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100613986] [2019-10-13 21:33:39,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182467421] [2019-10-13 21:33:39,148 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 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:33:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:39,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:39,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:33:39,418 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 21:33:39,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508885013] [2019-10-13 21:33:39,694 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:39,694 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:39,695 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:39,695 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:39,695 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:39,717 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:39,975 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:40,628 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:40,633 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:40,636 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:40,636 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:40,637 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,637 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,637 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,637 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 274#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:40,637 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:40,638 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(and (<= 100000 main_~a~0) (<= 0 main_~i~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:33:40,638 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,638 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:33:40,638 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:33:40,638 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 279#(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:33:40,638 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:40,638 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,639 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:40,639 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:40,639 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a5~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_16)))) (and (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_4|) |v_main_~#a5~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:33:40,639 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:40,982 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:40,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 11] total 46 [2019-10-13 21:33:40,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884417350] [2019-10-13 21:33:40,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-13 21:33:40,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:40,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-13 21:33:40,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1619, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 21:33:40,987 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 46 states. [2019-10-13 21:33:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:42,969 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2019-10-13 21:33:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-13 21:33:42,969 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2019-10-13 21:33:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:42,970 INFO L225 Difference]: With dead ends: 127 [2019-10-13 21:33:42,971 INFO L226 Difference]: Without dead ends: 86 [2019-10-13 21:33:42,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1363, Invalid=6119, Unknown=0, NotChecked=0, Total=7482 [2019-10-13 21:33:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-13 21:33:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2019-10-13 21:33:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-13 21:33:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-10-13 21:33:42,986 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 55 [2019-10-13 21:33:42,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:42,987 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-10-13 21:33:42,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-13 21:33:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-10-13 21:33:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:33:42,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:42,988 INFO L380 BasicCegarLoop]: trace histogram [26, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:43,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:43,193 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash -558595337, now seen corresponding path program 5 times [2019-10-13 21:33:43,194 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:43,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790655249] [2019-10-13 21:33:43,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:43,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:43,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:33:43,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790655249] [2019-10-13 21:33:43,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905532396] [2019-10-13 21:33: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 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:33:44,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:44,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:44,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:33:44,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:33:44,984 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-10-13 21:33:45,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924654789] [2019-10-13 21:33:45,142 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:45,142 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:45,143 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:45,143 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:45,143 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:45,156 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:46,023 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:46,030 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:46,033 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:46,033 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:46,033 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,033 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (<= __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:33:46,034 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,034 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 274#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:46,034 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) (<= __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:33:46,034 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(and (<= 100000 main_~a~0) (<= 0 main_~i~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:33:46,034 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,035 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:33:46,035 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:33:46,035 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 279#(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:33:46,035 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:46,035 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,036 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:46,036 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:46,036 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a5~0.base_BEFORE_CALL_5| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_5|) |v_main_~#a5~0.offset_BEFORE_CALL_5|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18)))))) [2019-10-13 21:33:46,036 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,398 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:46,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 31 [2019-10-13 21:33:46,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984069542] [2019-10-13 21:33:46,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:46,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:46,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:46,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:46,401 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 31 states. [2019-10-13 21:33:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:47,783 INFO L93 Difference]: Finished difference Result 162 states and 210 transitions. [2019-10-13 21:33:47,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 21:33:47,784 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 73 [2019-10-13 21:33:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:47,787 INFO L225 Difference]: With dead ends: 162 [2019-10-13 21:33:47,787 INFO L226 Difference]: Without dead ends: 126 [2019-10-13 21:33:47,791 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 21:33:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-13 21:33:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 117. [2019-10-13 21:33:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-10-13 21:33:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2019-10-13 21:33:47,818 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 73 [2019-10-13 21:33:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:47,819 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2019-10-13 21:33:47,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2019-10-13 21:33:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:33:47,823 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:47,823 INFO L380 BasicCegarLoop]: trace histogram [26, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:48,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:48,026 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:48,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:48,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2141910217, now seen corresponding path program 6 times [2019-10-13 21:33:48,026 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:48,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399638489] [2019-10-13 21:33:48,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:48,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-13 21:33:48,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399638489] [2019-10-13 21:33:48,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751409182] [2019-10-13 21:33:48,496 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 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:33:48,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:48,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:48,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:33:48,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-13 21:33:49,334 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-13 21:33:50,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1321341344] [2019-10-13 21:33:50,559 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:50,559 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:50,560 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:50,560 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:50,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:50,582 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:51,360 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:51,375 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:51,377 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:51,378 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:51,378 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:51,378 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= __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:33:51,378 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,378 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 274#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:51,379 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) (<= __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:33:51,379 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(and (<= 100000 main_~a~0) (<= 0 main_~i~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:33:51,379 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,379 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:33:51,379 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:33:51,380 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 279#(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:33:51,380 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:51,380 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,380 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:33:51,380 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:33:51,380 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((|v_main_~#a5~0.base_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_6|) |v_main_~#a5~0.offset_BEFORE_CALL_6|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22))))) [2019-10-13 21:33:51,381 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:51,874 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:51,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 29, 11] total 85 [2019-10-13 21:33:51,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539366031] [2019-10-13 21:33:51,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-13 21:33:51,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:51,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-13 21:33:51,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1778, Invalid=5362, Unknown=0, NotChecked=0, Total=7140 [2019-10-13 21:33:51,879 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 85 states. [2019-10-13 21:33:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:56,715 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2019-10-13 21:33:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-13 21:33:56,716 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 113 [2019-10-13 21:33:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:56,718 INFO L225 Difference]: With dead ends: 243 [2019-10-13 21:33:56,718 INFO L226 Difference]: Without dead ends: 158 [2019-10-13 21:33:56,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6399 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5366, Invalid=21694, Unknown=0, NotChecked=0, Total=27060 [2019-10-13 21:33:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-13 21:33:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2019-10-13 21:33:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-10-13 21:33:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 154 transitions. [2019-10-13 21:33:56,743 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 154 transitions. Word has length 113 [2019-10-13 21:33:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:56,744 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 154 transitions. [2019-10-13 21:33:56,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-13 21:33:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 154 transitions. [2019-10-13 21:33:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:33:56,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:56,746 INFO L380 BasicCegarLoop]: trace histogram [54, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:56,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:56,952 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:56,953 INFO L82 PathProgramCache]: Analyzing trace with hash 357791387, now seen corresponding path program 7 times [2019-10-13 21:33:56,953 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:56,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935133582] [2019-10-13 21:33:56,953 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:56,954 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:56,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2055 trivial. 0 not checked. [2019-10-13 21:33:57,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935133582] [2019-10-13 21:33:57,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393191541] [2019-10-13 21:33:57,563 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 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:33:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:57,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-13 21:33:57,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-13 21:33:59,343 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:34:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-10-13 21:34:02,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1571546348] [2019-10-13 21:34:02,986 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:34:02,986 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:34:02,986 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:34:02,986 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:34:02,987 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:34:03,002 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:34:03,814 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:34:03,821 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:34:03,823 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:34:03,823 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:34:03,824 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-13 21:34:03,824 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (<= __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) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-13 21:34:03,824 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,824 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 274#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:34:03,824 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (<= __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) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27))))))) [2019-10-13 21:34:03,825 INFO L193 IcfgInterpreter]: Reachable states at location L28-3 satisfy 245#(and (<= 100000 main_~a~0) (<= 0 main_~i~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:34:03,825 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,825 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:34:03,825 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:34:03,825 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 279#(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:34:03,826 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:34:03,826 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:03,826 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* main_~x~0 4) |main_~#a5~0.offset|))) (<= 0 main_~x~0)) [2019-10-13 21:34:03,826 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-13 21:34:03,826 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a5~0.offset_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a5~0.base_BEFORE_CALL_7| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_7|) |v_main_~#a5~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_26) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_27)))))) [2019-10-13 21:34:03,826 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:34:04,437 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:34:04,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 57, 57, 11] total 142 [2019-10-13 21:34:04,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270414338] [2019-10-13 21:34:04,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-10-13 21:34:04,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:34:04,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-10-13 21:34:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6475, Invalid=13547, Unknown=0, NotChecked=0, Total=20022 [2019-10-13 21:34:04,445 INFO L87 Difference]: Start difference. First operand 149 states and 154 transitions. Second operand 142 states.