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-crafted/zero_sum_m2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:15:54,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:15:54,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:15:54,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:15:54,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:15:54,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:15:54,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:15:54,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:15:54,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:15:54,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:15:54,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:15:54,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:15:54,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:15:54,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:15:54,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:15:54,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:15:54,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:15:54,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:15:54,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:15:54,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:15:54,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:15:54,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:15:54,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:15:54,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:15:54,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:15:54,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:15:54,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:15:54,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:15:54,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:15:54,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:15:54,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:15:54,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:15:54,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:15:54,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:15:54,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:15:54,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:15:54,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:15:54,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:15:54,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:15:54,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:15:54,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:15:54,993 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:15:55,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:15:55,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:15:55,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:15:55,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:15:55,008 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:15:55,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:15:55,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:15:55,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:15:55,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:15:55,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:15:55,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:15:55,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:15:55,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:15:55,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:15:55,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:15:55,010 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:15:55,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:15:55,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:15:55,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:15:55,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:15:55,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:15:55,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:15:55,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:15:55,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:15:55,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:15:55,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:15:55,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:15:55,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:15:55,012 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:15:55,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:15:55,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:15:55,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:15:55,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:15:55,315 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:15:55,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_m2.c [2019-10-06 23:15:55,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ab43fb9/db7f8038cdb04dee88e8e5ede522b08d/FLAGaf38fb604 [2019-10-06 23:15:55,869 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:15:55,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_m2.c [2019-10-06 23:15:55,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ab43fb9/db7f8038cdb04dee88e8e5ede522b08d/FLAGaf38fb604 [2019-10-06 23:15:56,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ab43fb9/db7f8038cdb04dee88e8e5ede522b08d [2019-10-06 23:15:56,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:15:56,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:15:56,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:15:56,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:15:56,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:15:56,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4c3d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56, skipping insertion in model container [2019-10-06 23:15:56,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,256 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:15:56,279 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:15:56,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:15:56,485 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:15:56,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:15:56,611 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:15:56,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56 WrapperNode [2019-10-06 23:15:56,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:15:56,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:15:56,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:15:56,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:15:56,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (1/1) ... [2019-10-06 23:15:56,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:15:56,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:15:56,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:15:56,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:15:56,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (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:15:56,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:15:56,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:15:56,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:15:56,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:15:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:15:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-06 23:15:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:15:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2019-10-06 23:15:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:15:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:15:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:15:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:15:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:15:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:15:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:15:57,115 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:15:57,115 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:15:57,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:15:57 BoogieIcfgContainer [2019-10-06 23:15:57,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:15:57,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:15:57,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:15:57,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:15:57,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:15:56" (1/3) ... [2019-10-06 23:15:57,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef90486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:15:57, skipping insertion in model container [2019-10-06 23:15:57,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:15:56" (2/3) ... [2019-10-06 23:15:57,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef90486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:15:57, skipping insertion in model container [2019-10-06 23:15:57,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:15:57" (3/3) ... [2019-10-06 23:15:57,125 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_m2.c [2019-10-06 23:15:57,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:15:57,142 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:15:57,153 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:15:57,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:15:57,175 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:15:57,175 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:15:57,176 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:15:57,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:15:57,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:15:57,176 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:15:57,176 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:15:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-06 23:15:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:15:57,197 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:15:57,198 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:15:57,199 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:15:57,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:15:57,204 INFO L82 PathProgramCache]: Analyzing trace with hash -112684807, now seen corresponding path program 1 times [2019-10-06 23:15:57,210 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:15:57,210 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,211 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,211 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:15:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:15:57,404 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:15:57,405 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,405 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:15:57,406 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-06 23:15:57,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-06 23:15:57,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-06 23:15:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-06 23:15:57,427 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-10-06 23:15:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:15:57,535 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-06 23:15:57,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-06 23:15:57,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-06 23:15:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:15:57,548 INFO L225 Difference]: With dead ends: 44 [2019-10-06 23:15:57,548 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:15:57,552 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-06 23:15:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:15:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:15:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:15:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-10-06 23:15:57,591 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 15 [2019-10-06 23:15:57,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:15:57,591 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-10-06 23:15:57,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-06 23:15:57,592 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2019-10-06 23:15:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:15:57,593 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:15:57,593 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:15:57,594 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:15:57,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:15:57,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1049806191, now seen corresponding path program 1 times [2019-10-06 23:15:57,595 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:15:57,595 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,595 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:15:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:15:57,648 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:15:57,649 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,652 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:15:57,653 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:15:57,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:15:57,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:15:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:15:57,656 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2019-10-06 23:15:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:15:57,698 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2019-10-06 23:15:57,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:15:57,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:15:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:15:57,700 INFO L225 Difference]: With dead ends: 34 [2019-10-06 23:15:57,701 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:15:57,702 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:15:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:15:57,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:15:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:15:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-10-06 23:15:57,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 16 [2019-10-06 23:15:57,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:15:57,715 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-10-06 23:15:57,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:15:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-10-06 23:15:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:15:57,716 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:15:57,717 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:15:57,717 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:15:57,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:15:57,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2044317511, now seen corresponding path program 1 times [2019-10-06 23:15:57,718 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:15:57,718 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,718 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:15:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:15:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:15:57,816 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,816 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:15:57,817 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-06 23:15:57,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-06 23:15:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-06 23:15:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:15:57,818 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 4 states. [2019-10-06 23:15:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:15:57,869 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2019-10-06 23:15:57,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-06 23:15:57,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-06 23:15:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:15:57,870 INFO L225 Difference]: With dead ends: 32 [2019-10-06 23:15:57,870 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:15:57,871 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-06 23:15:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:15:57,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:15:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:15:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:15:57,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2019-10-06 23:15:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:15:57,878 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:15:57,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-06 23:15:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:15:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:15:57,879 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:15:57,879 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:15:57,879 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:15:57,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:15:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1165736995, now seen corresponding path program 1 times [2019-10-06 23:15:57,880 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:15:57,880 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,881 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,881 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:15:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:15:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:15:57,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:57,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:15:57,971 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:15:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:15:58,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:15:58,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:15:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:15:58,086 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:15:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:15:58,135 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:15:58,159 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:15:58,160 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:15:58,166 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:15:58,172 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:15:58,173 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:15:58,363 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:15:58,779 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:15:58,799 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:15:58,807 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:15:58,808 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:15:58,808 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:15:58,808 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:15:58,809 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:15:58,809 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:15:58,809 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:15:58,809 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:15:58,810 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:15:58,810 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:15:58,810 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:15:58,811 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:15:58,811 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:15:58,811 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:15:58,811 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:15:58,811 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:15:58,812 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:15:58,812 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:15:59,196 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:15:59,196 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:15:59,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:15:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:15:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:15:59,199 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 17 states. [2019-10-06 23:15:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:15:59,473 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2019-10-06 23:15:59,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-06 23:15:59,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-10-06 23:15:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:15:59,475 INFO L225 Difference]: With dead ends: 35 [2019-10-06 23:15:59,475 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:15:59,476 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2019-10-06 23:15:59,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:15:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-06 23:15:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:15:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-06 23:15:59,481 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2019-10-06 23:15:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:15:59,482 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-06 23:15:59,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:15:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-06 23:15:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:15:59,483 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:15:59,483 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:15:59,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:15:59,687 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:15:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:15:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash 394462681, now seen corresponding path program 2 times [2019-10-06 23:15:59,688 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:15:59,688 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:59,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:59,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:15:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:15:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:15:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:15:59,756 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:15:59,756 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:15:59,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:15:59,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:15:59,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:15:59,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:15:59,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:15:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:15:59,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:15:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:15:59,879 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:15:59,881 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:15:59,881 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:15:59,882 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:15:59,882 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:15:59,883 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:15:59,940 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:00,230 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:00,250 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:00,272 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:00,273 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:00,273 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:00,273 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:16:00,273 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:00,274 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:00,274 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:00,274 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:00,274 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:00,274 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:16:00,275 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:00,275 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:00,275 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:00,276 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:00,276 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:00,276 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:00,281 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:16:00,282 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:16:00,652 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:00,653 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 18 [2019-10-06 23:16:00,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:16:00,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:16:00,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:16:00,655 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-06 23:16:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:01,008 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-10-06 23:16:01,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-06 23:16:01,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-10-06 23:16:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:01,010 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:16:01,010 INFO L226 Difference]: Without dead ends: 26 [2019-10-06 23:16:01,011 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:16:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-06 23:16:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-06 23:16:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-06 23:16:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-06 23:16:01,020 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2019-10-06 23:16:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:01,021 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-06 23:16:01,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:16:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-06 23:16:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-06 23:16:01,024 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:01,024 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:01,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:01,225 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash 513164793, now seen corresponding path program 3 times [2019-10-06 23:16:01,226 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:01,226 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:01,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:01,227 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:01,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:01,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:01,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:02,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:16:02,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:02,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-06 23:16:02,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:16:02,285 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-06 23:16:02,817 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:02,818 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:16:02,818 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:02,819 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:02,819 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:02,819 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:02,847 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:03,027 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:03,042 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:03,050 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:03,050 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:03,051 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:03,051 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:16:03,051 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:03,051 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:03,051 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:03,052 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:03,052 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:03,052 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:16:03,052 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:03,053 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:03,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:03,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:03,053 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:03,054 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:03,054 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:16:03,055 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:16:03,708 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:03,708 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15, 11] total 43 [2019-10-06 23:16:03,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-06 23:16:03,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-06 23:16:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1674, Unknown=0, NotChecked=0, Total=1806 [2019-10-06 23:16:03,711 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 43 states. [2019-10-06 23:16:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:04,712 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-10-06 23:16:04,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:16:04,712 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 25 [2019-10-06 23:16:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:04,714 INFO L225 Difference]: With dead ends: 41 [2019-10-06 23:16:04,714 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:16:04,717 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:16:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:16:04,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-10-06 23:16:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:16:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-06 23:16:04,724 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 25 [2019-10-06 23:16:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:04,724 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-06 23:16:04,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-06 23:16:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-06 23:16:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-06 23:16:04,725 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:04,726 INFO L385 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:04,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:04,928 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash -609919663, now seen corresponding path program 4 times [2019-10-06 23:16:04,930 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:04,930 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:04,931 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:04,932 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:16:05,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:05,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:05,019 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:05,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:16:05,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:16:05,181 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-06 23:16:05,230 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:05,232 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:16:05,232 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:05,233 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:05,233 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:05,233 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:05,258 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:16:05,402 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:05,412 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:05,416 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:05,416 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:05,417 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:05,417 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:16:05,417 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:05,417 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:05,418 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:05,418 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:05,418 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:05,418 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:16:05,418 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:05,419 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:05,419 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:05,419 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:05,419 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:05,419 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:05,420 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:16:05,420 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:16:05,804 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:05,804 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-06 23:16:05,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-06 23:16:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-06 23:16:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:16:05,807 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 26 states. [2019-10-06 23:16:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:06,493 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2019-10-06 23:16:06,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:16:06,494 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-10-06 23:16:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:06,497 INFO L225 Difference]: With dead ends: 79 [2019-10-06 23:16:06,497 INFO L226 Difference]: Without dead ends: 43 [2019-10-06 23:16:06,499 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:16:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-06 23:16:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2019-10-06 23:16:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:16:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2019-10-06 23:16:06,506 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 26 [2019-10-06 23:16:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:06,506 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2019-10-06 23:16:06,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-06 23:16:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2019-10-06 23:16:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:16:06,507 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:06,507 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:06,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:06,712 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 924814918, now seen corresponding path program 5 times [2019-10-06 23:16:06,712 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:06,712 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:06,713 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:06,713 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:16:06,776 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:06,776 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:06,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:06,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:16:06,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:06,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:16:06,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:16:06,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-06 23:16:06,978 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:06,980 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:16:06,980 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:06,981 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:06,981 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:06,981 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:07,004 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:16:07,147 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:07,156 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:07,159 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:07,160 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:07,160 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:07,160 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:16:07,160 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:07,161 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:07,161 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:07,161 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:07,161 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:07,161 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:16:07,162 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:07,162 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:07,162 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:07,162 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:07,162 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:07,163 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:07,163 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:16:07,163 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:16:07,531 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:07,532 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 26 [2019-10-06 23:16:07,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-06 23:16:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-06 23:16:07,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:16:07,534 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 26 states. [2019-10-06 23:16:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:08,104 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-06 23:16:08,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-06 23:16:08,104 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 27 [2019-10-06 23:16:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:08,105 INFO L225 Difference]: With dead ends: 42 [2019-10-06 23:16:08,105 INFO L226 Difference]: Without dead ends: 31 [2019-10-06 23:16:08,106 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:16:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-06 23:16:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-06 23:16:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-06 23:16:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-06 23:16:08,111 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2019-10-06 23:16:08,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:08,112 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-06 23:16:08,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-06 23:16:08,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-06 23:16:08,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:16:08,113 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:08,113 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:08,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:08,317 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash -902503389, now seen corresponding path program 6 times [2019-10-06 23:16:08,319 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:08,319 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:08,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:08,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:09,004 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2019-10-06 23:16:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:10,188 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:10,188 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:10,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:10,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:16:10,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:10,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:16:10,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:16:10,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:16:12,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:12,029 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:16:12,029 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:12,030 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:12,030 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:12,030 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:12,051 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:16:12,201 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:12,210 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:12,214 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:12,214 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:12,214 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:12,214 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:16:12,215 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:12,216 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:12,216 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:12,216 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:12,216 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:12,217 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:16:12,217 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:12,218 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:12,218 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:12,218 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:12,218 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:12,219 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:12,219 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:16:12,219 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:16:12,995 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:12,995 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 19, 11] total 65 [2019-10-06 23:16:12,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-06 23:16:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-06 23:16:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3914, Unknown=0, NotChecked=0, Total=4160 [2019-10-06 23:16:12,999 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 65 states. [2019-10-06 23:16:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:16,490 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2019-10-06 23:16:16,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-06 23:16:16,491 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 30 [2019-10-06 23:16:16,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:16,492 INFO L225 Difference]: With dead ends: 83 [2019-10-06 23:16:16,492 INFO L226 Difference]: Without dead ends: 45 [2019-10-06 23:16:16,496 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=560, Invalid=8560, Unknown=0, NotChecked=0, Total=9120 [2019-10-06 23:16:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-06 23:16:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-10-06 23:16:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-06 23:16:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-06 23:16:16,503 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 30 [2019-10-06 23:16:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:16,503 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-06 23:16:16,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-06 23:16:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-06 23:16:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-06 23:16:16,505 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:16,505 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:16,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:16,709 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash -86102225, now seen corresponding path program 7 times [2019-10-06 23:16:16,709 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:16,709 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:16,709 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:16,709 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:16:16,796 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:16,796 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:16,797 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:16,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-06 23:16:16,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:16:17,044 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:16:17,132 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:16:17,133 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:16:17,133 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:16:17,134 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:16:17,134 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:16:17,134 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:16:17,156 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:16:17,274 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:16:17,282 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:16:17,285 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:16:17,285 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:16:17,286 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:16:17,286 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:16:17,286 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:16:17,286 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:17,286 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:16:17,287 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:16:17,287 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:16:17,287 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:16:17,287 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:17,287 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:16:17,287 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:16:17,288 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:16:17,288 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:16:17,288 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:16:17,288 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:16:17,288 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:16:17,658 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:16:17,658 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 34 [2019-10-06 23:16:17,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-06 23:16:17,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-06 23:16:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2019-10-06 23:16:17,661 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 34 states. [2019-10-06 23:16:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:16:18,214 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-06 23:16:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:16:18,215 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2019-10-06 23:16:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:16:18,216 INFO L225 Difference]: With dead ends: 59 [2019-10-06 23:16:18,216 INFO L226 Difference]: Without dead ends: 36 [2019-10-06 23:16:18,217 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-06 23:16:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-06 23:16:18,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-06 23:16:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-06 23:16:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-06 23:16:18,223 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 32 [2019-10-06 23:16:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:16:18,224 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-06 23:16:18,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-06 23:16:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-06 23:16:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-06 23:16:18,225 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:16:18,225 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:16:18,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:18,430 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:16:18,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:16:18,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1919390983, now seen corresponding path program 8 times [2019-10-06 23:16:18,430 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:16:18,431 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:18,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:18,431 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:16:18,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:16:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:16:19,027 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2019-10-06 23:16:19,153 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2019-10-06 23:16:19,283 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2019-10-06 23:16:19,552 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-10-06 23:16:19,700 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-10-06 23:16:19,834 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-10-06 23:16:19,970 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-10-06 23:16:20,488 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-10-06 23:16:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:16:21,130 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:16:21,131 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:16:21,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:16:21,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:16:21,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:16:21,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 82 conjunts are in the unsatisfiable core [2019-10-06 23:16:21,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:16:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:16:23,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:16:41,025 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 123 [2019-10-06 23:16:53,269 WARN L191 SmtUtils]: Spent 8.25 s on a formula simplification. DAG size of input: 2930 DAG size of output: 75 [2019-10-06 23:16:53,639 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 123 [2019-10-06 23:17:02,956 WARN L191 SmtUtils]: Spent 7.20 s on a formula simplification. DAG size of input: 3056 DAG size of output: 54 [2019-10-06 23:17:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:17:03,227 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:17:03,229 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:17:03,229 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:17:03,229 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:17:03,230 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:17:03,230 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:17:03,252 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:17:03,370 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:17:03,382 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:17:03,387 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:17:03,388 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:17:03,388 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (<= ~SIZE~0 32767) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:17:03,388 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:17:03,388 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:17:03,389 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:03,389 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:17:03,389 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:17:03,389 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:17:03,390 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:17:03,390 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:03,390 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:17:03,390 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:17:03,390 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:17:03,390 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:17:03,391 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:17:03,391 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:17:03,391 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:17:04,779 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:17:04,779 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 26, 11] total 83 [2019-10-06 23:17:04,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-06 23:17:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-06 23:17:04,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=6309, Unknown=7, NotChecked=0, Total=6806 [2019-10-06 23:17:04,786 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 83 states. [2019-10-06 23:17:07,307 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 136 [2019-10-06 23:17:07,926 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2019-10-06 23:17:09,357 WARN L191 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 132 [2019-10-06 23:17:23,989 WARN L191 SmtUtils]: Spent 12.52 s on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2019-10-06 23:17:29,022 WARN L191 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 127 DAG size of output: 107 [2019-10-06 23:17:55,282 WARN L191 SmtUtils]: Spent 25.59 s on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2019-10-06 23:17:56,124 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2019-10-06 23:17:56,921 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-10-06 23:18:16,894 WARN L191 SmtUtils]: Spent 17.09 s on a formula simplification. DAG size of input: 132 DAG size of output: 106 [2019-10-06 23:18:17,395 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 94 [2019-10-06 23:18:18,060 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 89 [2019-10-06 23:18:18,732 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-10-06 23:18:19,061 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-06 23:18:20,967 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 132 [2019-10-06 23:18:21,942 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2019-10-06 23:18:22,484 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2019-10-06 23:18:23,738 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 116 [2019-10-06 23:18:27,245 WARN L191 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 111 [2019-10-06 23:18:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:28,826 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2019-10-06 23:18:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-06 23:18:28,827 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 35 [2019-10-06 23:18:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:28,829 INFO L225 Difference]: With dead ends: 102 [2019-10-06 23:18:28,829 INFO L226 Difference]: Without dead ends: 87 [2019-10-06 23:18:28,836 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5568 ImplicationChecksByTransitivity, 102.3s TimeCoverageRelationStatistics Valid=1591, Invalid=18993, Unknown=8, NotChecked=0, Total=20592 [2019-10-06 23:18:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-06 23:18:28,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2019-10-06 23:18:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-06 23:18:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-10-06 23:18:28,855 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 35 [2019-10-06 23:18:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:28,855 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-10-06 23:18:28,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-06 23:18:28,855 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-10-06 23:18:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-06 23:18:28,856 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:28,856 INFO L385 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:29,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:29,060 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:29,061 INFO L82 PathProgramCache]: Analyzing trace with hash 465402464, now seen corresponding path program 9 times [2019-10-06 23:18:29,061 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:29,061 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:29,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:29,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:29,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:18:29,166 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:29,166 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:29,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:29,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:29,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:29,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:29,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:18:29,404 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-06 23:18:29,473 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:29,474 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:18:29,474 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:29,475 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:29,475 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:29,475 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:29,494 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-06 23:18:29,610 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:29,617 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:29,620 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:29,621 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:29,621 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:18:29,621 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:18:29,621 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:29,621 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:29,621 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:29,622 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:29,622 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:29,622 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:18:29,622 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:29,622 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:29,622 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:29,623 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:29,623 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:29,623 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:29,623 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:18:29,623 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:18:30,169 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:30,169 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 30 [2019-10-06 23:18:30,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-06 23:18:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-06 23:18:30,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:18:30,171 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 30 states. [2019-10-06 23:18:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:30,833 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2019-10-06 23:18:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-06 23:18:30,833 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2019-10-06 23:18:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:30,834 INFO L225 Difference]: With dead ends: 104 [2019-10-06 23:18:30,834 INFO L226 Difference]: Without dead ends: 68 [2019-10-06 23:18:30,835 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:18:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-06 23:18:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-10-06 23:18:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-06 23:18:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-10-06 23:18:30,852 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 36 [2019-10-06 23:18:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:30,853 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-10-06 23:18:30,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-06 23:18:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-10-06 23:18:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:18:30,854 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:30,854 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:31,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:31,060 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:31,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1207386250, now seen corresponding path program 10 times [2019-10-06 23:18:31,061 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:31,061 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:31,061 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:31,061 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:18:31,132 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:31,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:31,133 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:31,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:31,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:18:31,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:18:31,422 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:31,424 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:18:31,424 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:31,424 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:31,424 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:31,425 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:31,444 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:18:31,556 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:31,569 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:31,572 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:31,572 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:31,572 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:18:31,572 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:18:31,573 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:31,573 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:31,573 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:31,573 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:31,573 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:31,573 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:18:31,574 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:31,574 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:31,574 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:31,574 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:31,574 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:31,574 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:31,574 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:18:31,575 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:18:31,959 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:31,960 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 11] total 29 [2019-10-06 23:18:31,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-06 23:18:31,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-06 23:18:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:18:31,962 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 29 states. [2019-10-06 23:18:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:32,425 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-10-06 23:18:32,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:18:32,425 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-10-06 23:18:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:32,426 INFO L225 Difference]: With dead ends: 83 [2019-10-06 23:18:32,427 INFO L226 Difference]: Without dead ends: 50 [2019-10-06 23:18:32,428 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2019-10-06 23:18:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-06 23:18:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-10-06 23:18:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-06 23:18:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2019-10-06 23:18:32,441 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 37 [2019-10-06 23:18:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:32,441 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2019-10-06 23:18:32,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-06 23:18:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2019-10-06 23:18:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:18:32,442 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:32,442 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:32,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:32,646 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:32,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 377734726, now seen corresponding path program 11 times [2019-10-06 23:18:32,647 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:32,647 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:32,647 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:32,647 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:18:32,755 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:32,756 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:32,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:32,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:18:32,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:32,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:32,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:18:33,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-06 23:18:33,147 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:33,148 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-06 23:18:33,148 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:33,148 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:33,148 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:33,148 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:33,170 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-06 23:18:33,282 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-06 23:18:33,292 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-06 23:18:33,295 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:33,295 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:33,295 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= 0 (+ ~SIZE~0 32768)) (<= |old(~SIZE~0)| 0) (<= ~SIZE~0 32767) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|)) [2019-10-06 23:18:33,296 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 245#(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:18:33,296 INFO L193 IcfgInterpreter]: Reachable states at location L37-4 satisfy 230#(and (not (< main_~i~0 ~SIZE~0)) (<= 0 main_~i~0)) [2019-10-06 23:18:33,296 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 254#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:33,296 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 225#(<= 0 main_~i~0) [2019-10-06 23:18:33,296 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 149#(<= 0 main_~i~0) [2019-10-06 23:18:33,297 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 73#true [2019-10-06 23:18:33,297 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 240#(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:18:33,297 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:33,297 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-06 23:18:33,297 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 259#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:18:33,297 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:33,298 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 187#(<= 0 main_~i~0) [2019-10-06 23:18:33,298 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 111#(<= 0 main_~i~0) [2019-10-06 23:18:33,298 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 235#(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:18:33,298 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 250#(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:18:33,679 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:33,680 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 11] total 34 [2019-10-06 23:18:33,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-06 23:18:33,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-06 23:18:33,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2019-10-06 23:18:33,682 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 34 states. [2019-10-06 23:18:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:34,447 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-10-06 23:18:34,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:18:34,448 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-10-06 23:18:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:34,449 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:18:34,449 INFO L226 Difference]: Without dead ends: 41 [2019-10-06 23:18:34,451 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 81 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:18:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-06 23:18:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-06 23:18:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-06 23:18:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-10-06 23:18:34,461 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 37 [2019-10-06 23:18:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:34,462 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-10-06 23:18:34,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-06 23:18:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-10-06 23:18:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-06 23:18:34,462 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:34,462 INFO L385 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:34,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:34,667 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash -11756509, now seen corresponding path program 12 times [2019-10-06 23:18:34,667 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:34,667 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,668 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,668 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:35,409 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2019-10-06 23:18:35,591 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-10-06 23:18:35,765 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-10-06 23:18:35,920 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-10-06 23:18:36,077 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-10-06 23:18:36,231 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 39 [2019-10-06 23:18:36,399 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2019-10-06 23:18:36,560 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-10-06 23:18:36,726 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-10-06 23:18:36,895 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2019-10-06 23:18:37,030 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-10-06 23:18:37,184 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2019-10-06 23:18:37,346 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-10-06 23:18:37,503 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-10-06 23:18:37,658 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-10-06 23:18:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-06 23:18:38,612 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:38,613 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:38,613 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 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:18:38,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:38,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:38,783 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 90 conjunts are in the unsatisfiable core [2019-10-06 23:18:38,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:18:40,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:42,431 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 127