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-36ac518-m [2019-10-06 23:31:07,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:31:07,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:31:07,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:31:07,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:31:07,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:31:07,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:31:07,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:31:07,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:31:07,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:31:07,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:31:07,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:31:07,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:31:07,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:31:07,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:31:07,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:31:07,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:31:07,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:31:07,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:31:07,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:31:07,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:31:07,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:31:07,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:31:07,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:31:07,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:31:07,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:31:07,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:31:07,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:31:07,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:31:07,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:31:07,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:31:07,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:31:07,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:31:07,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:31:07,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:31:07,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:31:07,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:31:07,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:31:07,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:31:07,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:31:07,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:31:07,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:31:07,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:31:07,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:31:07,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:31:07,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:31:07,963 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:31:07,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:31:07,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:31:07,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:31:07,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:31:07,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:31:07,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:31:07,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:31:07,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:31:07,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:31:07,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:31:07,967 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:31:07,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:31:07,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:31:07,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:31:07,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:31:07,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:31:07,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:31:07,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:31:07,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:31:07,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:31:07,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:31:07,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:31:07,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:31:07,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:31:08,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:31:08,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:31:08,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:31:08,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:31:08,277 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:31:08,277 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-06 23:31:08,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e215c380/644579f726234923a3123f55218d991c/FLAG4aa4ea4b3 [2019-10-06 23:31:08,803 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:31:08,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_ground-1.i [2019-10-06 23:31:08,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e215c380/644579f726234923a3123f55218d991c/FLAG4aa4ea4b3 [2019-10-06 23:31:09,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e215c380/644579f726234923a3123f55218d991c [2019-10-06 23:31:09,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:31:09,183 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:31:09,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:09,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:31:09,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:31:09,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed6f910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09, skipping insertion in model container [2019-10-06 23:31:09,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,200 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:31:09,218 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:31:09,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:09,411 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:31:09,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:31:09,465 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:31:09,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09 WrapperNode [2019-10-06 23:31:09,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:31:09,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:31:09,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:31:09,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:31:09,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... [2019-10-06 23:31:09,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:31:09,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:31:09,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:31:09,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:31:09,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:31:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:31:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:31:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:31:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:31:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:31:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:31:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:31:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:31:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:31:09,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:31:09,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:31:09,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:31:09,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:31:09,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:31:10,113 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:31:10,114 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-06 23:31:10,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:10 BoogieIcfgContainer [2019-10-06 23:31:10,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:31:10,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:31:10,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:31:10,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:31:10,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:31:09" (1/3) ... [2019-10-06 23:31:10,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465cb0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:10, skipping insertion in model container [2019-10-06 23:31:10,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:31:09" (2/3) ... [2019-10-06 23:31:10,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465cb0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:31:10, skipping insertion in model container [2019-10-06 23:31:10,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:31:10" (3/3) ... [2019-10-06 23:31:10,123 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy4_ground-1.i [2019-10-06 23:31:10,133 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:31:10,141 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:31:10,154 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:31:10,187 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:31:10,188 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:31:10,188 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:31:10,188 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:31:10,188 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:31:10,188 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:31:10,188 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:31:10,188 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:31:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-06 23:31:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:31:10,209 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:10,210 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:10,212 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash -215443945, now seen corresponding path program 1 times [2019-10-06 23:31:10,227 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:10,227 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:10,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:10,228 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:10,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:31:10,400 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:10,400 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:10,401 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:10,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:10,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:10,422 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-06 23:31:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:10,456 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2019-10-06 23:31:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:10,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-06 23:31:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:10,467 INFO L225 Difference]: With dead ends: 39 [2019-10-06 23:31:10,468 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:31:10,471 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:31:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:31:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:31:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-10-06 23:31:10,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2019-10-06 23:31:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:10,514 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-10-06 23:31:10,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2019-10-06 23:31:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:31:10,515 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:10,516 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:10,516 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 251755986, now seen corresponding path program 1 times [2019-10-06 23:31:10,517 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:10,517 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:10,517 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:10,518 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:10,575 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-06 23:31:10,575 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:10,576 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:31:10,576 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:31:10,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:31:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:31:10,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:10,581 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand 3 states. [2019-10-06 23:31:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:10,619 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2019-10-06 23:31:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:31:10,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:31:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:10,622 INFO L225 Difference]: With dead ends: 36 [2019-10-06 23:31:10,622 INFO L226 Difference]: Without dead ends: 24 [2019-10-06 23:31:10,624 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:31:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-06 23:31:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-06 23:31:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:31:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-06 23:31:10,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2019-10-06 23:31:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:10,638 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-06 23:31:10,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:31:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-06 23:31:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:31:10,639 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:10,639 INFO L385 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-06 23:31:10,640 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:10,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash -173046538, now seen corresponding path program 1 times [2019-10-06 23:31:10,640 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:10,641 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:10,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:10,642 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:10,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:10,774 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-06 23:31:10,774 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:10,774 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:10,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:31:10,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:10,914 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-06 23:31:10,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:10,956 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-06 23:31:10,956 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:10,982 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:10,983 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:10,990 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:10,998 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:10,998 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:11,148 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:12,439 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:12,450 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:12,455 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:12,455 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:12,455 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-06 23:31:12,456 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:12,456 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-06 23:31:12,456 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-06 23:31:12,457 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-06 23:31:12,457 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-06 23:31:12,457 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:12,457 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:12,457 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:12,458 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-06 23:31:12,458 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:12,458 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:12,458 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:12,459 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:31:12,459 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-06 23:31:12,459 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:12,845 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:12,845 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:31:12,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:31:12,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:31:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:31:12,852 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 18 states. [2019-10-06 23:31:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:13,584 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2019-10-06 23:31:13,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:31:13,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2019-10-06 23:31:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:13,586 INFO L225 Difference]: With dead ends: 57 [2019-10-06 23:31:13,586 INFO L226 Difference]: Without dead ends: 40 [2019-10-06 23:31:13,587 INFO L606 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-06 23:31:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-06 23:31:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-10-06 23:31:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-06 23:31:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-06 23:31:13,596 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 20 [2019-10-06 23:31:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:13,596 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-06 23:31:13,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:31:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-06 23:31:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:31:13,598 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:13,598 INFO L385 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-06 23:31:13,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:13,804 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1320114153, now seen corresponding path program 2 times [2019-10-06 23:31:13,805 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:13,805 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:13,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:13,806 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:13,897 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-06 23:31:13,897 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:13,897 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:13,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:13,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:31:13,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:13,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:31:13,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:13,984 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-06 23:31:13,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:14,010 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-06 23:31:14,011 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:14,014 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:14,014 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:14,015 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:14,015 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:14,015 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:14,057 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:14,645 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:31:15,188 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:15,196 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:15,200 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:15,200 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:15,201 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-06 23:31:15,201 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-06 23:31:15,201 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:15,201 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-06 23:31:15,202 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-06 23:31:15,202 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-06 23:31:15,202 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:15,202 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:15,202 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:15,203 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-06 23:31:15,203 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:15,203 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:15,203 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:15,204 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:31:15,204 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-06 23:31:15,204 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:15,496 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:15,496 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-06 23:31:15,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:31:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:31:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:31:15,508 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 19 states. [2019-10-06 23:31:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:16,194 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2019-10-06 23:31:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:31:16,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-10-06 23:31:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:16,196 INFO L225 Difference]: With dead ends: 74 [2019-10-06 23:31:16,196 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:31:16,197 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:31:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:31:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-10-06 23:31:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-06 23:31:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-10-06 23:31:16,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 27 [2019-10-06 23:31:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:16,209 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-10-06 23:31:16,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:31:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-10-06 23:31:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-06 23:31:16,211 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:16,211 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:16,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:16,416 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:16,417 INFO L82 PathProgramCache]: Analyzing trace with hash -908067177, now seen corresponding path program 3 times [2019-10-06 23:31:16,417 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:16,417 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:16,418 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:16,418 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-06 23:31:16,586 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:16,587 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:16,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:16,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:16,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:16,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:31:16,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:16,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-06 23:31:16,823 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:16,824 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:16,825 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:16,825 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:16,825 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:16,826 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:16,856 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:17,700 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:17,709 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:17,715 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:17,715 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:17,715 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-06 23:31:17,716 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-06 23:31:17,716 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:17,716 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-06 23:31:17,716 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-06 23:31:17,717 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-06 23:31:17,717 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:17,717 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:17,717 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:17,718 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-06 23:31:17,718 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:17,718 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:17,718 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:17,718 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:31:17,719 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-06 23:31:17,719 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:18,078 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:18,079 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-06 23:31:18,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:31:18,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:31:18,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:31:18,082 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 29 states. [2019-10-06 23:31:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:19,323 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-10-06 23:31:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-06 23:31:19,324 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 43 [2019-10-06 23:31:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:19,325 INFO L225 Difference]: With dead ends: 103 [2019-10-06 23:31:19,325 INFO L226 Difference]: Without dead ends: 66 [2019-10-06 23:31:19,327 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:31:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-06 23:31:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2019-10-06 23:31:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-06 23:31:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-10-06 23:31:19,351 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 43 [2019-10-06 23:31:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:19,351 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-10-06 23:31:19,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:31:19,351 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-10-06 23:31:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-06 23:31:19,355 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:19,355 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:19,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:19,562 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:19,563 INFO L82 PathProgramCache]: Analyzing trace with hash 15684571, now seen corresponding path program 4 times [2019-10-06 23:31:19,563 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:19,563 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:19,563 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:19,564 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:19,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-06 23:31:19,737 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:19,737 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:19,737 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:19,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:31:19,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-06 23:31:19,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-06 23:31:20,044 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:20,046 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:20,046 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:20,046 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:20,047 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:20,047 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:20,073 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:20,715 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:31:20,990 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:20,997 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:21,000 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:21,000 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:21,000 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-06 23:31:21,001 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-06 23:31:21,001 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:21,001 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-06 23:31:21,001 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-06 23:31:21,001 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-06 23:31:21,002 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:21,002 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:21,002 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:21,002 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-06 23:31:21,002 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:21,003 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:21,003 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:21,003 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:31:21,003 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-06 23:31:21,003 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:21,293 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:21,294 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-06 23:31:21,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:31:21,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:31:21,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:31:21,297 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 35 states. [2019-10-06 23:31:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:22,600 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2019-10-06 23:31:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:31:22,601 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 53 [2019-10-06 23:31:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:22,603 INFO L225 Difference]: With dead ends: 119 [2019-10-06 23:31:22,603 INFO L226 Difference]: Without dead ends: 78 [2019-10-06 23:31:22,605 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:31:22,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-06 23:31:22,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2019-10-06 23:31:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-06 23:31:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-10-06 23:31:22,617 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 53 [2019-10-06 23:31:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:22,617 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-10-06 23:31:22,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:31:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-10-06 23:31:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-06 23:31:22,618 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:22,619 INFO L385 BasicCegarLoop]: trace histogram [22, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:22,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:22,822 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1823291365, now seen corresponding path program 5 times [2019-10-06 23:31:22,823 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:22,824 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:22,824 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:22,824 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-06 23:31:23,163 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:23,163 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:23,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:26,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:31:26,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:26,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-06 23:31:26,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-06 23:31:26,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-10-06 23:31:27,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:27,020 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:27,020 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:27,020 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:27,020 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:27,021 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:27,040 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:27,271 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:31:27,916 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:31:27,967 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:27,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:27,977 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:27,978 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:27,978 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-06 23:31:27,978 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-06 23:31:27,979 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:27,979 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-06 23:31:27,979 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-06 23:31:27,979 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-06 23:31:27,979 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:27,980 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:27,980 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:31:27,980 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-06 23:31:27,980 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:27,980 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:27,980 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:27,981 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:31:27,981 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-06 23:31:27,981 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:28,471 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:28,471 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 10, 11] total 51 [2019-10-06 23:31:28,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-06 23:31:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-06 23:31:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=2069, Unknown=0, NotChecked=0, Total=2550 [2019-10-06 23:31:28,475 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 51 states. [2019-10-06 23:31:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:31,387 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2019-10-06 23:31:31,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-06 23:31:31,387 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 65 [2019-10-06 23:31:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:31,389 INFO L225 Difference]: With dead ends: 156 [2019-10-06 23:31:31,390 INFO L226 Difference]: Without dead ends: 115 [2019-10-06 23:31:31,393 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1469, Invalid=7843, Unknown=0, NotChecked=0, Total=9312 [2019-10-06 23:31:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-06 23:31:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2019-10-06 23:31:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-06 23:31:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-10-06 23:31:31,408 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 65 [2019-10-06 23:31:31,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:31,409 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-10-06 23:31:31,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-06 23:31:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-10-06 23:31:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-06 23:31:31,411 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:31,411 INFO L385 BasicCegarLoop]: trace histogram [23, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:31,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:31,612 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:31,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:31,613 INFO L82 PathProgramCache]: Analyzing trace with hash -868095310, now seen corresponding path program 6 times [2019-10-06 23:31:31,613 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:31,613 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:31,614 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:31,614 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-06 23:31:32,144 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:32,144 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:32,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:32,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:32,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:32,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-06 23:31:32,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-06 23:31:32,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-06 23:31:33,045 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:33,046 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:33,047 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:33,047 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:33,049 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:33,049 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:33,065 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:33,934 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:33,940 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:33,942 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:33,942 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:33,942 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-06 23:31:33,943 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-06 23:31:33,943 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:33,943 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-06 23:31:33,943 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-06 23:31:33,944 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-06 23:31:33,944 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:33,944 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:33,944 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:33,945 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-06 23:31:33,945 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:33,945 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:33,945 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:33,945 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:31:33,946 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-06 23:31:33,946 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:34,318 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:34,319 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-06 23:31:34,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:31:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:31:34,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:31:34,323 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 61 states. [2019-10-06 23:31:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:36,921 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2019-10-06 23:31:36,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-06 23:31:36,922 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 102 [2019-10-06 23:31:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:36,923 INFO L225 Difference]: With dead ends: 217 [2019-10-06 23:31:36,923 INFO L226 Difference]: Without dead ends: 140 [2019-10-06 23:31:36,928 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-06 23:31:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-06 23:31:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2019-10-06 23:31:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-06 23:31:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-10-06 23:31:36,944 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 102 [2019-10-06 23:31:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:36,944 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-10-06 23:31:36,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:31:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-10-06 23:31:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-06 23:31:36,947 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:36,947 INFO L385 BasicCegarLoop]: trace histogram [48, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:37,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:37,151 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:37,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1248739607, now seen corresponding path program 7 times [2019-10-06 23:31:37,152 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:37,152 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:37,152 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:37,153 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-06 23:31:38,248 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:38,248 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:38,248 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:38,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-06 23:31:38,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-06 23:31:38,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-06 23:31:41,165 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:41,167 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:31:41,167 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:41,167 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:41,167 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:41,167 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:41,183 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:41,924 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:31:42,014 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:42,028 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:42,030 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:42,030 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:42,030 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-06 23:31:42,031 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-06 23:31:42,031 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:42,031 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-06 23:31:42,031 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-06 23:31:42,031 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-06 23:31:42,032 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:42,032 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:42,032 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:42,033 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-06 23:31:42,033 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:42,034 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:42,034 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:42,034 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:31:42,034 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-06 23:31:42,034 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:42,517 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:42,518 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-06 23:31:42,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:31:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:31:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:31:42,524 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 111 states. [2019-10-06 23:31:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:49,765 INFO L93 Difference]: Finished difference Result 267 states and 326 transitions. [2019-10-06 23:31:49,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-06 23:31:49,766 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 127 [2019-10-06 23:31:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:49,768 INFO L225 Difference]: With dead ends: 267 [2019-10-06 23:31:49,769 INFO L226 Difference]: Without dead ends: 190 [2019-10-06 23:31:49,773 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9104 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15032, Invalid=31408, Unknown=0, NotChecked=0, Total=46440 [2019-10-06 23:31:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-06 23:31:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2019-10-06 23:31:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-06 23:31:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2019-10-06 23:31:49,793 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 127 [2019-10-06 23:31:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:49,794 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2019-10-06 23:31:49,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:31:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2019-10-06 23:31:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-06 23:31:49,797 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:49,797 INFO L385 BasicCegarLoop]: trace histogram [98, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:50,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:50,005 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:50,005 INFO L82 PathProgramCache]: Analyzing trace with hash 259656055, now seen corresponding path program 8 times [2019-10-06 23:31:50,006 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:50,006 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:50,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:50,006 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5395 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-06 23:31:53,626 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:53,627 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:53,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:36:38,623 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-06 23:36:38,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:36:38,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-06 23:36:38,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:36:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5395 backedges. 114 proven. 136 refuted. 0 times theorem prover too weak. 5145 trivial. 0 not checked. [2019-10-06 23:36:39,560 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:36:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5395 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 5169 trivial. 0 not checked. [2019-10-06 23:36:40,783 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:36:40,784 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:36:40,785 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:36:40,785 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:36:40,785 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:36:40,785 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:36:40,806 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:36:41,611 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:36:41,620 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:36:41,623 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:36:41,623 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:36:41,623 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((v_prenex_29 Int) (|v_main_~#a5~0.base_BEFORE_CALL_8| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_8|) |v_main_~#a5~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:36:41,623 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (exists ((v_prenex_29 Int) (|v_main_~#a5~0.base_BEFORE_CALL_8| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_8|) |v_main_~#a5~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:36:41,623 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:41,624 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-06 23:36:41,624 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (exists ((v_prenex_29 Int) (|v_main_~#a5~0.base_BEFORE_CALL_8| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_8|) |v_main_~#a5~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:36:41,624 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-06 23:36:41,624 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:41,624 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:36:41,625 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:36:41,625 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-06 23:36:41,625 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:36:41,625 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:41,625 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:36:41,625 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:36:41,626 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((v_prenex_29 Int) (|v_main_~#a5~0.base_BEFORE_CALL_8| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_29) v_prenex_30) (select (select |#memory_int| v_prenex_32) v_prenex_31))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_8|) |v_main_~#a5~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|)))))) [2019-10-06 23:36:41,626 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:36:42,390 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:36:42,391 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 21, 21, 11] total 149 [2019-10-06 23:36:42,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-10-06 23:36:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-10-06 23:36:42,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5918, Invalid=16134, Unknown=0, NotChecked=0, Total=22052 [2019-10-06 23:36:42,396 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 149 states. [2019-10-06 23:36:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:36:56,080 INFO L93 Difference]: Finished difference Result 340 states and 422 transitions. [2019-10-06 23:36:56,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-10-06 23:36:56,081 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 177 [2019-10-06 23:36:56,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:36:56,084 INFO L225 Difference]: With dead ends: 340 [2019-10-06 23:36:56,084 INFO L226 Difference]: Without dead ends: 263 [2019-10-06 23:36:56,089 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 520 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19605 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=17822, Invalid=66568, Unknown=0, NotChecked=0, Total=84390 [2019-10-06 23:36:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-06 23:36:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2019-10-06 23:36:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-06 23:36:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 259 transitions. [2019-10-06 23:36:56,113 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 259 transitions. Word has length 177 [2019-10-06 23:36:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:36:56,114 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 259 transitions. [2019-10-06 23:36:56,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-10-06 23:36:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 259 transitions. [2019-10-06 23:36:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-06 23:36:56,125 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:36:56,125 INFO L385 BasicCegarLoop]: trace histogram [99, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:36:56,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:36:56,326 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:36:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:36:56,327 INFO L82 PathProgramCache]: Analyzing trace with hash 550257842, now seen corresponding path program 9 times [2019-10-06 23:36:56,327 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:36:56,327 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:36:56,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:56,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:36:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7330 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-10-06 23:37:00,348 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:00,348 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:00,348 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:00,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:37:00,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:37:00,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-06 23:37:00,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:37:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7330 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-10-06 23:37:00,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:37:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7330 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-10-06 23:37:11,546 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:37:11,547 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:37:11,548 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:37:11,548 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:37:11,548 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:37:11,548 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:37:11,567 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:37:12,359 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:37:12,364 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:37:12,367 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:37:12,368 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:37:12,368 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#a5~0.offset_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a5~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_9|) |v_main_~#a5~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))) (and (= (select (select |#memory_int| v_prenex_34) v_prenex_33) (select (select |#memory_int| v_prenex_35) v_prenex_36)) (= |__VERIFIER_assert_#in~cond| 1))))) [2019-10-06 23:37:12,368 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_main_~#a5~0.offset_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a5~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_9|) |v_main_~#a5~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))) (and (= (select (select |#memory_int| v_prenex_34) v_prenex_33) (select (select |#memory_int| v_prenex_35) v_prenex_36)) (= |__VERIFIER_assert_#in~cond| 1))))) [2019-10-06 23:37:12,368 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:37:12,369 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-06 23:37:12,369 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_main_~#a5~0.offset_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a5~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_9|) |v_main_~#a5~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))) (and (= (select (select |#memory_int| v_prenex_34) v_prenex_33) (select (select |#memory_int| v_prenex_35) v_prenex_36)) (= |__VERIFIER_assert_#in~cond| 1))))) [2019-10-06 23:37:12,369 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-06 23:37:12,369 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:37:12,369 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:37:12,370 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:37:12,370 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-06 23:37:12,370 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:37:12,370 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:37:12,370 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:37:12,370 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:37:12,371 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((|v_main_~#a5~0.offset_BEFORE_CALL_9| Int) (v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a5~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_9|) |v_main_~#a5~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|)))) (and (= (select (select |#memory_int| v_prenex_34) v_prenex_33) (select (select |#memory_int| v_prenex_35) v_prenex_36)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:37:12,371 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:37:13,165 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:37:13,165 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102, 11] total 213 [2019-10-06 23:37:13,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 213 states [2019-10-06 23:37:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2019-10-06 23:37:13,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20532, Invalid=24624, Unknown=0, NotChecked=0, Total=45156 [2019-10-06 23:37:13,171 INFO L87 Difference]: Start difference. First operand 254 states and 259 transitions. Second operand 213 states. [2019-10-06 23:37:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:37:38,787 INFO L93 Difference]: Finished difference Result 513 states and 623 transitions. [2019-10-06 23:37:38,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2019-10-06 23:37:38,788 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 250 [2019-10-06 23:37:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:37:38,791 INFO L225 Difference]: With dead ends: 513 [2019-10-06 23:37:38,791 INFO L226 Difference]: Without dead ends: 364 [2019-10-06 23:37:38,795 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31289 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=61187, Invalid=114793, Unknown=0, NotChecked=0, Total=175980 [2019-10-06 23:37:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-10-06 23:37:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 355. [2019-10-06 23:37:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-10-06 23:37:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 360 transitions. [2019-10-06 23:37:38,821 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 360 transitions. Word has length 250 [2019-10-06 23:37:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:37:38,821 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 360 transitions. [2019-10-06 23:37:38,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 213 states. [2019-10-06 23:37:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 360 transitions. [2019-10-06 23:37:38,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-06 23:37:38,827 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:37:38,827 INFO L385 BasicCegarLoop]: trace histogram [200, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:37:39,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:39,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:37:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:37:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash -298838313, now seen corresponding path program 10 times [2019-10-06 23:37:39,034 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:37:39,035 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:39,035 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:39,035 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:37:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:53,555 INFO L134 CoverageAnalysis]: Checked inductivity of 22480 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-10-06 23:37:53,555 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:53,555 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:53,555 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:54,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 1833 conjuncts, 202 conjunts are in the unsatisfiable core [2019-10-06 23:37:54,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:37:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 22480 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-10-06 23:37:54,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 22480 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-10-06 23:38:37,588 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:37,589 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:38:37,590 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:37,590 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:37,590 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:37,590 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:37,622 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:38,453 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:38,461 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:38,463 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:38,463 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:38,464 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 260#(and (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a5~0.base_BEFORE_CALL_10| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_10|) |v_main_~#a5~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_40) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_39))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:38,464 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 265#(and (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a5~0.base_BEFORE_CALL_10| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_10|) |v_main_~#a5~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_40) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_39))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:38,464 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:38,464 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-06 23:38:38,464 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 270#(and (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a5~0.base_BEFORE_CALL_10| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_10|) |v_main_~#a5~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_40) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_39))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:38,464 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-06 23:38:38,464 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 154#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:38,464 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:38:38,465 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:38:38,465 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-06 23:38:38,465 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:38,465 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 197#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:38,465 INFO L193 IcfgInterpreter]: Reachable states at location L29 satisfy 250#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem12| (select (select |#memory_int| |main_~#a5~0.base|) (+ (* 4 main_~x~0) |main_~#a5~0.offset|))) (<= 100000 main_~i~0) (= |main_#t~mem11| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:38,465 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:38:38,465 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 255#(exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a5~0.base_BEFORE_CALL_10| Int) (|v_main_~#a5~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a5~0.base_BEFORE_CALL_10|) |v_main_~#a5~0.offset_BEFORE_CALL_10|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_40) v_prenex_37) (select (select |#memory_int| v_prenex_38) v_prenex_39))))) [2019-10-06 23:38:38,466 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 240#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:39,776 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:39,777 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [203, 203, 203, 11] total 415 [2019-10-06 23:38:39,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 415 states [2019-10-06 23:38:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 415 interpolants. [2019-10-06 23:38:39,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81839, Invalid=89971, Unknown=0, NotChecked=0, Total=171810 [2019-10-06 23:38:39,789 INFO L87 Difference]: Start difference. First operand 355 states and 360 transitions. Second operand 415 states. [2019-10-06 23:40:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:40:14,723 INFO L93 Difference]: Finished difference Result 715 states and 926 transitions. [2019-10-06 23:40:14,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 414 states. [2019-10-06 23:40:14,724 INFO L78 Accepts]: Start accepts. Automaton has 415 states. Word has length 351 [2019-10-06 23:40:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:40:14,727 INFO L225 Difference]: With dead ends: 715 [2019-10-06 23:40:14,727 INFO L226 Difference]: Without dead ends: 566 [2019-10-06 23:40:14,743 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 843 SyntacticMatches, 0 SemanticMatches, 822 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113604 ImplicationChecksByTransitivity, 148.2s TimeCoverageRelationStatistics Valid=244704, Invalid=433448, Unknown=0, NotChecked=0, Total=678152 [2019-10-06 23:40:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-06 23:40:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2019-10-06 23:40:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-06 23:40:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 562 transitions. [2019-10-06 23:40:14,779 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 562 transitions. Word has length 351 [2019-10-06 23:40:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:40:14,780 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 562 transitions. [2019-10-06 23:40:14,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 415 states. [2019-10-06 23:40:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 562 transitions. [2019-10-06 23:40:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2019-10-06 23:40:14,793 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:40:14,794 INFO L385 BasicCegarLoop]: trace histogram [402, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:40:15,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:40:15,004 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:40:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:40:15,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1779498935, now seen corresponding path program 11 times [2019-10-06 23:40:15,004 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:40:15,005 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:40:15,005 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:15,005 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:40:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:40:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:41:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 83383 backedges. 0 proven. 81003 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-10-06 23:41:13,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:41:13,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:41:13,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true