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_partition_original_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:35:45,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:35:45,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:35:45,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:35:45,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:35:45,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:35:45,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:35:45,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:35:45,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:35:45,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:35:45,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:35:45,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:35:45,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:35:45,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:35:45,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:35:45,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:35:45,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:35:45,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:35:45,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:35:45,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:35:45,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:35:45,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:35:45,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:35:45,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:35:45,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:35:45,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:35:45,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:35:45,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:35:45,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:35:45,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:35:45,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:35:45,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:35:45,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:35:45,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:35:46,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:35:46,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:35:46,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:35:46,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:35:46,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:35:46,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:35:46,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:35:46,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:35:46,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:35:46,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:35:46,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:35:46,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:35:46,019 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:35:46,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:35:46,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:35:46,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:35:46,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:35:46,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:35:46,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:35:46,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:35:46,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:35:46,024 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:35:46,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:35:46,025 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:35:46,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:35:46,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:35:46,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:35:46,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:35:46,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:35:46,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:46,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:35:46,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:35:46,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:35:46,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:35:46,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:35:46,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:35:46,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:35:46,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:35:46,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:35:46,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:35:46,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:35:46,338 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:35:46,339 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_original_ground.i [2019-10-13 21:35:46,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d24721b5/21d6393a626a4b32a5d8e4276d1c1f5c/FLAG028bcb91c [2019-10-13 21:35:46,870 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:35:46,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_original_ground.i [2019-10-13 21:35:46,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d24721b5/21d6393a626a4b32a5d8e4276d1c1f5c/FLAG028bcb91c [2019-10-13 21:35:47,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d24721b5/21d6393a626a4b32a5d8e4276d1c1f5c [2019-10-13 21:35:47,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:35:47,225 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:35:47,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:47,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:35:47,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:35:47,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2022d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47, skipping insertion in model container [2019-10-13 21:35:47,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,242 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:35:47,261 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:35:47,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:47,481 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:35:47,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:47,522 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:35:47,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47 WrapperNode [2019-10-13 21:35:47,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:47,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:35:47,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:35:47,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:35:47,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... [2019-10-13 21:35:47,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:35:47,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:35:47,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:35:47,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:35:47,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:35:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:35:47,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:35:47,716 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:35:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:35:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:35:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:35:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:35:47,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:35:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:35:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:35:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:35:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:35:47,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:35:48,131 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:35:48,132 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:35:48,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:48 BoogieIcfgContainer [2019-10-13 21:35:48,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:35:48,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:35:48,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:35:48,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:35:48,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:35:47" (1/3) ... [2019-10-13 21:35:48,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be50dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:48, skipping insertion in model container [2019-10-13 21:35:48,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:47" (2/3) ... [2019-10-13 21:35:48,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be50dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:48, skipping insertion in model container [2019-10-13 21:35:48,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:48" (3/3) ... [2019-10-13 21:35:48,142 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_partition_original_ground.i [2019-10-13 21:35:48,157 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:35:48,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:35:48,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:35:48,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:35:48,199 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:35:48,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:35:48,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:35:48,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:35:48,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:35:48,200 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:35:48,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:35:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:35:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:35:48,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:48,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:48,224 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash -257326419, now seen corresponding path program 1 times [2019-10-13 21:35:48,239 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:48,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531850420] [2019-10-13 21:35:48,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,240 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:35:48,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531850420] [2019-10-13 21:35:48,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:48,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:48,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135056331] [2019-10-13 21:35:48,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:48,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:48,457 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2019-10-13 21:35:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:48,511 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-13 21:35:48,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:48,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:35:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:48,524 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:35:48,525 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:35:48,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:35:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:35:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:35:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 21:35:48,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2019-10-13 21:35:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:48,575 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 21:35:48,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 21:35:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:35:48,577 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:48,577 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:48,577 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 198286821, now seen corresponding path program 1 times [2019-10-13 21:35:48,578 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:48,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349367538] [2019-10-13 21:35:48,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:48,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349367538] [2019-10-13 21:35:48,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:48,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:48,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965340771] [2019-10-13 21:35:48,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:48,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:48,646 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 21:35:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:48,680 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:35:48,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:48,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:35:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:48,688 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:35:48,688 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:35:48,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:35:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:35:48,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:35:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:35:48,701 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-10-13 21:35:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:48,702 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:35:48,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:35:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:35:48,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:48,706 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:48,707 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:48,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1699392540, now seen corresponding path program 1 times [2019-10-13 21:35:48,708 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:48,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689100035] [2019-10-13 21:35:48,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:48,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:48,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689100035] [2019-10-13 21:35:48,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084012281] [2019-10-13 21:35:48,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:48,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:48,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:48,926 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:48,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [281369157] [2019-10-13 21:35:49,010 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:49,010 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:49,016 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:49,024 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:49,024 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:49,194 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:49,621 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:49,652 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:49,666 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:49,667 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:49,667 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,668 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,668 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:49,668 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:49,669 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:49,669 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:49,670 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:49,670 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:49,670 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:49,671 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:35:49,672 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:49,672 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:49,672 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#bb~0.base_BEFORE_CALL_1| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_2) v_prenex_3))) (and (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_1|) |v_main_~#bb~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:49,992 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:49,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:35:49,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875493235] [2019-10-13 21:35:49,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:35:50,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:35:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:35:50,003 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 17 states. [2019-10-13 21:35:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:50,601 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-10-13 21:35:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:35:50,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 21:35:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:50,603 INFO L225 Difference]: With dead ends: 50 [2019-10-13 21:35:50,603 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:35:50,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:35:50,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:35:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-10-13 21:35:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 21:35:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-10-13 21:35:50,617 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2019-10-13 21:35:50,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:50,617 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-10-13 21:35:50,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:35:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-10-13 21:35:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:35:50,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:50,618 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:50,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:50,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1573392980, now seen corresponding path program 2 times [2019-10-13 21:35:50,828 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:50,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562931994] [2019-10-13 21:35:50,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:50,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:50,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:50,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562931994] [2019-10-13 21:35:50,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860577439] [2019-10-13 21:35:50,986 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:51,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:35:51,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:51,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:51,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:51,091 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:51,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [132285163] [2019-10-13 21:35:51,125 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:51,125 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:51,125 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:51,126 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:51,126 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:51,181 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:51,385 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:51,396 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:51,402 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:51,402 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:51,402 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:51,403 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:51,403 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:51,403 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:51,403 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:51,404 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:51,404 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:51,404 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:51,404 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:51,404 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) [2019-10-13 21:35:51,405 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:51,405 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:51,405 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#bb~0.base_BEFORE_CALL_2| Int) (|v_main_~#bb~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_2|) |v_main_~#bb~0.offset_BEFORE_CALL_2|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_5) v_prenex_6)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:51,730 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:51,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 21:35:51,730 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796405614] [2019-10-13 21:35:51,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:35:51,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:51,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:35:51,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:35:51,733 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 21 states. [2019-10-13 21:35:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:52,542 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2019-10-13 21:35:52,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:35:52,543 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-10-13 21:35:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:52,547 INFO L225 Difference]: With dead ends: 60 [2019-10-13 21:35:52,548 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 21:35:52,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=227, Invalid=1179, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 21:35:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 21:35:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-10-13 21:35:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 21:35:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-13 21:35:52,562 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2019-10-13 21:35:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:52,563 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-13 21:35:52,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:35:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-13 21:35:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:35:52,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:52,564 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:52,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:52,769 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1265542565, now seen corresponding path program 3 times [2019-10-13 21:35:52,770 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:52,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198793000] [2019-10-13 21:35:52,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:52,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:52,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:35:52,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198793000] [2019-10-13 21:35:52,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790751092] [2019-10-13 21:35:52,874 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:52,947 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:52,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:52,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:35:52,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:53,010 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:53,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [745586279] [2019-10-13 21:35:53,136 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:53,137 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:53,137 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:53,137 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:53,138 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:53,178 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:53,400 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:53,412 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:53,417 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:53,418 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:53,422 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:53,423 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:53,423 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:53,424 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:53,424 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:53,424 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:53,424 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:53,425 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:53,425 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:53,426 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) [2019-10-13 21:35:53,426 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:53,426 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:53,426 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_3| Int) (|v_main_~#bb~0.base_BEFORE_CALL_3| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_3|) |v_main_~#bb~0.offset_BEFORE_CALL_3|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_9) v_prenex_8)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:53,724 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:53,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 11] total 29 [2019-10-13 21:35:53,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085071979] [2019-10-13 21:35:53,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:35:53,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:35:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:35:53,727 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 29 states. [2019-10-13 21:35:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:54,897 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-10-13 21:35:54,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 21:35:54,898 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 21 [2019-10-13 21:35:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:54,899 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:35:54,899 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 21:35:54,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=2357, Unknown=0, NotChecked=0, Total=2862 [2019-10-13 21:35:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 21:35:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-10-13 21:35:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 21:35:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-10-13 21:35:54,911 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 21 [2019-10-13 21:35:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:54,911 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-10-13 21:35:54,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:35:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-10-13 21:35:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:35:54,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:54,912 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:55,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:55,117 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1864631148, now seen corresponding path program 4 times [2019-10-13 21:35:55,118 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:55,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298148189] [2019-10-13 21:35:55,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:55,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:35:55,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298148189] [2019-10-13 21:35:55,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835216706] [2019-10-13 21:35:55,355 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:55,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:35:55,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:35:55,470 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:35:55,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1834121864] [2019-10-13 21:35:55,785 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:55,785 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:55,786 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:55,786 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:55,786 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:55,816 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:55,966 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:55,990 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:56,002 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:56,002 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:56,003 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,003 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,004 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:56,004 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:56,005 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:56,006 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:56,006 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:56,006 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:56,007 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:56,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) [2019-10-13 21:35:56,011 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:56,011 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:56,012 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_4| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#bb~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_4|) |v_main_~#bb~0.offset_BEFORE_CALL_4|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:56,390 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:56,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:35:56,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042267589] [2019-10-13 21:35:56,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:35:56,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:56,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:35:56,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:35:56,393 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 39 states. [2019-10-13 21:35:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:57,798 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2019-10-13 21:35:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:35:57,799 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 29 [2019-10-13 21:35:57,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:57,800 INFO L225 Difference]: With dead ends: 86 [2019-10-13 21:35:57,800 INFO L226 Difference]: Without dead ends: 62 [2019-10-13 21:35:57,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:35:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-13 21:35:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2019-10-13 21:35:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 21:35:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2019-10-13 21:35:57,815 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 29 [2019-10-13 21:35:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:57,815 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2019-10-13 21:35:57,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:35:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2019-10-13 21:35:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 21:35:57,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:57,817 INFO L380 BasicCegarLoop]: trace histogram [26, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:58,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:58,023 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -949417068, now seen corresponding path program 5 times [2019-10-13 21:35:58,025 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:58,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926210637] [2019-10-13 21:35:58,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:58,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:58,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:35:58,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926210637] [2019-10-13 21:35:58,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873790245] [2019-10-13 21:35:58,173 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:58,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 21:35:58,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:58,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:35:58,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:35:58,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:35:58,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [244883100] [2019-10-13 21:35:58,446 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:58,447 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:58,449 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:58,449 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:58,450 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:58,471 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:58,590 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:35:58,597 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:58,600 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:58,600 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:58,601 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:58,601 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:58,601 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:58,601 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:58,602 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:35:58,602 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:58,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:35:58,602 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:35:58,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:58,603 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) [2019-10-13 21:35:58,603 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:35:58,603 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:35:58,603 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_15 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_5| Int) (|v_main_~#bb~0.base_BEFORE_CALL_5| Int) (v_prenex_14 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_15) v_prenex_14)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_5|) |v_main_~#bb~0.offset_BEFORE_CALL_5|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:35:58,865 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:58,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:35:58,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687495864] [2019-10-13 21:35:58,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:35:58,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:58,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:35:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:35:58,868 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 25 states. [2019-10-13 21:35:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:59,687 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2019-10-13 21:35:59,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:35:59,688 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2019-10-13 21:35:59,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:59,689 INFO L225 Difference]: With dead ends: 87 [2019-10-13 21:35:59,689 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 21:35:59,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=410, Invalid=1570, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 21:35:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 21:35:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2019-10-13 21:35:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 21:35:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-10-13 21:35:59,704 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 43 [2019-10-13 21:35:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:59,705 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-10-13 21:35:59,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:35:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-10-13 21:35:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:35:59,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:59,707 INFO L380 BasicCegarLoop]: trace histogram [26, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:59,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:59,917 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1595854099, now seen corresponding path program 6 times [2019-10-13 21:35:59,918 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:59,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861865483] [2019-10-13 21:35:59,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:59,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:59,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:00,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861865483] [2019-10-13 21:36:00,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100766504] [2019-10-13 21:36:00,339 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:00,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:00,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:00,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:36:00,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:00,463 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:01,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1433544030] [2019-10-13 21:36:01,652 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:01,652 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:01,653 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:01,653 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:01,653 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:01,682 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:01,799 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:01,807 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:01,812 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:01,813 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:01,813 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:01,813 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:01,813 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:01,814 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:01,814 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:01,814 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:01,814 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:01,814 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:01,815 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:01,815 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) [2019-10-13 21:36:01,815 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:01,815 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_18 Int) (|v_main_~#bb~0.offset_BEFORE_CALL_6| Int) (v_prenex_17 Int) (|v_main_~#bb~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| v_prenex_18) v_prenex_17)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_6|) |v_main_~#bb~0.offset_BEFORE_CALL_6|))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:01,815 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:36:02,224 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:02,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29, 11] total 67 [2019-10-13 21:36:02,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882024391] [2019-10-13 21:36:02,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-13 21:36:02,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:02,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-13 21:36:02,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1625, Invalid=2797, Unknown=0, NotChecked=0, Total=4422 [2019-10-13 21:36:02,229 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 67 states. [2019-10-13 21:36:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:05,448 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2019-10-13 21:36:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-13 21:36:05,449 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 50 [2019-10-13 21:36:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:05,451 INFO L225 Difference]: With dead ends: 128 [2019-10-13 21:36:05,451 INFO L226 Difference]: Without dead ends: 97 [2019-10-13 21:36:05,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3549 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4758, Invalid=11498, Unknown=0, NotChecked=0, Total=16256 [2019-10-13 21:36:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-13 21:36:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2019-10-13 21:36:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-13 21:36:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2019-10-13 21:36:05,468 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 50 [2019-10-13 21:36:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:05,469 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2019-10-13 21:36:05,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-13 21:36:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2019-10-13 21:36:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 21:36:05,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:05,472 INFO L380 BasicCegarLoop]: trace histogram [54, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:05,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:05,676 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1794894611, now seen corresponding path program 7 times [2019-10-13 21:36:05,677 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:05,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174544799] [2019-10-13 21:36:05,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:05,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:05,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:07,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174544799] [2019-10-13 21:36:07,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472075149] [2019-10-13 21:36:07,238 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:07,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-13 21:36:07,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:07,441 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:11,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [514367850] [2019-10-13 21:36:11,247 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:11,247 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:11,248 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:11,248 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:11,248 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:11,280 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:11,421 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-13 21:36:11,430 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:11,435 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:11,435 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:11,436 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 102#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:11,436 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 107#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:11,437 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 116#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:11,437 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:11,437 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 87#(and (<= 100000 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:11,438 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:11,438 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:36:11,438 INFO L193 IcfgInterpreter]: Reachable states at location L18-1 satisfy 82#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-13 21:36:11,438 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:11,439 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) [2019-10-13 21:36:11,439 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 92#(and (<= 100000 main_~a~0) (<= 0 main_~b~0) (= main_~x~0 0) (<= 100000 main_~i~0) (< main_~x~0 main_~b~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#bb~0.base|) (+ (* main_~x~0 4) |main_~#bb~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (not (< main_~a~0 100000)) (<= 0 main_~x~0)) [2019-10-13 21:36:11,440 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(and (exists ((|v_main_~#bb~0.offset_BEFORE_CALL_7| Int) (|v_main_~#bb~0.base_BEFORE_CALL_7| Int) (v_prenex_21 Int) (v_prenex_20 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#bb~0.base_BEFORE_CALL_7|) |v_main_~#bb~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| v_prenex_21) v_prenex_20))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:11,440 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 68#true [2019-10-13 21:36:12,229 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:12,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57, 11] total 123 [2019-10-13 21:36:12,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978508372] [2019-10-13 21:36:12,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-10-13 21:36:12,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-10-13 21:36:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6357, Invalid=8649, Unknown=0, NotChecked=0, Total=15006 [2019-10-13 21:36:12,237 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 123 states. [2019-10-13 21:36:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:21,646 INFO L93 Difference]: Finished difference Result 184 states and 251 transitions. [2019-10-13 21:36:21,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-10-13 21:36:21,647 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 78 [2019-10-13 21:36:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:21,648 INFO L225 Difference]: With dead ends: 184 [2019-10-13 21:36:21,649 INFO L226 Difference]: Without dead ends: 153 [2019-10-13 21:36:21,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11039 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=18842, Invalid=38518, Unknown=0, NotChecked=0, Total=57360 [2019-10-13 21:36:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-13 21:36:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2019-10-13 21:36:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-13 21:36:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2019-10-13 21:36:21,674 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 78 [2019-10-13 21:36:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:21,675 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2019-10-13 21:36:21,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-10-13 21:36:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2019-10-13 21:36:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:36:21,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:21,677 INFO L380 BasicCegarLoop]: trace histogram [110, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:21,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:21,881 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:21,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1073010925, now seen corresponding path program 8 times [2019-10-13 21:36:21,882 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:21,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410202908] [2019-10-13 21:36:21,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:21,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:21,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6183 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:27,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410202908] [2019-10-13 21:36:27,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618050137] [2019-10-13 21:36:27,166 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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