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 -i ../../../trunk/examples/svcomp/array-examples/standard_init9_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:13:29,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:13:29,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:13:29,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:13:29,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:13:29,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:13:29,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:13:29,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:13:29,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:13:29,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:13:29,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:13:29,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:13:29,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:13:29,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:13:29,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:13:29,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:13:29,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:13:29,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:13:29,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:13:29,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:13:29,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:13:29,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:13:29,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:13:29,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:13:29,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:13:29,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:13:29,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:13:29,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:13:29,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:13:29,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:13:29,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:13:29,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:13:29,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:13:29,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:13:29,889 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:13:29,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:13:29,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:13:29,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:13:29,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:13:29,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:13:29,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:13:29,894 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-01 23:13:29,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:13:29,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:13:29,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:13:29,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:13:29,911 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:13:29,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:13:29,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:13:29,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:13:29,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:13:29,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:13:29,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:13:29,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:13:29,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:13:29,913 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:13:29,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:13:29,913 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:13:29,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:13:29,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:13:29,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:13:29,914 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:13:29,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:13:29,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:13:29,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:13:29,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:13:29,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:13:29,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:13:29,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:13:29,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:13:29,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:13:29,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:13:29,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:13:29,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:13:29,964 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:13:29,964 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:13:29,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init9_ground-1.i [2019-10-01 23:13:30,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09fea2d7f/fb3d4fce555c429fb790d984492254dd/FLAG4d594a0e3 [2019-10-01 23:13:30,431 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:13:30,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init9_ground-1.i [2019-10-01 23:13:30,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09fea2d7f/fb3d4fce555c429fb790d984492254dd/FLAG4d594a0e3 [2019-10-01 23:13:30,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09fea2d7f/fb3d4fce555c429fb790d984492254dd [2019-10-01 23:13:30,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:13:30,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:13:30,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:13:30,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:13:30,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:13:30,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:13:30" (1/1) ... [2019-10-01 23:13:30,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ad8be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:30, skipping insertion in model container [2019-10-01 23:13:30,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:13:30" (1/1) ... [2019-10-01 23:13:30,891 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:13:30,910 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:13:31,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:13:31,115 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:13:31,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:13:31,249 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:13:31,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31 WrapperNode [2019-10-01 23:13:31,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:13:31,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:13:31,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:13:31,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:13:31,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (1/1) ... [2019-10-01 23:13:31,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (1/1) ... [2019-10-01 23:13:31,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (1/1) ... [2019-10-01 23:13:31,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (1/1) ... [2019-10-01 23:13:31,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (1/1) ... [2019-10-01 23:13:31,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (1/1) ... [2019-10-01 23:13:31,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (1/1) ... [2019-10-01 23:13:31,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:13:31,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:13:31,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:13:31,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:13:31,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (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-01 23:13:31,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:13:31,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:13:31,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:13:31,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:13:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:13:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:13:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:13:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:13:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:13:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:13:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:13:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:13:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:13:31,636 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:13:31,636 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-01 23:13:31,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:13:31 BoogieIcfgContainer [2019-10-01 23:13:31,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:13:31,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:13:31,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:13:31,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:13:31,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:13:30" (1/3) ... [2019-10-01 23:13:31,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dfbb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:13:31, skipping insertion in model container [2019-10-01 23:13:31,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:13:31" (2/3) ... [2019-10-01 23:13:31,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dfbb2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:13:31, skipping insertion in model container [2019-10-01 23:13:31,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:13:31" (3/3) ... [2019-10-01 23:13:31,650 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_init9_ground-1.i [2019-10-01 23:13:31,663 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:13:31,675 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:13:31,697 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:13:31,737 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:13:31,738 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:13:31,738 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:13:31,738 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:13:31,739 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:13:31,739 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:13:31,739 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:13:31,739 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:13:31,739 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:13:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2019-10-01 23:13:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 23:13:31,770 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:31,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:31,773 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1872712154, now seen corresponding path program 1 times [2019-10-01 23:13:31,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:31,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:31,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:31,928 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-01 23:13:31,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:13:31,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:13:31,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:13:31,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:13:31,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:13:31,953 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2019-10-01 23:13:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:31,979 INFO L93 Difference]: Finished difference Result 71 states and 110 transitions. [2019-10-01 23:13:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:13:31,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-10-01 23:13:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:31,988 INFO L225 Difference]: With dead ends: 71 [2019-10-01 23:13:31,988 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 23:13:31,992 INFO L640 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-01 23:13:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 23:13:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-01 23:13:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-01 23:13:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2019-10-01 23:13:32,037 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 29 [2019-10-01 23:13:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:32,038 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2019-10-01 23:13:32,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:13:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2019-10-01 23:13:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 23:13:32,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:32,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:32,040 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:32,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:32,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1932733742, now seen corresponding path program 1 times [2019-10-01 23:13:32,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:32,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:32,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:32,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:32,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:32,120 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-01 23:13:32,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:13:32,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:13:32,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:13:32,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:13:32,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:13:32,125 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 3 states. [2019-10-01 23:13:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:32,277 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2019-10-01 23:13:32,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:13:32,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-01 23:13:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:32,282 INFO L225 Difference]: With dead ends: 70 [2019-10-01 23:13:32,283 INFO L226 Difference]: Without dead ends: 43 [2019-10-01 23:13:32,285 INFO L640 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-01 23:13:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-01 23:13:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-01 23:13:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 23:13:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-01 23:13:32,306 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2019-10-01 23:13:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:32,306 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-01 23:13:32,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:13:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-01 23:13:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-01 23:13:32,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:32,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:32,310 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:32,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:32,311 INFO L82 PathProgramCache]: Analyzing trace with hash 97911482, now seen corresponding path program 1 times [2019-10-01 23:13:32,311 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:32,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:32,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:32,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 23:13:32,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:32,451 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:32,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:32,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:13:32,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 23:13:32,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:32,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:13:32,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:13:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:13:32,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:13:32,617 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 5 states. [2019-10-01 23:13:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:32,819 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2019-10-01 23:13:32,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:13:32,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-01 23:13:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:32,821 INFO L225 Difference]: With dead ends: 87 [2019-10-01 23:13:32,821 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 23:13:32,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-01 23:13:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 23:13:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-01 23:13:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 23:13:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-10-01 23:13:32,832 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 38 [2019-10-01 23:13:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:32,833 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-10-01 23:13:32,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:13:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-10-01 23:13:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 23:13:32,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:32,835 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:32,835 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1965553710, now seen corresponding path program 2 times [2019-10-01 23:13:32,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:32,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:32,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:13:32,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:32,978 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:13:33,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:33,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:13:33,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:33,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:13:33,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:13:33,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:33,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:13:33,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:13:33,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:13:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:13:33,127 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 6 states. [2019-10-01 23:13:33,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:33,271 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2019-10-01 23:13:33,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:13:33,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-01 23:13:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:33,273 INFO L225 Difference]: With dead ends: 104 [2019-10-01 23:13:33,273 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 23:13:33,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:13:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 23:13:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-01 23:13:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-01 23:13:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2019-10-01 23:13:33,289 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 47 [2019-10-01 23:13:33,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:33,290 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2019-10-01 23:13:33,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:13:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2019-10-01 23:13:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 23:13:33,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:33,292 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:33,292 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:33,293 INFO L82 PathProgramCache]: Analyzing trace with hash 369658042, now seen corresponding path program 3 times [2019-10-01 23:13:33,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:33,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:33,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:33,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:33,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-01 23:13:33,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:33,421 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:13:33,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:33,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:13:33,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:33,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 23:13:33,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-01 23:13:33,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:33,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-01 23:13:33,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 23:13:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 23:13:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:13:33,637 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 7 states. [2019-10-01 23:13:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:33,787 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2019-10-01 23:13:33,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-01 23:13:33,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-01 23:13:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:33,788 INFO L225 Difference]: With dead ends: 121 [2019-10-01 23:13:33,788 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 23:13:33,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-01 23:13:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 23:13:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-01 23:13:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 23:13:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-10-01 23:13:33,799 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 56 [2019-10-01 23:13:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:33,799 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-10-01 23:13:33,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 23:13:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-10-01 23:13:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-01 23:13:33,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:33,802 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:33,802 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:33,803 INFO L82 PathProgramCache]: Analyzing trace with hash 24657106, now seen corresponding path program 4 times [2019-10-01 23:13:33,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:33,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:33,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:33,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:33,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-01 23:13:33,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:33,933 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:13:33,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:34,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:13:34,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:34,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:13:34,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:13:34,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:34,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:13:34,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:13:34,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:13:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:13:34,072 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 8 states. [2019-10-01 23:13:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:34,258 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2019-10-01 23:13:34,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:13:34,259 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-10-01 23:13:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:34,261 INFO L225 Difference]: With dead ends: 138 [2019-10-01 23:13:34,261 INFO L226 Difference]: Without dead ends: 79 [2019-10-01 23:13:34,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:13:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-01 23:13:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-01 23:13:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:13:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-10-01 23:13:34,274 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 65 [2019-10-01 23:13:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:34,274 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-10-01 23:13:34,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:13:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-10-01 23:13:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-01 23:13:34,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:34,276 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:34,277 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash -217477446, now seen corresponding path program 5 times [2019-10-01 23:13:34,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:34,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:34,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:13:34,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:34,446 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:34,467 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:13:50,489 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-01 23:13:50,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:50,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:13:50,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-01 23:13:50,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:50,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:13:50,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:13:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:13:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:13:50,551 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 9 states. [2019-10-01 23:13:50,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:50,714 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2019-10-01 23:13:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:13:50,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-10-01 23:13:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:50,716 INFO L225 Difference]: With dead ends: 155 [2019-10-01 23:13:50,716 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 23:13:50,721 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:13:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 23:13:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-10-01 23:13:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-01 23:13:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-10-01 23:13:50,739 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 74 [2019-10-01 23:13:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:50,740 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-10-01 23:13:50,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:13:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-10-01 23:13:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-01 23:13:50,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:50,745 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:50,747 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash 346386898, now seen corresponding path program 6 times [2019-10-01 23:13:50,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:50,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:50,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:50,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-01 23:13:50,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:50,932 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:13:50,967 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:54,977 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-01 23:13:54,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:54,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 23:13:54,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-01 23:13:55,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:55,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-01 23:13:55,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-01 23:13:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-01 23:13:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:13:55,018 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 10 states. [2019-10-01 23:13:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:55,191 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2019-10-01 23:13:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 23:13:55,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-10-01 23:13:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:55,193 INFO L225 Difference]: With dead ends: 172 [2019-10-01 23:13:55,194 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 23:13:55,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-01 23:13:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 23:13:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-10-01 23:13:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 23:13:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2019-10-01 23:13:55,206 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 83 [2019-10-01 23:13:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:55,207 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2019-10-01 23:13:55,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-01 23:13:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2019-10-01 23:13:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 23:13:55,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:55,209 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:55,209 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash -698280774, now seen corresponding path program 7 times [2019-10-01 23:13:55,210 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:55,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:55,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:55,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:55,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-01 23:13:55,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:55,389 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:13:55,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:55,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:13:55,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:13:55,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:55,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:13:55,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:13:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:13:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:13:55,510 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 11 states. [2019-10-01 23:13:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:55,693 INFO L93 Difference]: Finished difference Result 189 states and 215 transitions. [2019-10-01 23:13:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:13:55,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-10-01 23:13:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:55,694 INFO L225 Difference]: With dead ends: 189 [2019-10-01 23:13:55,695 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 23:13:55,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:13:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 23:13:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-10-01 23:13:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:13:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-10-01 23:13:55,705 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 92 [2019-10-01 23:13:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:55,705 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-10-01 23:13:55,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:13:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-10-01 23:13:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-01 23:13:55,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:55,707 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:55,708 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -732453166, now seen corresponding path program 8 times [2019-10-01 23:13:55,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:55,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:55,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:55,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:13:55,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 23:13:55,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:55,846 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:13:55,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:13:55,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:13:55,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:13:55,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:13:55,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:13:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-10-01 23:13:55,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:13:55,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:13:55,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:13:55,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:13:55,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:13:55,980 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 12 states. [2019-10-01 23:13:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:13:56,186 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2019-10-01 23:13:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:13:56,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-01 23:13:56,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:13:56,187 INFO L225 Difference]: With dead ends: 206 [2019-10-01 23:13:56,187 INFO L226 Difference]: Without dead ends: 115 [2019-10-01 23:13:56,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:13:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-01 23:13:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-10-01 23:13:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 23:13:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2019-10-01 23:13:56,210 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 101 [2019-10-01 23:13:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:13:56,211 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2019-10-01 23:13:56,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:13:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2019-10-01 23:13:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 23:13:56,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:13:56,213 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:13:56,213 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:13:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:13:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1838619322, now seen corresponding path program 9 times [2019-10-01 23:13:56,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:13:56,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:13:56,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:56,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:13:56,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:13:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:13:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-10-01 23:13:56,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:13:56,352 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:13:56,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:14:23,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:14:23,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:14:23,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:14:23,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:14:23,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:23,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2019-10-01 23:14:23,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:14:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:14:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:14:23,757 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 14 states. [2019-10-01 23:14:24,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:24,030 INFO L93 Difference]: Finished difference Result 223 states and 249 transitions. [2019-10-01 23:14:24,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:14:24,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-10-01 23:14:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:24,032 INFO L225 Difference]: With dead ends: 223 [2019-10-01 23:14:24,032 INFO L226 Difference]: Without dead ends: 124 [2019-10-01 23:14:24,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:14:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-01 23:14:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-10-01 23:14:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-01 23:14:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2019-10-01 23:14:24,054 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 110 [2019-10-01 23:14:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:24,054 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2019-10-01 23:14:24,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:14:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2019-10-01 23:14:24,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-01 23:14:24,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:24,057 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:14:24,057 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:24,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:24,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1132012590, now seen corresponding path program 10 times [2019-10-01 23:14:24,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:24,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:24,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:24,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:14:24,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-10-01 23:14:24,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:24,268 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:14:24,297 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:14:24,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:14:24,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:14:24,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:14:24,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:14:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:14:24,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:14:24,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:14:24,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:14:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:14:24,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:14:24,483 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 14 states. [2019-10-01 23:14:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:14:24,733 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2019-10-01 23:14:24,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:14:24,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 119 [2019-10-01 23:14:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:14:24,736 INFO L225 Difference]: With dead ends: 240 [2019-10-01 23:14:24,736 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 23:14:24,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:14:24,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 23:14:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-01 23:14:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-01 23:14:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2019-10-01 23:14:24,745 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 119 [2019-10-01 23:14:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:14:24,745 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2019-10-01 23:14:24,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:14:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2019-10-01 23:14:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-01 23:14:24,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:14:24,747 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:14:24,748 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:14:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:14:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1513332922, now seen corresponding path program 11 times [2019-10-01 23:14:24,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:14:24,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:14:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:24,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:14:24,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:14:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:14:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-01 23:14:24,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:14:24,920 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:14:24,947 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:15:16,669 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-01 23:15:16,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:16,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:15:16,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-10-01 23:15:16,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:16,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:15:16,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:15:16,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:15:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:15:16,761 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand 15 states. [2019-10-01 23:15:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:17,017 INFO L93 Difference]: Finished difference Result 257 states and 283 transitions. [2019-10-01 23:15:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:15:17,018 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 128 [2019-10-01 23:15:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:17,020 INFO L225 Difference]: With dead ends: 257 [2019-10-01 23:15:17,020 INFO L226 Difference]: Without dead ends: 142 [2019-10-01 23:15:17,021 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:15:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-01 23:15:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-10-01 23:15:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-01 23:15:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2019-10-01 23:15:17,032 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 128 [2019-10-01 23:15:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:17,032 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2019-10-01 23:15:17,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:15:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2019-10-01 23:15:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-01 23:15:17,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:17,034 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:15:17,034 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash 892014802, now seen corresponding path program 12 times [2019-10-01 23:15:17,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:17,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:17,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:17,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-10-01 23:15:17,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:17,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:15:17,308 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:56,743 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 23:15:56,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:56,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 23:15:56,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-10-01 23:15:56,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:56,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-10-01 23:15:56,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-01 23:15:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-01 23:15:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:15:56,837 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 16 states. [2019-10-01 23:15:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:57,102 INFO L93 Difference]: Finished difference Result 274 states and 300 transitions. [2019-10-01 23:15:57,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 23:15:57,102 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 137 [2019-10-01 23:15:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:57,103 INFO L225 Difference]: With dead ends: 274 [2019-10-01 23:15:57,103 INFO L226 Difference]: Without dead ends: 151 [2019-10-01 23:15:57,104 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-10-01 23:15:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-01 23:15:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-10-01 23:15:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 23:15:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2019-10-01 23:15:57,113 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 137 [2019-10-01 23:15:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:57,113 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2019-10-01 23:15:57,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-01 23:15:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2019-10-01 23:15:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 23:15:57,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:57,115 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:15:57,115 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1312905542, now seen corresponding path program 13 times [2019-10-01 23:15:57,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:57,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:57,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:57,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:57,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-10-01 23:15:57,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:57,317 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:57,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:15:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:57,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:15:57,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-10-01 23:15:57,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:57,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:15:57,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:15:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:15:57,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:15:57,503 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 17 states. [2019-10-01 23:15:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:57,801 INFO L93 Difference]: Finished difference Result 291 states and 317 transitions. [2019-10-01 23:15:57,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:15:57,803 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 146 [2019-10-01 23:15:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:57,804 INFO L225 Difference]: With dead ends: 291 [2019-10-01 23:15:57,805 INFO L226 Difference]: Without dead ends: 160 [2019-10-01 23:15:57,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:15:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-01 23:15:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-10-01 23:15:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 23:15:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2019-10-01 23:15:57,818 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 146 [2019-10-01 23:15:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:57,833 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2019-10-01 23:15:57,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:15:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2019-10-01 23:15:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 23:15:57,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:57,835 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:15:57,835 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:57,836 INFO L82 PathProgramCache]: Analyzing trace with hash 305939922, now seen corresponding path program 14 times [2019-10-01 23:15:57,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:57,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:57,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:15:57,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-01 23:15:58,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:58,075 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:15:58,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:58,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:15:58,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:15:58,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:15:58,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:15:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2019-10-01 23:15:58,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:15:58,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:15:58,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:15:58,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:15:58,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:15:58,260 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 18 states. [2019-10-01 23:15:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:15:58,529 INFO L93 Difference]: Finished difference Result 308 states and 334 transitions. [2019-10-01 23:15:58,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:15:58,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 155 [2019-10-01 23:15:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:15:58,532 INFO L225 Difference]: With dead ends: 308 [2019-10-01 23:15:58,532 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:15:58,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:15:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:15:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-10-01 23:15:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 23:15:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2019-10-01 23:15:58,542 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 155 [2019-10-01 23:15:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:15:58,542 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2019-10-01 23:15:58,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:15:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2019-10-01 23:15:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-01 23:15:58,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:15:58,544 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:15:58,545 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:15:58,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:15:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2109746362, now seen corresponding path program 15 times [2019-10-01 23:15:58,545 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:15:58,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:15:58,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:58,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:15:58,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:15:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:15:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2019-10-01 23:15:58,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:15:58,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:15:58,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:17:02,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:17:02,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:17:02,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-01 23:17:02,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:17:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 30 proven. 120 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-01 23:17:02,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:17:02,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2019-10-01 23:17:02,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:17:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:17:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:17:02,895 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand 20 states. [2019-10-01 23:17:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:17:03,270 INFO L93 Difference]: Finished difference Result 325 states and 351 transitions. [2019-10-01 23:17:03,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:17:03,271 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 164 [2019-10-01 23:17:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:17:03,273 INFO L225 Difference]: With dead ends: 325 [2019-10-01 23:17:03,274 INFO L226 Difference]: Without dead ends: 178 [2019-10-01 23:17:03,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:17:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-01 23:17:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-10-01 23:17:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-01 23:17:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 187 transitions. [2019-10-01 23:17:03,283 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 187 transitions. Word has length 164 [2019-10-01 23:17:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:17:03,283 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 187 transitions. [2019-10-01 23:17:03,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:17:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 187 transitions. [2019-10-01 23:17:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-01 23:17:03,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:17:03,285 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:17:03,286 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:17:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:17:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 330463954, now seen corresponding path program 16 times [2019-10-01 23:17:03,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:17:03,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:17:03,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:03,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:17:03,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:17:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2019-10-01 23:17:03,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:17:03,578 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:17:03,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:17:03,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:17:03,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:17:03,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:17:03,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:17:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:17:03,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:17:03,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:17:03,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:17:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:17:03,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:17:03,767 INFO L87 Difference]: Start difference. First operand 178 states and 187 transitions. Second operand 20 states. [2019-10-01 23:17:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:17:04,140 INFO L93 Difference]: Finished difference Result 342 states and 368 transitions. [2019-10-01 23:17:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:17:04,143 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 173 [2019-10-01 23:17:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:17:04,145 INFO L225 Difference]: With dead ends: 342 [2019-10-01 23:17:04,145 INFO L226 Difference]: Without dead ends: 187 [2019-10-01 23:17:04,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:17:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-01 23:17:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-10-01 23:17:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 23:17:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 196 transitions. [2019-10-01 23:17:04,158 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 196 transitions. Word has length 173 [2019-10-01 23:17:04,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:17:04,159 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 196 transitions. [2019-10-01 23:17:04,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:17:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 196 transitions. [2019-10-01 23:17:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-01 23:17:04,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:17:04,164 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:17:04,164 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:17:04,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:17:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1002451642, now seen corresponding path program 17 times [2019-10-01 23:17:04,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:17:04,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:17:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:04,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:17:04,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:17:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:17:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2019-10-01 23:17:04,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:17:04,543 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:17:04,582 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:18:33,423 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-10-01 23:18:33,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:18:33,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:18:33,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:18:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2019-10-01 23:18:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:18:33,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:18:33,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:18:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:18:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:18:33,568 INFO L87 Difference]: Start difference. First operand 187 states and 196 transitions. Second operand 21 states. [2019-10-01 23:18:33,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:18:33,964 INFO L93 Difference]: Finished difference Result 359 states and 385 transitions. [2019-10-01 23:18:33,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:18:33,964 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 182 [2019-10-01 23:18:33,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:18:33,965 INFO L225 Difference]: With dead ends: 359 [2019-10-01 23:18:33,965 INFO L226 Difference]: Without dead ends: 196 [2019-10-01 23:18:33,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:18:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-01 23:18:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-10-01 23:18:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-01 23:18:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 205 transitions. [2019-10-01 23:18:33,975 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 205 transitions. Word has length 182 [2019-10-01 23:18:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:18:33,976 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 205 transitions. [2019-10-01 23:18:33,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:18:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 205 transitions. [2019-10-01 23:18:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-01 23:18:33,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:18:33,977 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:18:33,978 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:18:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:18:33,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1703260114, now seen corresponding path program 18 times [2019-10-01 23:18:33,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:18:33,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:18:33,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:33,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:18:33,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:18:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:18:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1368 trivial. 0 not checked. [2019-10-01 23:18:34,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:18:34,320 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:18:34,343 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:19:51,058 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:19:51,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:19:51,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:19:51,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:19:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 90 proven. 171 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2019-10-01 23:19:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:19:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 23 [2019-10-01 23:19:51,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:19:51,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:19:51,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:19:51,217 INFO L87 Difference]: Start difference. First operand 196 states and 205 transitions. Second operand 23 states. [2019-10-01 23:19:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:19:51,677 INFO L93 Difference]: Finished difference Result 376 states and 402 transitions. [2019-10-01 23:19:51,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:19:51,678 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 191 [2019-10-01 23:19:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:19:51,679 INFO L225 Difference]: With dead ends: 376 [2019-10-01 23:19:51,679 INFO L226 Difference]: Without dead ends: 205 [2019-10-01 23:19:51,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:19:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-10-01 23:19:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-10-01 23:19:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 23:19:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 214 transitions. [2019-10-01 23:19:51,689 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 214 transitions. Word has length 191 [2019-10-01 23:19:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:19:51,689 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 214 transitions. [2019-10-01 23:19:51,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:19:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 214 transitions. [2019-10-01 23:19:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 23:19:51,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:19:51,691 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:19:51,691 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:19:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:19:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1564915898, now seen corresponding path program 19 times [2019-10-01 23:19:51,692 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:19:51,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:19:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:51,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:19:51,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:19:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-10-01 23:19:52,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:19:52,168 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:19:52,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:19:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:19:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:19:52,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:19:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-10-01 23:19:52,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:19:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:19:52,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:19:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:19:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:19:52,388 INFO L87 Difference]: Start difference. First operand 205 states and 214 transitions. Second operand 23 states. [2019-10-01 23:19:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:19:52,793 INFO L93 Difference]: Finished difference Result 393 states and 419 transitions. [2019-10-01 23:19:52,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:19:52,795 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 200 [2019-10-01 23:19:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:19:52,796 INFO L225 Difference]: With dead ends: 393 [2019-10-01 23:19:52,797 INFO L226 Difference]: Without dead ends: 214 [2019-10-01 23:19:52,797 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:19:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-01 23:19:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-10-01 23:19:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-01 23:19:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 223 transitions. [2019-10-01 23:19:52,806 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 223 transitions. Word has length 200 [2019-10-01 23:19:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:19:52,806 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 223 transitions. [2019-10-01 23:19:52,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:19:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2019-10-01 23:19:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-01 23:19:52,807 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:19:52,808 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:19:52,808 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:19:52,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:19:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 531490002, now seen corresponding path program 20 times [2019-10-01 23:19:52,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:19:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:19:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:52,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:19:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:19:53,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1680 trivial. 0 not checked. [2019-10-01 23:19:53,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:19:53,188 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:19:53,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:19:53,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:19:53,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:19:53,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:19:53,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:19:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1680 trivial. 0 not checked. [2019-10-01 23:19:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:19:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:19:53,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:19:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:19:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:19:53,377 INFO L87 Difference]: Start difference. First operand 214 states and 223 transitions. Second operand 24 states. [2019-10-01 23:19:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:19:53,793 INFO L93 Difference]: Finished difference Result 410 states and 436 transitions. [2019-10-01 23:19:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:19:53,794 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 209 [2019-10-01 23:19:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:19:53,795 INFO L225 Difference]: With dead ends: 410 [2019-10-01 23:19:53,795 INFO L226 Difference]: Without dead ends: 223 [2019-10-01 23:19:53,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:19:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-10-01 23:19:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-10-01 23:19:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 23:19:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 232 transitions. [2019-10-01 23:19:53,806 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 232 transitions. Word has length 209 [2019-10-01 23:19:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:19:53,806 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 232 transitions. [2019-10-01 23:19:53,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:19:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 232 transitions. [2019-10-01 23:19:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-01 23:19:53,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:19:53,808 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:19:53,808 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:19:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:19:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -941900102, now seen corresponding path program 21 times [2019-10-01 23:19:53,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:19:53,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:19:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:53,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:19:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:19:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:19:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-01 23:19:54,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:19:54,236 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:19:54,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:21:32,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:21:32,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:21:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:21:32,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2079 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-01 23:21:33,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:33,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 23:21:33,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 23:21:33,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 23:21:33,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:21:33,021 INFO L87 Difference]: Start difference. First operand 223 states and 232 transitions. Second operand 25 states. [2019-10-01 23:21:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:33,501 INFO L93 Difference]: Finished difference Result 427 states and 453 transitions. [2019-10-01 23:21:33,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 23:21:33,501 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2019-10-01 23:21:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:33,503 INFO L225 Difference]: With dead ends: 427 [2019-10-01 23:21:33,503 INFO L226 Difference]: Without dead ends: 232 [2019-10-01 23:21:33,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:21:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-01 23:21:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-01 23:21:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-01 23:21:33,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 241 transitions. [2019-10-01 23:21:33,512 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 241 transitions. Word has length 218 [2019-10-01 23:21:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:33,512 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 241 transitions. [2019-10-01 23:21:33,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 23:21:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 241 transitions. [2019-10-01 23:21:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 23:21:33,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:33,514 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:21:33,514 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:33,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash -970778158, now seen corresponding path program 22 times [2019-10-01 23:21:33,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:33,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:33,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:21:33,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-01 23:21:33,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:21:33,955 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:21:33,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:21:34,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:21:34,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:21:34,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:21:34,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:21:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2277 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-10-01 23:21:34,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:21:34,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:21:34,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:21:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:21:34,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:21:34,203 INFO L87 Difference]: Start difference. First operand 232 states and 241 transitions. Second operand 26 states. [2019-10-01 23:21:34,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:21:34,655 INFO L93 Difference]: Finished difference Result 444 states and 470 transitions. [2019-10-01 23:21:34,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:21:34,661 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 227 [2019-10-01 23:21:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:21:34,663 INFO L225 Difference]: With dead ends: 444 [2019-10-01 23:21:34,663 INFO L226 Difference]: Without dead ends: 241 [2019-10-01 23:21:34,664 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:21:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-01 23:21:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-10-01 23:21:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-01 23:21:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 250 transitions. [2019-10-01 23:21:34,674 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 250 transitions. Word has length 227 [2019-10-01 23:21:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:21:34,674 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 250 transitions. [2019-10-01 23:21:34,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:21:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 250 transitions. [2019-10-01 23:21:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 23:21:34,676 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:21:34,676 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:21:34,676 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:21:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:21:34,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1426539706, now seen corresponding path program 23 times [2019-10-01 23:21:34,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:21:34,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:21:34,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:34,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:21:34,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:21:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:21:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2208 trivial. 0 not checked. [2019-10-01 23:21:35,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:21:35,137 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:21:35,190 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:23:39,494 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-10-01 23:23:39,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:23:39,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:23:39,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:23:39,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2484 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2208 trivial. 0 not checked. [2019-10-01 23:23:39,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:23:39,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:23:39,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:23:39,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:23:39,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:23:39,681 INFO L87 Difference]: Start difference. First operand 241 states and 250 transitions. Second operand 27 states. [2019-10-01 23:23:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:23:40,201 INFO L93 Difference]: Finished difference Result 461 states and 487 transitions. [2019-10-01 23:23:40,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:23:40,209 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 236 [2019-10-01 23:23:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:23:40,211 INFO L225 Difference]: With dead ends: 461 [2019-10-01 23:23:40,211 INFO L226 Difference]: Without dead ends: 250 [2019-10-01 23:23:40,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:23:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-01 23:23:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-10-01 23:23:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-01 23:23:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 259 transitions. [2019-10-01 23:23:40,220 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 259 transitions. Word has length 236 [2019-10-01 23:23:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:23:40,220 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 259 transitions. [2019-10-01 23:23:40,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:23:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 259 transitions. [2019-10-01 23:23:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-01 23:23:40,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:23:40,222 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:23:40,222 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:23:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:23:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash -925020462, now seen corresponding path program 24 times [2019-10-01 23:23:40,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:23:40,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:23:40,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:40,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:23:40,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:23:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:23:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2400 trivial. 0 not checked. [2019-10-01 23:23:40,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:23:40,702 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:23:40,730 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:25:32,524 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 23:25:32,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:32,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-01 23:25:32,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 24 proven. 300 refuted. 0 times theorem prover too weak. 2376 trivial. 0 not checked. [2019-10-01 23:25:32,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:32,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 29 [2019-10-01 23:25:32,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:25:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:25:32,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:25:32,740 INFO L87 Difference]: Start difference. First operand 250 states and 259 transitions. Second operand 29 states. [2019-10-01 23:25:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:33,322 INFO L93 Difference]: Finished difference Result 478 states and 504 transitions. [2019-10-01 23:25:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:25:33,323 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 245 [2019-10-01 23:25:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:33,327 INFO L225 Difference]: With dead ends: 478 [2019-10-01 23:25:33,327 INFO L226 Difference]: Without dead ends: 259 [2019-10-01 23:25:33,328 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:25:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-01 23:25:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-01 23:25:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-01 23:25:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 268 transitions. [2019-10-01 23:25:33,337 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 268 transitions. Word has length 245 [2019-10-01 23:25:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:33,338 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 268 transitions. [2019-10-01 23:25:33,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:25:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 268 transitions. [2019-10-01 23:25:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-01 23:25:33,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:33,340 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:33,340 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:33,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:33,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1381059258, now seen corresponding path program 25 times [2019-10-01 23:25:33,341 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:33,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:33,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:33,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:33,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2925 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2600 trivial. 0 not checked. [2019-10-01 23:25:34,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:34,022 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:25:34,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:34,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:25:34,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2925 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2600 trivial. 0 not checked. [2019-10-01 23:25:34,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:34,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:25:34,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:25:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:25:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:25:34,273 INFO L87 Difference]: Start difference. First operand 259 states and 268 transitions. Second operand 29 states. [2019-10-01 23:25:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:34,797 INFO L93 Difference]: Finished difference Result 495 states and 521 transitions. [2019-10-01 23:25:34,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:25:34,798 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 254 [2019-10-01 23:25:34,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:34,799 INFO L225 Difference]: With dead ends: 495 [2019-10-01 23:25:34,800 INFO L226 Difference]: Without dead ends: 268 [2019-10-01 23:25:34,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:25:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-01 23:25:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-10-01 23:25:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-10-01 23:25:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 277 transitions. [2019-10-01 23:25:34,811 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 277 transitions. Word has length 254 [2019-10-01 23:25:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:34,812 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 277 transitions. [2019-10-01 23:25:34,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:25:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 277 transitions. [2019-10-01 23:25:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-01 23:25:34,813 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:34,814 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:34,814 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:34,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash 64259026, now seen corresponding path program 26 times [2019-10-01 23:25:34,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:34,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:34,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:25:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3159 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2808 trivial. 0 not checked. [2019-10-01 23:25:35,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:35,599 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:25:35,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:25:35,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:25:35,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:25:35,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:25:35,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:25:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3159 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2808 trivial. 0 not checked. [2019-10-01 23:25:35,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:25:35,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:25:35,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:25:35,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:25:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:25:35,847 INFO L87 Difference]: Start difference. First operand 268 states and 277 transitions. Second operand 30 states. [2019-10-01 23:25:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:25:36,436 INFO L93 Difference]: Finished difference Result 512 states and 538 transitions. [2019-10-01 23:25:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:25:36,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 263 [2019-10-01 23:25:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:25:36,438 INFO L225 Difference]: With dead ends: 512 [2019-10-01 23:25:36,438 INFO L226 Difference]: Without dead ends: 277 [2019-10-01 23:25:36,439 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:25:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-01 23:25:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-10-01 23:25:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-01 23:25:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 286 transitions. [2019-10-01 23:25:36,448 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 286 transitions. Word has length 263 [2019-10-01 23:25:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:25:36,448 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 286 transitions. [2019-10-01 23:25:36,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:25:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 286 transitions. [2019-10-01 23:25:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 23:25:36,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:25:36,451 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:25:36,451 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:25:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:25:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash 21090490, now seen corresponding path program 27 times [2019-10-01 23:25:36,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:25:36,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:25:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:36,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:25:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:25:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:25:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 3024 trivial. 0 not checked. [2019-10-01 23:25:37,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:25:37,188 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:25:37,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:27:50,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:27:50,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:50,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-01 23:27:50,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 27 proven. 378 refuted. 0 times theorem prover too weak. 2997 trivial. 0 not checked. [2019-10-01 23:27:50,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:50,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 32 [2019-10-01 23:27:50,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:27:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:27:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:27:50,237 INFO L87 Difference]: Start difference. First operand 277 states and 286 transitions. Second operand 32 states. [2019-10-01 23:27:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:51,041 INFO L93 Difference]: Finished difference Result 529 states and 555 transitions. [2019-10-01 23:27:51,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:27:51,041 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 272 [2019-10-01 23:27:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:51,043 INFO L225 Difference]: With dead ends: 529 [2019-10-01 23:27:51,043 INFO L226 Difference]: Without dead ends: 286 [2019-10-01 23:27:51,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:27:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-10-01 23:27:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2019-10-01 23:27:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-01 23:27:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 295 transitions. [2019-10-01 23:27:51,058 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 295 transitions. Word has length 272 [2019-10-01 23:27:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:51,058 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 295 transitions. [2019-10-01 23:27:51,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:27:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 295 transitions. [2019-10-01 23:27:51,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-01 23:27:51,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:51,061 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:51,061 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:51,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1057011922, now seen corresponding path program 28 times [2019-10-01 23:27:51,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:51,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:51,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:51,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:51,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3654 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 3248 trivial. 0 not checked. [2019-10-01 23:27:51,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:51,768 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:51,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:27:51,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:27:51,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:51,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:27:51,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3654 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 3248 trivial. 0 not checked. [2019-10-01 23:27:52,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:52,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:27:52,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:27:52,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:27:52,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:27:52,022 INFO L87 Difference]: Start difference. First operand 286 states and 295 transitions. Second operand 32 states. [2019-10-01 23:27:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:52,619 INFO L93 Difference]: Finished difference Result 546 states and 572 transitions. [2019-10-01 23:27:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:27:52,619 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 281 [2019-10-01 23:27:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:52,621 INFO L225 Difference]: With dead ends: 546 [2019-10-01 23:27:52,622 INFO L226 Difference]: Without dead ends: 295 [2019-10-01 23:27:52,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:27:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-01 23:27:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-01 23:27:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-01 23:27:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 304 transitions. [2019-10-01 23:27:52,633 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 304 transitions. Word has length 281 [2019-10-01 23:27:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:52,633 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 304 transitions. [2019-10-01 23:27:52,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:27:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 304 transitions. [2019-10-01 23:27:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-01 23:27:52,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:52,635 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:52,636 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:52,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:52,636 INFO L82 PathProgramCache]: Analyzing trace with hash 392222394, now seen corresponding path program 29 times [2019-10-01 23:27:52,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:52,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:52,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:52,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:52,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2019-10-01 23:27:53,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:53,284 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:53,340 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1