java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:34:02,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:34:02,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:34:02,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:34:02,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:34:02,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:34:02,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:34:02,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:34:02,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:34:02,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:34:02,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:34:02,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:34:02,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:34:02,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:34:02,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:34:02,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:34:02,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:34:02,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:34:02,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:34:02,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:34:02,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:34:02,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:34:02,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:34:02,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:34:02,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:34:02,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:34:02,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:34:02,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:34:02,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:34:02,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:34:02,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:34:02,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:34:02,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:34:02,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:34:02,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:34:02,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:34:02,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:34:02,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:34:02,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:34:02,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:34:02,656 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:34:02,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 22:34:02,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:34:02,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:34:02,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:34:02,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:34:02,673 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:34:02,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:34:02,674 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:34:02,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:34:02,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:34:02,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:34:02,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:34:02,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:34:02,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:34:02,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:34:02,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:34:02,676 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:34:02,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:34:02,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:34:02,676 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:34:02,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:34:02,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:34:02,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:34:02,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:34:02,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:34:02,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:34:02,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:34:02,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:34:02,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:34:02,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:34:02,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:34:02,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:34:02,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:34:02,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:34:02,723 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:34:02,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label29.c [2019-09-07 22:34:02,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894fffa7d/c06d398559db4395bc0d2b9879db8e60/FLAG2a1e8b30a [2019-09-07 22:34:03,496 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:34:03,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label29.c [2019-09-07 22:34:03,528 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894fffa7d/c06d398559db4395bc0d2b9879db8e60/FLAG2a1e8b30a [2019-09-07 22:34:03,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894fffa7d/c06d398559db4395bc0d2b9879db8e60 [2019-09-07 22:34:03,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:34:03,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:34:03,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:34:03,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:34:03,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:34:03,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:34:03" (1/1) ... [2019-09-07 22:34:03,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4db4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:03, skipping insertion in model container [2019-09-07 22:34:03,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:34:03" (1/1) ... [2019-09-07 22:34:03,678 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:34:03,810 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:34:04,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:34:04,981 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:34:05,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:34:05,451 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:34:05,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05 WrapperNode [2019-09-07 22:34:05,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:34:05,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:34:05,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:34:05,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:34:05,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (1/1) ... [2019-09-07 22:34:05,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (1/1) ... [2019-09-07 22:34:05,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (1/1) ... [2019-09-07 22:34:05,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (1/1) ... [2019-09-07 22:34:05,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (1/1) ... [2019-09-07 22:34:05,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (1/1) ... [2019-09-07 22:34:05,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (1/1) ... [2019-09-07 22:34:05,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:34:05,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:34:05,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:34:05,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:34:05,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (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-09-07 22:34:05,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:34:05,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:34:05,863 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:34:05,863 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:34:05,863 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:34:05,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:34:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:34:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:34:05,864 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:34:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:34:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:34:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:34:05,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:34:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:34:05,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:34:10,125 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:34:10,125 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:34:10,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:34:10 BoogieIcfgContainer [2019-09-07 22:34:10,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:34:10,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:34:10,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:34:10,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:34:10,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:34:03" (1/3) ... [2019-09-07 22:34:10,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d291280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:34:10, skipping insertion in model container [2019-09-07 22:34:10,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:34:05" (2/3) ... [2019-09-07 22:34:10,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d291280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:34:10, skipping insertion in model container [2019-09-07 22:34:10,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:34:10" (3/3) ... [2019-09-07 22:34:10,144 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label29.c [2019-09-07 22:34:10,154 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:34:10,164 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:34:10,182 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:34:10,221 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:34:10,221 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:34:10,221 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:34:10,222 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:34:10,222 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:34:10,222 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:34:10,222 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:34:10,222 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:34:10,222 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:34:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:34:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 22:34:10,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:10,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:10,270 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:10,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1247826190, now seen corresponding path program 1 times [2019-09-07 22:34:10,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:10,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:10,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:10,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:10,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:34:10,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:34:10,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:34:10,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:34:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:34:10,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:34:10,621 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 3 states. [2019-09-07 22:34:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:15,294 INFO L93 Difference]: Finished difference Result 2248 states and 4319 transitions. [2019-09-07 22:34:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:34:15,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-07 22:34:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:15,334 INFO L225 Difference]: With dead ends: 2248 [2019-09-07 22:34:15,334 INFO L226 Difference]: Without dead ends: 1412 [2019-09-07 22:34:15,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:34:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-09-07 22:34:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-09-07 22:34:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-07 22:34:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2558 transitions. [2019-09-07 22:34:15,490 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2558 transitions. Word has length 45 [2019-09-07 22:34:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:15,491 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2558 transitions. [2019-09-07 22:34:15,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:34:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2558 transitions. [2019-09-07 22:34:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 22:34:15,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:15,497 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:15,498 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash 943060347, now seen corresponding path program 1 times [2019-09-07 22:34:15,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:15,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:15,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:34:15,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:34:15,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:34:15,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:34:15,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:34:15,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:34:15,705 INFO L87 Difference]: Start difference. First operand 1412 states and 2558 transitions. Second operand 5 states. [2019-09-07 22:34:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:20,893 INFO L93 Difference]: Finished difference Result 3572 states and 6416 transitions. [2019-09-07 22:34:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:34:20,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-07 22:34:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:20,906 INFO L225 Difference]: With dead ends: 3572 [2019-09-07 22:34:20,907 INFO L226 Difference]: Without dead ends: 2166 [2019-09-07 22:34:20,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:34:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-09-07 22:34:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2146. [2019-09-07 22:34:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-09-07 22:34:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3628 transitions. [2019-09-07 22:34:20,974 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3628 transitions. Word has length 116 [2019-09-07 22:34:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:20,975 INFO L475 AbstractCegarLoop]: Abstraction has 2146 states and 3628 transitions. [2019-09-07 22:34:20,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:34:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3628 transitions. [2019-09-07 22:34:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 22:34:20,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:20,979 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:20,979 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:20,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1308391962, now seen corresponding path program 1 times [2019-09-07 22:34:20,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:20,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:20,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:20,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:20,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:34:21,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:34:21,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:34:21,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:34:21,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:34:21,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:34:21,218 INFO L87 Difference]: Start difference. First operand 2146 states and 3628 transitions. Second operand 6 states. [2019-09-07 22:34:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:26,280 INFO L93 Difference]: Finished difference Result 5051 states and 8506 transitions. [2019-09-07 22:34:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:34:26,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-07 22:34:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:26,303 INFO L225 Difference]: With dead ends: 5051 [2019-09-07 22:34:26,304 INFO L226 Difference]: Without dead ends: 2911 [2019-09-07 22:34:26,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:34:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2019-09-07 22:34:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2887. [2019-09-07 22:34:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2887 states. [2019-09-07 22:34:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4487 transitions. [2019-09-07 22:34:26,379 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4487 transitions. Word has length 139 [2019-09-07 22:34:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:26,380 INFO L475 AbstractCegarLoop]: Abstraction has 2887 states and 4487 transitions. [2019-09-07 22:34:26,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:34:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4487 transitions. [2019-09-07 22:34:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 22:34:26,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:26,384 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:26,384 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1824000722, now seen corresponding path program 1 times [2019-09-07 22:34:26,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:26,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:26,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:26,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:26,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:34:26,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:34:26,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:34:26,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:34:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:34:26,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:34:26,557 INFO L87 Difference]: Start difference. First operand 2887 states and 4487 transitions. Second operand 6 states. [2019-09-07 22:34:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:31,082 INFO L93 Difference]: Finished difference Result 6543 states and 10148 transitions. [2019-09-07 22:34:31,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:34:31,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-07 22:34:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:31,104 INFO L225 Difference]: With dead ends: 6543 [2019-09-07 22:34:31,104 INFO L226 Difference]: Without dead ends: 3662 [2019-09-07 22:34:31,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:34:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2019-09-07 22:34:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3642. [2019-09-07 22:34:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-09-07 22:34:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 5124 transitions. [2019-09-07 22:34:31,210 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 5124 transitions. Word has length 143 [2019-09-07 22:34:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:31,210 INFO L475 AbstractCegarLoop]: Abstraction has 3642 states and 5124 transitions. [2019-09-07 22:34:31,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:34:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 5124 transitions. [2019-09-07 22:34:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 22:34:31,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:31,215 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:31,215 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1871023439, now seen corresponding path program 1 times [2019-09-07 22:34:31,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:31,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:31,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:31,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:34:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:34:31,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:34:31,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:34:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:34:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:34:31,448 INFO L87 Difference]: Start difference. First operand 3642 states and 5124 transitions. Second operand 6 states. [2019-09-07 22:34:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:36,409 INFO L93 Difference]: Finished difference Result 10404 states and 14982 transitions. [2019-09-07 22:34:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:34:36,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-09-07 22:34:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:36,451 INFO L225 Difference]: With dead ends: 10404 [2019-09-07 22:34:36,451 INFO L226 Difference]: Without dead ends: 6768 [2019-09-07 22:34:36,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:34:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-09-07 22:34:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 6670. [2019-09-07 22:34:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2019-09-07 22:34:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 9031 transitions. [2019-09-07 22:34:36,642 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 9031 transitions. Word has length 174 [2019-09-07 22:34:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:36,642 INFO L475 AbstractCegarLoop]: Abstraction has 6670 states and 9031 transitions. [2019-09-07 22:34:36,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:34:36,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 9031 transitions. [2019-09-07 22:34:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-07 22:34:36,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:36,647 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:36,648 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash 666932303, now seen corresponding path program 1 times [2019-09-07 22:34:36,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:36,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 22:34:36,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:34:36,832 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-09-07 22:34:36,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:36,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:34:36,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:34:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-07 22:34:37,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:34:37,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-09-07 22:34:37,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:34:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:34:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:34:37,069 INFO L87 Difference]: Start difference. First operand 6670 states and 9031 transitions. Second operand 7 states. [2019-09-07 22:34:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:47,535 INFO L93 Difference]: Finished difference Result 26371 states and 40408 transitions. [2019-09-07 22:34:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:34:47,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2019-09-07 22:34:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:47,674 INFO L225 Difference]: With dead ends: 26371 [2019-09-07 22:34:47,674 INFO L226 Difference]: Without dead ends: 19707 [2019-09-07 22:34:47,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:34:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19707 states. [2019-09-07 22:34:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19707 to 19490. [2019-09-07 22:34:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19490 states. [2019-09-07 22:34:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19490 states to 19490 states and 25887 transitions. [2019-09-07 22:34:48,422 INFO L78 Accepts]: Start accepts. Automaton has 19490 states and 25887 transitions. Word has length 206 [2019-09-07 22:34:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:48,423 INFO L475 AbstractCegarLoop]: Abstraction has 19490 states and 25887 transitions. [2019-09-07 22:34:48,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:34:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 19490 states and 25887 transitions. [2019-09-07 22:34:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-07 22:34:48,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:48,435 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:48,436 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:48,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:48,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2111491797, now seen corresponding path program 1 times [2019-09-07 22:34:48,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:48,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:48,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:34:48,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:34:48,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:34:48,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:34:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:34:48,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:34:48,644 INFO L87 Difference]: Start difference. First operand 19490 states and 25887 transitions. Second operand 4 states. [2019-09-07 22:34:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:55,156 INFO L93 Difference]: Finished difference Result 46740 states and 62298 transitions. [2019-09-07 22:34:55,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:34:55,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-09-07 22:34:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:55,265 INFO L225 Difference]: With dead ends: 46740 [2019-09-07 22:34:55,266 INFO L226 Difference]: Without dead ends: 27256 [2019-09-07 22:34:55,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 22:34:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27256 states. [2019-09-07 22:34:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27256 to 27240. [2019-09-07 22:34:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27240 states. [2019-09-07 22:34:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27240 states to 27240 states and 33309 transitions. [2019-09-07 22:34:55,844 INFO L78 Accepts]: Start accepts. Automaton has 27240 states and 33309 transitions. Word has length 268 [2019-09-07 22:34:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:55,845 INFO L475 AbstractCegarLoop]: Abstraction has 27240 states and 33309 transitions. [2019-09-07 22:34:55,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:34:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 27240 states and 33309 transitions. [2019-09-07 22:34:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-07 22:34:55,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:55,853 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:55,854 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:55,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:55,854 INFO L82 PathProgramCache]: Analyzing trace with hash 860741538, now seen corresponding path program 1 times [2019-09-07 22:34:55,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:55,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:55,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:55,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 22:34:56,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:34:56,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:34:56,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:34:56,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:34:56,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:34:56,065 INFO L87 Difference]: Start difference. First operand 27240 states and 33309 transitions. Second operand 4 states. [2019-09-07 22:35:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:35:02,874 INFO L93 Difference]: Finished difference Result 90632 states and 114427 transitions. [2019-09-07 22:35:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:35:02,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2019-09-07 22:35:02,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:35:03,100 INFO L225 Difference]: With dead ends: 90632 [2019-09-07 22:35:03,100 INFO L226 Difference]: Without dead ends: 63398 [2019-09-07 22:35:03,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 22:35:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63398 states. [2019-09-07 22:35:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63398 to 57766. [2019-09-07 22:35:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57766 states. [2019-09-07 22:35:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57766 states to 57766 states and 71732 transitions. [2019-09-07 22:35:05,702 INFO L78 Accepts]: Start accepts. Automaton has 57766 states and 71732 transitions. Word has length 301 [2019-09-07 22:35:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:35:05,703 INFO L475 AbstractCegarLoop]: Abstraction has 57766 states and 71732 transitions. [2019-09-07 22:35:05,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:35:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 57766 states and 71732 transitions. [2019-09-07 22:35:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-09-07 22:35:05,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:35:05,732 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:35:05,733 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:35:05,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:35:05,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1668457534, now seen corresponding path program 1 times [2019-09-07 22:35:05,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:35:05,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:35:05,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:05,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:35:05,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:35:06,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:35:06,224 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) [2019-09-07 22:35:06,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:35:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:06,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:35:06,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:35:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 309 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:35:06,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:35:06,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:35:06,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:35:06,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:35:06,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:35:06,783 INFO L87 Difference]: Start difference. First operand 57766 states and 71732 transitions. Second operand 9 states. [2019-09-07 22:35:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:35:13,184 INFO L93 Difference]: Finished difference Result 115068 states and 144367 transitions. [2019-09-07 22:35:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:35:13,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 433 [2019-09-07 22:35:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:35:13,370 INFO L225 Difference]: With dead ends: 115068 [2019-09-07 22:35:13,370 INFO L226 Difference]: Without dead ends: 57308 [2019-09-07 22:35:13,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:35:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57308 states. [2019-09-07 22:35:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57308 to 51580. [2019-09-07 22:35:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51580 states. [2019-09-07 22:35:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51580 states to 51580 states and 60777 transitions. [2019-09-07 22:35:14,355 INFO L78 Accepts]: Start accepts. Automaton has 51580 states and 60777 transitions. Word has length 433 [2019-09-07 22:35:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:35:14,357 INFO L475 AbstractCegarLoop]: Abstraction has 51580 states and 60777 transitions. [2019-09-07 22:35:14,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:35:14,357 INFO L276 IsEmpty]: Start isEmpty. Operand 51580 states and 60777 transitions. [2019-09-07 22:35:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2019-09-07 22:35:14,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:35:14,433 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:35:14,434 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:35:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:35:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -118378095, now seen corresponding path program 1 times [2019-09-07 22:35:14,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:35:14,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:35:14,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:14,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:35:14,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 238 proven. 194 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-07 22:35:15,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:35:15,279 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-09-07 22:35:15,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:35:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:15,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:35:15,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:35:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 511 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-07 22:35:15,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:35:15,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:35:15,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:35:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:35:15,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:35:15,961 INFO L87 Difference]: Start difference. First operand 51580 states and 60777 transitions. Second operand 9 states. [2019-09-07 22:35:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:35:31,307 INFO L93 Difference]: Finished difference Result 135529 states and 169638 transitions. [2019-09-07 22:35:31,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 22:35:31,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 693 [2019-09-07 22:35:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:35:31,590 INFO L225 Difference]: With dead ends: 135529 [2019-09-07 22:35:31,590 INFO L226 Difference]: Without dead ends: 83955 [2019-09-07 22:35:31,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:35:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83955 states. [2019-09-07 22:35:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83955 to 79654. [2019-09-07 22:35:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79654 states. [2019-09-07 22:35:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79654 states to 79654 states and 99749 transitions. [2019-09-07 22:35:33,420 INFO L78 Accepts]: Start accepts. Automaton has 79654 states and 99749 transitions. Word has length 693 [2019-09-07 22:35:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:35:33,421 INFO L475 AbstractCegarLoop]: Abstraction has 79654 states and 99749 transitions. [2019-09-07 22:35:33,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:35:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 79654 states and 99749 transitions. [2019-09-07 22:35:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-09-07 22:35:33,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:35:33,465 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:35:33,465 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:35:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:35:33,466 INFO L82 PathProgramCache]: Analyzing trace with hash -434630699, now seen corresponding path program 1 times [2019-09-07 22:35:33,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:35:33,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:35:33,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:33,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:35:33,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-09-07 22:35:33,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:35:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:35:33,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:35:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:35:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:35:33,919 INFO L87 Difference]: Start difference. First operand 79654 states and 99749 transitions. Second operand 4 states. [2019-09-07 22:35:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:35:40,388 INFO L93 Difference]: Finished difference Result 186214 states and 235176 transitions. [2019-09-07 22:35:40,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:35:40,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 748 [2019-09-07 22:35:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:35:40,797 INFO L225 Difference]: With dead ends: 186214 [2019-09-07 22:35:40,797 INFO L226 Difference]: Without dead ends: 107268 [2019-09-07 22:35:40,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-09-07 22:35:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107268 states. [2019-09-07 22:35:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107268 to 105146. [2019-09-07 22:35:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105146 states. [2019-09-07 22:35:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105146 states to 105146 states and 128241 transitions. [2019-09-07 22:35:45,202 INFO L78 Accepts]: Start accepts. Automaton has 105146 states and 128241 transitions. Word has length 748 [2019-09-07 22:35:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:35:45,203 INFO L475 AbstractCegarLoop]: Abstraction has 105146 states and 128241 transitions. [2019-09-07 22:35:45,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:35:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 105146 states and 128241 transitions. [2019-09-07 22:35:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2019-09-07 22:35:45,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:35:45,248 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:35:45,248 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:35:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:35:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1725365104, now seen corresponding path program 1 times [2019-09-07 22:35:45,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:35:45,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:35:45,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:45,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:35:45,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:35:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 284 proven. 80 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-09-07 22:35:46,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:35:46,645 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-09-07 22:35:46,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:35:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:35:46,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:35:46,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:35:46,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:35:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-07 22:35:47,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:35:47,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-09-07 22:35:47,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 22:35:47,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 22:35:47,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-07 22:35:47,296 INFO L87 Difference]: Start difference. First operand 105146 states and 128241 transitions. Second operand 12 states. [2019-09-07 22:36:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:36:18,046 INFO L93 Difference]: Finished difference Result 271314 states and 337501 transitions. [2019-09-07 22:36:18,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 22:36:18,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 767 [2019-09-07 22:36:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:36:18,855 INFO L225 Difference]: With dead ends: 271314 [2019-09-07 22:36:18,855 INFO L226 Difference]: Without dead ends: 166876 [2019-09-07 22:36:18,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=3054, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 22:36:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166876 states. [2019-09-07 22:36:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166876 to 164952. [2019-09-07 22:36:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164952 states. [2019-09-07 22:36:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164952 states to 164952 states and 194587 transitions. [2019-09-07 22:36:21,187 INFO L78 Accepts]: Start accepts. Automaton has 164952 states and 194587 transitions. Word has length 767 [2019-09-07 22:36:21,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:36:21,187 INFO L475 AbstractCegarLoop]: Abstraction has 164952 states and 194587 transitions. [2019-09-07 22:36:21,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 22:36:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 164952 states and 194587 transitions. [2019-09-07 22:36:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2019-09-07 22:36:21,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:36:21,354 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:36:21,354 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:36:21,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:36:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1288990978, now seen corresponding path program 1 times [2019-09-07 22:36:21,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:36:21,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:36:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:21,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:36:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1239 proven. 766 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-09-07 22:36:27,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:36:27,072 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-09-07 22:36:27,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:36:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:36:27,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1672 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 22:36:27,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:36:27,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:36:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 949 proven. 0 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2019-09-07 22:36:28,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:36:28,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2019-09-07 22:36:28,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 22:36:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 22:36:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-07 22:36:28,440 INFO L87 Difference]: Start difference. First operand 164952 states and 194587 transitions. Second operand 21 states. [2019-09-07 22:37:13,730 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-07 22:37:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:20,875 INFO L93 Difference]: Finished difference Result 394365 states and 461388 transitions. [2019-09-07 22:37:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-09-07 22:37:20,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1320 [2019-09-07 22:37:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:21,403 INFO L225 Difference]: With dead ends: 394365 [2019-09-07 22:37:21,404 INFO L226 Difference]: Without dead ends: 230831 [2019-09-07 22:37:21,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1554 GetRequests, 1358 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15863 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3777, Invalid=34835, Unknown=0, NotChecked=0, Total=38612 [2019-09-07 22:37:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230831 states. [2019-09-07 22:37:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230831 to 205986. [2019-09-07 22:37:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205986 states. [2019-09-07 22:37:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205986 states to 205986 states and 226646 transitions. [2019-09-07 22:37:24,869 INFO L78 Accepts]: Start accepts. Automaton has 205986 states and 226646 transitions. Word has length 1320 [2019-09-07 22:37:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:24,870 INFO L475 AbstractCegarLoop]: Abstraction has 205986 states and 226646 transitions. [2019-09-07 22:37:24,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 22:37:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 205986 states and 226646 transitions. [2019-09-07 22:37:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1480 [2019-09-07 22:37:24,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:24,976 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:37:24,977 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:24,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2024828268, now seen corresponding path program 1 times [2019-09-07 22:37:24,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:24,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:24,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:24,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:24,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3510 backedges. 383 proven. 1451 refuted. 0 times theorem prover too weak. 1676 trivial. 0 not checked. [2019-09-07 22:37:28,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:28,153 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-09-07 22:37:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:28,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1931 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:37:28,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3510 backedges. 2286 proven. 2 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2019-09-07 22:37:29,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:29,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 22:37:29,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:37:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:37:29,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:37:29,688 INFO L87 Difference]: Start difference. First operand 205986 states and 226646 transitions. Second operand 15 states. [2019-09-07 22:37:48,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:37:48,371 INFO L93 Difference]: Finished difference Result 403717 states and 445143 transitions. [2019-09-07 22:37:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 22:37:48,372 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1479 [2019-09-07 22:37:48,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:37:48,677 INFO L225 Difference]: With dead ends: 403717 [2019-09-07 22:37:48,677 INFO L226 Difference]: Without dead ends: 176296 [2019-09-07 22:37:48,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1573 GetRequests, 1517 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=646, Invalid=2660, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 22:37:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176296 states. [2019-09-07 22:37:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176296 to 144563. [2019-09-07 22:37:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144563 states. [2019-09-07 22:37:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144563 states to 144563 states and 150933 transitions. [2019-09-07 22:37:50,766 INFO L78 Accepts]: Start accepts. Automaton has 144563 states and 150933 transitions. Word has length 1479 [2019-09-07 22:37:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:37:50,766 INFO L475 AbstractCegarLoop]: Abstraction has 144563 states and 150933 transitions. [2019-09-07 22:37:50,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:37:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 144563 states and 150933 transitions. [2019-09-07 22:37:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1959 [2019-09-07 22:37:50,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:37:50,838 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:37:50,839 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:37:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:37:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash -189196706, now seen corresponding path program 1 times [2019-09-07 22:37:50,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:37:50,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:37:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:50,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:50,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:37:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4229 backedges. 865 proven. 1837 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked. [2019-09-07 22:37:56,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:37:56,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 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-09-07 22:37:56,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:37:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:37:56,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 2430 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:37:56,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:37:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4229 backedges. 3019 proven. 2 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2019-09-07 22:37:58,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:37:58,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 22:37:58,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 22:37:58,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 22:37:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-09-07 22:37:58,218 INFO L87 Difference]: Start difference. First operand 144563 states and 150933 transitions. Second operand 14 states. [2019-09-07 22:38:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:38:12,197 INFO L93 Difference]: Finished difference Result 299624 states and 312728 transitions. [2019-09-07 22:38:12,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 22:38:12,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1958 [2019-09-07 22:38:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:38:12,472 INFO L225 Difference]: With dead ends: 299624 [2019-09-07 22:38:12,472 INFO L226 Difference]: Without dead ends: 155777 [2019-09-07 22:38:12,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2025 GetRequests, 1986 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 22:38:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155777 states. [2019-09-07 22:38:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155777 to 144525. [2019-09-07 22:38:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144525 states. [2019-09-07 22:38:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144525 states to 144525 states and 150453 transitions. [2019-09-07 22:38:14,691 INFO L78 Accepts]: Start accepts. Automaton has 144525 states and 150453 transitions. Word has length 1958 [2019-09-07 22:38:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:38:14,692 INFO L475 AbstractCegarLoop]: Abstraction has 144525 states and 150453 transitions. [2019-09-07 22:38:14,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 22:38:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 144525 states and 150453 transitions. [2019-09-07 22:38:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2110 [2019-09-07 22:38:14,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:38:14,791 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:38:14,791 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:38:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:38:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash 190506516, now seen corresponding path program 1 times [2019-09-07 22:38:14,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:38:14,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:38:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:14,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:38:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6355 backedges. 1063 proven. 3762 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2019-09-07 22:38:23,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:38:23,717 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-09-07 22:38:23,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:38:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:38:24,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:38:24,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:38:24,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:38:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6355 backedges. 3023 proven. 2 refuted. 0 times theorem prover too weak. 3330 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:38:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:38:25,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 5] total 25 [2019-09-07 22:38:25,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 22:38:25,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 22:38:25,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-09-07 22:38:25,809 INFO L87 Difference]: Start difference. First operand 144525 states and 150453 transitions. Second operand 25 states. [2019-09-07 22:39:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:01,170 INFO L93 Difference]: Finished difference Result 286029 states and 297835 transitions. [2019-09-07 22:39:01,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-09-07 22:39:01,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 2109 [2019-09-07 22:39:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:01,422 INFO L225 Difference]: With dead ends: 286029 [2019-09-07 22:39:01,422 INFO L226 Difference]: Without dead ends: 142220 [2019-09-07 22:39:01,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2344 GetRequests, 2206 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7069 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2777, Invalid=16129, Unknown=0, NotChecked=0, Total=18906 [2019-09-07 22:39:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142220 states. [2019-09-07 22:39:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142220 to 134996. [2019-09-07 22:39:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134996 states. [2019-09-07 22:39:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134996 states to 134996 states and 139265 transitions. [2019-09-07 22:39:03,119 INFO L78 Accepts]: Start accepts. Automaton has 134996 states and 139265 transitions. Word has length 2109 [2019-09-07 22:39:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:03,121 INFO L475 AbstractCegarLoop]: Abstraction has 134996 states and 139265 transitions. [2019-09-07 22:39:03,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 22:39:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 134996 states and 139265 transitions. [2019-09-07 22:39:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2359 [2019-09-07 22:39:03,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:03,242 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:39:03,242 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash 455509090, now seen corresponding path program 1 times [2019-09-07 22:39:03,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7187 backedges. 1278 proven. 722 refuted. 0 times theorem prover too weak. 5187 trivial. 0 not checked. [2019-09-07 22:39:10,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:10,641 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-09-07 22:39:10,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:11,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 2947 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:39:11,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7187 backedges. 4798 proven. 2 refuted. 0 times theorem prover too weak. 2387 trivial. 0 not checked. [2019-09-07 22:39:13,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:13,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 22:39:13,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:39:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:39:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:39:13,206 INFO L87 Difference]: Start difference. First operand 134996 states and 139265 transitions. Second operand 16 states. [2019-09-07 22:39:18,114 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-07 22:39:19,180 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-07 22:39:20,977 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-07 22:39:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:39:27,956 INFO L93 Difference]: Finished difference Result 268625 states and 277170 transitions. [2019-09-07 22:39:27,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 22:39:27,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 2358 [2019-09-07 22:39:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:39:28,167 INFO L225 Difference]: With dead ends: 268625 [2019-09-07 22:39:28,167 INFO L226 Difference]: Without dead ends: 135097 [2019-09-07 22:39:28,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2469 GetRequests, 2398 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1024, Invalid=4232, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 22:39:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135097 states. [2019-09-07 22:39:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135097 to 134305. [2019-09-07 22:39:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134305 states. [2019-09-07 22:39:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134305 states to 134305 states and 138081 transitions. [2019-09-07 22:39:29,771 INFO L78 Accepts]: Start accepts. Automaton has 134305 states and 138081 transitions. Word has length 2358 [2019-09-07 22:39:29,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:39:29,772 INFO L475 AbstractCegarLoop]: Abstraction has 134305 states and 138081 transitions. [2019-09-07 22:39:29,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:39:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 134305 states and 138081 transitions. [2019-09-07 22:39:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2469 [2019-09-07 22:39:29,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:39:29,891 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:39:29,891 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:39:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:39:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash -215664274, now seen corresponding path program 1 times [2019-09-07 22:39:29,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:39:29,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:39:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:39:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7791 backedges. 1571 proven. 3179 refuted. 0 times theorem prover too weak. 3041 trivial. 0 not checked. [2019-09-07 22:39:38,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:39:38,359 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-09-07 22:39:38,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:39:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:39:38,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:39:38,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:39:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7791 backedges. 4516 proven. 2 refuted. 0 times theorem prover too weak. 3273 trivial. 0 not checked. [2019-09-07 22:39:41,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:39:41,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 22:39:41,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 22:39:41,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 22:39:41,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-09-07 22:39:41,016 INFO L87 Difference]: Start difference. First operand 134305 states and 138081 transitions. Second operand 19 states. [2019-09-07 22:40:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:40:13,984 INFO L93 Difference]: Finished difference Result 275848 states and 284144 transitions. [2019-09-07 22:40:13,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-07 22:40:13,984 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 2468 [2019-09-07 22:40:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:40:14,217 INFO L225 Difference]: With dead ends: 275848 [2019-09-07 22:40:14,217 INFO L226 Difference]: Without dead ends: 142263 [2019-09-07 22:40:14,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2718 GetRequests, 2578 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7546 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2628, Invalid=16554, Unknown=0, NotChecked=0, Total=19182 [2019-09-07 22:40:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142263 states. [2019-09-07 22:40:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142263 to 136370. [2019-09-07 22:40:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136370 states. [2019-09-07 22:40:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136370 states to 136370 states and 139397 transitions. [2019-09-07 22:40:15,918 INFO L78 Accepts]: Start accepts. Automaton has 136370 states and 139397 transitions. Word has length 2468 [2019-09-07 22:40:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:40:15,919 INFO L475 AbstractCegarLoop]: Abstraction has 136370 states and 139397 transitions. [2019-09-07 22:40:15,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 22:40:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 136370 states and 139397 transitions. [2019-09-07 22:40:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2516 [2019-09-07 22:40:16,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:40:16,043 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:40:16,043 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:40:16,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:40:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1536650036, now seen corresponding path program 1 times [2019-09-07 22:40:16,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:40:16,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:40:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:16,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:40:16,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:40:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7594 backedges. 3994 proven. 794 refuted. 0 times theorem prover too weak. 2806 trivial. 0 not checked. [2019-09-07 22:40:23,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:40:23,009 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) [2019-09-07 22:40:23,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:40:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:40:23,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 3131 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 22:40:23,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:40:23,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:23,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:23,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:24,082 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 25 [2019-09-07 22:40:24,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:24,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:24,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:24,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:24,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:40:24,380 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 37 [2019-09-07 22:40:24,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:24,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:25,014 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_33 Int) (v_prenex_1 Int)) (let ((.cse0 (* 9 v_prenex_1))) (let ((.cse1 (div .cse0 10))) (and (<= c_~a3~0 (+ (* 2 (div v_prenex_33 5)) 339134)) (<= 0 .cse0) (<= 0 v_prenex_33) (< 417 v_prenex_33) (<= v_prenex_33 (+ (mod .cse1 299791) 300208)) (< 417 v_prenex_1) (<= 0 .cse1))))) is different from true [2019-09-07 22:40:25,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:25,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:40:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7594 backedges. 4312 proven. 677 refuted. 0 times theorem prover too weak. 2593 trivial. 12 not checked. [2019-09-07 22:40:29,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:40:29,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 28 [2019-09-07 22:40:29,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 22:40:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 22:40:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=611, Unknown=2, NotChecked=50, Total=756 [2019-09-07 22:40:29,538 INFO L87 Difference]: Start difference. First operand 136370 states and 139397 transitions. Second operand 28 states. [2019-09-07 22:41:40,606 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-07 22:41:50,156 WARN L188 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-07 22:42:57,358 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-09-07 22:43:41,690 WARN L188 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-09-07 22:44:12,882 WARN L188 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-09-07 22:45:01,396 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-07 22:45:11,907 WARN L188 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 68 DAG size of output: 45 [2019-09-07 22:45:50,402 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-07 22:46:09,148 WARN L188 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-07 22:46:11,074 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-07 22:46:17,795 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-07 22:46:22,009 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-07 22:46:37,790 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-07 22:46:58,200 WARN L188 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 49 DAG size of output: 47