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_copy5_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:33:26,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:33:26,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:33:26,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:33:26,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:33:26,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:33:26,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:33:26,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:33:26,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:33:26,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:33:26,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:33:26,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:33:26,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:33:26,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:33:26,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:33:26,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:33:26,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:33:26,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:33:26,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:33:26,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:33:26,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:33:26,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:33:26,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:33:26,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:33:26,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:33:26,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:33:26,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:33:26,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:33:26,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:33:26,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:33:26,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:33:26,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:33:26,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:33:26,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:33:26,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:33:26,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:33:26,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:33:26,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:33:26,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:33:26,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:33:26,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:33:26,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-06 23:33:26,223 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:33:26,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:33:26,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:33:26,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:33:26,225 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:33:26,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:33:26,225 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:33:26,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:33:26,227 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:33:26,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:33:26,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:33:26,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:33:26,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:33:26,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:33:26,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:33:26,229 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:33:26,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:33:26,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:33:26,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:33:26,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:33:26,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:33:26,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:33:26,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:33:26,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:33:26,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:33:26,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:33:26,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:33:26,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:33:26,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-06 23:33:26,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:33:26,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:33:26,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:33:26,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:33:26,527 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:33:26,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy5_ground-2.i [2019-10-06 23:33:26,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e2e53d2/28b1003c39004b0b9340f98388adbf63/FLAGf7eb19006 [2019-10-06 23:33:27,058 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:33:27,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy5_ground-2.i [2019-10-06 23:33:27,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e2e53d2/28b1003c39004b0b9340f98388adbf63/FLAGf7eb19006 [2019-10-06 23:33:27,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16e2e53d2/28b1003c39004b0b9340f98388adbf63 [2019-10-06 23:33:27,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:33:27,507 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:33:27,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:33:27,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:33:27,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:33:27,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fcc4f73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27, skipping insertion in model container [2019-10-06 23:33:27,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,523 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:33:27,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:33:27,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:33:27,733 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:33:27,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:33:27,780 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:33:27,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27 WrapperNode [2019-10-06 23:33:27,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:33:27,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:33:27,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:33:27,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:33:27,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... [2019-10-06 23:33:27,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:33:27,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:33:27,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:33:27,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:33:27,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:33:27,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:33:27,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:33:27,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:33:27,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:33:27,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:33:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:33:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:33:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:33:27,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:33:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:33:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:33:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:33:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:33:27,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:33:28,466 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:33:28,466 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-06 23:33:28,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:33:28 BoogieIcfgContainer [2019-10-06 23:33:28,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:33:28,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:33:28,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:33:28,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:33:28,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:33:27" (1/3) ... [2019-10-06 23:33:28,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1deabcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:33:28, skipping insertion in model container [2019-10-06 23:33:28,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:33:27" (2/3) ... [2019-10-06 23:33:28,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1deabcab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:33:28, skipping insertion in model container [2019-10-06 23:33:28,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:33:28" (3/3) ... [2019-10-06 23:33:28,476 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy5_ground-2.i [2019-10-06 23:33:28,486 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:33:28,494 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:33:28,506 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:33:28,530 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:33:28,530 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:33:28,530 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:33:28,531 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:33:28,531 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:33:28,531 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:33:28,531 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:33:28,531 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:33:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-06 23:33:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:33:28,554 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:28,554 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:28,556 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:28,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1854431878, now seen corresponding path program 1 times [2019-10-06 23:33:28,567 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:28,568 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:28,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:28,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:33:28,762 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:28,763 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:33:28,763 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:33:28,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:33:28,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:33:28,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:33:28,786 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-06 23:33:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:28,826 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-10-06 23:33:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:33:28,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:33:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:28,839 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:33:28,840 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:33:28,846 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:33:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:33:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:33:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:33:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-06 23:33:28,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2019-10-06 23:33:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:28,887 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-06 23:33:28,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:33:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-10-06 23:33:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:33:28,888 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:28,888 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:28,889 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:28,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:28,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1492741861, now seen corresponding path program 1 times [2019-10-06 23:33:28,890 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:28,890 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:28,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:28,890 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:33:28,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:28,972 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:33:28,972 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:33:28,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:33:28,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:33:28,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:33:28,975 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 3 states. [2019-10-06 23:33:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:29,014 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-10-06 23:33:29,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:33:29,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-06 23:33:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:29,016 INFO L225 Difference]: With dead ends: 39 [2019-10-06 23:33:29,017 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:33:29,018 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:33:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:33:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-06 23:33:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-06 23:33:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-06 23:33:29,025 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2019-10-06 23:33:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:29,026 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-06 23:33:29,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:33:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-06 23:33:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-06 23:33:29,027 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:29,027 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:29,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:29,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -528222000, now seen corresponding path program 1 times [2019-10-06 23:33:29,029 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:29,029 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:29,029 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:29,029 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:33:29,122 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:29,122 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:29,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:33:29,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:33:29,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:33:29,318 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:29,346 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:29,348 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:29,356 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:29,364 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:29,365 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:29,514 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:30,254 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:33:31,031 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:31,043 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:31,049 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:31,049 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:31,050 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:31,050 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:31,051 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:31,051 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:31,051 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|)))) [2019-10-06 23:33:31,052 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:31,052 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:31,052 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:31,052 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:31,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:31,053 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:31,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:31,054 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:31,054 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (|v_main_~#a6~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_1|) |v_main_~#a6~0.offset_BEFORE_CALL_1|)))))) [2019-10-06 23:33:31,055 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:31,055 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:33:31,056 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:31,412 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:31,413 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:33:31,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:33:31,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:33:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:33:31,416 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2019-10-06 23:33:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:32,184 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-10-06 23:33:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:33:32,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-10-06 23:33:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:32,186 INFO L225 Difference]: With dead ends: 62 [2019-10-06 23:33:32,186 INFO L226 Difference]: Without dead ends: 43 [2019-10-06 23:33:32,188 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:33:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-06 23:33:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-06 23:33:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:33:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-06 23:33:32,204 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 22 [2019-10-06 23:33:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:32,204 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-06 23:33:32,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:33:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-06 23:33:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:33:32,206 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:32,207 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:32,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:32,421 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1489745050, now seen corresponding path program 2 times [2019-10-06 23:33:32,422 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:32,423 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:32,423 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:32,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:32,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:33:32,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:32,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:32,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:32,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:33:32,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:32,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:33:32,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:33:32,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:33:32,705 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:32,706 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:32,707 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:32,707 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:32,708 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:32,708 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:32,747 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:33,948 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:33,981 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:33,985 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:33,985 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:33,986 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:33,986 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:33,986 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:33,986 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:33,986 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|)))) [2019-10-06 23:33:33,987 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:33,987 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:33,987 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:33,987 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:33,987 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:33,988 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:33,990 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:33,990 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:33,990 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a6~0.base_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_2|) |v_main_~#a6~0.offset_BEFORE_CALL_2|)))))) [2019-10-06 23:33:33,991 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:33,991 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:33:33,991 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:34,249 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:34,250 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-06 23:33:34,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:33:34,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:33:34,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:33:34,251 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 19 states. [2019-10-06 23:33:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:35,018 INFO L93 Difference]: Finished difference Result 84 states and 114 transitions. [2019-10-06 23:33:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:33:35,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2019-10-06 23:33:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:35,020 INFO L225 Difference]: With dead ends: 84 [2019-10-06 23:33:35,020 INFO L226 Difference]: Without dead ends: 63 [2019-10-06 23:33:35,021 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:33:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-06 23:33:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-10-06 23:33:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-06 23:33:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-10-06 23:33:35,032 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 30 [2019-10-06 23:33:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:35,033 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-10-06 23:33:35,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:33:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-10-06 23:33:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-06 23:33:35,035 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:35,035 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:35,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:35,242 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash 11000486, now seen corresponding path program 3 times [2019-10-06 23:33:35,243 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:35,244 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:35,244 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:35,244 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:33:35,384 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:35,385 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:35,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:35,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:33:35,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:35,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:33:35,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:33:35,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:33:35,585 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:35,587 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:35,587 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:35,587 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:35,588 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:35,588 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:35,612 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:36,694 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:36,700 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:36,703 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:36,704 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:36,704 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:36,704 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:36,704 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:36,705 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:36,705 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|)))) [2019-10-06 23:33:36,705 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:36,705 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:36,705 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:36,706 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:36,706 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:36,706 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:36,706 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:36,706 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:36,707 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a6~0.base_BEFORE_CALL_3| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_9) v_prenex_11) (select (select |#memory_int| v_prenex_10) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_3|) |v_main_~#a6~0.offset_BEFORE_CALL_3|))))) [2019-10-06 23:33:36,707 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:36,707 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:33:36,707 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:36,961 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:36,962 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-06 23:33:36,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:33:36,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:33:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:33:36,964 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 23 states. [2019-10-06 23:33:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:37,684 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2019-10-06 23:33:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:33:37,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2019-10-06 23:33:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:37,688 INFO L225 Difference]: With dead ends: 113 [2019-10-06 23:33:37,688 INFO L226 Difference]: Without dead ends: 69 [2019-10-06 23:33:37,690 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:33:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-06 23:33:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-06 23:33:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-06 23:33:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2019-10-06 23:33:37,701 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 50 [2019-10-06 23:33:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:37,701 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2019-10-06 23:33:37,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:33:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2019-10-06 23:33:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-06 23:33:37,703 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:37,703 INFO L385 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:37,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:37,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1190337914, now seen corresponding path program 4 times [2019-10-06 23:33:37,909 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:37,909 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:37,909 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:37,909 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:33:38,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:38,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:38,131 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:38,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:33:38,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:33:38,254 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-06 23:33:38,430 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:38,432 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:38,432 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:38,432 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:38,433 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:38,433 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:38,455 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:39,541 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:39,548 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:39,554 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:39,554 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:39,554 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:39,555 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:39,555 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:39,555 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:39,555 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|)))) [2019-10-06 23:33:39,555 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:39,556 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:39,556 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:39,556 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:39,556 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:39,556 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:39,557 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:39,557 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:39,557 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a6~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_4|) |v_main_~#a6~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:33:39,557 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:39,557 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:33:39,558 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:39,854 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:39,855 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 35 [2019-10-06 23:33:39,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-06 23:33:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-06 23:33:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-06 23:33:39,858 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 35 states. [2019-10-06 23:33:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:41,053 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-10-06 23:33:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-06 23:33:41,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2019-10-06 23:33:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:41,056 INFO L225 Difference]: With dead ends: 125 [2019-10-06 23:33:41,056 INFO L226 Difference]: Without dead ends: 81 [2019-10-06 23:33:41,059 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=934, Invalid=3098, Unknown=0, NotChecked=0, Total=4032 [2019-10-06 23:33:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-06 23:33:41,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-10-06 23:33:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-06 23:33:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-10-06 23:33:41,070 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 56 [2019-10-06 23:33:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:41,070 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-10-06 23:33:41,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-06 23:33:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-10-06 23:33:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-06 23:33:41,072 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:41,072 INFO L385 BasicCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:41,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:41,284 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:41,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash -142820794, now seen corresponding path program 5 times [2019-10-06 23:33:41,285 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:41,285 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:41,285 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:41,286 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-06 23:33:41,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:41,519 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:41,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:42,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:33:42,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:42,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-06 23:33:42,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-06 23:33:42,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-10-06 23:33:42,608 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:42,609 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:42,609 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:42,610 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:42,610 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:42,610 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:42,624 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:42,904 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:33:43,667 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:43,678 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:43,681 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:43,681 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:43,682 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:43,682 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:43,682 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:43,682 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:43,682 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|)))) [2019-10-06 23:33:43,683 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:43,683 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:43,683 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:43,683 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-06 23:33:43,683 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:43,684 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:43,684 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:43,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:43,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a6~0.base_BEFORE_CALL_5| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_5|) |v_main_~#a6~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:33:43,685 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:43,685 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:33:43,685 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:43,953 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:43,954 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9, 11] total 28 [2019-10-06 23:33:43,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:33:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:33:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:33:43,956 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 28 states. [2019-10-06 23:33:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:45,176 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2019-10-06 23:33:45,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-06 23:33:45,177 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 68 [2019-10-06 23:33:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:45,178 INFO L225 Difference]: With dead ends: 158 [2019-10-06 23:33:45,178 INFO L226 Difference]: Without dead ends: 121 [2019-10-06 23:33:45,179 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=520, Invalid=1832, Unknown=0, NotChecked=0, Total=2352 [2019-10-06 23:33:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-06 23:33:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2019-10-06 23:33:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-06 23:33:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2019-10-06 23:33:45,195 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 68 [2019-10-06 23:33:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:45,195 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2019-10-06 23:33:45,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:33:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2019-10-06 23:33:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-06 23:33:45,197 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:45,197 INFO L385 BasicCegarLoop]: trace histogram [22, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:45,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:45,401 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:45,402 INFO L82 PathProgramCache]: Analyzing trace with hash -866740026, now seen corresponding path program 6 times [2019-10-06 23:33:45,402 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:45,402 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:45,402 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:45,403 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-06 23:33:45,855 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:45,855 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:45,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:46,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:33:46,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:33:46,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:33:46,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-06 23:33:46,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-06 23:33:46,836 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:46,840 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:46,840 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:46,841 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:46,841 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:46,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:46,864 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:47,901 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:47,906 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:47,909 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:47,909 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:47,909 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:47,909 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:47,910 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:47,910 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:47,910 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|)))) [2019-10-06 23:33:47,910 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:47,910 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:47,911 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:47,911 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:47,911 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:47,911 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:47,911 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:47,912 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:47,912 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a6~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a6~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_22) v_prenex_23) (select (select |#memory_int| v_prenex_24) v_prenex_21))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_6|) |v_main_~#a6~0.offset_BEFORE_CALL_6|)))))) [2019-10-06 23:33:47,912 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:47,912 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:33:47,912 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:48,336 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:48,337 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-06 23:33:48,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-06 23:33:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-06 23:33:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2019-10-06 23:33:48,339 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 59 states. [2019-10-06 23:33:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:33:50,933 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2019-10-06 23:33:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-06 23:33:50,934 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 108 [2019-10-06 23:33:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:33:50,935 INFO L225 Difference]: With dead ends: 229 [2019-10-06 23:33:50,936 INFO L226 Difference]: Without dead ends: 145 [2019-10-06 23:33:50,940 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3514, Invalid=8918, Unknown=0, NotChecked=0, Total=12432 [2019-10-06 23:33:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-06 23:33:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2019-10-06 23:33:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-06 23:33:50,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 142 transitions. [2019-10-06 23:33:50,959 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 142 transitions. Word has length 108 [2019-10-06 23:33:50,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:33:50,960 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 142 transitions. [2019-10-06 23:33:50,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-06 23:33:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 142 transitions. [2019-10-06 23:33:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-06 23:33:50,963 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:33:50,963 INFO L385 BasicCegarLoop]: trace histogram [46, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:33:51,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:51,172 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:33:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:33:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1674581946, now seen corresponding path program 7 times [2019-10-06 23:33:51,173 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:33:51,174 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:51,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:51,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:33:51,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:33:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 1501 trivial. 0 not checked. [2019-10-06 23:33:52,162 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:52,163 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:52,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:33:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:52,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-06 23:33:52,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-06 23:33:53,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:33:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1606 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-06 23:33:56,285 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:33:56,287 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-06 23:33:56,287 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:33:56,287 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:33:56,288 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:33:56,288 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:33:56,309 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:33:56,976 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:33:57,318 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:33:57,547 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:33:57,614 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:33:57,621 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:33:57,623 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:33:57,624 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:33:57,624 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 307#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:57,624 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 312#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:57,624 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 321#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:33:57,625 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:57,625 INFO L193 IcfgInterpreter]: Reachable states at location L34 satisfy 297#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= |main_#t~mem14| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (<= main_~x~0 0) (<= 0 main_~x~0) (= |main_#t~mem15| (select (select |#memory_int| |main_~#a6~0.base|) (+ (* 4 main_~x~0) |main_~#a6~0.offset|)))) [2019-10-06 23:33:57,625 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:57,625 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:57,625 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:57,625 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:57,626 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 326#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:33:57,626 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:57,626 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:33:57,626 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 317#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:33:57,626 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 302#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a6~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int) (|v_main_~#a6~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a6~0.base_BEFORE_CALL_7|) |v_main_~#a6~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_28) v_prenex_26) (select (select |#memory_int| v_prenex_27) v_prenex_25)))))) [2019-10-06 23:33:57,627 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 292#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:33:57,627 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 72#true [2019-10-06 23:33:57,627 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:33:58,218 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:33:58,218 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 49, 49, 11] total 121 [2019-10-06 23:33:58,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-10-06 23:33:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-10-06 23:33:58,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4724, Invalid=9796, Unknown=0, NotChecked=0, Total=14520 [2019-10-06 23:33:58,226 INFO L87 Difference]: Start difference. First operand 136 states and 142 transitions. Second operand 121 states. [2019-10-06 23:34:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:34:07,121 INFO L93 Difference]: Finished difference Result 282 states and 346 transitions. [2019-10-06 23:34:07,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-10-06 23:34:07,121 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 132 [2019-10-06 23:34:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:34:07,123 INFO L225 Difference]: With dead ends: 282 [2019-10-06 23:34:07,123 INFO L226 Difference]: Without dead ends: 198 [2019-10-06 23:34:07,134 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12007 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14196, Invalid=41736, Unknown=0, NotChecked=0, Total=55932 [2019-10-06 23:34:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-06 23:34:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 189. [2019-10-06 23:34:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-06 23:34:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 195 transitions. [2019-10-06 23:34:07,155 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 195 transitions. Word has length 132 [2019-10-06 23:34:07,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:34:07,155 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 195 transitions. [2019-10-06 23:34:07,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-10-06 23:34:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 195 transitions. [2019-10-06 23:34:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-06 23:34:07,158 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:34:07,159 INFO L385 BasicCegarLoop]: trace histogram [94, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:34:07,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:34:07,372 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:34:07,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:34:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash -723793147, now seen corresponding path program 8 times [2019-10-06 23:34:07,372 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:34:07,373 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:07,373 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:07,373 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:07,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:34:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:34:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5065 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-10-06 23:34:10,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:10,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:34:10,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true