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/sorting_selectionsort_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:25:26,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:25:26,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:25:26,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:25:26,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:25:26,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:25:26,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:25:26,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:25:26,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:25:26,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:25:26,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:25:26,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:25:26,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:25:26,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:25:26,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:25:26,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:25:26,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:25:26,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:25:26,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:25:26,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:25:26,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:25:26,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:25:26,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:25:26,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:25:26,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:25:26,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:25:26,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:25:26,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:25:26,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:25:26,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:25:26,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:25:26,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:25:26,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:25:26,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:25:26,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:25:26,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:25:26,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:25:26,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:25:26,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:25:26,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:25:26,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:25:26,936 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:25:26,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:25:26,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:25:26,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:25:26,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:25:26,977 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:25:26,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:25:26,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:25:26,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:25:26,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:25:26,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:25:26,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:25:26,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:25:26,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:25:26,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:25:26,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:25:26,984 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:25:26,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:25:26,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:25:26,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:25:26,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:25:26,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:25:26,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:25:26,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:25:26,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:25:26,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:25:26,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:25:26,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:25:26,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:25:26,987 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:25:27,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:25:27,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:25:27,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:25:27,283 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:25:27,284 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:25:27,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-1.i [2019-10-06 23:25:27,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29f80959/f7215de7f58142a2a13792adc47034cf/FLAG24e25dd26 [2019-10-06 23:25:27,827 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:25:27,829 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-1.i [2019-10-06 23:25:27,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29f80959/f7215de7f58142a2a13792adc47034cf/FLAG24e25dd26 [2019-10-06 23:25:28,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c29f80959/f7215de7f58142a2a13792adc47034cf [2019-10-06 23:25:28,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:25:28,192 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:25:28,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:25:28,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:25:28,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:25:28,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b5ff0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28, skipping insertion in model container [2019-10-06 23:25:28,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,208 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:25:28,228 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:25:28,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:25:28,462 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:25:28,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:25:28,508 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:25:28,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28 WrapperNode [2019-10-06 23:25:28,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:25:28,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:25:28,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:25:28,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:25:28,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... [2019-10-06 23:25:28,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:25:28,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:25:28,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:25:28,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:25:28,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:25:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:25:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:25:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:25:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:25:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:25:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:25:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:25:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:25:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:25:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:25:28,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:25:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:25:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:25:28,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:25:29,209 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:25:29,209 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-06 23:25:29,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:25:29 BoogieIcfgContainer [2019-10-06 23:25:29,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:25:29,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:25:29,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:25:29,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:25:29,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:25:28" (1/3) ... [2019-10-06 23:25:29,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776126d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:25:29, skipping insertion in model container [2019-10-06 23:25:29,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:25:28" (2/3) ... [2019-10-06 23:25:29,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776126d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:25:29, skipping insertion in model container [2019-10-06 23:25:29,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:25:29" (3/3) ... [2019-10-06 23:25:29,219 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_ground-1.i [2019-10-06 23:25:29,229 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:25:29,237 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:25:29,247 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:25:29,273 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:25:29,273 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:25:29,273 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:25:29,274 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:25:29,274 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:25:29,274 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:25:29,274 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:25:29,275 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:25:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-06 23:25:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:25:29,299 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:29,300 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:29,302 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1973278226, now seen corresponding path program 1 times [2019-10-06 23:25:29,314 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:29,314 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:29,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:29,314 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:29,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:29,467 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:25:29,469 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:29,469 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:25:29,470 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:25:29,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:25:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:25:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:25:29,493 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-10-06 23:25:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:29,539 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2019-10-06 23:25:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:25:29,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:25:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:29,551 INFO L225 Difference]: With dead ends: 51 [2019-10-06 23:25:29,551 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:25:29,555 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:25:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:25:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-06 23:25:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-06 23:25:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-10-06 23:25:29,606 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 13 [2019-10-06 23:25:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:29,607 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-06 23:25:29,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:25:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-10-06 23:25:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:25:29,608 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:29,608 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:29,609 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:29,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1107315554, now seen corresponding path program 1 times [2019-10-06 23:25:29,610 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:29,610 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:29,611 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:29,611 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:29,658 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:25:29,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:29,659 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:25:29,659 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:25:29,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:25:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:25:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:25:29,668 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 3 states. [2019-10-06 23:25:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:29,731 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2019-10-06 23:25:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:25:29,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:25:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:29,734 INFO L225 Difference]: With dead ends: 45 [2019-10-06 23:25:29,734 INFO L226 Difference]: Without dead ends: 35 [2019-10-06 23:25:29,735 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:25:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-06 23:25:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-06 23:25:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-06 23:25:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-06 23:25:29,746 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 14 [2019-10-06 23:25:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:29,746 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-06 23:25:29,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:25:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2019-10-06 23:25:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:25:29,748 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:29,748 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:29,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1470921508, now seen corresponding path program 1 times [2019-10-06 23:25:29,749 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:29,749 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:29,749 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:29,750 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:29,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:25:29,821 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:29,821 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:29,822 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:25:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:29,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:25:29,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:25:29,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:25:29,963 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:29,987 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:25:29,987 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:29,992 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:29,998 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:29,999 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:30,177 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:30,424 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-06 23:25:30,431 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:30,441 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:30,441 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:30,442 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 103#false [2019-10-06 23:25:30,442 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 88#false [2019-10-06 23:25:30,442 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 108#false [2019-10-06 23:25:30,443 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 117#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:30,443 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:30,443 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 93#false [2019-10-06 23:25:30,444 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:25:30,444 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:25:30,444 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 122#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:25:30,445 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:30,445 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 83#false [2019-10-06 23:25:30,446 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 78#(and (< main_~i~0 100000) (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 0 main_~s~0) (= main_~k~0 (+ main_~i~0 1)) (<= 100000 main_~i~1) (<= main_~k~0 1) (= main_~i~0 main_~s~0) (<= main_~i~0 0) (<= main_~s~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:30,446 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:30,446 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 98#false [2019-10-06 23:25:30,447 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 113#false [2019-10-06 23:25:30,678 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:25:30,679 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4, 4, 4] total 13 [2019-10-06 23:25:30,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-06 23:25:30,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-06 23:25:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-06 23:25:30,681 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 8 states. [2019-10-06 23:25:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:31,031 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2019-10-06 23:25:31,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-06 23:25:31,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-06 23:25:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:31,033 INFO L225 Difference]: With dead ends: 55 [2019-10-06 23:25:31,034 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:25:31,035 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-06 23:25:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:25:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-10-06 23:25:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:25:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-10-06 23:25:31,049 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 15 [2019-10-06 23:25:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:31,049 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-10-06 23:25:31,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-06 23:25:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2019-10-06 23:25:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:25:31,051 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:31,051 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:25:31,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:31,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:31,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1528376143, now seen corresponding path program 1 times [2019-10-06 23:25:31,265 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:31,265 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:31,265 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:31,266 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:31,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:25:31,353 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:31,353 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:25:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:31,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:25:31,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:25:31,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:25:31,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:31,452 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:25:31,452 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:31,453 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:31,453 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:31,453 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:31,502 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:31,811 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2019-10-06 23:25:31,824 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:31,832 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:31,833 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:31,833 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 135#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:25:31,833 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 117#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:31,833 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 140#false [2019-10-06 23:25:31,834 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 149#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:31,834 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:31,834 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 125#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:31,834 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:25:31,835 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:25:31,835 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 154#(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:25:31,835 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:31,835 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:31,836 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:31,836 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:31,836 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 130#(and (= |__VERIFIER_assert_#in~cond| 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:31,836 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 145#false [2019-10-06 23:25:32,106 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-06 23:25:32,107 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 4, 4] total 18 [2019-10-06 23:25:32,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-06 23:25:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-06 23:25:32,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:25:32,109 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 11 states. [2019-10-06 23:25:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:32,485 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2019-10-06 23:25:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-06 23:25:32,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-10-06 23:25:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:32,488 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:25:32,488 INFO L226 Difference]: Without dead ends: 40 [2019-10-06 23:25:32,489 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-10-06 23:25:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-06 23:25:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-10-06 23:25:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:25:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-10-06 23:25:32,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 16 [2019-10-06 23:25:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:32,501 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-10-06 23:25:32,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-06 23:25:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-10-06 23:25:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-06 23:25:32,502 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:32,502 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:32,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:32,706 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:32,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2138333176, now seen corresponding path program 1 times [2019-10-06 23:25:32,707 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:32,708 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:32,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:32,708 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:32,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:25:32,760 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:32,760 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:32,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:25:32,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:32,862 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:25:32,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:25:32,890 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:32,892 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:25:32,892 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:32,894 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:32,895 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:32,896 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:32,938 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:33,296 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:25:33,345 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:33,349 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:33,349 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:33,350 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:25:33,350 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (or (and (<= 1 main_~x~0) (= main_~i~0 0)) (and (= main_~x~0 0) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:25:33,350 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:33,350 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:33,351 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:33,351 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:33,351 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:33,351 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:33,351 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:25:33,352 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:25:33,352 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:25:33,352 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:33,352 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:33,352 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:33,353 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:33,353 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:25:33,353 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:33,353 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:33,849 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:25:33,849 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 14] total 22 [2019-10-06 23:25:33,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-06 23:25:33,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-06 23:25:33,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-10-06 23:25:33,851 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 22 states. [2019-10-06 23:25:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:34,625 INFO L93 Difference]: Finished difference Result 73 states and 98 transitions. [2019-10-06 23:25:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:25:34,625 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-10-06 23:25:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:34,627 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:25:34,627 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:25:34,629 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:25:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:25:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-10-06 23:25:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-06 23:25:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-10-06 23:25:34,640 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 23 [2019-10-06 23:25:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:34,640 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-10-06 23:25:34,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-06 23:25:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-10-06 23:25:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:25:34,642 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:34,642 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:34,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:34,856 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:34,856 INFO L82 PathProgramCache]: Analyzing trace with hash 17647327, now seen corresponding path program 2 times [2019-10-06 23:25:34,857 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:34,857 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:34,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:34,858 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-06 23:25:34,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:34,915 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:34,915 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 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:25:34,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:25:34,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:25:34,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-06 23:25:34,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-06 23:25:35,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:25:35,086 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:35,088 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:25:35,089 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:35,090 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:35,090 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:35,090 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:35,121 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:35,374 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:25:35,395 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:35,399 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:35,400 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:35,401 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:25:35,403 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (or (and (<= 1 main_~x~0) (= main_~i~0 0)) (and (= main_~x~0 0) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:25:35,404 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:35,404 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:35,404 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:35,404 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:35,405 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:35,405 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:35,405 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:25:35,405 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:25:35,405 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:25:35,408 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:35,408 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:35,409 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:35,409 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:35,409 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:25:35,409 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:35,409 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:36,015 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:25:36,015 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 14] total 28 [2019-10-06 23:25:36,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:25:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:25:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:25:36,018 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 28 states. [2019-10-06 23:25:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:37,359 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2019-10-06 23:25:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-06 23:25:37,364 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-10-06 23:25:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:37,365 INFO L225 Difference]: With dead ends: 91 [2019-10-06 23:25:37,365 INFO L226 Difference]: Without dead ends: 61 [2019-10-06 23:25:37,368 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=440, Invalid=2530, Unknown=0, NotChecked=0, Total=2970 [2019-10-06 23:25:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-06 23:25:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2019-10-06 23:25:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-06 23:25:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2019-10-06 23:25:37,386 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2019-10-06 23:25:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:37,392 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2019-10-06 23:25:37,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:25:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2019-10-06 23:25:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:25:37,393 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:37,393 INFO L385 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:37,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:37,602 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1410067541, now seen corresponding path program 3 times [2019-10-06 23:25:37,603 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:37,603 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:37,603 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:37,604 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:25:37,706 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:37,706 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:37,706 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 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:25:37,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:25:37,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:25:37,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:25:37,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:25:37,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:25:37,875 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:37,877 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:25:37,877 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:37,878 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:37,879 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:37,879 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:37,904 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:38,102 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:25:38,118 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:38,122 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:38,122 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:38,122 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:25:38,122 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (or (and (<= 1 main_~x~0) (= main_~i~0 0)) (and (= main_~x~0 0) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:25:38,123 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:38,123 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:38,123 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:38,124 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:38,124 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:38,124 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:38,125 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:25:38,128 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:25:38,129 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:25:38,129 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:38,129 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:38,132 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:38,132 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:38,133 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:25:38,133 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:38,133 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:38,611 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:25:38,612 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 14] total 28 [2019-10-06 23:25:38,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:25:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:25:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:25:38,615 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 28 states. [2019-10-06 23:25:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:39,545 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2019-10-06 23:25:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:25:39,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2019-10-06 23:25:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:39,547 INFO L225 Difference]: With dead ends: 101 [2019-10-06 23:25:39,547 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:25:39,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=428, Invalid=2122, Unknown=0, NotChecked=0, Total=2550 [2019-10-06 23:25:39,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:25:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-06 23:25:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-06 23:25:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2019-10-06 23:25:39,559 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 32 [2019-10-06 23:25:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:39,559 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2019-10-06 23:25:39,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:25:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2019-10-06 23:25:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:25:39,560 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:39,560 INFO L385 BasicCegarLoop]: trace histogram [12, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:39,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:39,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1222392289, now seen corresponding path program 4 times [2019-10-06 23:25:39,766 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:39,767 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:39,767 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:39,767 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:39,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:25:39,921 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:39,921 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:39,922 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 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:25:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:40,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:25:40,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:25:40,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:25:40,270 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:40,272 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:25:40,272 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:40,272 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:40,273 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:40,273 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:40,305 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:40,456 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:25:40,468 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:40,471 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:40,471 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:40,471 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:25:40,471 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (or (and (<= 1 main_~x~0) (= main_~i~0 0)) (and (= main_~x~0 0) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:25:40,472 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:40,472 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:40,472 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:40,472 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:40,472 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:40,472 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:40,473 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:25:40,473 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:25:40,473 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:25:40,473 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:40,473 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:40,474 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:40,474 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:40,474 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:25:40,474 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:40,475 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:40,985 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:25:40,986 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 14] total 42 [2019-10-06 23:25:40,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-06 23:25:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-06 23:25:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1273, Unknown=0, NotChecked=0, Total=1722 [2019-10-06 23:25:40,989 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 42 states. [2019-10-06 23:25:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:42,531 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2019-10-06 23:25:42,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-06 23:25:42,532 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 39 [2019-10-06 23:25:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:42,533 INFO L225 Difference]: With dead ends: 115 [2019-10-06 23:25:42,533 INFO L226 Difference]: Without dead ends: 74 [2019-10-06 23:25:42,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1303, Invalid=4859, Unknown=0, NotChecked=0, Total=6162 [2019-10-06 23:25:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-06 23:25:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-10-06 23:25:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-06 23:25:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-10-06 23:25:42,547 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 39 [2019-10-06 23:25:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:42,547 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-10-06 23:25:42,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-06 23:25:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-10-06 23:25:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-06 23:25:42,548 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:42,549 INFO L385 BasicCegarLoop]: trace histogram [26, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:42,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:42,753 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1064533857, now seen corresponding path program 5 times [2019-10-06 23:25:42,754 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:42,754 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:42,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:42,754 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 2 proven. 351 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-06 23:25:43,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:43,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:43,138 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 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:25:43,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:25:43,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:25:43,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-06 23:25:43,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2019-10-06 23:25:43,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-10-06 23:25:43,576 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:43,578 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:25:43,578 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:43,578 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:43,578 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:43,579 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:43,599 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:43,748 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:25:43,762 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:43,765 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:43,765 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:43,765 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:25:43,765 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 1 main_~x~0) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:25:43,766 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:43,766 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:43,766 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:43,766 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:43,766 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:43,767 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:43,767 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:25:43,767 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:25:43,767 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:25:43,767 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:43,768 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:43,768 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:43,768 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:43,768 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:25:43,768 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:43,768 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:44,398 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:25:44,398 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 10, 14] total 58 [2019-10-06 23:25:44,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-06 23:25:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-06 23:25:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=2723, Unknown=0, NotChecked=0, Total=3306 [2019-10-06 23:25:44,401 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 58 states. [2019-10-06 23:25:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:48,020 INFO L93 Difference]: Finished difference Result 136 states and 178 transitions. [2019-10-06 23:25:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-06 23:25:48,020 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 53 [2019-10-06 23:25:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:48,022 INFO L225 Difference]: With dead ends: 136 [2019-10-06 23:25:48,022 INFO L226 Difference]: Without dead ends: 95 [2019-10-06 23:25:48,026 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3604 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2145, Invalid=11897, Unknown=0, NotChecked=0, Total=14042 [2019-10-06 23:25:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-06 23:25:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2019-10-06 23:25:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-06 23:25:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-10-06 23:25:48,039 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 53 [2019-10-06 23:25:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:48,039 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-10-06 23:25:48,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-06 23:25:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-10-06 23:25:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-06 23:25:48,041 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:48,041 INFO L385 BasicCegarLoop]: trace histogram [27, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:48,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:48,246 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:48,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:48,247 INFO L82 PathProgramCache]: Analyzing trace with hash 869018027, now seen corresponding path program 6 times [2019-10-06 23:25:48,247 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:48,248 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:48,248 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:48,248 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:25:48,693 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:48,693 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:48,693 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:48,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:25:48,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:25:48,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:25:48,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-06 23:25:48,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 2 proven. 378 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:25:49,792 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:49,794 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:25:49,794 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:49,794 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:49,794 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:49,795 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:49,820 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:25:50,002 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:25:50,016 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:25:50,019 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:25:50,019 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:25:50,019 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:25:50,019 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 1 main_~x~0) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:25:50,020 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:50,020 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:25:50,020 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:50,020 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:50,020 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:25:50,021 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:50,021 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:25:50,021 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:25:50,021 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:25:50,021 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:25:50,021 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:25:50,022 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:25:50,022 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:25:50,022 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:25:50,022 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:25:50,022 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:25:50,615 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:25:50,616 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 14] total 72 [2019-10-06 23:25:50,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-06 23:25:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-06 23:25:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1754, Invalid=3358, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:25:50,619 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 72 states. [2019-10-06 23:25:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:25:53,867 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2019-10-06 23:25:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-06 23:25:53,868 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 62 [2019-10-06 23:25:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:25:53,870 INFO L225 Difference]: With dead ends: 169 [2019-10-06 23:25:53,870 INFO L226 Difference]: Without dead ends: 116 [2019-10-06 23:25:53,876 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4754 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5158, Invalid=14024, Unknown=0, NotChecked=0, Total=19182 [2019-10-06 23:25:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-06 23:25:53,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-10-06 23:25:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-06 23:25:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2019-10-06 23:25:53,891 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 62 [2019-10-06 23:25:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:25:53,891 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2019-10-06 23:25:53,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-06 23:25:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2019-10-06 23:25:53,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-06 23:25:53,893 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:25:53,893 INFO L385 BasicCegarLoop]: trace histogram [56, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:25:54,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:54,101 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:25:54,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:25:54,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1788151393, now seen corresponding path program 7 times [2019-10-06 23:25:54,102 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:25:54,102 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:54,102 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:54,102 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:25:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:25:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 2 proven. 1596 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:25:55,443 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:25:55,443 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:25:55,443 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:25:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:25:55,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:25:55,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:25:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-06 23:25:55,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:25:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 2 proven. 1596 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:25:59,857 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:25:59,858 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:25:59,858 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:25:59,859 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:25:59,859 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:25:59,859 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:25:59,872 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:26:00,032 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:26:00,054 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:26:00,057 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:26:00,058 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:26:00,058 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:26:00,058 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 1 main_~x~0) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:26:00,058 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:26:00,058 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:26:00,058 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:26:00,058 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:00,059 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:26:00,059 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:00,059 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:26:00,059 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:26:00,059 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:26:00,059 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:26:00,059 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:00,060 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:26:00,060 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:26:00,060 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:26:00,060 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:26:00,060 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:26:00,863 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:26:00,863 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 14] total 130 [2019-10-06 23:26:00,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-10-06 23:26:00,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-10-06 23:26:00,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6829, Invalid=9941, Unknown=0, NotChecked=0, Total=16770 [2019-10-06 23:26:00,867 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 130 states. [2019-10-06 23:26:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:26:10,414 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2019-10-06 23:26:10,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-10-06 23:26:10,414 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 91 [2019-10-06 23:26:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:26:10,417 INFO L225 Difference]: With dead ends: 227 [2019-10-06 23:26:10,417 INFO L226 Difference]: Without dead ends: 174 [2019-10-06 23:26:10,422 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13686 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=20267, Invalid=44503, Unknown=0, NotChecked=0, Total=64770 [2019-10-06 23:26:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-06 23:26:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-10-06 23:26:10,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-06 23:26:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 185 transitions. [2019-10-06 23:26:10,441 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 185 transitions. Word has length 91 [2019-10-06 23:26:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:26:10,442 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 185 transitions. [2019-10-06 23:26:10,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-10-06 23:26:10,442 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 185 transitions. [2019-10-06 23:26:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-06 23:26:10,444 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:26:10,445 INFO L385 BasicCegarLoop]: trace histogram [114, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:26:10,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:26:10,651 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:26:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:26:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1910199583, now seen corresponding path program 8 times [2019-10-06 23:26:10,652 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:26:10,652 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:26:10,652 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:26:10,653 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:26:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:26:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:26:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6664 backedges. 2 proven. 6555 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-06 23:26:15,538 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:26:15,539 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:26:15,539 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:26:15,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-06 23:26:15,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:26:15,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-06 23:26:15,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:26:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6664 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6559 trivial. 0 not checked. [2019-10-06 23:26:16,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:26:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6664 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 6557 trivial. 0 not checked. [2019-10-06 23:26:17,734 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:26:17,735 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:26:17,735 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:26:17,736 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:26:17,736 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:26:17,736 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:26:17,760 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:26:17,948 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:26:17,959 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:26:17,961 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:26:17,961 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:26:17,961 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:26:17,962 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (or (and (<= 1 main_~x~0) (= main_~i~0 0)) (and (= main_~x~0 0) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:26:17,962 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:26:17,962 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:26:17,962 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:26:17,962 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:17,963 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:26:17,963 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:17,963 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:26:17,963 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:26:17,963 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:26:17,963 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:26:17,963 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:17,963 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:26:17,963 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:26:17,964 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:26:17,964 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:26:17,964 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:26:19,391 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:26:19,391 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 18, 18, 14] total 162 [2019-10-06 23:26:19,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-10-06 23:26:19,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-10-06 23:26:19,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7339, Invalid=18743, Unknown=0, NotChecked=0, Total=26082 [2019-10-06 23:26:19,395 INFO L87 Difference]: Start difference. First operand 173 states and 185 transitions. Second operand 162 states. [2019-10-06 23:26:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:26:37,739 INFO L93 Difference]: Finished difference Result 260 states and 314 transitions. [2019-10-06 23:26:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2019-10-06 23:26:37,740 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 149 [2019-10-06 23:26:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:26:37,744 INFO L225 Difference]: With dead ends: 260 [2019-10-06 23:26:37,745 INFO L226 Difference]: Without dead ends: 207 [2019-10-06 23:26:37,754 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 401 SyntacticMatches, 2 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24012 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=23377, Invalid=88513, Unknown=0, NotChecked=0, Total=111890 [2019-10-06 23:26:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-06 23:26:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 198. [2019-10-06 23:26:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-06 23:26:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 210 transitions. [2019-10-06 23:26:37,790 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 210 transitions. Word has length 149 [2019-10-06 23:26:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:26:37,792 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 210 transitions. [2019-10-06 23:26:37,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-10-06 23:26:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 210 transitions. [2019-10-06 23:26:37,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-06 23:26:37,808 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:26:37,808 INFO L385 BasicCegarLoop]: trace histogram [115, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:26:38,015 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:26:38,015 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:26:38,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:26:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1331153749, now seen corresponding path program 9 times [2019-10-06 23:26:38,016 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:26:38,016 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:26:38,017 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:26:38,017 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:26:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:26:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:26:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 2 proven. 6670 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:26:42,868 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:26:42,868 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:26:42,868 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:26:43,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:26:43,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:26:43,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:26:43,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:26:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-06 23:26:43,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:26:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7139 backedges. 2 proven. 6670 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:26:56,927 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:26:56,929 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:26:56,929 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:26:56,929 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:26:56,929 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:26:56,930 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:26:56,946 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:26:57,100 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:26:57,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:26:57,116 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:26:57,116 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:26:57,116 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:26:57,116 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(and (or (and (<= 1 main_~x~0) (= main_~i~0 0)) (and (= main_~x~0 0) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 1 main_~x~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0)))) [2019-10-06 23:26:57,116 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:26:57,117 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:26:57,117 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:26:57,117 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:57,117 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:26:57,117 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:57,118 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:26:57,118 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:26:57,118 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:26:57,118 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:26:57,118 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:26:57,118 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:26:57,119 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:26:57,119 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:26:57,119 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:26:57,119 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:26:58,342 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:26:58,342 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 14] total 248 [2019-10-06 23:26:58,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 248 states [2019-10-06 23:26:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2019-10-06 23:26:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27538, Invalid=33718, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:26:58,348 INFO L87 Difference]: Start difference. First operand 198 states and 210 transitions. Second operand 248 states. [2019-10-06 23:27:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:27:31,437 INFO L93 Difference]: Finished difference Result 393 states and 533 transitions. [2019-10-06 23:27:31,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2019-10-06 23:27:31,437 INFO L78 Accepts]: Start accepts. Automaton has 248 states. Word has length 166 [2019-10-06 23:27:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:27:31,443 INFO L225 Difference]: With dead ends: 393 [2019-10-06 23:27:31,443 INFO L226 Difference]: Without dead ends: 316 [2019-10-06 23:27:31,455 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 489 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44838 ImplicationChecksByTransitivity, 50.7s TimeCoverageRelationStatistics Valid=82158, Invalid=158432, Unknown=0, NotChecked=0, Total=240590 [2019-10-06 23:27:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-10-06 23:27:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2019-10-06 23:27:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-10-06 23:27:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 327 transitions. [2019-10-06 23:27:31,480 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 327 transitions. Word has length 166 [2019-10-06 23:27:31,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:27:31,481 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 327 transitions. [2019-10-06 23:27:31,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 248 states. [2019-10-06 23:27:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 327 transitions. [2019-10-06 23:27:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-06 23:27:31,484 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:27:31,484 INFO L385 BasicCegarLoop]: trace histogram [232, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:27:31,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:31,689 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:27:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:27:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1694442143, now seen corresponding path program 10 times [2019-10-06 23:27:31,690 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:27:31,690 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:31,691 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:31,691 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:27:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:27:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27497 backedges. 2 proven. 27028 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:27:50,871 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:27:50,871 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:27:50,871 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:27:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:27:51,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:27:51,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:27:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 27497 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2019-10-06 23:27:51,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:28:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 27497 backedges. 2 proven. 27028 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:28:47,823 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:28:47,825 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:28:47,825 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:28:47,825 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:28:47,825 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:28:47,826 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:28:47,842 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:28:47,982 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:28:47,998 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:28:48,006 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:28:48,006 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:28:48,006 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:28:48,006 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 1 main_~x~0) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:28:48,007 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:28:48,007 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:28:48,007 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:28:48,007 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:48,007 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:28:48,007 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:48,007 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:28:48,008 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:28:48,008 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:28:48,008 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:28:48,010 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:28:48,010 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:28:48,011 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:28:48,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-06 23:28:48,011 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:28:48,011 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:28:50,128 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:28:50,128 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 14] total 482 [2019-10-06 23:28:50,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 482 states [2019-10-06 23:28:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 482 interpolants. [2019-10-06 23:28:50,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109789, Invalid=122053, Unknown=0, NotChecked=0, Total=231842 [2019-10-06 23:28:50,146 INFO L87 Difference]: Start difference. First operand 315 states and 327 transitions. Second operand 482 states. [2019-10-06 23:31:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:00,240 INFO L93 Difference]: Finished difference Result 627 states and 884 transitions. [2019-10-06 23:31:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 482 states. [2019-10-06 23:31:00,240 INFO L78 Accepts]: Start accepts. Automaton has 482 states. Word has length 283 [2019-10-06 23:31:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:00,244 INFO L225 Difference]: With dead ends: 627 [2019-10-06 23:31:00,244 INFO L226 Difference]: Without dead ends: 550 [2019-10-06 23:31:00,271 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1560 GetRequests, 601 SyntacticMatches, 2 SemanticMatches, 957 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158094 ImplicationChecksByTransitivity, 195.7s TimeCoverageRelationStatistics Valid=328443, Invalid=590279, Unknown=0, NotChecked=0, Total=918722 [2019-10-06 23:31:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-06 23:31:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 549. [2019-10-06 23:31:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-10-06 23:31:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 561 transitions. [2019-10-06 23:31:00,304 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 561 transitions. Word has length 283 [2019-10-06 23:31:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:00,305 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 561 transitions. [2019-10-06 23:31:00,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 482 states. [2019-10-06 23:31:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 561 transitions. [2019-10-06 23:31:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-10-06 23:31:00,315 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:00,315 INFO L385 BasicCegarLoop]: trace histogram [466, 30, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:00,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:00,521 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:00,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1259602463, now seen corresponding path program 11 times [2019-10-06 23:31:00,522 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:00,522 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:00,522 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:00,522 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 109280 backedges. 2 proven. 108811 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2019-10-06 23:32:17,894 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:17,894 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:32:17,894 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:23,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-06 23:32:23,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:32:23,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-06 23:32:23,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:32:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 109280 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 108815 trivial. 0 not checked. [2019-10-06 23:32:30,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:32:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 109280 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 108813 trivial. 0 not checked. [2019-10-06 23:32:37,017 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:32:37,019 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:32:37,019 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:32:37,019 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:32:37,019 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:32:37,020 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:32:37,037 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:32:37,203 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:32:37,217 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:32:37,222 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:32:37,223 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:32:37,223 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 206#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-06 23:32:37,223 INFO L193 IcfgInterpreter]: Reachable states at location L36-3 satisfy 196#(or (and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 1 main_~x~0) (<= 100000 main_~k~0) (<= main_~i~0 0) (= main_~i~0 0)) (and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0))) [2019-10-06 23:32:37,223 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 221#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:32:37,223 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 230#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:32:37,223 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 216#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:32:37,224 INFO L193 IcfgInterpreter]: Reachable states at location L37-1 satisfy 187#(and (<= |main_#t~mem12| |main_#t~mem11|) (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:32:37,224 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 73#(and (<= 0 main_~i~0) (not (< main_~i~1 100000)) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0)) [2019-10-06 23:32:37,224 INFO L193 IcfgInterpreter]: Reachable states at location L37 satisfy 175#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:32:37,224 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:32:37,224 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:32:37,224 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 235#(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:32:37,224 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:32:37,225 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 109#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (= main_~x~0 0) (<= 100000 main_~i~1) (<= 100000 main_~k~0) (<= main_~x~0 0) (<= main_~i~0 0) (<= 0 main_~x~0) (= main_~i~0 0)) [2019-10-06 23:32:37,225 INFO L193 IcfgInterpreter]: Reachable states at location L20-2 satisfy 101#(and (<= 0 main_~i~0) (<= 0 main_~s~0) (<= 100000 main_~i~1) (<= main_~i~0 0) (= main_~i~0 0) (<= 1 main_~k~0)) [2019-10-06 23:32:37,225 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 68#true [2019-10-06 23:32:37,225 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 201#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-06 23:32:37,225 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 226#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-06 23:32:37,226 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 211#(and (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-06 23:32:41,464 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:32:41,464 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [469, 34, 34, 14] total 546 [2019-10-06 23:32:41,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 546 states [2019-10-06 23:32:41,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 546 interpolants. [2019-10-06 23:32:41,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111819, Invalid=185751, Unknown=0, NotChecked=0, Total=297570 [2019-10-06 23:32:41,489 INFO L87 Difference]: Start difference. First operand 549 states and 561 transitions. Second operand 546 states. [2019-10-06 23:33:33,583 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-10-06 23:35:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:35:59,614 INFO L93 Difference]: Finished difference Result 684 states and 762 transitions. [2019-10-06 23:35:59,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 578 states. [2019-10-06 23:35:59,614 INFO L78 Accepts]: Start accepts. Automaton has 546 states. Word has length 517 [2019-10-06 23:35:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:35:59,620 INFO L225 Difference]: With dead ends: 684 [2019-10-06 23:35:59,620 INFO L226 Difference]: Without dead ends: 607 [2019-10-06 23:35:59,654 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2592 GetRequests, 1473 SyntacticMatches, 2 SemanticMatches, 1117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221204 ImplicationChecksByTransitivity, 272.5s TimeCoverageRelationStatistics Valid=340409, Invalid=910633, Unknown=0, NotChecked=0, Total=1251042 [2019-10-06 23:35:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-06 23:35:59,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 598. [2019-10-06 23:35:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-06 23:35:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 610 transitions. [2019-10-06 23:35:59,694 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 610 transitions. Word has length 517 [2019-10-06 23:35:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:35:59,695 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 610 transitions. [2019-10-06 23:35:59,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 546 states. [2019-10-06 23:35:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 610 transitions. [2019-10-06 23:35:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2019-10-06 23:35:59,705 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:35:59,705 INFO L385 BasicCegarLoop]: trace histogram [467, 62, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:35:59,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:35:59,914 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:35:59,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:35:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash -69974357, now seen corresponding path program 12 times [2019-10-06 23:35:59,915 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:35:59,915 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:35:59,915 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:35:59,915 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:35:59,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:36:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 111235 backedges. 2 proven. 109278 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2019-10-06 23:37:17,697 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:17,697 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:17,697 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:18,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:37:18,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:37:18,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 3133 conjuncts, 469 conjunts are in the unsatisfiable core [2019-10-06 23:37:18,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:37:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 111235 backedges. 0 proven. 109278 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2019-10-06 23:37:19,014 INFO L322 TraceCheckSpWp]: Computing backward predicates...