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/loop-lit/gr2006.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:59:07,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:59:07,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:59:07,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:59:07,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:59:07,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:59:07,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:59:07,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:59:07,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:59:07,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:59:07,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:59:07,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:59:07,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:59:07,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:59:07,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:59:07,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:59:07,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:59:07,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:59:07,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:59:07,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:59:07,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:59:07,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:59:07,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:59:07,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:59:07,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:59:07,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:59:07,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:59:07,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:59:07,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:59:07,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:59:07,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:59:08,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:59:08,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:59:08,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:59:08,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:59:08,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:59:08,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:59:08,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:59:08,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:59:08,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:59:08,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:59:08,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:59:08,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:59:08,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:59:08,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:59:08,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:59:08,039 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:59:08,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:59:08,039 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:59:08,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:59:08,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:59:08,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:59:08,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:59:08,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:59:08,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:59:08,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:59:08,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:59:08,042 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:59:08,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:59:08,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:59:08,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:59:08,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:59:08,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:59:08,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:59:08,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:59:08,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:59:08,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:59:08,044 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:59:08,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:59:08,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:59:08,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:59:08,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:59:08,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:59:08,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:59:08,320 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:59:08,320 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:59:08,321 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gr2006.i [2019-10-13 22:59:08,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3896f6728/fa075523410e416d8ddeefc44fafe232/FLAG49d15fb3e [2019-10-13 22:59:08,812 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:59:08,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gr2006.i [2019-10-13 22:59:08,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3896f6728/fa075523410e416d8ddeefc44fafe232/FLAG49d15fb3e [2019-10-13 22:59:09,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3896f6728/fa075523410e416d8ddeefc44fafe232 [2019-10-13 22:59:09,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:59:09,188 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:59:09,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:09,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:59:09,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:59:09,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c19cb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09, skipping insertion in model container [2019-10-13 22:59:09,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,206 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:59:09,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:59:09,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:09,476 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:59:09,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:09,508 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:59:09,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09 WrapperNode [2019-10-13 22:59:09,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:09,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:59:09,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:59:09,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:59:09,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... [2019-10-13 22:59:09,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:59:09,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:59:09,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:59:09,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:59:09,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:59:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:59:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:59:09,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:59:09,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:59:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:59:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:59:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:59:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:59:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:59:09,904 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:59:09,904 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 22:59:09,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:09 BoogieIcfgContainer [2019-10-13 22:59:09,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:59:09,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:59:09,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:59:09,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:59:09,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:59:09" (1/3) ... [2019-10-13 22:59:09,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525ba694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:09, skipping insertion in model container [2019-10-13 22:59:09,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:09" (2/3) ... [2019-10-13 22:59:09,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525ba694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:09, skipping insertion in model container [2019-10-13 22:59:09,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:09" (3/3) ... [2019-10-13 22:59:09,915 INFO L109 eAbstractionObserver]: Analyzing ICFG gr2006.i [2019-10-13 22:59:09,926 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:59:09,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:59:09,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:59:09,971 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:59:09,972 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:59:09,973 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:59:09,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:59:09,974 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:59:09,974 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:59:09,974 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:59:09,974 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:59:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-13 22:59:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 22:59:10,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:10,007 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:10,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1022443096, now seen corresponding path program 1 times [2019-10-13 22:59:10,021 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:10,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135380399] [2019-10-13 22:59:10,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135380399] [2019-10-13 22:59:10,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:10,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 22:59:10,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981390880] [2019-10-13 22:59:10,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 22:59:10,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 22:59:10,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:59:10,135 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-13 22:59:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:10,159 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-13 22:59:10,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 22:59:10,161 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 22:59:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:10,170 INFO L225 Difference]: With dead ends: 29 [2019-10-13 22:59:10,170 INFO L226 Difference]: Without dead ends: 12 [2019-10-13 22:59:10,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 22:59:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-13 22:59:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-13 22:59:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-13 22:59:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-13 22:59:10,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-13 22:59:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:10,216 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-13 22:59:10,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 22:59:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-13 22:59:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:59:10,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:10,217 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:10,218 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:10,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1666502658, now seen corresponding path program 1 times [2019-10-13 22:59:10,219 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:10,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412643909] [2019-10-13 22:59:10,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412643909] [2019-10-13 22:59:10,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:10,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:59:10,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230684360] [2019-10-13 22:59:10,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:59:10,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:10,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:59:10,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:59:10,378 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-10-13 22:59:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:10,478 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-10-13 22:59:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:59:10,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:59:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:10,480 INFO L225 Difference]: With dead ends: 20 [2019-10-13 22:59:10,480 INFO L226 Difference]: Without dead ends: 15 [2019-10-13 22:59:10,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:59:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-13 22:59:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-13 22:59:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 22:59:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-10-13 22:59:10,487 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-10-13 22:59:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:10,488 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-10-13 22:59:10,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:59:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-10-13 22:59:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:59:10,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:10,489 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:10,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1396448135, now seen corresponding path program 1 times [2019-10-13 22:59:10,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:10,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943637364] [2019-10-13 22:59:10,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943637364] [2019-10-13 22:59:10,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685062411] [2019-10-13 22:59:10,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:10,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 22:59:10,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:10,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:10,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,753 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:10,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:10,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:10,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:10,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:10,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:59:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:10,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [151953178] [2019-10-13 22:59:10,958 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:59:10,958 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:10,965 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:10,974 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:10,975 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:11,051 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:11,368 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:11,415 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:11,419 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:11,420 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:11,420 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 87#(and (< main_~y~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) [2019-10-13 22:59:11,420 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:11,421 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:11,422 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#true [2019-10-13 22:59:11,422 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 93#(and (<= 0 main_~y~0) (or (and (not (< main_~y~0 0)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)))) [2019-10-13 22:59:11,422 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:11,422 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 116#true [2019-10-13 22:59:11,423 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 82#(<= 0 main_~x~0) [2019-10-13 22:59:11,423 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 107#(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-13 22:59:11,423 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(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-13 22:59:11,424 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 102#(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-13 22:59:11,425 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(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-13 22:59:11,623 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:11,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 7] total 19 [2019-10-13 22:59:11,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128214378] [2019-10-13 22:59:11,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 22:59:11,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 22:59:11,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-13 22:59:11,629 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 19 states. [2019-10-13 22:59:11,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:11,868 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2019-10-13 22:59:11,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 22:59:11,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 13 [2019-10-13 22:59:11,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:11,869 INFO L225 Difference]: With dead ends: 25 [2019-10-13 22:59:11,870 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 22:59:11,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-10-13 22:59:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 22:59:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 22:59:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 22:59:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-10-13 22:59:11,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2019-10-13 22:59:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:11,883 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-10-13 22:59:11,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 22:59:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-10-13 22:59:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 22:59:11,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:11,885 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:12,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:12,093 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash -927306090, now seen corresponding path program 2 times [2019-10-13 22:59:12,094 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:12,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759222115] [2019-10-13 22:59:12,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:12,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:12,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759222115] [2019-10-13 22:59:12,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7729338] [2019-10-13 22:59:12,173 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:12,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 22:59:12,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:12,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 22:59:12,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:12,219 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:12,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1019665816] [2019-10-13 22:59:12,316 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:59:12,316 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:12,317 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:12,317 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:12,318 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:12,343 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:12,487 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:12,508 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:12,511 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:12,511 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:12,511 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 87#(and (< main_~y~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) [2019-10-13 22:59:12,512 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:12,512 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:12,512 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#true [2019-10-13 22:59:12,512 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 93#(and (<= 0 main_~y~0) (or (and (not (< main_~y~0 0)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)))) [2019-10-13 22:59:12,513 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:12,513 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 116#true [2019-10-13 22:59:12,513 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 82#(<= 0 main_~x~0) [2019-10-13 22:59:12,514 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 107#(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-13 22:59:12,514 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(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-13 22:59:12,514 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 102#(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-13 22:59:12,515 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(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-13 22:59:12,694 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:12,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 7] total 20 [2019-10-13 22:59:12,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529373279] [2019-10-13 22:59:12,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 22:59:12,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:12,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 22:59:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-10-13 22:59:12,698 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-10-13 22:59:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:13,071 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-10-13 22:59:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 22:59:13,074 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-10-13 22:59:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:13,075 INFO L225 Difference]: With dead ends: 37 [2019-10-13 22:59:13,076 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 22:59:13,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2019-10-13 22:59:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 22:59:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-13 22:59:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 22:59:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-10-13 22:59:13,083 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 19 [2019-10-13 22:59:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:13,084 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-10-13 22:59:13,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 22:59:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-10-13 22:59:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 22:59:13,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:13,085 INFO L380 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:13,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:13,286 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 62074612, now seen corresponding path program 3 times [2019-10-13 22:59:13,287 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:13,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525061063] [2019-10-13 22:59:13,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:13,288 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:13,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:13,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525061063] [2019-10-13 22:59:13,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69669647] [2019-10-13 22:59:13,465 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:13,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:59:13,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:13,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 22:59:13,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:13,525 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:13,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1010590582] [2019-10-13 22:59:13,743 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:59:13,744 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:13,744 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:13,744 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:13,744 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:13,754 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:13,824 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:13,841 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:13,844 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:13,844 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:13,844 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 87#(and (< main_~y~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) [2019-10-13 22:59:13,844 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:13,845 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:13,845 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#true [2019-10-13 22:59:13,845 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 93#(and (<= 0 main_~y~0) (or (and (not (< main_~y~0 0)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)))) [2019-10-13 22:59:13,845 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:13,846 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 116#true [2019-10-13 22:59:13,846 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 82#(<= 0 main_~x~0) [2019-10-13 22:59:13,846 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 107#(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-13 22:59:13,846 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(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-13 22:59:13,846 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 102#(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-13 22:59:13,847 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(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-13 22:59:14,079 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:14,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 7] total 32 [2019-10-13 22:59:14,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707937535] [2019-10-13 22:59:14,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 22:59:14,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 22:59:14,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-10-13 22:59:14,086 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-10-13 22:59:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:14,969 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2019-10-13 22:59:14,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 22:59:14,969 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-10-13 22:59:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:14,970 INFO L225 Difference]: With dead ends: 61 [2019-10-13 22:59:14,971 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 22:59:14,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=892, Invalid=2078, Unknown=0, NotChecked=0, Total=2970 [2019-10-13 22:59:14,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 22:59:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-13 22:59:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 22:59:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-10-13 22:59:14,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 31 [2019-10-13 22:59:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:14,982 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-10-13 22:59:14,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 22:59:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-10-13 22:59:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 22:59:14,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:14,984 INFO L380 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:15,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:15,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash -98740048, now seen corresponding path program 4 times [2019-10-13 22:59:15,190 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:15,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889108345] [2019-10-13 22:59:15,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:15,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:15,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:15,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889108345] [2019-10-13 22:59:15,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511713271] [2019-10-13 22:59:15,664 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:15,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 22:59:15,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:15,752 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:16,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [251731304] [2019-10-13 22:59:16,526 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:59:16,526 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:16,527 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:16,527 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:16,527 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:16,538 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:16,609 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:16,636 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:16,638 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:16,639 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:16,639 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 87#(and (< main_~y~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) [2019-10-13 22:59:16,639 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:16,639 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:16,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 121#true [2019-10-13 22:59:16,640 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 93#(and (<= 0 main_~y~0) (or (and (not (< main_~y~0 0)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)))) [2019-10-13 22:59:16,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:16,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 116#true [2019-10-13 22:59:16,640 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 82#(<= 0 main_~x~0) [2019-10-13 22:59:16,641 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 107#(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-13 22:59:16,641 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 97#(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-13 22:59:16,641 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 102#(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-13 22:59:16,641 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 112#(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-13 22:59:16,859 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:16,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 7] total 56 [2019-10-13 22:59:16,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329859070] [2019-10-13 22:59:16,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-13 22:59:16,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-13 22:59:16,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1087, Invalid=1993, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 22:59:16,865 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-10-13 22:59:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:19,228 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2019-10-13 22:59:19,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-13 22:59:19,229 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-10-13 22:59:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:19,230 INFO L225 Difference]: With dead ends: 109 [2019-10-13 22:59:19,231 INFO L226 Difference]: Without dead ends: 104 [2019-10-13 22:59:19,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3484, Invalid=7022, Unknown=0, NotChecked=0, Total=10506 [2019-10-13 22:59:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-13 22:59:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-10-13 22:59:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-10-13 22:59:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-10-13 22:59:19,268 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 55 [2019-10-13 22:59:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:19,268 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-10-13 22:59:19,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-13 22:59:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-10-13 22:59:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 22:59:19,271 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:19,271 INFO L380 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:19,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:19,481 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 259412008, now seen corresponding path program 5 times [2019-10-13 22:59:19,482 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:19,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176786384] [2019-10-13 22:59:19,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:19,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:19,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:20,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176786384] [2019-10-13 22:59:20,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207393425] [2019-10-13 22:59:20,573 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:20,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-10-13 22:59:20,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:20,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 22:59:20,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:20,764 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:21,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1257912045] [2019-10-13 22:59:21,803 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:59:21,803 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:21,804 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:21,804 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:21,804 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:21,827 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:21,912 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:21,927 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:21,929 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:21,929 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:21,930 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 90#(and (< main_~y~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) [2019-10-13 22:59:21,930 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:21,930 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:21,930 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 124#true [2019-10-13 22:59:21,935 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 96#(and (<= 0 main_~y~0) (or (and (not (< main_~y~0 0)) (<= 1 main_~x~0)) (and (= main_~y~0 0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)))) [2019-10-13 22:59:21,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:21,935 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 119#true [2019-10-13 22:59:21,936 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 85#(<= 0 main_~x~0) [2019-10-13 22:59:21,936 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 110#(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-13 22:59:21,936 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 100#(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-13 22:59:21,937 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 105#(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-13 22:59:21,937 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 115#(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-13 22:59:22,244 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:22,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50, 7] total 61 [2019-10-13 22:59:22,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359174003] [2019-10-13 22:59:22,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 22:59:22,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 22:59:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=2352, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 22:59:22,248 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 61 states. [2019-10-13 22:59:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:25,110 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2019-10-13 22:59:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-13 22:59:25,111 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 103 [2019-10-13 22:59:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:25,114 INFO L225 Difference]: With dead ends: 117 [2019-10-13 22:59:25,114 INFO L226 Difference]: Without dead ends: 112 [2019-10-13 22:59:25,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 256 SyntacticMatches, 43 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2868 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4161, Invalid=8271, Unknown=0, NotChecked=0, Total=12432 [2019-10-13 22:59:25,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-13 22:59:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-10-13 22:59:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 22:59:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-10-13 22:59:25,131 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 103 [2019-10-13 22:59:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:25,131 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-10-13 22:59:25,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 22:59:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-10-13 22:59:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 22:59:25,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:25,133 INFO L380 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:25,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:25,338 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:25,338 INFO L82 PathProgramCache]: Analyzing trace with hash -41654084, now seen corresponding path program 6 times [2019-10-13 22:59:25,339 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:25,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668747453] [2019-10-13 22:59:25,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:25,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:25,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:28,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668747453] [2019-10-13 22:59:28,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805179666] [2019-10-13 22:59:28,978 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:29,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:59:29,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:29,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 154 conjunts are in the unsatisfiable core [2019-10-13 22:59:29,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:37,788 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:39,987 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2019-10-13 22:59:40,431 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-10-13 22:59:40,951 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-10-13 22:59:41,481 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-13 22:59:42,073 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-10-13 22:59:42,667 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-10-13 22:59:43,327 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-10-13 22:59:44,131 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 85 [2019-10-13 22:59:44,937 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2019-10-13 22:59:45,824 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 96 [2019-10-13 22:59:46,758 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 102 [2019-10-13 22:59:47,678 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 106 [2019-10-13 22:59:48,032 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2019-10-13 22:59:48,685 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 112 [2019-10-13 22:59:49,069 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-10-13 22:59:49,844 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 116