./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Addition03_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/Addition03_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc212c6f03bbd9a964d699fa8baa949beea27f48 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:56:24,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:56:24,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:56:25,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:56:25,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:56:25,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:56:25,007 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:56:25,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:56:25,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:56:25,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:56:25,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:56:25,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:56:25,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:56:25,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:56:25,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:56:25,016 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:56:25,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:56:25,019 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:56:25,021 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:56:25,023 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:56:25,024 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:56:25,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:56:25,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:56:25,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:56:25,028 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:56:25,029 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:56:25,030 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:56:25,031 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:56:25,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:56:25,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:56:25,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:56:25,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:56:25,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:56:25,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:56:25,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:56:25,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:56:25,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:56:25,060 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:56:25,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:56:25,062 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:56:25,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:56:25,062 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:56:25,062 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:56:25,062 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:56:25,063 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:56:25,063 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:56:25,063 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:56:25,063 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:56:25,064 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:56:25,064 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:56:25,064 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:56:25,064 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:56:25,064 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:56:25,064 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:56:25,065 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:56:25,065 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:56:25,065 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:56:25,065 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:56:25,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:56:25,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:56:25,066 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:56:25,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:56:25,066 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:56:25,066 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:56:25,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:56:25,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dc212c6f03bbd9a964d699fa8baa949beea27f48 [2019-01-12 14:56:25,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:56:25,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:56:25,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:56:25,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:56:25,144 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:56:25,145 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Addition03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:25,212 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba76f7fb/f058d57776594b4aa98ee9f6ac9bad63/FLAG54aca009c [2019-01-12 14:56:25,663 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:56:25,664 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Addition03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:25,672 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba76f7fb/f058d57776594b4aa98ee9f6ac9bad63/FLAG54aca009c [2019-01-12 14:56:26,006 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fba76f7fb/f058d57776594b4aa98ee9f6ac9bad63 [2019-01-12 14:56:26,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:56:26,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:56:26,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:26,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:56:26,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:56:26,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb669e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26, skipping insertion in model container [2019-01-12 14:56:26,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:56:26,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:56:26,256 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:26,265 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:56:26,285 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:26,301 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:56:26,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26 WrapperNode [2019-01-12 14:56:26,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:26,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:26,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:56:26,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:56:26,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:26,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:56:26,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:56:26,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:56:26,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (1/1) ... [2019-01-12 14:56:26,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:56:26,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:56:26,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:56:26,368 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:56:26,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (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-01-12 14:56:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:56:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:56:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2019-01-12 14:56:26,487 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2019-01-12 14:56:26,784 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:56:26,785 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:56:26,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:26 BoogieIcfgContainer [2019-01-12 14:56:26,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:56:26,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:56:26,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:56:26,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:56:26,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:56:26" (1/3) ... [2019-01-12 14:56:26,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d99c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:26, skipping insertion in model container [2019-01-12 14:56:26,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:26" (2/3) ... [2019-01-12 14:56:26,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d99c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:26, skipping insertion in model container [2019-01-12 14:56:26,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:26" (3/3) ... [2019-01-12 14:56:26,798 INFO L112 eAbstractionObserver]: Analyzing ICFG Addition03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:26,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:56:26,821 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:56:26,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:56:26,864 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:56:26,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:56:26,865 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:56:26,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:56:26,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:56:26,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:56:26,865 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:56:26,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:56:26,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:56:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-12 14:56:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:56:26,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:26,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:26,892 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:26,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash 647744991, now seen corresponding path program 1 times [2019-01-12 14:56:26,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:26,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:26,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:26,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:26,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:56:27,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:56:27,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:56:27,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:56:27,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:56:27,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:56:27,132 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-12 14:56:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:27,327 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2019-01-12 14:56:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:56:27,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:56:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:27,339 INFO L225 Difference]: With dead ends: 31 [2019-01-12 14:56:27,339 INFO L226 Difference]: Without dead ends: 18 [2019-01-12 14:56:27,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:56:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-12 14:56:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-12 14:56:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 14:56:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-01-12 14:56:27,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 9 [2019-01-12 14:56:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:27,386 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-01-12 14:56:27,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:56:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2019-01-12 14:56:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:56:27,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:27,389 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:27,392 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash 271548548, now seen corresponding path program 1 times [2019-01-12 14:56:27,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:27,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:27,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:27,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:27,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:56:27,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:27,597 INFO L223 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-01-12 14:56:27,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:27,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:56:27,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:27,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:56:27,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:56:27,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:56:27,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:56:27,727 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 6 states. [2019-01-12 14:56:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:28,052 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-12 14:56:28,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:56:28,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-12 14:56:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:28,054 INFO L225 Difference]: With dead ends: 25 [2019-01-12 14:56:28,055 INFO L226 Difference]: Without dead ends: 21 [2019-01-12 14:56:28,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-12 14:56:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-12 14:56:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-12 14:56:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-01-12 14:56:28,066 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 16 [2019-01-12 14:56:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:28,067 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-12 14:56:28,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:56:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-01-12 14:56:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:56:28,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:28,070 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:28,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:28,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash 583097021, now seen corresponding path program 2 times [2019-01-12 14:56:28,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:28,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:28,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:28,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 14:56:28,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:28,221 INFO L223 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:28,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:28,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:28,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:28,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 14:56:28,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:28,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:56:28,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:56:28,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:56:28,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:56:28,323 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 7 states. [2019-01-12 14:56:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:28,555 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-01-12 14:56:28,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:56:28,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-12 14:56:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:28,558 INFO L225 Difference]: With dead ends: 28 [2019-01-12 14:56:28,558 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 14:56:28,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:56:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 14:56:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 14:56:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 14:56:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-01-12 14:56:28,566 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 23 [2019-01-12 14:56:28,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:28,566 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-01-12 14:56:28,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:56:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2019-01-12 14:56:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:56:28,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:28,568 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:28,569 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:28,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:28,569 INFO L82 PathProgramCache]: Analyzing trace with hash -840522458, now seen corresponding path program 3 times [2019-01-12 14:56:28,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:28,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:28,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:28,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 14:56:28,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:28,815 INFO L223 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:28,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:28,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 14:56:28,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:28,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-12 14:56:28,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:28,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 14:56:28,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:28,982 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 8 states. [2019-01-12 14:56:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:29,197 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-01-12 14:56:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:56:29,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-12 14:56:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:29,201 INFO L225 Difference]: With dead ends: 31 [2019-01-12 14:56:29,201 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 14:56:29,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:56:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 14:56:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 14:56:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 14:56:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-12 14:56:29,210 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 30 [2019-01-12 14:56:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:29,211 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-12 14:56:29,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-01-12 14:56:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:56:29,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:29,213 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:29,214 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:29,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1584493413, now seen corresponding path program 4 times [2019-01-12 14:56:29,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:29,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:29,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:29,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-12 14:56:29,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:29,367 INFO L223 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:29,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:56:29,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:56:29,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:29,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-12 14:56:29,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:29,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 14:56:29,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:56:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:56:29,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:56:29,464 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 9 states. [2019-01-12 14:56:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:29,724 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2019-01-12 14:56:29,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:56:29,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-01-12 14:56:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:29,726 INFO L225 Difference]: With dead ends: 34 [2019-01-12 14:56:29,726 INFO L226 Difference]: Without dead ends: 30 [2019-01-12 14:56:29,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:56:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-12 14:56:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-12 14:56:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 14:56:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-01-12 14:56:29,740 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 37 [2019-01-12 14:56:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:29,742 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-01-12 14:56:29,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:56:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-01-12 14:56:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 14:56:29,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:29,744 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:29,744 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash 255857864, now seen corresponding path program 5 times [2019-01-12 14:56:29,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:29,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:29,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 14:56:30,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:30,034 INFO L223 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-01-12 14:56:30,051 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:56:30,098 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 14:56:30,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:30,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 14:56:30,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:30,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 14:56:30,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:56:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:56:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:56:30,148 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 10 states. [2019-01-12 14:56:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:30,537 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-12 14:56:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:56:30,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-01-12 14:56:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:30,540 INFO L225 Difference]: With dead ends: 37 [2019-01-12 14:56:30,540 INFO L226 Difference]: Without dead ends: 33 [2019-01-12 14:56:30,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:56:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-12 14:56:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-12 14:56:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-12 14:56:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-12 14:56:30,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 44 [2019-01-12 14:56:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:30,550 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-12 14:56:30,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:56:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2019-01-12 14:56:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:56:30,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:30,552 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:30,553 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash -122190983, now seen corresponding path program 6 times [2019-01-12 14:56:30,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:30,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:30,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:30,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:30,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-12 14:56:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:30,801 INFO L223 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:30,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:56:30,866 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 14:56:30,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:30,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-01-12 14:56:30,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:30,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 14:56:30,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 14:56:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 14:56:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:56:30,910 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 11 states. [2019-01-12 14:56:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:31,439 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-12 14:56:31,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:56:31,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-01-12 14:56:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:31,442 INFO L225 Difference]: With dead ends: 40 [2019-01-12 14:56:31,442 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 14:56:31,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 14:56:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 14:56:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 14:56:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:56:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-01-12 14:56:31,453 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 51 [2019-01-12 14:56:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:31,453 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-01-12 14:56:31,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 14:56:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2019-01-12 14:56:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:56:31,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:31,459 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:31,460 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:31,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1321750678, now seen corresponding path program 7 times [2019-01-12 14:56:31,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:31,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:31,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-01-12 14:56:31,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:31,648 INFO L223 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:31,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:31,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-01-12 14:56:31,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 14:56:31,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 14:56:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 14:56:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:56:31,758 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 12 states. [2019-01-12 14:56:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:32,407 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-01-12 14:56:32,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:56:32,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-01-12 14:56:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:32,410 INFO L225 Difference]: With dead ends: 43 [2019-01-12 14:56:32,410 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:56:32,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 14:56:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:56:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:56:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:56:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-01-12 14:56:32,421 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 58 [2019-01-12 14:56:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:32,421 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-01-12 14:56:32,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 14:56:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2019-01-12 14:56:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-12 14:56:32,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:32,427 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:32,428 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1710203049, now seen corresponding path program 8 times [2019-01-12 14:56:32,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:32,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:32,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-01-12 14:56:32,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:32,703 INFO L223 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) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:32,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:32,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:32,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:32,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-01-12 14:56:32,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:32,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 14:56:32,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 14:56:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 14:56:32,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:56:32,799 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 13 states. [2019-01-12 14:56:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:33,149 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-01-12 14:56:33,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:56:33,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-01-12 14:56:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:33,152 INFO L225 Difference]: With dead ends: 46 [2019-01-12 14:56:33,152 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 14:56:33,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:56:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 14:56:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-12 14:56:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 14:56:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-01-12 14:56:33,162 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 65 [2019-01-12 14:56:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:33,163 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-01-12 14:56:33,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 14:56:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2019-01-12 14:56:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 14:56:33,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:33,166 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:33,167 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1851173620, now seen corresponding path program 9 times [2019-01-12 14:56:33,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:33,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:33,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-01-12 14:56:33,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:33,424 INFO L223 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:33,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:33,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 14:56:33,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:33,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-01-12 14:56:33,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:33,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 14:56:33,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 14:56:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 14:56:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:56:33,620 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 14 states. [2019-01-12 14:56:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:34,023 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2019-01-12 14:56:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 14:56:34,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-01-12 14:56:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:34,026 INFO L225 Difference]: With dead ends: 49 [2019-01-12 14:56:34,026 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:56:34,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:56:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:56:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:56:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:56:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2019-01-12 14:56:34,038 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 72 [2019-01-12 14:56:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:34,039 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2019-01-12 14:56:34,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 14:56:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2019-01-12 14:56:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-12 14:56:34,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:34,042 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:34,042 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:34,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:34,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1718796235, now seen corresponding path program 10 times [2019-01-12 14:56:34,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-01-12 14:56:34,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:34,223 INFO L223 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:34,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:56:34,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:56:34,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:34,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-01-12 14:56:34,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:34,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 14:56:34,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:56:34,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:56:34,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:56:34,318 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 15 states. [2019-01-12 14:56:34,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:34,628 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2019-01-12 14:56:34,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:56:34,628 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2019-01-12 14:56:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:34,629 INFO L225 Difference]: With dead ends: 52 [2019-01-12 14:56:34,630 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 14:56:34,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 14:56:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 14:56:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-12 14:56:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-12 14:56:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-01-12 14:56:34,641 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 79 [2019-01-12 14:56:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:34,641 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-01-12 14:56:34,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:56:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-01-12 14:56:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-12 14:56:34,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:34,644 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:34,644 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1991187026, now seen corresponding path program 11 times [2019-01-12 14:56:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-01-12 14:56:35,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:35,053 INFO L223 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-01-12 14:56:35,062 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:56:35,109 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 14:56:35,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:35,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2019-01-12 14:56:35,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:35,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 14:56:35,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 14:56:35,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 14:56:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:56:35,180 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 16 states. [2019-01-12 14:56:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:35,727 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2019-01-12 14:56:35,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 14:56:35,728 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-01-12 14:56:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:35,730 INFO L225 Difference]: With dead ends: 55 [2019-01-12 14:56:35,730 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 14:56:35,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 14:56:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 14:56:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-12 14:56:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 14:56:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2019-01-12 14:56:35,741 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 86 [2019-01-12 14:56:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:35,742 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-01-12 14:56:35,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 14:56:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2019-01-12 14:56:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 14:56:35,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:35,745 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:35,745 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:35,745 INFO L82 PathProgramCache]: Analyzing trace with hash 859981331, now seen corresponding path program 12 times [2019-01-12 14:56:35,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:35,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:35,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:35,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:35,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-01-12 14:56:35,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:35,935 INFO L223 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) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:35,949 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:56:36,004 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 14:56:36,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:36,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-01-12 14:56:36,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:36,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 14:56:36,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:56:36,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:56:36,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:56:36,083 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand 17 states. [2019-01-12 14:56:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:36,706 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2019-01-12 14:56:36,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 14:56:36,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2019-01-12 14:56:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:36,709 INFO L225 Difference]: With dead ends: 58 [2019-01-12 14:56:36,709 INFO L226 Difference]: Without dead ends: 54 [2019-01-12 14:56:36,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2019-01-12 14:56:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-12 14:56:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-12 14:56:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-12 14:56:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2019-01-12 14:56:36,720 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 93 [2019-01-12 14:56:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:36,722 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-01-12 14:56:36,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:56:36,722 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2019-01-12 14:56:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 14:56:36,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:36,723 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:36,723 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:36,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1707753808, now seen corresponding path program 13 times [2019-01-12 14:56:36,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:36,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:36,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:36,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:36,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-01-12 14:56:37,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:37,035 INFO L223 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-01-12 14:56:37,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:37,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-01-12 14:56:37,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:37,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 14:56:37,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 14:56:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 14:56:37,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-01-12 14:56:37,142 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand 18 states. [2019-01-12 14:56:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:37,462 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2019-01-12 14:56:37,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 14:56:37,463 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 100 [2019-01-12 14:56:37,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:37,465 INFO L225 Difference]: With dead ends: 61 [2019-01-12 14:56:37,465 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 14:56:37,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-01-12 14:56:37,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 14:56:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-12 14:56:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 14:56:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2019-01-12 14:56:37,475 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 100 [2019-01-12 14:56:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:37,477 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2019-01-12 14:56:37,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 14:56:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2019-01-12 14:56:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 14:56:37,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:37,482 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:37,482 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:37,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:37,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1365479665, now seen corresponding path program 14 times [2019-01-12 14:56:37,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:37,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:37,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:37,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 14:56:38,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:38,241 INFO L223 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:38,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:38,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:38,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:38,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 14:56:38,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:38,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 14:56:38,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 14:56:38,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 14:56:38,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-01-12 14:56:38,374 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand 19 states. [2019-01-12 14:56:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:38,783 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2019-01-12 14:56:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:56:38,784 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 107 [2019-01-12 14:56:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:38,785 INFO L225 Difference]: With dead ends: 64 [2019-01-12 14:56:38,785 INFO L226 Difference]: Without dead ends: 60 [2019-01-12 14:56:38,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 14:56:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-12 14:56:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-12 14:56:38,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 14:56:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2019-01-12 14:56:38,795 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 107 [2019-01-12 14:56:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:38,797 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2019-01-12 14:56:38,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 14:56:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2019-01-12 14:56:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-12 14:56:38,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:38,800 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:38,800 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash -477018126, now seen corresponding path program 15 times [2019-01-12 14:56:38,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:38,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:38,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:38,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:38,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-01-12 14:56:39,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:39,317 INFO L223 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-01-12 14:56:39,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:39,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 14:56:39,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:39,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-01-12 14:56:39,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:39,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-12 14:56:39,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 14:56:39,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 14:56:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-01-12 14:56:39,448 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand 20 states. [2019-01-12 14:56:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:39,840 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2019-01-12 14:56:39,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 14:56:39,841 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 114 [2019-01-12 14:56:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:39,843 INFO L225 Difference]: With dead ends: 67 [2019-01-12 14:56:39,843 INFO L226 Difference]: Without dead ends: 63 [2019-01-12 14:56:39,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 14:56:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-12 14:56:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-12 14:56:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-12 14:56:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2019-01-12 14:56:39,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 114 [2019-01-12 14:56:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:39,853 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2019-01-12 14:56:39,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 14:56:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2019-01-12 14:56:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-12 14:56:39,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:39,857 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:39,857 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:39,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 306528463, now seen corresponding path program 16 times [2019-01-12 14:56:39,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:39,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:39,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 14:56:40,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:40,124 INFO L223 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-01-12 14:56:40,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:56:40,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:56:40,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:40,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 14:56:40,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:40,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-12 14:56:40,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 14:56:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 14:56:40,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-01-12 14:56:40,244 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 21 states. [2019-01-12 14:56:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:40,866 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2019-01-12 14:56:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 14:56:40,867 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 121 [2019-01-12 14:56:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:40,868 INFO L225 Difference]: With dead ends: 70 [2019-01-12 14:56:40,868 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 14:56:40,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 14:56:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 14:56:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-12 14:56:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 14:56:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-01-12 14:56:40,878 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 121 [2019-01-12 14:56:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:40,878 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-01-12 14:56:40,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 14:56:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-01-12 14:56:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 14:56:40,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:40,882 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:40,882 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:40,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1476273772, now seen corresponding path program 17 times [2019-01-12 14:56:40,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:40,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:40,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-01-12 14:56:41,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:41,861 INFO L223 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-01-12 14:56:41,870 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:56:41,926 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 14:56:41,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:41,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-01-12 14:56:41,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:41,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 14:56:41,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 14:56:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 14:56:41,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:56:41,989 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 22 states. [2019-01-12 14:56:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:42,405 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-01-12 14:56:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 14:56:42,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 128 [2019-01-12 14:56:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:42,408 INFO L225 Difference]: With dead ends: 73 [2019-01-12 14:56:42,408 INFO L226 Difference]: Without dead ends: 69 [2019-01-12 14:56:42,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 14:56:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-12 14:56:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-12 14:56:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-12 14:56:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2019-01-12 14:56:42,417 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 128 [2019-01-12 14:56:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:42,417 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2019-01-12 14:56:42,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 14:56:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2019-01-12 14:56:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-12 14:56:42,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:42,421 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:42,422 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1314616749, now seen corresponding path program 18 times [2019-01-12 14:56:42,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:42,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:42,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:42,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:42,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-01-12 14:56:43,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:43,480 INFO L223 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-01-12 14:56:43,507 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:56:43,790 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 14:56:43,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:43,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-01-12 14:56:43,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:43,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 14:56:43,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:56:43,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:56:43,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:56:43,871 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 23 states. [2019-01-12 14:56:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:44,341 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2019-01-12 14:56:44,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:56:44,342 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 135 [2019-01-12 14:56:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:44,344 INFO L225 Difference]: With dead ends: 76 [2019-01-12 14:56:44,344 INFO L226 Difference]: Without dead ends: 72 [2019-01-12 14:56:44,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 14:56:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-12 14:56:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-12 14:56:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 14:56:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2019-01-12 14:56:44,354 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 135 [2019-01-12 14:56:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:44,354 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2019-01-12 14:56:44,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:56:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2019-01-12 14:56:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-12 14:56:44,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:44,356 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:44,359 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash 995612214, now seen corresponding path program 19 times [2019-01-12 14:56:44,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:44,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:44,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:44,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:44,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-01-12 14:56:44,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:44,920 INFO L223 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-01-12 14:56:44,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:44,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-01-12 14:56:45,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:45,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 14:56:45,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 14:56:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 14:56:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:56:45,046 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 24 states. [2019-01-12 14:56:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:45,565 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2019-01-12 14:56:45,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 14:56:45,566 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 142 [2019-01-12 14:56:45,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:45,568 INFO L225 Difference]: With dead ends: 79 [2019-01-12 14:56:45,568 INFO L226 Difference]: Without dead ends: 75 [2019-01-12 14:56:45,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:56:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-12 14:56:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-12 14:56:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-12 14:56:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2019-01-12 14:56:45,578 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 142 [2019-01-12 14:56:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:45,578 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2019-01-12 14:56:45,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 14:56:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2019-01-12 14:56:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-12 14:56:45,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:45,582 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:45,582 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 507137931, now seen corresponding path program 20 times [2019-01-12 14:56:45,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:45,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:45,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:45,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:45,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-01-12 14:56:46,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:46,366 INFO L223 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-01-12 14:56:46,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:46,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:46,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:46,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-01-12 14:56:46,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:46,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-12 14:56:46,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-12 14:56:46,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-12 14:56:46,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2019-01-12 14:56:46,478 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand 25 states. [2019-01-12 14:56:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:47,294 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2019-01-12 14:56:47,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 14:56:47,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2019-01-12 14:56:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:47,298 INFO L225 Difference]: With dead ends: 82 [2019-01-12 14:56:47,298 INFO L226 Difference]: Without dead ends: 78 [2019-01-12 14:56:47,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 14:56:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-12 14:56:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-12 14:56:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-12 14:56:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2019-01-12 14:56:47,315 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 149 [2019-01-12 14:56:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:47,315 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2019-01-12 14:56:47,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-12 14:56:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2019-01-12 14:56:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 14:56:47,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:47,320 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:47,321 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:47,321 INFO L82 PathProgramCache]: Analyzing trace with hash 45030872, now seen corresponding path program 21 times [2019-01-12 14:56:47,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:47,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:47,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:47,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-01-12 14:56:47,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:47,732 INFO L223 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-01-12 14:56:47,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:47,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-12 14:56:47,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:47,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2019-01-12 14:56:47,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:47,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-01-12 14:56:47,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-12 14:56:47,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-12 14:56:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2019-01-12 14:56:47,887 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 26 states. [2019-01-12 14:56:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:48,502 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2019-01-12 14:56:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 14:56:48,505 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 156 [2019-01-12 14:56:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:48,507 INFO L225 Difference]: With dead ends: 85 [2019-01-12 14:56:48,508 INFO L226 Difference]: Without dead ends: 81 [2019-01-12 14:56:48,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 14:56:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-12 14:56:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-12 14:56:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-12 14:56:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2019-01-12 14:56:48,524 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 156 [2019-01-12 14:56:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:48,524 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2019-01-12 14:56:48,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-12 14:56:48,525 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2019-01-12 14:56:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 14:56:48,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:48,529 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:48,529 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:48,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1620438633, now seen corresponding path program 22 times [2019-01-12 14:56:48,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:48,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:48,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:48,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-01-12 14:56:49,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:49,354 INFO L223 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-01-12 14:56:49,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:56:49,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:56:49,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:49,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-01-12 14:56:49,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:49,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-12 14:56:49,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-12 14:56:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-12 14:56:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2019-01-12 14:56:49,487 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 27 states. [2019-01-12 14:56:50,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:50,047 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2019-01-12 14:56:50,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 14:56:50,048 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 163 [2019-01-12 14:56:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:50,050 INFO L225 Difference]: With dead ends: 88 [2019-01-12 14:56:50,050 INFO L226 Difference]: Without dead ends: 84 [2019-01-12 14:56:50,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 14:56:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-12 14:56:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-12 14:56:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-12 14:56:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2019-01-12 14:56:50,061 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 163 [2019-01-12 14:56:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:50,061 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2019-01-12 14:56:50,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-12 14:56:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2019-01-12 14:56:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-12 14:56:50,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:50,066 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:50,066 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash 973312122, now seen corresponding path program 23 times [2019-01-12 14:56:50,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:50,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:50,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-01-12 14:56:50,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:50,596 INFO L223 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-01-12 14:56:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:56:50,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-01-12 14:56:50,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:50,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2019-01-12 14:56:50,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:50,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2019-01-12 14:56:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-12 14:56:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-12 14:56:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2019-01-12 14:56:50,891 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand 28 states. [2019-01-12 14:56:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:51,532 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2019-01-12 14:56:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-12 14:56:51,534 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 170 [2019-01-12 14:56:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:51,536 INFO L225 Difference]: With dead ends: 91 [2019-01-12 14:56:51,536 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 14:56:51,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 14:56:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 14:56:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-12 14:56:51,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-12 14:56:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2019-01-12 14:56:51,548 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 170 [2019-01-12 14:56:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:51,548 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2019-01-12 14:56:51,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-12 14:56:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2019-01-12 14:56:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 14:56:51,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:51,553 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:51,553 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1078096455, now seen corresponding path program 24 times [2019-01-12 14:56:51,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:51,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:51,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:51,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:51,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-01-12 14:56:52,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:52,248 INFO L223 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-01-12 14:56:52,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:56:52,343 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-01-12 14:56:52,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:52,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-01-12 14:56:52,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:52,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-12 14:56:52,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 14:56:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 14:56:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:56:52,407 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. Second operand 29 states. [2019-01-12 14:56:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:53,065 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2019-01-12 14:56:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 14:56:53,066 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 177 [2019-01-12 14:56:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:53,068 INFO L225 Difference]: With dead ends: 94 [2019-01-12 14:56:53,068 INFO L226 Difference]: Without dead ends: 90 [2019-01-12 14:56:53,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 14:56:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-12 14:56:53,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-12 14:56:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-12 14:56:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2019-01-12 14:56:53,078 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 177 [2019-01-12 14:56:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:53,078 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2019-01-12 14:56:53,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 14:56:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2019-01-12 14:56:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-12 14:56:53,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:53,083 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:53,083 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -298775012, now seen corresponding path program 25 times [2019-01-12 14:56:53,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:53,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:53,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-01-12 14:56:54,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:54,222 INFO L223 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-01-12 14:56:54,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:54,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2019-01-12 14:56:54,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:54,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-01-12 14:56:54,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-12 14:56:54,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-12 14:56:54,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=488, Unknown=0, NotChecked=0, Total=870 [2019-01-12 14:56:54,418 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand 30 states. [2019-01-12 14:56:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:55,160 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2019-01-12 14:56:55,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-12 14:56:55,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 184 [2019-01-12 14:56:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:55,163 INFO L225 Difference]: With dead ends: 97 [2019-01-12 14:56:55,163 INFO L226 Difference]: Without dead ends: 93 [2019-01-12 14:56:55,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2019-01-12 14:56:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-12 14:56:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-12 14:56:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-12 14:56:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-01-12 14:56:55,173 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 184 [2019-01-12 14:56:55,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:55,173 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-01-12 14:56:55,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-12 14:56:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-01-12 14:56:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-12 14:56:55,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:55,178 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:55,179 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1170998491, now seen corresponding path program 26 times [2019-01-12 14:56:55,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:55,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:55,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:55,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-01-12 14:56:55,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:55,928 INFO L223 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-01-12 14:56:55,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:56,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:56,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:56,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2379 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-01-12 14:56:56,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:56,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-01-12 14:56:56,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-12 14:56:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-12 14:56:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=520, Unknown=0, NotChecked=0, Total=930 [2019-01-12 14:56:56,110 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 31 states. [2019-01-12 14:56:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:56,816 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2019-01-12 14:56:56,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 14:56:56,817 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 191 [2019-01-12 14:56:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:56,819 INFO L225 Difference]: With dead ends: 100 [2019-01-12 14:56:56,820 INFO L226 Difference]: Without dead ends: 96 [2019-01-12 14:56:56,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 14:56:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-12 14:56:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-12 14:56:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-12 14:56:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2019-01-12 14:56:56,832 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 191 [2019-01-12 14:56:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:56,834 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2019-01-12 14:56:56,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-12 14:56:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2019-01-12 14:56:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-12 14:56:56,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:56,837 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:56,838 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -151816514, now seen corresponding path program 27 times [2019-01-12 14:56:56,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:56,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:56,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-01-12 14:56:57,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:57,490 INFO L223 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-01-12 14:56:57,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:57,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-12 14:56:57,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:57,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-01-12 14:56:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:57,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2019-01-12 14:56:57,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-12 14:56:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-12 14:56:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=553, Unknown=0, NotChecked=0, Total=992 [2019-01-12 14:56:57,707 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand 32 states. [2019-01-12 14:56:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:59,361 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2019-01-12 14:56:59,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-12 14:56:59,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 198 [2019-01-12 14:56:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:59,364 INFO L225 Difference]: With dead ends: 103 [2019-01-12 14:56:59,364 INFO L226 Difference]: Without dead ends: 99 [2019-01-12 14:56:59,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2019-01-12 14:56:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-12 14:56:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-12 14:56:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-12 14:56:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2019-01-12 14:56:59,378 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 131 transitions. Word has length 198 [2019-01-12 14:56:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:59,379 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 131 transitions. [2019-01-12 14:56:59,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-12 14:56:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 131 transitions. [2019-01-12 14:56:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-12 14:56:59,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:59,383 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:59,383 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 595503363, now seen corresponding path program 28 times [2019-01-12 14:56:59,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:59,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:59,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:59,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:59,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2019-01-12 14:57:00,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:00,476 INFO L223 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-01-12 14:57:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:57:00,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:57:00,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:00,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2019-01-12 14:57:00,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:00,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-01-12 14:57:00,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-12 14:57:00,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-12 14:57:00,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=587, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 14:57:00,676 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. Second operand 33 states. [2019-01-12 14:57:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:01,846 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2019-01-12 14:57:01,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 14:57:01,847 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 205 [2019-01-12 14:57:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:01,849 INFO L225 Difference]: With dead ends: 106 [2019-01-12 14:57:01,849 INFO L226 Difference]: Without dead ends: 102 [2019-01-12 14:57:01,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2019-01-12 14:57:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-12 14:57:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-12 14:57:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-12 14:57:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2019-01-12 14:57:01,868 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 205 [2019-01-12 14:57:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:01,869 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2019-01-12 14:57:01,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-12 14:57:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2019-01-12 14:57:01,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-12 14:57:01,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:01,872 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:01,874 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash -253318560, now seen corresponding path program 29 times [2019-01-12 14:57:01,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:01,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:01,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:01,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:01,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2019-01-12 14:57:02,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:02,616 INFO L223 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-01-12 14:57:02,626 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:57:02,755 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2019-01-12 14:57:02,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:02,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2019-01-12 14:57:02,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:02,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2019-01-12 14:57:02,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-12 14:57:02,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-12 14:57:02,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=622, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 14:57:02,860 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand 34 states. [2019-01-12 14:57:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:03,772 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2019-01-12 14:57:03,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-12 14:57:03,778 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 212 [2019-01-12 14:57:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:03,779 INFO L225 Difference]: With dead ends: 109 [2019-01-12 14:57:03,779 INFO L226 Difference]: Without dead ends: 105 [2019-01-12 14:57:03,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2019-01-12 14:57:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-12 14:57:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-12 14:57:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-12 14:57:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2019-01-12 14:57:03,795 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 212 [2019-01-12 14:57:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:03,795 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2019-01-12 14:57:03,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-12 14:57:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2019-01-12 14:57:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-12 14:57:03,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:03,800 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:03,800 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1353278495, now seen corresponding path program 30 times [2019-01-12 14:57:03,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:03,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:03,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-01-12 14:57:04,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:04,358 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:04,380 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:57:04,544 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-01-12 14:57:04,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:04,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-01-12 14:57:04,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:04,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-01-12 14:57:04,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 14:57:04,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 14:57:04,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=658, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 14:57:04,654 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand 35 states. [2019-01-12 14:57:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:05,657 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2019-01-12 14:57:05,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 14:57:05,658 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 219 [2019-01-12 14:57:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:05,659 INFO L225 Difference]: With dead ends: 112 [2019-01-12 14:57:05,659 INFO L226 Difference]: Without dead ends: 108 [2019-01-12 14:57:05,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2019-01-12 14:57:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-12 14:57:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-12 14:57:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-12 14:57:05,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 143 transitions. [2019-01-12 14:57:05,673 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 143 transitions. Word has length 219 [2019-01-12 14:57:05,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:05,673 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 143 transitions. [2019-01-12 14:57:05,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 14:57:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 143 transitions. [2019-01-12 14:57:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-12 14:57:05,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:05,675 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:05,675 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:05,676 INFO L82 PathProgramCache]: Analyzing trace with hash 931563778, now seen corresponding path program 31 times [2019-01-12 14:57:05,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:05,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:05,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:05,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3379 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2019-01-12 14:57:06,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:06,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:06,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:06,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3379 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2019-01-12 14:57:06,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:06,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-01-12 14:57:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-12 14:57:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-12 14:57:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=565, Invalid=695, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 14:57:06,597 INFO L87 Difference]: Start difference. First operand 108 states and 143 transitions. Second operand 36 states. [2019-01-12 14:57:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:08,215 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2019-01-12 14:57:08,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-12 14:57:08,217 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 226 [2019-01-12 14:57:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:08,218 INFO L225 Difference]: With dead ends: 115 [2019-01-12 14:57:08,218 INFO L226 Difference]: Without dead ends: 111 [2019-01-12 14:57:08,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2019-01-12 14:57:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-12 14:57:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-12 14:57:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-12 14:57:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 147 transitions. [2019-01-12 14:57:08,231 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 147 transitions. Word has length 226 [2019-01-12 14:57:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:08,232 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 147 transitions. [2019-01-12 14:57:08,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-12 14:57:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 147 transitions. [2019-01-12 14:57:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-12 14:57:08,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:08,234 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:08,234 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:08,235 INFO L82 PathProgramCache]: Analyzing trace with hash -183503937, now seen corresponding path program 32 times [2019-01-12 14:57:08,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:08,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:08,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2019-01-12 14:57:08,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:08,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:08,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:08,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:08,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:08,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2019-01-12 14:57:09,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:09,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-01-12 14:57:09,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-12 14:57:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-12 14:57:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=733, Unknown=0, NotChecked=0, Total=1332 [2019-01-12 14:57:09,038 INFO L87 Difference]: Start difference. First operand 111 states and 147 transitions. Second operand 37 states. [2019-01-12 14:57:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:09,979 INFO L93 Difference]: Finished difference Result 118 states and 155 transitions. [2019-01-12 14:57:09,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 14:57:09,980 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 233 [2019-01-12 14:57:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:09,982 INFO L225 Difference]: With dead ends: 118 [2019-01-12 14:57:09,982 INFO L226 Difference]: Without dead ends: 114 [2019-01-12 14:57:09,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2019-01-12 14:57:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-12 14:57:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-12 14:57:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 14:57:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 151 transitions. [2019-01-12 14:57:09,995 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 151 transitions. Word has length 233 [2019-01-12 14:57:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:09,996 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 151 transitions. [2019-01-12 14:57:09,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-12 14:57:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 151 transitions. [2019-01-12 14:57:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-12 14:57:09,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:09,998 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:09,998 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:09,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash -550571356, now seen corresponding path program 33 times [2019-01-12 14:57:09,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:09,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:09,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:09,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2019-01-12 14:57:11,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:11,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:11,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:57:11,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-12 14:57:11,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:11,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2019-01-12 14:57:11,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:11,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-01-12 14:57:11,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-12 14:57:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-12 14:57:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=772, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 14:57:11,420 INFO L87 Difference]: Start difference. First operand 114 states and 151 transitions. Second operand 38 states. [2019-01-12 14:57:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:13,830 INFO L93 Difference]: Finished difference Result 121 states and 159 transitions. [2019-01-12 14:57:13,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-12 14:57:13,832 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 240 [2019-01-12 14:57:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:13,834 INFO L225 Difference]: With dead ends: 121 [2019-01-12 14:57:13,834 INFO L226 Difference]: Without dead ends: 117 [2019-01-12 14:57:13,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2019-01-12 14:57:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-12 14:57:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-12 14:57:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-12 14:57:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 155 transitions. [2019-01-12 14:57:13,846 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 155 transitions. Word has length 240 [2019-01-12 14:57:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:13,846 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 155 transitions. [2019-01-12 14:57:13,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-12 14:57:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 155 transitions. [2019-01-12 14:57:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-12 14:57:13,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:13,849 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:13,849 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:13,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:13,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1981730973, now seen corresponding path program 34 times [2019-01-12 14:57:13,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:13,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:13,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2019-01-12 14:57:15,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:15,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:15,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:57:15,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:57:15,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:15,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2019-01-12 14:57:15,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:15,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-01-12 14:57:15,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-12 14:57:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-12 14:57:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=812, Unknown=0, NotChecked=0, Total=1482 [2019-01-12 14:57:15,823 INFO L87 Difference]: Start difference. First operand 117 states and 155 transitions. Second operand 39 states. [2019-01-12 14:57:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:17,977 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2019-01-12 14:57:17,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 14:57:17,978 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 247 [2019-01-12 14:57:17,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:17,980 INFO L225 Difference]: With dead ends: 124 [2019-01-12 14:57:17,980 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 14:57:17,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 14:57:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 14:57:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 14:57:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 14:57:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2019-01-12 14:57:17,995 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 247 [2019-01-12 14:57:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:17,996 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2019-01-12 14:57:17,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-12 14:57:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2019-01-12 14:57:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-12 14:57:17,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:17,998 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:17,998 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1357134010, now seen corresponding path program 35 times [2019-01-12 14:57:17,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:17,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:17,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-01-12 14:57:18,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:18,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:18,851 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:57:19,043 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-01-12 14:57:19,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:19,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2019-01-12 14:57:19,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:19,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2019-01-12 14:57:19,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-12 14:57:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-12 14:57:19,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=853, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 14:57:19,161 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand 40 states. [2019-01-12 14:57:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:20,375 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2019-01-12 14:57:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-12 14:57:20,376 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 254 [2019-01-12 14:57:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:20,378 INFO L225 Difference]: With dead ends: 127 [2019-01-12 14:57:20,378 INFO L226 Difference]: Without dead ends: 123 [2019-01-12 14:57:20,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2019-01-12 14:57:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-12 14:57:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-12 14:57:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-12 14:57:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2019-01-12 14:57:20,394 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 254 [2019-01-12 14:57:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:20,395 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2019-01-12 14:57:20,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-12 14:57:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2019-01-12 14:57:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-12 14:57:20,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:20,400 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:20,400 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash 605508219, now seen corresponding path program 36 times [2019-01-12 14:57:20,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:20,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:20,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2019-01-12 14:57:21,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:21,227 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:21,237 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:57:21,372 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-01-12 14:57:21,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:21,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2019-01-12 14:57:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:21,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-01-12 14:57:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-12 14:57:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-12 14:57:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=745, Invalid=895, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 14:57:21,480 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand 41 states. [2019-01-12 14:57:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:22,975 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-01-12 14:57:22,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-12 14:57:22,976 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 261 [2019-01-12 14:57:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:22,979 INFO L225 Difference]: With dead ends: 130 [2019-01-12 14:57:22,980 INFO L226 Difference]: Without dead ends: 126 [2019-01-12 14:57:22,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2019-01-12 14:57:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-12 14:57:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-01-12 14:57:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-12 14:57:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2019-01-12 14:57:23,000 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 261 [2019-01-12 14:57:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:23,001 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2019-01-12 14:57:23,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-12 14:57:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2019-01-12 14:57:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-12 14:57:23,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:23,023 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:23,023 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:23,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:23,024 INFO L82 PathProgramCache]: Analyzing trace with hash 459859688, now seen corresponding path program 37 times [2019-01-12 14:57:23,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:23,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:23,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:23,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:23,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4810 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-01-12 14:57:23,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:23,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:23,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:23,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4810 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-01-12 14:57:24,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:24,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-01-12 14:57:24,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-12 14:57:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-12 14:57:24,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=938, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 14:57:24,108 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand 42 states. [2019-01-12 14:57:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:26,027 INFO L93 Difference]: Finished difference Result 133 states and 175 transitions. [2019-01-12 14:57:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-12 14:57:26,028 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 268 [2019-01-12 14:57:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:26,030 INFO L225 Difference]: With dead ends: 133 [2019-01-12 14:57:26,030 INFO L226 Difference]: Without dead ends: 129 [2019-01-12 14:57:26,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2019-01-12 14:57:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-12 14:57:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-12 14:57:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-12 14:57:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 171 transitions. [2019-01-12 14:57:26,044 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 171 transitions. Word has length 268 [2019-01-12 14:57:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:26,044 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 171 transitions. [2019-01-12 14:57:26,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-12 14:57:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 171 transitions. [2019-01-12 14:57:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-12 14:57:26,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:26,047 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:26,047 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash -424830631, now seen corresponding path program 38 times [2019-01-12 14:57:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:26,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:26,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:26,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2019-01-12 14:57:27,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:27,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:27,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:27,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:27,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:27,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2019-01-12 14:57:27,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:27,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-01-12 14:57:27,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-12 14:57:27,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-12 14:57:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=824, Invalid=982, Unknown=0, NotChecked=0, Total=1806 [2019-01-12 14:57:27,710 INFO L87 Difference]: Start difference. First operand 129 states and 171 transitions. Second operand 43 states. [2019-01-12 14:57:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:29,192 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2019-01-12 14:57:29,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-12 14:57:29,193 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 275 [2019-01-12 14:57:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:29,195 INFO L225 Difference]: With dead ends: 136 [2019-01-12 14:57:29,195 INFO L226 Difference]: Without dead ends: 132 [2019-01-12 14:57:29,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2019-01-12 14:57:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-12 14:57:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-01-12 14:57:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-12 14:57:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2019-01-12 14:57:29,215 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 275 [2019-01-12 14:57:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:29,215 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2019-01-12 14:57:29,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-12 14:57:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2019-01-12 14:57:29,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-01-12 14:57:29,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:29,220 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:29,221 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1058156938, now seen corresponding path program 39 times [2019-01-12 14:57:29,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:29,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5343 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2019-01-12 14:57:30,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:30,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:30,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:57:30,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-12 14:57:30,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:30,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5343 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 3042 trivial. 0 not checked. [2019-01-12 14:57:30,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:30,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-01-12 14:57:30,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 14:57:30,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 14:57:30,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=1027, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:57:30,445 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand 44 states. [2019-01-12 14:57:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:31,667 INFO L93 Difference]: Finished difference Result 139 states and 183 transitions. [2019-01-12 14:57:31,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-12 14:57:31,669 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 282 [2019-01-12 14:57:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:31,670 INFO L225 Difference]: With dead ends: 139 [2019-01-12 14:57:31,670 INFO L226 Difference]: Without dead ends: 135 [2019-01-12 14:57:31,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2019-01-12 14:57:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-12 14:57:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-12 14:57:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-12 14:57:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2019-01-12 14:57:31,687 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 282 [2019-01-12 14:57:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:31,687 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2019-01-12 14:57:31,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 14:57:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2019-01-12 14:57:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-12 14:57:31,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:31,690 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:31,690 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:31,690 INFO L82 PathProgramCache]: Analyzing trace with hash 565560631, now seen corresponding path program 40 times [2019-01-12 14:57:31,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:31,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:31,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:31,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5620 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2019-01-12 14:57:32,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:32,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:32,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:57:32,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:57:32,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:32,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5620 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 3200 trivial. 0 not checked. [2019-01-12 14:57:32,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:32,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-01-12 14:57:32,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-12 14:57:32,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-12 14:57:32,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=1073, Unknown=0, NotChecked=0, Total=1980 [2019-01-12 14:57:32,804 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand 45 states. [2019-01-12 14:57:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:34,148 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2019-01-12 14:57:34,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-12 14:57:34,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 289 [2019-01-12 14:57:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:34,152 INFO L225 Difference]: With dead ends: 142 [2019-01-12 14:57:34,152 INFO L226 Difference]: Without dead ends: 138 [2019-01-12 14:57:34,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2019-01-12 14:57:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-12 14:57:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-01-12 14:57:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-12 14:57:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 183 transitions. [2019-01-12 14:57:34,174 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 183 transitions. Word has length 289 [2019-01-12 14:57:34,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:34,174 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 183 transitions. [2019-01-12 14:57:34,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-12 14:57:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 183 transitions. [2019-01-12 14:57:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-12 14:57:34,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:34,176 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:34,177 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash -705460436, now seen corresponding path program 41 times [2019-01-12 14:57:34,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:34,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5904 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2019-01-12 14:57:35,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:35,083 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:35,093 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:57:35,290 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2019-01-12 14:57:35,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:35,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5904 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2019-01-12 14:57:35,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:35,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2019-01-12 14:57:35,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-12 14:57:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-12 14:57:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=950, Invalid=1120, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 14:57:35,426 INFO L87 Difference]: Start difference. First operand 138 states and 183 transitions. Second operand 46 states. [2019-01-12 14:57:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:36,775 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2019-01-12 14:57:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-12 14:57:36,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 296 [2019-01-12 14:57:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:36,778 INFO L225 Difference]: With dead ends: 145 [2019-01-12 14:57:36,778 INFO L226 Difference]: Without dead ends: 141 [2019-01-12 14:57:36,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2019-01-12 14:57:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-12 14:57:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-12 14:57:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-12 14:57:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 187 transitions. [2019-01-12 14:57:36,796 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 187 transitions. Word has length 296 [2019-01-12 14:57:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:36,796 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 187 transitions. [2019-01-12 14:57:36,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-12 14:57:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 187 transitions. [2019-01-12 14:57:36,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-01-12 14:57:36,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:36,802 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:36,803 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:36,803 INFO L82 PathProgramCache]: Analyzing trace with hash 992212501, now seen corresponding path program 42 times [2019-01-12 14:57:36,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:36,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:36,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:36,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2019-01-12 14:57:38,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:38,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:38,290 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:57:38,474 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-01-12 14:57:38,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:38,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6195 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2019-01-12 14:57:38,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:38,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-01-12 14:57:38,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-12 14:57:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-12 14:57:38,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=1168, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 14:57:38,662 INFO L87 Difference]: Start difference. First operand 141 states and 187 transitions. Second operand 47 states. [2019-01-12 14:57:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:40,179 INFO L93 Difference]: Finished difference Result 148 states and 195 transitions. [2019-01-12 14:57:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-12 14:57:40,180 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 303 [2019-01-12 14:57:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:40,182 INFO L225 Difference]: With dead ends: 148 [2019-01-12 14:57:40,182 INFO L226 Difference]: Without dead ends: 144 [2019-01-12 14:57:40,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2019-01-12 14:57:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-12 14:57:40,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-01-12 14:57:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-12 14:57:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2019-01-12 14:57:40,208 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 303 [2019-01-12 14:57:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:40,210 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2019-01-12 14:57:40,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-12 14:57:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2019-01-12 14:57:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-12 14:57:40,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:40,212 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:40,212 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash 919128014, now seen corresponding path program 43 times [2019-01-12 14:57:40,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:40,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:40,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:41,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6493 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2019-01-12 14:57:41,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:41,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:41,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:41,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6493 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2019-01-12 14:57:41,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:41,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2019-01-12 14:57:41,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-12 14:57:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-12 14:57:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=1217, Unknown=0, NotChecked=0, Total=2256 [2019-01-12 14:57:41,656 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand 48 states. [2019-01-12 14:57:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:43,443 INFO L93 Difference]: Finished difference Result 151 states and 199 transitions. [2019-01-12 14:57:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-12 14:57:43,444 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 310 [2019-01-12 14:57:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:43,446 INFO L225 Difference]: With dead ends: 151 [2019-01-12 14:57:43,446 INFO L226 Difference]: Without dead ends: 147 [2019-01-12 14:57:43,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2019-01-12 14:57:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-12 14:57:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-12 14:57:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-12 14:57:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 195 transitions. [2019-01-12 14:57:43,474 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 195 transitions. Word has length 310 [2019-01-12 14:57:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:43,475 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 195 transitions. [2019-01-12 14:57:43,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-12 14:57:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 195 transitions. [2019-01-12 14:57:43,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-01-12 14:57:43,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:43,483 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:43,483 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:43,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:43,484 INFO L82 PathProgramCache]: Analyzing trace with hash 554454003, now seen corresponding path program 44 times [2019-01-12 14:57:43,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:43,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:43,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:43,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6798 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2019-01-12 14:57:44,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:44,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:44,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:44,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:44,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:44,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6798 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2019-01-12 14:57:44,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:44,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-01-12 14:57:44,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-12 14:57:44,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-12 14:57:44,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=1267, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 14:57:44,798 INFO L87 Difference]: Start difference. First operand 147 states and 195 transitions. Second operand 49 states. [2019-01-12 14:57:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:46,713 INFO L93 Difference]: Finished difference Result 154 states and 203 transitions. [2019-01-12 14:57:46,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-12 14:57:46,715 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 317 [2019-01-12 14:57:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:46,716 INFO L225 Difference]: With dead ends: 154 [2019-01-12 14:57:46,716 INFO L226 Difference]: Without dead ends: 150 [2019-01-12 14:57:46,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2019-01-12 14:57:46,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-12 14:57:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-01-12 14:57:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-12 14:57:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 199 transitions. [2019-01-12 14:57:46,741 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 199 transitions. Word has length 317 [2019-01-12 14:57:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:46,741 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 199 transitions. [2019-01-12 14:57:46,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-12 14:57:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 199 transitions. [2019-01-12 14:57:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-01-12 14:57:46,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:46,748 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:46,748 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1294848880, now seen corresponding path program 45 times [2019-01-12 14:57:46,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:46,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:46,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:46,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:46,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7110 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2019-01-12 14:57:47,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:47,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:47,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:57:47,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-12 14:57:47,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:47,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7110 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 4050 trivial. 0 not checked. [2019-01-12 14:57:48,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:48,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2019-01-12 14:57:48,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 14:57:48,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 14:57:48,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=1318, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 14:57:48,161 INFO L87 Difference]: Start difference. First operand 150 states and 199 transitions. Second operand 50 states. [2019-01-12 14:57:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:49,855 INFO L93 Difference]: Finished difference Result 157 states and 207 transitions. [2019-01-12 14:57:49,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-12 14:57:49,856 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 324 [2019-01-12 14:57:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:49,858 INFO L225 Difference]: With dead ends: 157 [2019-01-12 14:57:49,858 INFO L226 Difference]: Without dead ends: 153 [2019-01-12 14:57:49,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2019-01-12 14:57:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-12 14:57:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-12 14:57:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-12 14:57:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 203 transitions. [2019-01-12 14:57:49,887 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 203 transitions. Word has length 324 [2019-01-12 14:57:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:49,887 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 203 transitions. [2019-01-12 14:57:49,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 14:57:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 203 transitions. [2019-01-12 14:57:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-01-12 14:57:49,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:49,892 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:49,892 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:49,893 INFO L82 PathProgramCache]: Analyzing trace with hash -811407663, now seen corresponding path program 46 times [2019-01-12 14:57:49,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:49,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:49,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:49,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2019-01-12 14:57:50,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:50,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:50,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:57:51,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:57:51,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:51,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 4232 trivial. 0 not checked. [2019-01-12 14:57:51,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:51,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2019-01-12 14:57:51,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-12 14:57:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-12 14:57:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1180, Invalid=1370, Unknown=0, NotChecked=0, Total=2550 [2019-01-12 14:57:51,167 INFO L87 Difference]: Start difference. First operand 153 states and 203 transitions. Second operand 51 states. [2019-01-12 14:57:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:52,904 INFO L93 Difference]: Finished difference Result 160 states and 211 transitions. [2019-01-12 14:57:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-12 14:57:52,905 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 331 [2019-01-12 14:57:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:52,907 INFO L225 Difference]: With dead ends: 160 [2019-01-12 14:57:52,907 INFO L226 Difference]: Without dead ends: 156 [2019-01-12 14:57:52,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2019-01-12 14:57:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-12 14:57:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-01-12 14:57:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-12 14:57:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 207 transitions. [2019-01-12 14:57:52,935 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 207 transitions. Word has length 331 [2019-01-12 14:57:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:52,938 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 207 transitions. [2019-01-12 14:57:52,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-12 14:57:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 207 transitions. [2019-01-12 14:57:52,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-01-12 14:57:52,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:52,940 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:52,945 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1818326510, now seen corresponding path program 47 times [2019-01-12 14:57:52,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:52,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:52,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:52,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:52,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2019-01-12 14:57:54,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:54,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:54,293 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:57:54,512 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2019-01-12 14:57:54,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:54,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2019-01-12 14:57:54,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:54,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2019-01-12 14:57:54,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-12 14:57:54,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-12 14:57:54,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=1423, Unknown=0, NotChecked=0, Total=2652 [2019-01-12 14:57:54,656 INFO L87 Difference]: Start difference. First operand 156 states and 207 transitions. Second operand 52 states. [2019-01-12 14:57:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:56,359 INFO L93 Difference]: Finished difference Result 163 states and 215 transitions. [2019-01-12 14:57:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-12 14:57:56,360 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 338 [2019-01-12 14:57:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:56,362 INFO L225 Difference]: With dead ends: 163 [2019-01-12 14:57:56,362 INFO L226 Difference]: Without dead ends: 159 [2019-01-12 14:57:56,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2019-01-12 14:57:56,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-12 14:57:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-12 14:57:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-12 14:57:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 211 transitions. [2019-01-12 14:57:56,392 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 211 transitions. Word has length 338 [2019-01-12 14:57:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:56,393 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 211 transitions. [2019-01-12 14:57:56,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-12 14:57:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 211 transitions. [2019-01-12 14:57:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-12 14:57:56,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:56,399 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:56,399 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash -683940177, now seen corresponding path program 48 times [2019-01-12 14:57:56,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:56,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:56,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8088 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2019-01-12 14:57:57,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:57,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:57,659 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:57:57,877 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-01-12 14:57:57,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:57,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8088 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2019-01-12 14:57:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:57,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2019-01-12 14:57:57,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-12 14:57:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-12 14:57:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=1477, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 14:57:57,982 INFO L87 Difference]: Start difference. First operand 159 states and 211 transitions. Second operand 53 states. [2019-01-12 14:57:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:59,994 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-01-12 14:57:59,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-12 14:57:59,996 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 345 [2019-01-12 14:57:59,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:59,997 INFO L225 Difference]: With dead ends: 166 [2019-01-12 14:57:59,997 INFO L226 Difference]: Without dead ends: 162 [2019-01-12 14:57:59,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 14:57:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-12 14:58:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-01-12 14:58:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-12 14:58:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 215 transitions. [2019-01-12 14:58:00,028 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 215 transitions. Word has length 345 [2019-01-12 14:58:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:00,028 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 215 transitions. [2019-01-12 14:58:00,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-12 14:58:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 215 transitions. [2019-01-12 14:58:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-01-12 14:58:00,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:00,036 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:00,036 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:00,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:00,036 INFO L82 PathProgramCache]: Analyzing trace with hash 225889204, now seen corresponding path program 49 times [2019-01-12 14:58:00,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:00,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:00,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:00,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8428 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2019-01-12 14:58:01,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:01,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:01,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:01,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8428 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2019-01-12 14:58:01,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:01,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2019-01-12 14:58:01,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-12 14:58:01,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-12 14:58:01,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=1532, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 14:58:01,476 INFO L87 Difference]: Start difference. First operand 162 states and 215 transitions. Second operand 54 states. [2019-01-12 14:58:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:03,348 INFO L93 Difference]: Finished difference Result 169 states and 223 transitions. [2019-01-12 14:58:03,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-12 14:58:03,350 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 352 [2019-01-12 14:58:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:03,351 INFO L225 Difference]: With dead ends: 169 [2019-01-12 14:58:03,351 INFO L226 Difference]: Without dead ends: 165 [2019-01-12 14:58:03,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2019-01-12 14:58:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-12 14:58:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-12 14:58:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-12 14:58:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2019-01-12 14:58:03,379 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 352 [2019-01-12 14:58:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:03,380 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2019-01-12 14:58:03,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-12 14:58:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2019-01-12 14:58:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-01-12 14:58:03,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:03,387 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:03,388 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash -498373747, now seen corresponding path program 50 times [2019-01-12 14:58:03,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:03,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:03,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2019-01-12 14:58:04,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:04,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:04,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:04,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:04,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2019-01-12 14:58:05,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:05,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-01-12 14:58:05,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-12 14:58:05,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-12 14:58:05,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1382, Invalid=1588, Unknown=0, NotChecked=0, Total=2970 [2019-01-12 14:58:05,018 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 55 states. [2019-01-12 14:58:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:06,906 INFO L93 Difference]: Finished difference Result 172 states and 227 transitions. [2019-01-12 14:58:06,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-12 14:58:06,906 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 359 [2019-01-12 14:58:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:06,907 INFO L225 Difference]: With dead ends: 172 [2019-01-12 14:58:06,908 INFO L226 Difference]: Without dead ends: 168 [2019-01-12 14:58:06,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2019-01-12 14:58:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-12 14:58:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-01-12 14:58:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-12 14:58:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2019-01-12 14:58:06,939 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 359 [2019-01-12 14:58:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:06,940 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2019-01-12 14:58:06,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-12 14:58:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2019-01-12 14:58:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-01-12 14:58:06,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:06,947 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:06,947 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1089632342, now seen corresponding path program 51 times [2019-01-12 14:58:06,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:06,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:06,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:06,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2019-01-12 14:58:08,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:08,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:08,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:58:08,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-12 14:58:08,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:08,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9129 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2019-01-12 14:58:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:08,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-01-12 14:58:08,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-12 14:58:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-12 14:58:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=1645, Unknown=0, NotChecked=0, Total=3080 [2019-01-12 14:58:08,523 INFO L87 Difference]: Start difference. First operand 168 states and 223 transitions. Second operand 56 states. [2019-01-12 14:58:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:10,567 INFO L93 Difference]: Finished difference Result 175 states and 231 transitions. [2019-01-12 14:58:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-12 14:58:10,569 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 366 [2019-01-12 14:58:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:10,570 INFO L225 Difference]: With dead ends: 175 [2019-01-12 14:58:10,570 INFO L226 Difference]: Without dead ends: 171 [2019-01-12 14:58:10,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2019-01-12 14:58:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-12 14:58:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-12 14:58:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-12 14:58:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2019-01-12 14:58:10,599 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 366 [2019-01-12 14:58:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:10,599 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2019-01-12 14:58:10,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-12 14:58:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2019-01-12 14:58:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-01-12 14:58:10,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:10,607 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:10,608 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:10,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:10,608 INFO L82 PathProgramCache]: Analyzing trace with hash 996513131, now seen corresponding path program 52 times [2019-01-12 14:58:10,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:10,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:10,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9490 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2019-01-12 14:58:11,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:11,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:11,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:58:12,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:58:12,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:12,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9490 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2019-01-12 14:58:12,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:12,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2019-01-12 14:58:12,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-12 14:58:12,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-12 14:58:12,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1489, Invalid=1703, Unknown=0, NotChecked=0, Total=3192 [2019-01-12 14:58:12,178 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand 57 states. [2019-01-12 14:58:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:14,421 INFO L93 Difference]: Finished difference Result 178 states and 235 transitions. [2019-01-12 14:58:14,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-12 14:58:14,423 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 373 [2019-01-12 14:58:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:14,426 INFO L225 Difference]: With dead ends: 178 [2019-01-12 14:58:14,426 INFO L226 Difference]: Without dead ends: 174 [2019-01-12 14:58:14,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2019-01-12 14:58:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-12 14:58:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-01-12 14:58:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-01-12 14:58:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2019-01-12 14:58:14,460 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 373 [2019-01-12 14:58:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:14,461 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2019-01-12 14:58:14,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-12 14:58:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2019-01-12 14:58:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-12 14:58:14,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:14,468 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:14,468 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 825061368, now seen corresponding path program 53 times [2019-01-12 14:58:14,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:14,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:14,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:14,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:14,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2019-01-12 14:58:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:15,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:15,839 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:58:16,098 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2019-01-12 14:58:16,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:16,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9858 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 5618 trivial. 0 not checked. [2019-01-12 14:58:16,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:16,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-01-12 14:58:16,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-12 14:58:16,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-12 14:58:16,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1544, Invalid=1762, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 14:58:16,255 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand 58 states. [2019-01-12 14:58:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:18,242 INFO L93 Difference]: Finished difference Result 181 states and 239 transitions. [2019-01-12 14:58:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-12 14:58:18,244 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 380 [2019-01-12 14:58:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:18,246 INFO L225 Difference]: With dead ends: 181 [2019-01-12 14:58:18,247 INFO L226 Difference]: Without dead ends: 177 [2019-01-12 14:58:18,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2019-01-12 14:58:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-12 14:58:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-12 14:58:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-12 14:58:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 235 transitions. [2019-01-12 14:58:18,271 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 235 transitions. Word has length 380 [2019-01-12 14:58:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:18,272 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 235 transitions. [2019-01-12 14:58:18,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-12 14:58:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 235 transitions. [2019-01-12 14:58:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-01-12 14:58:18,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:18,279 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:18,279 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1396606025, now seen corresponding path program 54 times [2019-01-12 14:58:18,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:18,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:18,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:18,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10233 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2019-01-12 14:58:20,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:20,071 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:20,081 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:58:20,322 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2019-01-12 14:58:20,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:20,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10233 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 5832 trivial. 0 not checked. [2019-01-12 14:58:20,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:20,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2019-01-12 14:58:20,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-12 14:58:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-12 14:58:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=1822, Unknown=0, NotChecked=0, Total=3422 [2019-01-12 14:58:20,554 INFO L87 Difference]: Start difference. First operand 177 states and 235 transitions. Second operand 59 states. [2019-01-12 14:58:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:22,753 INFO L93 Difference]: Finished difference Result 184 states and 243 transitions. [2019-01-12 14:58:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-12 14:58:22,755 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 387 [2019-01-12 14:58:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:22,757 INFO L225 Difference]: With dead ends: 184 [2019-01-12 14:58:22,757 INFO L226 Difference]: Without dead ends: 180 [2019-01-12 14:58:22,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2019-01-12 14:58:22,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-12 14:58:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-01-12 14:58:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-12 14:58:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2019-01-12 14:58:22,785 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 387 [2019-01-12 14:58:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:22,786 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2019-01-12 14:58:22,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-12 14:58:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2019-01-12 14:58:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-01-12 14:58:22,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:22,789 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:22,789 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1478726298, now seen corresponding path program 55 times [2019-01-12 14:58:22,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:22,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:22,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10615 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2019-01-12 14:58:24,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:24,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:24,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:24,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10615 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2019-01-12 14:58:24,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:24,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2019-01-12 14:58:24,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-12 14:58:24,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-12 14:58:24,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1657, Invalid=1883, Unknown=0, NotChecked=0, Total=3540 [2019-01-12 14:58:24,755 INFO L87 Difference]: Start difference. First operand 180 states and 239 transitions. Second operand 60 states. [2019-01-12 14:58:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:27,025 INFO L93 Difference]: Finished difference Result 187 states and 247 transitions. [2019-01-12 14:58:27,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-12 14:58:27,027 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 394 [2019-01-12 14:58:27,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:27,028 INFO L225 Difference]: With dead ends: 187 [2019-01-12 14:58:27,029 INFO L226 Difference]: Without dead ends: 183 [2019-01-12 14:58:27,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2019-01-12 14:58:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-12 14:58:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-12 14:58:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-12 14:58:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 243 transitions. [2019-01-12 14:58:27,066 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 243 transitions. Word has length 394 [2019-01-12 14:58:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:27,067 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 243 transitions. [2019-01-12 14:58:27,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-12 14:58:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 243 transitions. [2019-01-12 14:58:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-12 14:58:27,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:27,070 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:27,070 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1185568807, now seen corresponding path program 56 times [2019-01-12 14:58:27,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:27,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:27,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:27,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:27,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11004 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2019-01-12 14:58:28,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:28,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:28,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:28,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:28,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:28,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 11004 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2019-01-12 14:58:28,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:28,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-01-12 14:58:28,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-12 14:58:28,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-12 14:58:28,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1715, Invalid=1945, Unknown=0, NotChecked=0, Total=3660 [2019-01-12 14:58:28,766 INFO L87 Difference]: Start difference. First operand 183 states and 243 transitions. Second operand 61 states. [2019-01-12 14:58:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:31,142 INFO L93 Difference]: Finished difference Result 190 states and 251 transitions. [2019-01-12 14:58:31,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-12 14:58:31,144 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 401 [2019-01-12 14:58:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:31,145 INFO L225 Difference]: With dead ends: 190 [2019-01-12 14:58:31,145 INFO L226 Difference]: Without dead ends: 186 [2019-01-12 14:58:31,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2019-01-12 14:58:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-12 14:58:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-01-12 14:58:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-12 14:58:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2019-01-12 14:58:31,177 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 401 [2019-01-12 14:58:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:31,177 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2019-01-12 14:58:31,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-12 14:58:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2019-01-12 14:58:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-01-12 14:58:31,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:31,186 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:31,186 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1599029188, now seen corresponding path program 57 times [2019-01-12 14:58:31,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:31,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:31,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2019-01-12 14:58:32,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:32,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:32,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:58:32,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2019-01-12 14:58:32,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:32,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked. [2019-01-12 14:58:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:33,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-01-12 14:58:33,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-12 14:58:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-12 14:58:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1774, Invalid=2008, Unknown=0, NotChecked=0, Total=3782 [2019-01-12 14:58:33,177 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand 62 states. [2019-01-12 14:58:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:35,780 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2019-01-12 14:58:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-12 14:58:35,781 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 408 [2019-01-12 14:58:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:35,784 INFO L225 Difference]: With dead ends: 193 [2019-01-12 14:58:35,784 INFO L226 Difference]: Without dead ends: 189 [2019-01-12 14:58:35,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2019-01-12 14:58:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-12 14:58:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-12 14:58:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-12 14:58:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 251 transitions. [2019-01-12 14:58:35,817 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 251 transitions. Word has length 408 [2019-01-12 14:58:35,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:35,818 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 251 transitions. [2019-01-12 14:58:35,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-12 14:58:35,818 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 251 transitions. [2019-01-12 14:58:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-12 14:58:35,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:35,823 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:35,823 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:35,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:35,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1688023301, now seen corresponding path program 58 times [2019-01-12 14:58:35,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:35,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:35,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:35,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11803 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2019-01-12 14:58:37,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:37,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:58:37,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:58:37,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:37,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11803 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 6728 trivial. 0 not checked. [2019-01-12 14:58:38,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:38,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-01-12 14:58:38,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-12 14:58:38,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-12 14:58:38,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2019-01-12 14:58:38,088 INFO L87 Difference]: Start difference. First operand 189 states and 251 transitions. Second operand 63 states. [2019-01-12 14:58:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:40,889 INFO L93 Difference]: Finished difference Result 196 states and 259 transitions. [2019-01-12 14:58:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-12 14:58:40,891 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 415 [2019-01-12 14:58:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:40,893 INFO L225 Difference]: With dead ends: 196 [2019-01-12 14:58:40,893 INFO L226 Difference]: Without dead ends: 192 [2019-01-12 14:58:40,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2019-01-12 14:58:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-12 14:58:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-01-12 14:58:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-12 14:58:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 255 transitions. [2019-01-12 14:58:40,938 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 255 transitions. Word has length 415 [2019-01-12 14:58:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:40,939 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 255 transitions. [2019-01-12 14:58:40,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-12 14:58:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 255 transitions. [2019-01-12 14:58:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-01-12 14:58:40,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:40,948 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:40,948 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1620105438, now seen corresponding path program 59 times [2019-01-12 14:58:40,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:40,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:40,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:40,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12213 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2019-01-12 14:58:42,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:42,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:42,558 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:58:42,876 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2019-01-12 14:58:42,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:42,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12213 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2019-01-12 14:58:43,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:43,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2019-01-12 14:58:43,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-12 14:58:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-12 14:58:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2019-01-12 14:58:43,033 INFO L87 Difference]: Start difference. First operand 192 states and 255 transitions. Second operand 64 states. [2019-01-12 14:58:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:45,799 INFO L93 Difference]: Finished difference Result 199 states and 263 transitions. [2019-01-12 14:58:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-12 14:58:45,801 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 422 [2019-01-12 14:58:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:45,803 INFO L225 Difference]: With dead ends: 199 [2019-01-12 14:58:45,803 INFO L226 Difference]: Without dead ends: 195 [2019-01-12 14:58:45,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2019-01-12 14:58:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-12 14:58:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-12 14:58:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-12 14:58:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2019-01-12 14:58:45,836 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 422 [2019-01-12 14:58:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:45,837 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2019-01-12 14:58:45,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-12 14:58:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2019-01-12 14:58:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-01-12 14:58:45,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:45,840 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:45,841 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1272238365, now seen corresponding path program 60 times [2019-01-12 14:58:45,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:45,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:45,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:45,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12630 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2019-01-12 14:58:47,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:47,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:47,440 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:58:47,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2019-01-12 14:58:47,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:47,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12630 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2019-01-12 14:58:48,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:48,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2019-01-12 14:58:48,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-12 14:58:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-12 14:58:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2019-01-12 14:58:48,005 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand 65 states. [2019-01-12 14:58:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:50,883 INFO L93 Difference]: Finished difference Result 202 states and 267 transitions. [2019-01-12 14:58:50,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-12 14:58:50,885 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 429 [2019-01-12 14:58:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:50,888 INFO L225 Difference]: With dead ends: 202 [2019-01-12 14:58:50,888 INFO L226 Difference]: Without dead ends: 198 [2019-01-12 14:58:50,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5861, Invalid=9889, Unknown=0, NotChecked=0, Total=15750 [2019-01-12 14:58:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-12 14:58:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-01-12 14:58:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-12 14:58:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. [2019-01-12 14:58:50,920 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 429 [2019-01-12 14:58:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:50,921 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. [2019-01-12 14:58:50,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-12 14:58:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2019-01-12 14:58:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-01-12 14:58:50,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:50,924 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:50,924 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1382005888, now seen corresponding path program 61 times [2019-01-12 14:58:50,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:50,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:50,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:50,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13054 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2019-01-12 14:58:52,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:52,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:52,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13054 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2019-01-12 14:58:52,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:52,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2019-01-12 14:58:52,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-12 14:58:52,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-12 14:58:52,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2020, Invalid=2270, Unknown=0, NotChecked=0, Total=4290 [2019-01-12 14:58:52,907 INFO L87 Difference]: Start difference. First operand 198 states and 263 transitions. Second operand 66 states. [2019-01-12 14:58:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:55,773 INFO L93 Difference]: Finished difference Result 205 states and 271 transitions. [2019-01-12 14:58:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-12 14:58:55,776 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 436 [2019-01-12 14:58:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:55,777 INFO L225 Difference]: With dead ends: 205 [2019-01-12 14:58:55,777 INFO L226 Difference]: Without dead ends: 201 [2019-01-12 14:58:55,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6050, Invalid=10206, Unknown=0, NotChecked=0, Total=16256 [2019-01-12 14:58:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-12 14:58:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-12 14:58:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-12 14:58:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 267 transitions. [2019-01-12 14:58:55,811 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 267 transitions. Word has length 436 [2019-01-12 14:58:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:55,812 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 267 transitions. [2019-01-12 14:58:55,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-12 14:58:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 267 transitions. [2019-01-12 14:58:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-01-12 14:58:55,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:55,816 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:55,817 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2055762369, now seen corresponding path program 62 times [2019-01-12 14:58:55,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:55,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:55,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:55,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 13485 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2019-01-12 14:58:57,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:57,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:57,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:57,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:57,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13485 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2019-01-12 14:58:57,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:57,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2019-01-12 14:58:57,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-12 14:58:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-12 14:58:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2084, Invalid=2338, Unknown=0, NotChecked=0, Total=4422 [2019-01-12 14:58:57,810 INFO L87 Difference]: Start difference. First operand 201 states and 267 transitions. Second operand 67 states. [2019-01-12 14:59:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:00,675 INFO L93 Difference]: Finished difference Result 208 states and 275 transitions. [2019-01-12 14:59:00,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-12 14:59:00,677 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 443 [2019-01-12 14:59:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:00,679 INFO L225 Difference]: With dead ends: 208 [2019-01-12 14:59:00,679 INFO L226 Difference]: Without dead ends: 204 [2019-01-12 14:59:00,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6242, Invalid=10528, Unknown=0, NotChecked=0, Total=16770 [2019-01-12 14:59:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-12 14:59:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-01-12 14:59:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-12 14:59:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 271 transitions. [2019-01-12 14:59:00,713 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 271 transitions. Word has length 443 [2019-01-12 14:59:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:00,714 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 271 transitions. [2019-01-12 14:59:00,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-12 14:59:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 271 transitions. [2019-01-12 14:59:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-01-12 14:59:00,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:00,717 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:00,718 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1885779166, now seen corresponding path program 63 times [2019-01-12 14:59:00,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:00,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:00,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:00,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:00,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13923 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2019-01-12 14:59:02,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:02,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:02,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:02,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2019-01-12 14:59:02,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:02,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13923 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2019-01-12 14:59:03,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:03,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2019-01-12 14:59:03,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-12 14:59:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-12 14:59:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2149, Invalid=2407, Unknown=0, NotChecked=0, Total=4556 [2019-01-12 14:59:03,072 INFO L87 Difference]: Start difference. First operand 204 states and 271 transitions. Second operand 68 states. [2019-01-12 14:59:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:06,111 INFO L93 Difference]: Finished difference Result 211 states and 279 transitions. [2019-01-12 14:59:06,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-12 14:59:06,113 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 450 [2019-01-12 14:59:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:06,115 INFO L225 Difference]: With dead ends: 211 [2019-01-12 14:59:06,115 INFO L226 Difference]: Without dead ends: 207 [2019-01-12 14:59:06,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6437, Invalid=10855, Unknown=0, NotChecked=0, Total=17292 [2019-01-12 14:59:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-12 14:59:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-12 14:59:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-12 14:59:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 275 transitions. [2019-01-12 14:59:06,150 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 275 transitions. Word has length 450 [2019-01-12 14:59:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:06,151 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 275 transitions. [2019-01-12 14:59:06,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-12 14:59:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 275 transitions. [2019-01-12 14:59:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-01-12 14:59:06,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:06,155 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:06,155 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:06,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1056368225, now seen corresponding path program 64 times [2019-01-12 14:59:06,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:06,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:06,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 14368 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2019-01-12 14:59:07,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:07,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:07,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:08,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:08,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:08,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14368 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2019-01-12 14:59:08,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:08,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2019-01-12 14:59:08,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-12 14:59:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-12 14:59:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2215, Invalid=2477, Unknown=0, NotChecked=0, Total=4692 [2019-01-12 14:59:08,288 INFO L87 Difference]: Start difference. First operand 207 states and 275 transitions. Second operand 69 states. [2019-01-12 14:59:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:11,916 INFO L93 Difference]: Finished difference Result 214 states and 283 transitions. [2019-01-12 14:59:11,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-12 14:59:11,918 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 457 [2019-01-12 14:59:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:11,919 INFO L225 Difference]: With dead ends: 214 [2019-01-12 14:59:11,920 INFO L226 Difference]: Without dead ends: 210 [2019-01-12 14:59:11,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6635, Invalid=11187, Unknown=0, NotChecked=0, Total=17822 [2019-01-12 14:59:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-12 14:59:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2019-01-12 14:59:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-12 14:59:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 279 transitions. [2019-01-12 14:59:11,960 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 279 transitions. Word has length 457 [2019-01-12 14:59:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:11,961 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 279 transitions. [2019-01-12 14:59:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-12 14:59:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 279 transitions. [2019-01-12 14:59:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-01-12 14:59:11,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:11,966 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:11,966 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:11,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:11,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1969658684, now seen corresponding path program 65 times [2019-01-12 14:59:11,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:11,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:11,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:11,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14820 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2019-01-12 14:59:13,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:13,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:13,796 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:14,153 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2019-01-12 14:59:14,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:14,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14820 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2019-01-12 14:59:14,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:14,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2019-01-12 14:59:14,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-12 14:59:14,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-12 14:59:14,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2282, Invalid=2548, Unknown=0, NotChecked=0, Total=4830 [2019-01-12 14:59:14,339 INFO L87 Difference]: Start difference. First operand 210 states and 279 transitions. Second operand 70 states. [2019-01-12 14:59:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:17,543 INFO L93 Difference]: Finished difference Result 217 states and 287 transitions. [2019-01-12 14:59:17,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-12 14:59:17,545 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 464 [2019-01-12 14:59:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:17,546 INFO L225 Difference]: With dead ends: 217 [2019-01-12 14:59:17,547 INFO L226 Difference]: Without dead ends: 213 [2019-01-12 14:59:17,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6836, Invalid=11524, Unknown=0, NotChecked=0, Total=18360 [2019-01-12 14:59:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-12 14:59:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-12 14:59:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-12 14:59:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 283 transitions. [2019-01-12 14:59:17,597 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 283 transitions. Word has length 464 [2019-01-12 14:59:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:17,597 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 283 transitions. [2019-01-12 14:59:17,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-12 14:59:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 283 transitions. [2019-01-12 14:59:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-01-12 14:59:17,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:17,601 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:17,601 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:17,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -618576259, now seen corresponding path program 66 times [2019-01-12 14:59:17,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:17,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:17,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:17,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15279 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2019-01-12 14:59:19,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:19,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:19,425 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:19,732 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2019-01-12 14:59:19,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:19,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15279 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2019-01-12 14:59:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:19,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2019-01-12 14:59:19,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-12 14:59:19,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-12 14:59:19,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2350, Invalid=2620, Unknown=0, NotChecked=0, Total=4970 [2019-01-12 14:59:19,898 INFO L87 Difference]: Start difference. First operand 213 states and 283 transitions. Second operand 71 states. [2019-01-12 14:59:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:23,082 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2019-01-12 14:59:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-12 14:59:23,084 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 471 [2019-01-12 14:59:23,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:23,085 INFO L225 Difference]: With dead ends: 220 [2019-01-12 14:59:23,085 INFO L226 Difference]: Without dead ends: 216 [2019-01-12 14:59:23,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7040, Invalid=11866, Unknown=0, NotChecked=0, Total=18906 [2019-01-12 14:59:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-12 14:59:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-01-12 14:59:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-12 14:59:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 287 transitions. [2019-01-12 14:59:23,126 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 287 transitions. Word has length 471 [2019-01-12 14:59:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:23,126 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 287 transitions. [2019-01-12 14:59:23,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-12 14:59:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 287 transitions. [2019-01-12 14:59:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-01-12 14:59:23,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:23,133 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:23,133 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 144435558, now seen corresponding path program 67 times [2019-01-12 14:59:23,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:23,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:23,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:23,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:23,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15745 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2019-01-12 14:59:25,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:25,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:25,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:25,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15745 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2019-01-12 14:59:25,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:25,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2019-01-12 14:59:25,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-12 14:59:25,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-12 14:59:25,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=2693, Unknown=0, NotChecked=0, Total=5112 [2019-01-12 14:59:25,360 INFO L87 Difference]: Start difference. First operand 216 states and 287 transitions. Second operand 72 states. [2019-01-12 14:59:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:28,432 INFO L93 Difference]: Finished difference Result 223 states and 295 transitions. [2019-01-12 14:59:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-12 14:59:28,434 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 478 [2019-01-12 14:59:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:28,436 INFO L225 Difference]: With dead ends: 223 [2019-01-12 14:59:28,436 INFO L226 Difference]: Without dead ends: 219 [2019-01-12 14:59:28,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=7247, Invalid=12213, Unknown=0, NotChecked=0, Total=19460 [2019-01-12 14:59:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-12 14:59:28,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-01-12 14:59:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-12 14:59:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 291 transitions. [2019-01-12 14:59:28,479 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 291 transitions. Word has length 478 [2019-01-12 14:59:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:28,480 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 291 transitions. [2019-01-12 14:59:28,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-12 14:59:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2019-01-12 14:59:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2019-01-12 14:59:28,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:28,484 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:28,484 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash -328918949, now seen corresponding path program 68 times [2019-01-12 14:59:28,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:28,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:28,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16218 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2019-01-12 14:59:30,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:30,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:30,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:30,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:30,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16218 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2019-01-12 14:59:30,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:30,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2019-01-12 14:59:30,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-12 14:59:30,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-12 14:59:30,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2489, Invalid=2767, Unknown=0, NotChecked=0, Total=5256 [2019-01-12 14:59:30,801 INFO L87 Difference]: Start difference. First operand 219 states and 291 transitions. Second operand 73 states. [2019-01-12 14:59:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:33,985 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2019-01-12 14:59:33,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-12 14:59:33,986 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 485 [2019-01-12 14:59:33,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:33,988 INFO L225 Difference]: With dead ends: 226 [2019-01-12 14:59:33,988 INFO L226 Difference]: Without dead ends: 222 [2019-01-12 14:59:33,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2414 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7457, Invalid=12565, Unknown=0, NotChecked=0, Total=20022 [2019-01-12 14:59:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-12 14:59:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2019-01-12 14:59:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-12 14:59:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 295 transitions. [2019-01-12 14:59:34,047 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 295 transitions. Word has length 485 [2019-01-12 14:59:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:34,050 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 295 transitions. [2019-01-12 14:59:34,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-12 14:59:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 295 transitions. [2019-01-12 14:59:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-01-12 14:59:34,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:34,057 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:34,058 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash 465352968, now seen corresponding path program 69 times [2019-01-12 14:59:34,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:34,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:34,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:34,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:34,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:36,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16698 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2019-01-12 14:59:36,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:36,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:36,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:36,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2019-01-12 14:59:36,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:36,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16698 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 9522 trivial. 0 not checked. [2019-01-12 14:59:36,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:36,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2019-01-12 14:59:36,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-12 14:59:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-12 14:59:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2560, Invalid=2842, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 14:59:36,973 INFO L87 Difference]: Start difference. First operand 222 states and 295 transitions. Second operand 74 states. [2019-01-12 14:59:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:40,181 INFO L93 Difference]: Finished difference Result 229 states and 303 transitions. [2019-01-12 14:59:40,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-12 14:59:40,183 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 492 [2019-01-12 14:59:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:40,185 INFO L225 Difference]: With dead ends: 229 [2019-01-12 14:59:40,185 INFO L226 Difference]: Without dead ends: 225 [2019-01-12 14:59:40,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7670, Invalid=12922, Unknown=0, NotChecked=0, Total=20592 [2019-01-12 14:59:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-12 14:59:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-01-12 14:59:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-12 14:59:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 299 transitions. [2019-01-12 14:59:40,230 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 299 transitions. Word has length 492 [2019-01-12 14:59:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:40,230 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 299 transitions. [2019-01-12 14:59:40,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-12 14:59:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 299 transitions. [2019-01-12 14:59:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-01-12 14:59:40,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:40,235 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:40,235 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:40,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1854451513, now seen corresponding path program 70 times [2019-01-12 14:59:40,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:40,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:40,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:40,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:40,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17185 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2019-01-12 14:59:42,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:42,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:42,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:42,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:42,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:42,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17185 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2019-01-12 14:59:43,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:43,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2019-01-12 14:59:43,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-12 14:59:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-12 14:59:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2632, Invalid=2918, Unknown=0, NotChecked=0, Total=5550 [2019-01-12 14:59:43,051 INFO L87 Difference]: Start difference. First operand 225 states and 299 transitions. Second operand 75 states. [2019-01-12 14:59:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:46,670 INFO L93 Difference]: Finished difference Result 232 states and 307 transitions. [2019-01-12 14:59:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-12 14:59:46,672 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 499 [2019-01-12 14:59:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:46,674 INFO L225 Difference]: With dead ends: 232 [2019-01-12 14:59:46,674 INFO L226 Difference]: Without dead ends: 228 [2019-01-12 14:59:46,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7886, Invalid=13284, Unknown=0, NotChecked=0, Total=21170 [2019-01-12 14:59:46,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-01-12 14:59:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-01-12 14:59:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-01-12 14:59:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 303 transitions. [2019-01-12 14:59:46,722 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 303 transitions. Word has length 499 [2019-01-12 14:59:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:46,725 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 303 transitions. [2019-01-12 14:59:46,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-12 14:59:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 303 transitions. [2019-01-12 14:59:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-01-12 14:59:46,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:46,732 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:46,732 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash 485995434, now seen corresponding path program 71 times [2019-01-12 14:59:46,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:46,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17679 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2019-01-12 14:59:48,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:48,941 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:49,344 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2019-01-12 14:59:49,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:49,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17679 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2019-01-12 14:59:49,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:49,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2019-01-12 14:59:49,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-12 14:59:49,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-12 14:59:49,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=2995, Unknown=0, NotChecked=0, Total=5700 [2019-01-12 14:59:49,547 INFO L87 Difference]: Start difference. First operand 228 states and 303 transitions. Second operand 76 states. [2019-01-12 14:59:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:53,102 INFO L93 Difference]: Finished difference Result 235 states and 311 transitions. [2019-01-12 14:59:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-12 14:59:53,104 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 506 [2019-01-12 14:59:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:53,107 INFO L225 Difference]: With dead ends: 235 [2019-01-12 14:59:53,107 INFO L226 Difference]: Without dead ends: 231 [2019-01-12 14:59:53,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=8105, Invalid=13651, Unknown=0, NotChecked=0, Total=21756 [2019-01-12 14:59:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-12 14:59:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-01-12 14:59:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-12 14:59:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 307 transitions. [2019-01-12 14:59:53,178 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 307 transitions. Word has length 506 [2019-01-12 14:59:53,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:53,178 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 307 transitions. [2019-01-12 14:59:53,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-12 14:59:53,179 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 307 transitions. [2019-01-12 14:59:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-01-12 14:59:53,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:53,188 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:53,189 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1218434281, now seen corresponding path program 72 times [2019-01-12 14:59:53,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:53,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18180 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2019-01-12 14:59:55,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:55,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:55,363 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:55,800 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2019-01-12 14:59:55,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:55,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18180 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2019-01-12 14:59:55,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:55,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2019-01-12 14:59:55,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-12 14:59:55,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-12 14:59:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2779, Invalid=3073, Unknown=0, NotChecked=0, Total=5852 [2019-01-12 14:59:55,993 INFO L87 Difference]: Start difference. First operand 231 states and 307 transitions. Second operand 77 states. [2019-01-12 14:59:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:59,528 INFO L93 Difference]: Finished difference Result 238 states and 315 transitions. [2019-01-12 14:59:59,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-12 14:59:59,530 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 513 [2019-01-12 14:59:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:59,532 INFO L225 Difference]: With dead ends: 238 [2019-01-12 14:59:59,532 INFO L226 Difference]: Without dead ends: 234 [2019-01-12 14:59:59,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=8327, Invalid=14023, Unknown=0, NotChecked=0, Total=22350 [2019-01-12 14:59:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-12 14:59:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-01-12 14:59:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-12 14:59:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 311 transitions. [2019-01-12 14:59:59,584 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 311 transitions. Word has length 513 [2019-01-12 14:59:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:59,585 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 311 transitions. [2019-01-12 14:59:59,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-12 14:59:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 311 transitions. [2019-01-12 14:59:59,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2019-01-12 14:59:59,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:59,589 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:59,589 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1507280564, now seen corresponding path program 73 times [2019-01-12 14:59:59,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:59,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:59,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:59,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:59,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18688 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2019-01-12 15:00:02,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:02,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:02,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:00:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:02,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 18688 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2019-01-12 15:00:02,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:02,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2019-01-12 15:00:02,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-12 15:00:02,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-12 15:00:02,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2854, Invalid=3152, Unknown=0, NotChecked=0, Total=6006 [2019-01-12 15:00:02,476 INFO L87 Difference]: Start difference. First operand 234 states and 311 transitions. Second operand 78 states. [2019-01-12 15:00:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:05,981 INFO L93 Difference]: Finished difference Result 241 states and 319 transitions. [2019-01-12 15:00:05,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-12 15:00:05,984 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 520 [2019-01-12 15:00:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:05,986 INFO L225 Difference]: With dead ends: 241 [2019-01-12 15:00:05,986 INFO L226 Difference]: Without dead ends: 237 [2019-01-12 15:00:05,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8552, Invalid=14400, Unknown=0, NotChecked=0, Total=22952 [2019-01-12 15:00:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-12 15:00:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2019-01-12 15:00:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-12 15:00:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 315 transitions. [2019-01-12 15:00:06,039 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 315 transitions. Word has length 520 [2019-01-12 15:00:06,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:06,039 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 315 transitions. [2019-01-12 15:00:06,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-12 15:00:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 315 transitions. [2019-01-12 15:00:06,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-01-12 15:00:06,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:06,044 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:06,044 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:06,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2128587765, now seen corresponding path program 74 times [2019-01-12 15:00:06,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:06,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:06,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:00:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 19203 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2019-01-12 15:00:08,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:08,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:08,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:00:08,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:00:08,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:00:08,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19203 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 10952 trivial. 0 not checked. [2019-01-12 15:00:09,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:09,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2019-01-12 15:00:09,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-12 15:00:09,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-12 15:00:09,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2930, Invalid=3232, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 15:00:09,033 INFO L87 Difference]: Start difference. First operand 237 states and 315 transitions. Second operand 79 states. [2019-01-12 15:00:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:13,029 INFO L93 Difference]: Finished difference Result 244 states and 323 transitions. [2019-01-12 15:00:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-12 15:00:13,031 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 527 [2019-01-12 15:00:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:13,032 INFO L225 Difference]: With dead ends: 244 [2019-01-12 15:00:13,033 INFO L226 Difference]: Without dead ends: 240 [2019-01-12 15:00:13,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8780, Invalid=14782, Unknown=0, NotChecked=0, Total=23562 [2019-01-12 15:00:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-12 15:00:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-01-12 15:00:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-12 15:00:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 319 transitions. [2019-01-12 15:00:13,086 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 319 transitions. Word has length 527 [2019-01-12 15:00:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:13,086 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 319 transitions. [2019-01-12 15:00:13,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-12 15:00:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 319 transitions. [2019-01-12 15:00:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2019-01-12 15:00:13,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:13,090 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:13,091 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1945392658, now seen corresponding path program 75 times [2019-01-12 15:00:13,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:13,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:13,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:00:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 19725 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2019-01-12 15:00:15,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:15,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:00:15,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2019-01-12 15:00:15,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:00:15,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19725 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 11250 trivial. 0 not checked. [2019-01-12 15:00:16,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:16,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2019-01-12 15:00:16,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-12 15:00:16,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-12 15:00:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3007, Invalid=3313, Unknown=0, NotChecked=0, Total=6320 [2019-01-12 15:00:16,156 INFO L87 Difference]: Start difference. First operand 240 states and 319 transitions. Second operand 80 states. [2019-01-12 15:00:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:19,982 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2019-01-12 15:00:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-12 15:00:19,984 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 534 [2019-01-12 15:00:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:19,986 INFO L225 Difference]: With dead ends: 247 [2019-01-12 15:00:19,986 INFO L226 Difference]: Without dead ends: 243 [2019-01-12 15:00:19,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9011, Invalid=15169, Unknown=0, NotChecked=0, Total=24180 [2019-01-12 15:00:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-12 15:00:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-01-12 15:00:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-12 15:00:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 323 transitions. [2019-01-12 15:00:20,040 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 323 transitions. Word has length 534 [2019-01-12 15:00:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:20,040 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 323 transitions. [2019-01-12 15:00:20,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-12 15:00:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 323 transitions. [2019-01-12 15:00:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-01-12 15:00:20,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:20,045 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:20,045 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1696289235, now seen corresponding path program 76 times [2019-01-12 15:00:20,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:20,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:20,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:00:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20254 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2019-01-12 15:00:22,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:22,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:22,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:00:22,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:00:22,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:00:22,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20254 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 11552 trivial. 0 not checked. [2019-01-12 15:00:22,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:22,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2019-01-12 15:00:22,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-12 15:00:22,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-12 15:00:22,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3085, Invalid=3395, Unknown=0, NotChecked=0, Total=6480 [2019-01-12 15:00:22,936 INFO L87 Difference]: Start difference. First operand 243 states and 323 transitions. Second operand 81 states. [2019-01-12 15:00:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:26,909 INFO L93 Difference]: Finished difference Result 250 states and 331 transitions. [2019-01-12 15:00:26,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-12 15:00:26,911 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 541 [2019-01-12 15:00:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:26,914 INFO L225 Difference]: With dead ends: 250 [2019-01-12 15:00:26,914 INFO L226 Difference]: Without dead ends: 246 [2019-01-12 15:00:26,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9245, Invalid=15561, Unknown=0, NotChecked=0, Total=24806 [2019-01-12 15:00:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-12 15:00:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2019-01-12 15:00:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-12 15:00:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 327 transitions. [2019-01-12 15:00:26,969 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 327 transitions. Word has length 541 [2019-01-12 15:00:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:26,969 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 327 transitions. [2019-01-12 15:00:26,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-12 15:00:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2019-01-12 15:00:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-01-12 15:00:26,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:26,974 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:26,974 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:26,975 INFO L82 PathProgramCache]: Analyzing trace with hash -667130480, now seen corresponding path program 77 times [2019-01-12 15:00:26,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:26,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:26,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:00:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 20790 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2019-01-12 15:00:29,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:29,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:29,405 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:00:29,873 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-01-12 15:00:29,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:00:29,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20790 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 11858 trivial. 0 not checked. [2019-01-12 15:00:30,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:30,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2019-01-12 15:00:30,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-12 15:00:30,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-12 15:00:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3164, Invalid=3478, Unknown=0, NotChecked=0, Total=6642 [2019-01-12 15:00:30,269 INFO L87 Difference]: Start difference. First operand 246 states and 327 transitions. Second operand 82 states. [2019-01-12 15:00:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:34,515 INFO L93 Difference]: Finished difference Result 253 states and 335 transitions. [2019-01-12 15:00:34,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-12 15:00:34,517 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 548 [2019-01-12 15:00:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:34,519 INFO L225 Difference]: With dead ends: 253 [2019-01-12 15:00:34,519 INFO L226 Difference]: Without dead ends: 249 [2019-01-12 15:00:34,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9482, Invalid=15958, Unknown=0, NotChecked=0, Total=25440 [2019-01-12 15:00:34,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-12 15:00:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-01-12 15:00:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-12 15:00:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 331 transitions. [2019-01-12 15:00:34,577 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 331 transitions. Word has length 548 [2019-01-12 15:00:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:34,578 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 331 transitions. [2019-01-12 15:00:34,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-12 15:00:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 331 transitions. [2019-01-12 15:00:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-01-12 15:00:34,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:34,583 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:34,583 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2017934513, now seen corresponding path program 78 times [2019-01-12 15:00:34,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:34,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:34,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:34,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:00:34,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 21333 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2019-01-12 15:00:37,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:37,220 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:37,231 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:00:37,614 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2019-01-12 15:00:37,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:00:37,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 21333 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2019-01-12 15:00:37,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:37,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2019-01-12 15:00:37,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-12 15:00:37,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-12 15:00:37,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3244, Invalid=3562, Unknown=0, NotChecked=0, Total=6806 [2019-01-12 15:00:37,842 INFO L87 Difference]: Start difference. First operand 249 states and 331 transitions. Second operand 83 states. [2019-01-12 15:00:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:41,880 INFO L93 Difference]: Finished difference Result 256 states and 339 transitions. [2019-01-12 15:00:41,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-12 15:00:41,882 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 555 [2019-01-12 15:00:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:41,885 INFO L225 Difference]: With dead ends: 256 [2019-01-12 15:00:41,885 INFO L226 Difference]: Without dead ends: 252 [2019-01-12 15:00:41,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 634 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3159 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9722, Invalid=16360, Unknown=0, NotChecked=0, Total=26082 [2019-01-12 15:00:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-12 15:00:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2019-01-12 15:00:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-12 15:00:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 335 transitions. [2019-01-12 15:00:41,957 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 335 transitions. Word has length 555 [2019-01-12 15:00:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:41,957 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 335 transitions. [2019-01-12 15:00:41,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-12 15:00:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 335 transitions. [2019-01-12 15:00:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-01-12 15:00:41,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:41,962 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:41,962 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1019818958, now seen corresponding path program 79 times [2019-01-12 15:00:41,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:41,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:41,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:41,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:00:41,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21883 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2019-01-12 15:00:44,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:44,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:44,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:00:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:44,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 21883 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2019-01-12 15:00:45,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:45,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2019-01-12 15:00:45,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-12 15:00:45,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-12 15:00:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3325, Invalid=3647, Unknown=0, NotChecked=0, Total=6972 [2019-01-12 15:00:45,123 INFO L87 Difference]: Start difference. First operand 252 states and 335 transitions. Second operand 84 states. [2019-01-12 15:00:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:49,577 INFO L93 Difference]: Finished difference Result 259 states and 343 transitions. [2019-01-12 15:00:49,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-12 15:00:49,580 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 562 [2019-01-12 15:00:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:49,583 INFO L225 Difference]: With dead ends: 259 [2019-01-12 15:00:49,583 INFO L226 Difference]: Without dead ends: 255 [2019-01-12 15:00:49,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9965, Invalid=16767, Unknown=0, NotChecked=0, Total=26732 [2019-01-12 15:00:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-12 15:00:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-01-12 15:00:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-12 15:00:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 339 transitions. [2019-01-12 15:00:49,643 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 339 transitions. Word has length 562 [2019-01-12 15:00:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:49,644 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 339 transitions. [2019-01-12 15:00:49,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-12 15:00:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 339 transitions. [2019-01-12 15:00:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-01-12 15:00:49,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:49,648 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:49,648 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:49,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1162376049, now seen corresponding path program 80 times [2019-01-12 15:00:49,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:49,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:49,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:49,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:00:49,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 22440 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2019-01-12 15:00:52,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:52,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:52,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:00:52,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:00:52,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:00:52,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:00:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 22440 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2019-01-12 15:00:52,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:00:52,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2019-01-12 15:00:52,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-12 15:00:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-12 15:00:52,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3407, Invalid=3733, Unknown=0, NotChecked=0, Total=7140 [2019-01-12 15:00:52,693 INFO L87 Difference]: Start difference. First operand 255 states and 339 transitions. Second operand 85 states. [2019-01-12 15:00:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:00:56,930 INFO L93 Difference]: Finished difference Result 262 states and 347 transitions. [2019-01-12 15:00:56,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-12 15:00:56,932 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 569 [2019-01-12 15:00:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:00:56,934 INFO L225 Difference]: With dead ends: 262 [2019-01-12 15:00:56,934 INFO L226 Difference]: Without dead ends: 258 [2019-01-12 15:00:56,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3320 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10211, Invalid=17179, Unknown=0, NotChecked=0, Total=27390 [2019-01-12 15:00:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-12 15:00:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-01-12 15:00:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-12 15:00:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 343 transitions. [2019-01-12 15:00:56,995 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 343 transitions. Word has length 569 [2019-01-12 15:00:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:00:56,996 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 343 transitions. [2019-01-12 15:00:56,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-12 15:00:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 343 transitions. [2019-01-12 15:00:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-01-12 15:00:57,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:00:57,001 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:00:57,001 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:00:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:00:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1370047020, now seen corresponding path program 81 times [2019-01-12 15:00:57,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:00:57,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:00:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:57,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:00:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:00:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:00:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23004 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2019-01-12 15:00:59,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:00:59,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:00:59,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:01:00,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2019-01-12 15:01:00,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:01:00,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:01:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 23004 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2019-01-12 15:01:00,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:01:00,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2019-01-12 15:01:00,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-12 15:01:00,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-12 15:01:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3490, Invalid=3820, Unknown=0, NotChecked=0, Total=7310 [2019-01-12 15:01:00,586 INFO L87 Difference]: Start difference. First operand 258 states and 343 transitions. Second operand 86 states. [2019-01-12 15:01:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:01:05,269 INFO L93 Difference]: Finished difference Result 265 states and 351 transitions. [2019-01-12 15:01:05,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-12 15:01:05,271 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 576 [2019-01-12 15:01:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:01:05,273 INFO L225 Difference]: With dead ends: 265 [2019-01-12 15:01:05,273 INFO L226 Difference]: Without dead ends: 261 [2019-01-12 15:01:05,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10460, Invalid=17596, Unknown=0, NotChecked=0, Total=28056 [2019-01-12 15:01:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-01-12 15:01:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-01-12 15:01:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-12 15:01:05,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 347 transitions. [2019-01-12 15:01:05,339 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 347 transitions. Word has length 576 [2019-01-12 15:01:05,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:01:05,342 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 347 transitions. [2019-01-12 15:01:05,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-12 15:01:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 347 transitions. [2019-01-12 15:01:05,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2019-01-12 15:01:05,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:01:05,346 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:01:05,347 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:01:05,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:01:05,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1461690003, now seen corresponding path program 82 times [2019-01-12 15:01:05,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:01:05,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:01:05,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:05,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:01:05,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:01:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 23575 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2019-01-12 15:01:08,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:01:08,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:01:08,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:01:08,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:01:08,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:01:08,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:01:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 23575 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 13448 trivial. 0 not checked. [2019-01-12 15:01:08,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:01:08,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2019-01-12 15:01:08,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-12 15:01:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-12 15:01:08,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3574, Invalid=3908, Unknown=0, NotChecked=0, Total=7482 [2019-01-12 15:01:08,793 INFO L87 Difference]: Start difference. First operand 261 states and 347 transitions. Second operand 87 states. [2019-01-12 15:01:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:01:13,497 INFO L93 Difference]: Finished difference Result 268 states and 355 transitions. [2019-01-12 15:01:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-12 15:01:13,499 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 583 [2019-01-12 15:01:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:01:13,501 INFO L225 Difference]: With dead ends: 268 [2019-01-12 15:01:13,501 INFO L226 Difference]: Without dead ends: 264 [2019-01-12 15:01:13,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10712, Invalid=18018, Unknown=0, NotChecked=0, Total=28730 [2019-01-12 15:01:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-12 15:01:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-01-12 15:01:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-12 15:01:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2019-01-12 15:01:13,568 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 583 [2019-01-12 15:01:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:01:13,568 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2019-01-12 15:01:13,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-12 15:01:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2019-01-12 15:01:13,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-01-12 15:01:13,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:01:13,573 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:01:13,574 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:01:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:01:13,574 INFO L82 PathProgramCache]: Analyzing trace with hash 500701814, now seen corresponding path program 83 times [2019-01-12 15:01:13,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:01:13,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:01:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:13,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:01:13,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:01:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 24153 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2019-01-12 15:01:16,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:01:16,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:01:16,368 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:01:16,907 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2019-01-12 15:01:16,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:01:16,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:01:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24153 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2019-01-12 15:01:17,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:01:17,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2019-01-12 15:01:17,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-12 15:01:17,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-12 15:01:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=3997, Unknown=0, NotChecked=0, Total=7656 [2019-01-12 15:01:17,186 INFO L87 Difference]: Start difference. First operand 264 states and 351 transitions. Second operand 88 states. [2019-01-12 15:01:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:01:22,214 INFO L93 Difference]: Finished difference Result 271 states and 359 transitions. [2019-01-12 15:01:22,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-12 15:01:22,216 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 590 [2019-01-12 15:01:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:01:22,218 INFO L225 Difference]: With dead ends: 271 [2019-01-12 15:01:22,218 INFO L226 Difference]: Without dead ends: 267 [2019-01-12 15:01:22,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10967, Invalid=18445, Unknown=0, NotChecked=0, Total=29412 [2019-01-12 15:01:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-01-12 15:01:22,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-01-12 15:01:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-12 15:01:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 355 transitions. [2019-01-12 15:01:22,291 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 355 transitions. Word has length 590 [2019-01-12 15:01:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:01:22,292 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 355 transitions. [2019-01-12 15:01:22,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-12 15:01:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 355 transitions. [2019-01-12 15:01:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-01-12 15:01:22,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:01:22,297 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:01:22,297 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:01:22,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:01:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1084892341, now seen corresponding path program 84 times [2019-01-12 15:01:22,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:01:22,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:01:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:22,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:01:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:01:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24738 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2019-01-12 15:01:25,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:01:25,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:01:25,528 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:01:25,955 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2019-01-12 15:01:25,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:01:25,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:01:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 24738 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2019-01-12 15:01:26,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:01:26,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2019-01-12 15:01:26,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-12 15:01:26,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-12 15:01:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3745, Invalid=4087, Unknown=0, NotChecked=0, Total=7832 [2019-01-12 15:01:26,191 INFO L87 Difference]: Start difference. First operand 267 states and 355 transitions. Second operand 89 states. [2019-01-12 15:01:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:01:31,064 INFO L93 Difference]: Finished difference Result 274 states and 363 transitions. [2019-01-12 15:01:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-12 15:01:31,065 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 597 [2019-01-12 15:01:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:01:31,067 INFO L225 Difference]: With dead ends: 274 [2019-01-12 15:01:31,067 INFO L226 Difference]: Without dead ends: 270 [2019-01-12 15:01:31,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3654 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11225, Invalid=18877, Unknown=0, NotChecked=0, Total=30102 [2019-01-12 15:01:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-12 15:01:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-01-12 15:01:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-01-12 15:01:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 359 transitions. [2019-01-12 15:01:31,138 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 359 transitions. Word has length 597 [2019-01-12 15:01:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:01:31,140 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 359 transitions. [2019-01-12 15:01:31,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-12 15:01:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 359 transitions. [2019-01-12 15:01:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-01-12 15:01:31,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:01:31,147 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:01:31,147 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:01:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:01:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1294548456, now seen corresponding path program 85 times [2019-01-12 15:01:31,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:01:31,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:01:31,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:31,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:01:31,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:01:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 25330 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2019-01-12 15:01:34,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:01:34,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:01:34,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:01:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:01:34,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:01:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 25330 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2019-01-12 15:01:34,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:01:34,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2019-01-12 15:01:34,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-12 15:01:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-12 15:01:34,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3832, Invalid=4178, Unknown=0, NotChecked=0, Total=8010 [2019-01-12 15:01:34,845 INFO L87 Difference]: Start difference. First operand 270 states and 359 transitions. Second operand 90 states. [2019-01-12 15:01:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:01:39,834 INFO L93 Difference]: Finished difference Result 277 states and 367 transitions. [2019-01-12 15:01:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-12 15:01:39,836 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 604 [2019-01-12 15:01:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:01:39,838 INFO L225 Difference]: With dead ends: 277 [2019-01-12 15:01:39,838 INFO L226 Difference]: Without dead ends: 273 [2019-01-12 15:01:39,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11486, Invalid=19314, Unknown=0, NotChecked=0, Total=30800 [2019-01-12 15:01:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-12 15:01:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2019-01-12 15:01:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-12 15:01:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2019-01-12 15:01:39,913 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 604 [2019-01-12 15:01:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:01:39,914 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2019-01-12 15:01:39,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-12 15:01:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2019-01-12 15:01:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2019-01-12 15:01:39,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:01:39,919 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:01:39,919 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:01:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:01:39,920 INFO L82 PathProgramCache]: Analyzing trace with hash 13376041, now seen corresponding path program 86 times [2019-01-12 15:01:39,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:01:39,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:01:39,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:39,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:01:39,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:01:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25929 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2019-01-12 15:01:42,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:01:42,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:01:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:01:43,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:01:43,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:01:43,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:01:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 25929 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2019-01-12 15:01:43,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:01:43,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2019-01-12 15:01:43,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-12 15:01:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-12 15:01:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3920, Invalid=4270, Unknown=0, NotChecked=0, Total=8190 [2019-01-12 15:01:43,412 INFO L87 Difference]: Start difference. First operand 273 states and 363 transitions. Second operand 91 states. [2019-01-12 15:01:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:01:48,555 INFO L93 Difference]: Finished difference Result 280 states and 371 transitions. [2019-01-12 15:01:48,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-12 15:01:48,557 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 611 [2019-01-12 15:01:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:01:48,559 INFO L225 Difference]: With dead ends: 280 [2019-01-12 15:01:48,559 INFO L226 Difference]: Without dead ends: 276 [2019-01-12 15:01:48,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3827 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=11750, Invalid=19756, Unknown=0, NotChecked=0, Total=31506 [2019-01-12 15:01:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-12 15:01:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2019-01-12 15:01:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-12 15:01:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 367 transitions. [2019-01-12 15:01:48,642 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 367 transitions. Word has length 611 [2019-01-12 15:01:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:01:48,643 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 367 transitions. [2019-01-12 15:01:48,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-12 15:01:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 367 transitions. [2019-01-12 15:01:48,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-01-12 15:01:48,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:01:48,650 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:01:48,651 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:01:48,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:01:48,651 INFO L82 PathProgramCache]: Analyzing trace with hash 625906874, now seen corresponding path program 87 times [2019-01-12 15:01:48,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:01:48,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:01:48,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:48,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:01:48,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:01:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 26535 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 15138 trivial. 0 not checked. [2019-01-12 15:01:51,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:01:51,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:01:51,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:01:52,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2019-01-12 15:01:52,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:01:52,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:01:52,533 INFO L134 CoverageAnalysis]: Checked inductivity of 26535 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 15138 trivial. 0 not checked. [2019-01-12 15:01:52,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:01:52,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2019-01-12 15:01:52,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-12 15:01:52,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-12 15:01:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4009, Invalid=4363, Unknown=0, NotChecked=0, Total=8372 [2019-01-12 15:01:52,555 INFO L87 Difference]: Start difference. First operand 276 states and 367 transitions. Second operand 92 states. [2019-01-12 15:01:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:01:57,951 INFO L93 Difference]: Finished difference Result 283 states and 375 transitions. [2019-01-12 15:01:57,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-12 15:01:57,953 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 618 [2019-01-12 15:01:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:01:57,955 INFO L225 Difference]: With dead ends: 283 [2019-01-12 15:01:57,955 INFO L226 Difference]: Without dead ends: 279 [2019-01-12 15:01:57,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12017, Invalid=20203, Unknown=0, NotChecked=0, Total=32220 [2019-01-12 15:01:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-12 15:01:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2019-01-12 15:01:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-01-12 15:01:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 371 transitions. [2019-01-12 15:01:58,030 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 371 transitions. Word has length 618 [2019-01-12 15:01:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:01:58,030 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 371 transitions. [2019-01-12 15:01:58,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-12 15:01:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2019-01-12 15:01:58,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-01-12 15:01:58,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:01:58,036 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:01:58,036 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:01:58,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:01:58,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2081897991, now seen corresponding path program 88 times [2019-01-12 15:01:58,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:01:58,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:01:58,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:58,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:01:58,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:01:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:02:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 27148 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2019-01-12 15:02:01,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:02:01,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:02:01,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:02:01,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:02:01,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:02:01,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:02:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 27148 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 15488 trivial. 0 not checked. [2019-01-12 15:02:01,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:02:01,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2019-01-12 15:02:01,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-12 15:02:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-12 15:02:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=4457, Unknown=0, NotChecked=0, Total=8556 [2019-01-12 15:02:01,961 INFO L87 Difference]: Start difference. First operand 279 states and 371 transitions. Second operand 93 states. [2019-01-12 15:02:07,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:02:07,335 INFO L93 Difference]: Finished difference Result 286 states and 379 transitions. [2019-01-12 15:02:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-12 15:02:07,337 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 625 [2019-01-12 15:02:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:02:07,339 INFO L225 Difference]: With dead ends: 286 [2019-01-12 15:02:07,340 INFO L226 Difference]: Without dead ends: 282 [2019-01-12 15:02:07,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12287, Invalid=20655, Unknown=0, NotChecked=0, Total=32942 [2019-01-12 15:02:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-12 15:02:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-01-12 15:02:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 15:02:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 375 transitions. [2019-01-12 15:02:07,417 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 375 transitions. Word has length 625 [2019-01-12 15:02:07,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:02:07,418 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 375 transitions. [2019-01-12 15:02:07,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-12 15:02:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 375 transitions. [2019-01-12 15:02:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-01-12 15:02:07,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:02:07,423 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:02:07,424 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:02:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:02:07,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1041986140, now seen corresponding path program 89 times [2019-01-12 15:02:07,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:02:07,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:02:07,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:07,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:02:07,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:02:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 27768 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2019-01-12 15:02:10,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:02:10,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:02:10,787 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:02:11,370 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2019-01-12 15:02:11,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:02:11,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:02:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27768 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2019-01-12 15:02:11,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:02:11,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2019-01-12 15:02:11,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-12 15:02:11,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-12 15:02:11,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4190, Invalid=4552, Unknown=0, NotChecked=0, Total=8742 [2019-01-12 15:02:11,640 INFO L87 Difference]: Start difference. First operand 282 states and 375 transitions. Second operand 94 states. [2019-01-12 15:02:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:02:17,023 INFO L93 Difference]: Finished difference Result 289 states and 383 transitions. [2019-01-12 15:02:17,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-12 15:02:17,026 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 632 [2019-01-12 15:02:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:02:17,028 INFO L225 Difference]: With dead ends: 289 [2019-01-12 15:02:17,028 INFO L226 Difference]: Without dead ends: 285 [2019-01-12 15:02:17,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 722 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12560, Invalid=21112, Unknown=0, NotChecked=0, Total=33672 [2019-01-12 15:02:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-12 15:02:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2019-01-12 15:02:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-12 15:02:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 379 transitions. [2019-01-12 15:02:17,110 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 379 transitions. Word has length 632 [2019-01-12 15:02:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:02:17,110 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 379 transitions. [2019-01-12 15:02:17,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-12 15:02:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 379 transitions. [2019-01-12 15:02:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2019-01-12 15:02:17,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:02:17,115 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 90, 90, 90, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:02:17,116 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:02:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:02:17,116 INFO L82 PathProgramCache]: Analyzing trace with hash -768907547, now seen corresponding path program 90 times [2019-01-12 15:02:17,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:02:17,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:02:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:17,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:02:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:02:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 28395 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2019-01-12 15:02:20,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:02:20,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:02:20,507 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:02:21,012 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2019-01-12 15:02:21,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:02:21,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:02:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 28395 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 16200 trivial. 0 not checked. [2019-01-12 15:02:21,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:02:21,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2019-01-12 15:02:21,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-12 15:02:21,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-12 15:02:21,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4282, Invalid=4648, Unknown=0, NotChecked=0, Total=8930 [2019-01-12 15:02:21,281 INFO L87 Difference]: Start difference. First operand 285 states and 379 transitions. Second operand 95 states. [2019-01-12 15:02:26,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:02:26,705 INFO L93 Difference]: Finished difference Result 292 states and 387 transitions. [2019-01-12 15:02:26,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-12 15:02:26,707 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 639 [2019-01-12 15:02:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:02:26,709 INFO L225 Difference]: With dead ends: 292 [2019-01-12 15:02:26,709 INFO L226 Difference]: Without dead ends: 288 [2019-01-12 15:02:26,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4185 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12836, Invalid=21574, Unknown=0, NotChecked=0, Total=34410 [2019-01-12 15:02:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-12 15:02:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-01-12 15:02:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-12 15:02:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 383 transitions. [2019-01-12 15:02:26,796 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 383 transitions. Word has length 639 [2019-01-12 15:02:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:02:26,796 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 383 transitions. [2019-01-12 15:02:26,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-12 15:02:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 383 transitions. [2019-01-12 15:02:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2019-01-12 15:02:26,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:02:26,807 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 91, 91, 91, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:02:26,807 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:02:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:02:26,807 INFO L82 PathProgramCache]: Analyzing trace with hash -788972802, now seen corresponding path program 91 times [2019-01-12 15:02:26,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:02:26,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:02:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:26,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:02:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:02:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 29029 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2019-01-12 15:02:30,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:02:30,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:02:30,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:02:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:02:30,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:02:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 29029 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 16562 trivial. 0 not checked. [2019-01-12 15:02:31,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:02:31,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2019-01-12 15:02:31,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-12 15:02:31,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-12 15:02:31,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4375, Invalid=4745, Unknown=0, NotChecked=0, Total=9120 [2019-01-12 15:02:31,146 INFO L87 Difference]: Start difference. First operand 288 states and 383 transitions. Second operand 96 states. [2019-01-12 15:02:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:02:36,920 INFO L93 Difference]: Finished difference Result 295 states and 391 transitions. [2019-01-12 15:02:36,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-12 15:02:36,923 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 646 [2019-01-12 15:02:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:02:36,925 INFO L225 Difference]: With dead ends: 295 [2019-01-12 15:02:36,926 INFO L226 Difference]: Without dead ends: 291 [2019-01-12 15:02:36,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=13115, Invalid=22041, Unknown=0, NotChecked=0, Total=35156 [2019-01-12 15:02:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-01-12 15:02:37,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-01-12 15:02:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-12 15:02:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 387 transitions. [2019-01-12 15:02:37,008 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 387 transitions. Word has length 646 [2019-01-12 15:02:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:02:37,008 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 387 transitions. [2019-01-12 15:02:37,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-12 15:02:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 387 transitions. [2019-01-12 15:02:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2019-01-12 15:02:37,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:02:37,014 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 92, 92, 92, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:02:37,014 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:02:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:02:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1138969405, now seen corresponding path program 92 times [2019-01-12 15:02:37,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:02:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:02:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:37,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:02:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:02:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 29670 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2019-01-12 15:02:40,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:02:40,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:02:40,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:02:40,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:02:40,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:02:40,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:02:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 29670 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2019-01-12 15:02:41,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:02:41,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2019-01-12 15:02:41,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-12 15:02:41,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-12 15:02:41,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4469, Invalid=4843, Unknown=0, NotChecked=0, Total=9312 [2019-01-12 15:02:41,199 INFO L87 Difference]: Start difference. First operand 291 states and 387 transitions. Second operand 97 states. [2019-01-12 15:02:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:02:47,194 INFO L93 Difference]: Finished difference Result 298 states and 395 transitions. [2019-01-12 15:02:47,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-12 15:02:47,196 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 653 [2019-01-12 15:02:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:02:47,199 INFO L225 Difference]: With dead ends: 298 [2019-01-12 15:02:47,199 INFO L226 Difference]: Without dead ends: 294 [2019-01-12 15:02:47,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4370 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13397, Invalid=22513, Unknown=0, NotChecked=0, Total=35910 [2019-01-12 15:02:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-12 15:02:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2019-01-12 15:02:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-12 15:02:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 391 transitions. [2019-01-12 15:02:47,287 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 391 transitions. Word has length 653 [2019-01-12 15:02:47,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:02:47,287 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 391 transitions. [2019-01-12 15:02:47,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-12 15:02:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 391 transitions. [2019-01-12 15:02:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2019-01-12 15:02:47,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:02:47,293 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 93, 93, 93, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:02:47,294 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:02:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:02:47,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1232875872, now seen corresponding path program 93 times [2019-01-12 15:02:47,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:02:47,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:02:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:47,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:02:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:02:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30318 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2019-01-12 15:02:50,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:02:50,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:02:50,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:02:51,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2019-01-12 15:02:51,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:02:51,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:02:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30318 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2019-01-12 15:02:51,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:02:51,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2019-01-12 15:02:51,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-12 15:02:51,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-12 15:02:51,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=4942, Unknown=0, NotChecked=0, Total=9506 [2019-01-12 15:02:51,880 INFO L87 Difference]: Start difference. First operand 294 states and 391 transitions. Second operand 98 states. [2019-01-12 15:02:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:02:57,964 INFO L93 Difference]: Finished difference Result 301 states and 399 transitions. [2019-01-12 15:02:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-12 15:02:57,966 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 660 [2019-01-12 15:02:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:02:57,969 INFO L225 Difference]: With dead ends: 301 [2019-01-12 15:02:57,970 INFO L226 Difference]: Without dead ends: 297 [2019-01-12 15:02:57,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13682, Invalid=22990, Unknown=0, NotChecked=0, Total=36672 [2019-01-12 15:02:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-01-12 15:02:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-01-12 15:02:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-12 15:02:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 395 transitions. [2019-01-12 15:02:58,064 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 395 transitions. Word has length 660 [2019-01-12 15:02:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:02:58,065 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 395 transitions. [2019-01-12 15:02:58,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-12 15:02:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 395 transitions. [2019-01-12 15:02:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-01-12 15:02:58,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:02:58,070 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:02:58,071 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:02:58,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:02:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1860221023, now seen corresponding path program 94 times [2019-01-12 15:02:58,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:02:58,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:02:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:58,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:02:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:02:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:03:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30973 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2019-01-12 15:03:01,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:03:01,923 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:03:01,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:03:02,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:03:02,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:03:02,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:03:02,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30973 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 17672 trivial. 0 not checked. [2019-01-12 15:03:02,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:03:02,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2019-01-12 15:03:02,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-12 15:03:02,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-12 15:03:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4660, Invalid=5042, Unknown=0, NotChecked=0, Total=9702 [2019-01-12 15:03:02,443 INFO L87 Difference]: Start difference. First operand 297 states and 395 transitions. Second operand 99 states. [2019-01-12 15:03:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:03:08,609 INFO L93 Difference]: Finished difference Result 304 states and 403 transitions. [2019-01-12 15:03:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-12 15:03:08,611 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 667 [2019-01-12 15:03:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:03:08,613 INFO L225 Difference]: With dead ends: 304 [2019-01-12 15:03:08,613 INFO L226 Difference]: Without dead ends: 300 [2019-01-12 15:03:08,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 762 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4559 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13970, Invalid=23472, Unknown=0, NotChecked=0, Total=37442 [2019-01-12 15:03:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-12 15:03:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-01-12 15:03:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-12 15:03:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 399 transitions. [2019-01-12 15:03:08,705 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 399 transitions. Word has length 667 [2019-01-12 15:03:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:03:08,706 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 399 transitions. [2019-01-12 15:03:08,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-12 15:03:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 399 transitions. [2019-01-12 15:03:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2019-01-12 15:03:08,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:03:08,712 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 95, 95, 95, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:03:08,712 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:03:08,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:03:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash -969470654, now seen corresponding path program 95 times [2019-01-12 15:03:08,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:03:08,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:03:08,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:08,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:03:08,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:03:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 31635 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2019-01-12 15:03:12,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:03:12,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:03:12,475 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:03:13,114 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2019-01-12 15:03:13,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:03:13,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:03:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 31635 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2019-01-12 15:03:13,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:03:13,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2019-01-12 15:03:13,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-12 15:03:13,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-12 15:03:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4757, Invalid=5143, Unknown=0, NotChecked=0, Total=9900 [2019-01-12 15:03:13,758 INFO L87 Difference]: Start difference. First operand 300 states and 399 transitions. Second operand 100 states. [2019-01-12 15:03:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:03:20,188 INFO L93 Difference]: Finished difference Result 307 states and 407 transitions. [2019-01-12 15:03:20,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-12 15:03:20,190 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 674 [2019-01-12 15:03:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:03:20,192 INFO L225 Difference]: With dead ends: 307 [2019-01-12 15:03:20,192 INFO L226 Difference]: Without dead ends: 303 [2019-01-12 15:03:20,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 770 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=14261, Invalid=23959, Unknown=0, NotChecked=0, Total=38220 [2019-01-12 15:03:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-12 15:03:20,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-01-12 15:03:20,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-01-12 15:03:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 403 transitions. [2019-01-12 15:03:20,295 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 403 transitions. Word has length 674 [2019-01-12 15:03:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:03:20,298 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 403 transitions. [2019-01-12 15:03:20,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-12 15:03:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 403 transitions. [2019-01-12 15:03:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2019-01-12 15:03:20,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:03:20,306 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 96, 96, 96, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:03:20,306 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:03:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:03:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash -863551617, now seen corresponding path program 96 times [2019-01-12 15:03:20,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:03:20,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:03:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:20,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:03:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:03:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32304 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2019-01-12 15:03:24,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:03:24,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:03:24,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:03:24,908 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2019-01-12 15:03:24,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:03:24,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:03:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32304 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2019-01-12 15:03:25,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:03:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2019-01-12 15:03:25,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-12 15:03:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-12 15:03:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4855, Invalid=5245, Unknown=0, NotChecked=0, Total=10100 [2019-01-12 15:03:25,202 INFO L87 Difference]: Start difference. First operand 303 states and 403 transitions. Second operand 101 states. [2019-01-12 15:03:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:03:31,830 INFO L93 Difference]: Finished difference Result 310 states and 411 transitions. [2019-01-12 15:03:31,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-12 15:03:31,832 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 681 [2019-01-12 15:03:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:03:31,835 INFO L225 Difference]: With dead ends: 310 [2019-01-12 15:03:31,835 INFO L226 Difference]: Without dead ends: 306 [2019-01-12 15:03:31,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4752 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=14555, Invalid=24451, Unknown=0, NotChecked=0, Total=39006 [2019-01-12 15:03:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-12 15:03:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-01-12 15:03:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-12 15:03:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 407 transitions. [2019-01-12 15:03:31,943 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 407 transitions. Word has length 681 [2019-01-12 15:03:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:03:31,943 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 407 transitions. [2019-01-12 15:03:31,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-12 15:03:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 407 transitions. [2019-01-12 15:03:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2019-01-12 15:03:31,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:03:31,949 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:03:31,950 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:03:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:03:31,950 INFO L82 PathProgramCache]: Analyzing trace with hash -798042396, now seen corresponding path program 97 times [2019-01-12 15:03:31,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:03:31,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:03:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:31,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:03:31,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:03:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 32980 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2019-01-12 15:03:35,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:03:35,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:03:35,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:03:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:03:36,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:03:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32980 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2019-01-12 15:03:36,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:03:36,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2019-01-12 15:03:36,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-12 15:03:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-12 15:03:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4954, Invalid=5348, Unknown=0, NotChecked=0, Total=10302 [2019-01-12 15:03:36,452 INFO L87 Difference]: Start difference. First operand 306 states and 407 transitions. Second operand 102 states. [2019-01-12 15:03:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:03:43,129 INFO L93 Difference]: Finished difference Result 313 states and 415 transitions. [2019-01-12 15:03:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-12 15:03:43,131 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 688 [2019-01-12 15:03:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:03:43,134 INFO L225 Difference]: With dead ends: 313 [2019-01-12 15:03:43,134 INFO L226 Difference]: Without dead ends: 309 [2019-01-12 15:03:43,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=14852, Invalid=24948, Unknown=0, NotChecked=0, Total=39800 [2019-01-12 15:03:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-12 15:03:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-01-12 15:03:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-01-12 15:03:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 411 transitions. [2019-01-12 15:03:43,246 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 411 transitions. Word has length 688 [2019-01-12 15:03:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:03:43,247 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 411 transitions. [2019-01-12 15:03:43,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-12 15:03:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 411 transitions. [2019-01-12 15:03:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-01-12 15:03:43,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:03:43,253 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 98, 98, 98, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:03:43,253 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:03:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:03:43,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1815561123, now seen corresponding path program 98 times [2019-01-12 15:03:43,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:03:43,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:03:43,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:43,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:03:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:03:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 33663 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2019-01-12 15:03:47,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:03:47,316 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:03:47,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:03:47,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:03:47,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:03:47,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:03:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33663 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2019-01-12 15:03:47,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:03:47,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2019-01-12 15:03:47,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-12 15:03:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-12 15:03:47,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5054, Invalid=5452, Unknown=0, NotChecked=0, Total=10506 [2019-01-12 15:03:47,909 INFO L87 Difference]: Start difference. First operand 309 states and 411 transitions. Second operand 103 states. [2019-01-12 15:03:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:03:54,763 INFO L93 Difference]: Finished difference Result 316 states and 419 transitions. [2019-01-12 15:03:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-12 15:03:54,765 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 695 [2019-01-12 15:03:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:03:54,768 INFO L225 Difference]: With dead ends: 316 [2019-01-12 15:03:54,768 INFO L226 Difference]: Without dead ends: 312 [2019-01-12 15:03:54,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 994 GetRequests, 794 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4949 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=15152, Invalid=25450, Unknown=0, NotChecked=0, Total=40602 [2019-01-12 15:03:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-12 15:03:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-01-12 15:03:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-12 15:03:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 415 transitions. [2019-01-12 15:03:54,879 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 415 transitions. Word has length 695 [2019-01-12 15:03:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:03:54,880 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 415 transitions. [2019-01-12 15:03:54,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-12 15:03:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2019-01-12 15:03:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2019-01-12 15:03:54,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:03:54,886 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 99, 99, 99, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:03:54,886 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:03:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:03:54,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1738077306, now seen corresponding path program 99 times [2019-01-12 15:03:54,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:03:54,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:03:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:54,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:03:54,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:03:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:03:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 34353 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2019-01-12 15:03:59,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:03:59,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:03:59,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:03:59,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2019-01-12 15:03:59,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:03:59,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34353 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 19602 trivial. 0 not checked. [2019-01-12 15:04:00,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:00,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2019-01-12 15:04:00,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-12 15:04:00,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-12 15:04:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5155, Invalid=5557, Unknown=0, NotChecked=0, Total=10712 [2019-01-12 15:04:00,127 INFO L87 Difference]: Start difference. First operand 312 states and 415 transitions. Second operand 104 states. [2019-01-12 15:04:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:07,289 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2019-01-12 15:04:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-12 15:04:07,291 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 702 [2019-01-12 15:04:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:07,295 INFO L225 Difference]: With dead ends: 319 [2019-01-12 15:04:07,295 INFO L226 Difference]: Without dead ends: 315 [2019-01-12 15:04:07,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15455, Invalid=25957, Unknown=0, NotChecked=0, Total=41412 [2019-01-12 15:04:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-12 15:04:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-01-12 15:04:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-12 15:04:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 419 transitions. [2019-01-12 15:04:07,450 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 419 transitions. Word has length 702 [2019-01-12 15:04:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:07,451 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 419 transitions. [2019-01-12 15:04:07,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-12 15:04:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 419 transitions. [2019-01-12 15:04:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2019-01-12 15:04:07,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:07,459 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:07,459 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:07,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:07,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1014488635, now seen corresponding path program 100 times [2019-01-12 15:04:07,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:07,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:07,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:07,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:07,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 35050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2019-01-12 15:04:21,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:04:21,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [206] imperfect sequences [] total 206 [2019-01-12 15:04:21,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2019-01-12 15:04:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2019-01-12 15:04:21,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10409, Invalid=31821, Unknown=0, NotChecked=0, Total=42230 [2019-01-12 15:04:21,761 INFO L87 Difference]: Start difference. First operand 315 states and 419 transitions. Second operand 206 states. [2019-01-12 15:04:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:30,440 INFO L93 Difference]: Finished difference Result 621 states and 826 transitions. [2019-01-12 15:04:30,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2019-01-12 15:04:30,442 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 709 [2019-01-12 15:04:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:30,449 INFO L225 Difference]: With dead ends: 621 [2019-01-12 15:04:30,449 INFO L226 Difference]: Without dead ends: 617 [2019-01-12 15:04:30,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50198 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=31213, Invalid=134029, Unknown=0, NotChecked=0, Total=165242 [2019-01-12 15:04:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-01-12 15:04:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 318. [2019-01-12 15:04:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-01-12 15:04:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 423 transitions. [2019-01-12 15:04:31,080 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 423 transitions. Word has length 709 [2019-01-12 15:04:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:31,080 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 423 transitions. [2019-01-12 15:04:31,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2019-01-12 15:04:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 423 transitions. [2019-01-12 15:04:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2019-01-12 15:04:31,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:31,092 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 101, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:31,092 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1497878476, now seen corresponding path program 1 times [2019-01-12 15:04:31,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:31,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:31,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:04:31,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35150 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 35050 trivial. 0 not checked. [2019-01-12 15:04:31,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:04:31,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:04:31,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:04:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:04:31,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:04:31,418 INFO L87 Difference]: Start difference. First operand 318 states and 423 transitions. Second operand 4 states. [2019-01-12 15:04:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:31,445 INFO L93 Difference]: Finished difference Result 627 states and 834 transitions. [2019-01-12 15:04:31,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:04:31,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 711 [2019-01-12 15:04:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:31,451 INFO L225 Difference]: With dead ends: 627 [2019-01-12 15:04:31,451 INFO L226 Difference]: Without dead ends: 320 [2019-01-12 15:04:31,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:04:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-12 15:04:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2019-01-12 15:04:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-01-12 15:04:31,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 422 transitions. [2019-01-12 15:04:31,571 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 422 transitions. Word has length 711 [2019-01-12 15:04:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:31,572 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 422 transitions. [2019-01-12 15:04:31,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:04:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 422 transitions. [2019-01-12 15:04:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-01-12 15:04:31,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:04:31,578 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 101, 100, 100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:04:31,578 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:04:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:04:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -174189113, now seen corresponding path program 1 times [2019-01-12 15:04:31,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:04:31,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:04:31,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:31,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:31,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:04:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 35554 backedges. 701 proven. 1 refuted. 0 times theorem prover too weak. 34852 trivial. 0 not checked. [2019-01-12 15:04:31,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:04:31,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:04:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:04:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:04:32,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:04:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 35554 backedges. 701 proven. 1 refuted. 0 times theorem prover too weak. 34852 trivial. 0 not checked. [2019-01-12 15:04:32,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:04:32,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2019-01-12 15:04:32,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:04:32,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:04:32,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:04:32,389 INFO L87 Difference]: Start difference. First operand 318 states and 422 transitions. Second operand 7 states. [2019-01-12 15:04:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:04:32,468 INFO L93 Difference]: Finished difference Result 323 states and 429 transitions. [2019-01-12 15:04:32,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:04:32,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 717 [2019-01-12 15:04:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:04:32,470 INFO L225 Difference]: With dead ends: 323 [2019-01-12 15:04:32,470 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:04:32,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 718 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:04:32,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:04:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:04:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:04:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:04:32,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 717 [2019-01-12 15:04:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:04:32,472 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:04:32,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:04:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:04:32,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:04:32,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:04:32,576 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 15:04:32,576 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:04:32,576 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 34) no Hoare annotation was computed. [2019-01-12 15:04:32,576 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:04:32,577 INFO L451 ceAbstractionStarter]: At program point L29(line 29) the Hoare annotation is: true [2019-01-12 15:04:32,577 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:04:32,577 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2019-01-12 15:04:32,577 INFO L451 ceAbstractionStarter]: At program point L26(lines 26 35) the Hoare annotation is: true [2019-01-12 15:04:32,577 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2019-01-12 15:04:32,578 INFO L448 ceAbstractionStarter]: For program point additionFINAL(lines 13 23) no Hoare annotation was computed. [2019-01-12 15:04:32,578 INFO L444 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: (and (<= |addition_#in~m| addition_~m) (<= |addition_#in~n| addition_~n) (<= (+ addition_~n 1) 0)) [2019-01-12 15:04:32,578 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2019-01-12 15:04:32,578 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2019-01-12 15:04:32,578 INFO L444 ceAbstractionStarter]: At program point L18(line 18) the Hoare annotation is: (and (<= |addition_#in~m| addition_~m) (<= |addition_#in~n| addition_~n) (<= 1 addition_~n)) [2019-01-12 15:04:32,578 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2019-01-12 15:04:32,578 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2019-01-12 15:04:32,578 INFO L451 ceAbstractionStarter]: At program point additionENTRY(lines 13 23) the Hoare annotation is: true [2019-01-12 15:04:32,578 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2019-01-12 15:04:32,579 INFO L448 ceAbstractionStarter]: For program point additionEXIT(lines 13 23) no Hoare annotation was computed. [2019-01-12 15:04:32,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:04:32 BoogieIcfgContainer [2019-01-12 15:04:32,585 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:04:32,586 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:04:32,586 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:04:32,586 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:04:32,587 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:26" (3/4) ... [2019-01-12 15:04:32,591 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:04:32,599 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure addition [2019-01-12 15:04:32,605 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:04:32,606 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:04:32,642 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:04:32,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:04:32,643 INFO L168 Benchmark]: Toolchain (without parser) took 486632.11 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -388.4 MB). Peak memory consumption was 969.0 MB. Max. memory is 11.5 GB. [2019-01-12 15:04:32,644 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:04:32,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.13 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:04:32,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:04:32,645 INFO L168 Benchmark]: Boogie Preprocessor took 24.76 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:04:32,645 INFO L168 Benchmark]: RCFGBuilder took 418.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-01-12 15:04:32,646 INFO L168 Benchmark]: TraceAbstraction took 485797.55 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.8 MB). Peak memory consumption was 999.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:04:32,646 INFO L168 Benchmark]: Witness Printer took 56.17 ms. Allocated memory is still 2.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2019-01-12 15:04:32,650 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.13 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.77 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.76 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 418.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 485797.55 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.8 MB). Peak memory consumption was 999.5 MB. Max. memory is 11.5 GB. * Witness Printer took 56.17 ms. Allocated memory is still 2.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. SAFE Result, 485.7s OverallTime, 103 OverallIterations, 102 TraceHistogramMax, 264.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1248 SDtfs, 11307 SDslu, 22797 SDs, 0 SdLazy, 28912 SolverSat, 16857 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52128 GetRequests, 41414 SyntacticMatches, 1 SemanticMatches, 10713 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221800 ImplicationChecksByTransitivity, 342.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 103 MinimizatonAttempts, 301 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 25 HoareAnnotationTreeSize, 11 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 2.4s SsaConstructionTime, 22.0s SatisfiabilityAnalysisTime, 178.0s InterpolantComputationTime, 73945 NumberOfCodeBlocks, 73945 NumberOfCodeBlocksAsserted, 2719 NumberOfCheckSat, 73742 ConstructedInterpolants, 0 QuantifiedInterpolants, 93484158 SizeOfPredicates, 5150 NumberOfNonLiveVariables, 99470 ConjunctsInSsa, 10300 ConjunctsInUnsatCore, 203 InterpolantComputations, 3 PerfectInterpolantSequences, 1454706/2444708 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...