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/reducercommutativity/sum05-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:25:36,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:25:36,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:25:36,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:25:36,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:25:36,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:25:36,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:25:36,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:25:36,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:25:36,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:25:36,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:25:36,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:25:36,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:25:36,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:25:36,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:25:36,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:25:36,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:25:36,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:25:36,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:25:36,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:25:36,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:25:36,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:25:36,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:25:36,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:25:36,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:25:36,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:25:36,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:25:36,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:25:36,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:25:36,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:25:36,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:25:36,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:25:36,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:25:36,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:25:36,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:25:36,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:25:36,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:25:36,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:25:36,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:25:36,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:25:36,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:25:36,954 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-15 03:25:36,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:25:36,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:25:36,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:25:36,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:25:36,987 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:25:36,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:25:36,991 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:25:36,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:25:36,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:25:36,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:25:36,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:25:36,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:25:36,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:25:36,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:25:36,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:25:36,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:25:36,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:25:36,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:25:36,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:25:36,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:25:36,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:25:36,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:25:36,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:25:36,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:25:36,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:25:36,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:25:36,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:25:36,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:25:36,996 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-15 03:25:37,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:25:37,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:25:37,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:25:37,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:25:37,305 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:25:37,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum05-2.i [2019-10-15 03:25:37,370 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864ee1a4c/93734429346b4c69b6c83ea1d5187dc8/FLAG0f01be158 [2019-10-15 03:25:37,795 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:25:37,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum05-2.i [2019-10-15 03:25:37,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864ee1a4c/93734429346b4c69b6c83ea1d5187dc8/FLAG0f01be158 [2019-10-15 03:25:38,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/864ee1a4c/93734429346b4c69b6c83ea1d5187dc8 [2019-10-15 03:25:38,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:25:38,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:25:38,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:25:38,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:25:38,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:25:38,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6581bd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38, skipping insertion in model container [2019-10-15 03:25:38,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,243 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:25:38,262 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:25:38,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:25:38,464 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:25:38,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:25:38,626 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:25:38,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38 WrapperNode [2019-10-15 03:25:38,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:25:38,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:25:38,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:25:38,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:25:38,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (1/1) ... [2019-10-15 03:25:38,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:25:38,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:25:38,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:25:38,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:25:38,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (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-15 03:25:38,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:25:38,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:25:38,742 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-10-15 03:25:38,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-10-15 03:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:25:39,133 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:25:39,134 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-15 03:25:39,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:25:39 BoogieIcfgContainer [2019-10-15 03:25:39,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:25:39,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:25:39,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:25:39,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:25:39,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:25:38" (1/3) ... [2019-10-15 03:25:39,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e268b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:25:39, skipping insertion in model container [2019-10-15 03:25:39,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:25:38" (2/3) ... [2019-10-15 03:25:39,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e268b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:25:39, skipping insertion in model container [2019-10-15 03:25:39,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:25:39" (3/3) ... [2019-10-15 03:25:39,144 INFO L109 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2019-10-15 03:25:39,154 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:25:39,163 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:25:39,175 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:25:39,200 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:25:39,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:25:39,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:25:39,201 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:25:39,201 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:25:39,201 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:25:39,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:25:39,202 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:25:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-15 03:25:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:25:39,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:39,224 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:39,225 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:39,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:39,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1818423299, now seen corresponding path program 1 times [2019-10-15 03:25:39,238 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:39,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840908304] [2019-10-15 03:25:39,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:39,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:39,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-15 03:25:39,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840908304] [2019-10-15 03:25:39,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:25:39,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:25:39,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804952791] [2019-10-15 03:25:39,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:25:39,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:25:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:39,448 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-15 03:25:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:39,478 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-15 03:25:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:25:39,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 03:25:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:39,489 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:25:39,490 INFO L226 Difference]: Without dead ends: 20 [2019-10-15 03:25:39,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-15 03:25:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-15 03:25:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-15 03:25:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-15 03:25:39,533 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-15 03:25:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:39,534 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-15 03:25:39,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:25:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-15 03:25:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:25:39,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:39,536 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:39,537 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2093950433, now seen corresponding path program 1 times [2019-10-15 03:25:39,538 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:39,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022051843] [2019-10-15 03:25:39,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:39,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:39,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:25:39,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022051843] [2019-10-15 03:25:39,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405386917] [2019-10-15 03:25:39,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:39,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 03:25:39,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:25:39,749 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 03:25:39,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 03:25:39,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-15 03:25:39,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475880527] [2019-10-15 03:25:39,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:25:39,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:39,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:25:39,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:25:39,798 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-15 03:25:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:39,811 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-15 03:25:39,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:25:39,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 03:25:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:39,813 INFO L225 Difference]: With dead ends: 33 [2019-10-15 03:25:39,813 INFO L226 Difference]: Without dead ends: 21 [2019-10-15 03:25:39,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:25:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-15 03:25:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-15 03:25:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-15 03:25:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-15 03:25:39,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-15 03:25:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:39,821 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-15 03:25:39,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:25:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-15 03:25:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:25:39,823 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:39,823 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:40,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:40,033 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:40,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash 903502258, now seen corresponding path program 1 times [2019-10-15 03:25:40,035 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:40,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195681266] [2019-10-15 03:25:40,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:40,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:40,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:40,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195681266] [2019-10-15 03:25:40,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:25:40,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:25:40,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131516913] [2019-10-15 03:25:40,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:25:40,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:40,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:25:40,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:40,158 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-15 03:25:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:40,169 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-15 03:25:40,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:25:40,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:25:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:40,171 INFO L225 Difference]: With dead ends: 31 [2019-10-15 03:25:40,171 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 03:25:40,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:25:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 03:25:40,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 03:25:40,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 03:25:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-15 03:25:40,179 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-15 03:25:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:40,181 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-15 03:25:40,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:25:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-15 03:25:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 03:25:40,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:40,183 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:40,183 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2130547361, now seen corresponding path program 1 times [2019-10-15 03:25:40,184 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:40,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880646306] [2019-10-15 03:25:40,184 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:40,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:40,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:40,300 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880646306] [2019-10-15 03:25:40,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217351840] [2019-10-15 03:25:40,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:40,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:25:40,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:40,426 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:40,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [758024559] [2019-10-15 03:25:40,495 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:40,495 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:40,502 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:40,511 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:40,512 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:40,708 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:42,702 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:42,765 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:42,769 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:43,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:43,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 03:25:43,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318069717] [2019-10-15 03:25:43,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 03:25:43,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:43,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 03:25:43,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:25:43,157 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-15 03:25:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:45,912 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-15 03:25:45,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:25:45,914 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-15 03:25:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:45,915 INFO L225 Difference]: With dead ends: 40 [2019-10-15 03:25:45,915 INFO L226 Difference]: Without dead ends: 25 [2019-10-15 03:25:45,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-15 03:25:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-15 03:25:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-15 03:25:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-15 03:25:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-15 03:25:45,927 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-15 03:25:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:45,928 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-15 03:25:45,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 03:25:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-15 03:25:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 03:25:45,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:45,932 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:46,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:46,137 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash 356639231, now seen corresponding path program 2 times [2019-10-15 03:25:46,138 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:46,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874810727] [2019-10-15 03:25:46,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:46,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:46,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:25:46,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874810727] [2019-10-15 03:25:46,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698921972] [2019-10-15 03:25:46,237 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 03:25:46,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 03:25:46,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:46,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:25:46,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:25:46,336 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-15 03:25:46,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1917018730] [2019-10-15 03:25:46,374 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:46,375 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:46,375 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:46,376 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:46,376 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:46,407 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:47,834 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:47,858 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:47,861 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:48,278 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:48,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-15 03:25:48,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79392077] [2019-10-15 03:25:48,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 03:25:48,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:48,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 03:25:48,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:25:48,283 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-15 03:25:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:49,346 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-15 03:25:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:25:49,347 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-15 03:25:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:49,348 INFO L225 Difference]: With dead ends: 44 [2019-10-15 03:25:49,348 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 03:25:49,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-15 03:25:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 03:25:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 03:25:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 03:25:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-15 03:25:49,358 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-15 03:25:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:49,358 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-15 03:25:49,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 03:25:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-15 03:25:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:25:49,360 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:49,360 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:49,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:49,569 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash 906031436, now seen corresponding path program 3 times [2019-10-15 03:25:49,570 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:49,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151000959] [2019-10-15 03:25:49,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:49,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:49,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 26 proven. 36 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 03:25:49,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151000959] [2019-10-15 03:25:49,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117407570] [2019-10-15 03:25:49,662 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 03:25:49,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:25:49,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:25:49,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:25:49,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 03:25:49,797 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 03:25:49,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [911885659] [2019-10-15 03:25:49,837 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:49,837 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:49,838 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:49,838 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:49,838 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:49,875 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:51,229 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:51,255 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:51,258 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:51,580 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:51,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 18 [2019-10-15 03:25:51,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831591080] [2019-10-15 03:25:51,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 03:25:51,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:51,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 03:25:51,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:25:51,584 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 19 states. [2019-10-15 03:25:52,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:52,351 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-15 03:25:52,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 03:25:52,352 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2019-10-15 03:25:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:52,353 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:25:52,353 INFO L226 Difference]: Without dead ends: 30 [2019-10-15 03:25:52,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 111 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2019-10-15 03:25:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-15 03:25:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-15 03:25:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-15 03:25:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-15 03:25:52,362 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 42 [2019-10-15 03:25:52,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:52,362 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-15 03:25:52,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 03:25:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-15 03:25:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:25:52,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:52,364 INFO L380 BasicCegarLoop]: trace histogram [15, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:52,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:52,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:52,569 INFO L82 PathProgramCache]: Analyzing trace with hash 886327137, now seen corresponding path program 4 times [2019-10-15 03:25:52,570 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:52,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665358665] [2019-10-15 03:25:52,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:52,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:52,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-15 03:25:52,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665358665] [2019-10-15 03:25:52,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942054083] [2019-10-15 03:25:52,654 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 03:25:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:52,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:25:52,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:25:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 76 proven. 1 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-15 03:25:52,803 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:25:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-15 03:25:52,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319217490] [2019-10-15 03:25:52,825 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-15 03:25:52,826 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:25:52,826 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:25:52,826 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:25:52,826 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:25:52,841 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 03:25:54,321 INFO L199 IcfgInterpreter]: Interpreting procedure sum with input of size 1 for LOIs [2019-10-15 03:25:54,354 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 03:25:54,358 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:25:54,800 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:25:54,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-15 03:25:54,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261216788] [2019-10-15 03:25:54,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-15 03:25:54,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:25:54,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-15 03:25:54,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:25:54,803 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 18 states. [2019-10-15 03:25:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:25:55,467 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-15 03:25:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 03:25:55,468 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-10-15 03:25:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:25:55,469 INFO L225 Difference]: With dead ends: 46 [2019-10-15 03:25:55,469 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 03:25:55,470 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-10-15 03:25:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 03:25:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-15 03:25:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-15 03:25:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-15 03:25:55,478 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 45 [2019-10-15 03:25:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:25:55,479 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-15 03:25:55,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-15 03:25:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-15 03:25:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:25:55,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:25:55,487 INFO L380 BasicCegarLoop]: trace histogram [15, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:25:55,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:25:55,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:25:55,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:25:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash -81363278, now seen corresponding path program 5 times [2019-10-15 03:25:55,690 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:25:55,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006129004] [2019-10-15 03:25:55,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:55,691 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:25:55,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:25:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:25:57,745 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-10-15 03:25:58,067 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 52 [2019-10-15 03:26:00,485 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 87 DAG size of output: 42 [2019-10-15 03:26:01,018 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 32 [2019-10-15 03:26:09,304 WARN L191 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 70 DAG size of output: 31 [2019-10-15 03:26:11,337 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_main_~#x~0.offset| 0))) (and (let ((.cse3 (<= 1 |c_main_~#x~0.offset|)) (.cse18 (<= 8 |c_main_~#x~0.offset|)) (.cse19 (<= (+ |c_main_~#x~0.offset| 1) 0))) (or (<= 4 |c_main_~#x~0.offset|) (and .cse0 (= c_main_~i~2 0) (let ((.cse1 (* 4 c_main_~i~2))) (let ((.cse2 (<= 12 |c_main_~#x~0.offset|)) (.cse6 (+ .cse1 |c_main_~#x~0.offset|))) (or (<= (+ .cse1 |c_main_~#x~0.offset| 1) 0) (<= (+ c_main_~i~2 1) 0) .cse2 (<= 16 |c_main_~#x~0.offset|) .cse3 (not (= 0 |c_main_~#x~0.offset|)) (let ((.cse4 (= .cse1 0)) (.cse5 (= 16 .cse1))) (and .cse4 (or (not .cse5) (<= (+ |c_main_~#x~0.offset| 16) 0)) (or (not .cse4) (<= 8 .cse6) (<= 12 .cse6) (and (<= 0 |c_main_~#x~0.offset|) (or .cse2 .cse3 (let ((.cse7 (= c_main_~ret~1 c_main_~ret2~0))) (and .cse7 (let ((.cse16 (select |c_#memory_int| |c_main_~#x~0.base|)) (.cse17 (* c_main_~i~2 4))) (let ((.cse11 (select .cse16 (+ .cse17 |c_main_~#x~0.offset| 4)))) (let ((.cse15 (store .cse16 (+ .cse17 |c_main_~#x~0.offset|) .cse11))) (let ((.cse12 (select .cse15 (+ |c_main_~#x~0.offset| 8))) (.cse13 (select .cse15 16)) (.cse14 (select .cse15 (+ |c_main_~#x~0.offset| 12)))) (let ((.cse9 (+ .cse11 .cse12 .cse13 .cse14 c_main_~temp~0))) (let ((.cse10 (* 4294967296 (div .cse9 4294967296)))) (or (let ((.cse8 (* 4294967296 (div (+ .cse11 .cse12 .cse13 .cse14 c_main_~temp~0 2147483648) 4294967296)))) (and (or (= (+ c_main_~ret~1 .cse8) .cse9) (< .cse8 .cse10)) .cse7 (<= .cse8 .cse9) (<= .cse8 .cse10))) (and (<= .cse9 (+ (* 4294967296 (div (+ .cse11 .cse12 .cse13 .cse14 c_main_~temp~0 (- 2147483648)) 4294967296)) 4294967295)) (= (+ .cse10 c_main_~ret~1 4294967296) .cse9))))))))))) .cse18 .cse19 (<= 16 .cse6)))) (= 0 .cse1) (or (= 0 .cse6) .cse5))) (<= 1 c_main_~i~2) (<= 1 .cse6) .cse19)))) .cse3 .cse18 .cse19)) .cse0)) is different from false