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/Problem17_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:05:03,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:05:03,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:05:03,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:05:03,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:05:03,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:05:03,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:05:03,597 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:05:03,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:05:03,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:05:03,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:05:03,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:05:03,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:05:03,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:05:03,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:05:03,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:05:03,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:05:03,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:05:03,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:05:03,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:05:03,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:05:03,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:05:03,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:05:03,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:05:03,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:05:03,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:05:03,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:05:03,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:05:03,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:05:03,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:05:03,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:05:03,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:05:03,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:05:03,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:05:03,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:05:03,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:05:03,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:05:03,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:05:03,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:05:03,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:05:03,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:05:03,628 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:05:03,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:05:03,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:05:03,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:05:03,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:05:03,647 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:05:03,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:05:03,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:05:03,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:05:03,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:05:03,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:05:03,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:05:03,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:05:03,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:05:03,649 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:05:03,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:05:03,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:05:03,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:05:03,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:05:03,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:05:03,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:05:03,651 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:05:03,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:05:03,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:05:03,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:05:03,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:05:03,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:05:03,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:05:03,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:05:03,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:05:03,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:05:03,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:05:03,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:05:03,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:05:03,725 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:05:03,726 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label49.c [2019-09-07 22:05:03,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b21bb7e0/29555891cba84eb7982081afe1cd91b1/FLAG35b09694c [2019-09-07 22:05:04,524 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:05:04,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label49.c [2019-09-07 22:05:04,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b21bb7e0/29555891cba84eb7982081afe1cd91b1/FLAG35b09694c [2019-09-07 22:05:04,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b21bb7e0/29555891cba84eb7982081afe1cd91b1 [2019-09-07 22:05:04,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:05:04,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:05:04,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:05:04,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:05:04,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:05:04,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:05:04" (1/1) ... [2019-09-07 22:05:04,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64899908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:04, skipping insertion in model container [2019-09-07 22:05:04,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:05:04" (1/1) ... [2019-09-07 22:05:04,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:05:04,779 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:05:05,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:05:05,940 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:05:06,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:05:06,374 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:05:06,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06 WrapperNode [2019-09-07 22:05:06,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:05:06,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:05:06,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:05:06,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:05:06,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (1/1) ... [2019-09-07 22:05:06,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (1/1) ... [2019-09-07 22:05:06,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (1/1) ... [2019-09-07 22:05:06,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (1/1) ... [2019-09-07 22:05:06,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (1/1) ... [2019-09-07 22:05:06,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (1/1) ... [2019-09-07 22:05:06,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (1/1) ... [2019-09-07 22:05:06,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:05:06,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:05:06,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:05:06,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:05:06,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (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:05:06,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:05:06,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:05:06,781 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:05:06,781 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:05:06,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:05:06,782 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:05:06,782 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:05:06,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:05:06,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:05:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:05:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:05:06,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:05:06,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:05:10,884 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:05:10,885 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:05:10,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:05:10 BoogieIcfgContainer [2019-09-07 22:05:10,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:05:10,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:05:10,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:05:10,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:05:10,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:05:04" (1/3) ... [2019-09-07 22:05:10,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d815c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:05:10, skipping insertion in model container [2019-09-07 22:05:10,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:05:06" (2/3) ... [2019-09-07 22:05:10,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d815c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:05:10, skipping insertion in model container [2019-09-07 22:05:10,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:05:10" (3/3) ... [2019-09-07 22:05:10,908 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label49.c [2019-09-07 22:05:10,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:05:10,934 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:05:10,954 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:05:11,008 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:05:11,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:05:11,009 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:05:11,009 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:05:11,010 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:05:11,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:05:11,011 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:05:11,012 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:05:11,012 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:05:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-07 22:05:11,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 22:05:11,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:11,067 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] [2019-09-07 22:05:11,069 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:11,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1643264031, now seen corresponding path program 1 times [2019-09-07 22:05:11,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:11,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:11,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:11,349 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:05:11,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:11,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:05:11,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:05:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:05:11,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:05:11,380 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-07 22:05:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:20,382 INFO L93 Difference]: Finished difference Result 2162 states and 4009 transitions. [2019-09-07 22:05:20,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:05:20,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-07 22:05:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:20,417 INFO L225 Difference]: With dead ends: 2162 [2019-09-07 22:05:20,417 INFO L226 Difference]: Without dead ends: 1478 [2019-09-07 22:05:20,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:05:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2019-09-07 22:05:20,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1006. [2019-09-07 22:05:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-09-07 22:05:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1697 transitions. [2019-09-07 22:05:20,593 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1697 transitions. Word has length 21 [2019-09-07 22:05:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:20,594 INFO L475 AbstractCegarLoop]: Abstraction has 1006 states and 1697 transitions. [2019-09-07 22:05:20,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:05:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1697 transitions. [2019-09-07 22:05:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 22:05:20,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:20,610 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:05:20,610 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1154353601, now seen corresponding path program 1 times [2019-09-07 22:05:20,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:20,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:20,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:20,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:20,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:20,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:20,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:05:20,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:05:20,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:05:20,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:05:20,841 INFO L87 Difference]: Start difference. First operand 1006 states and 1697 transitions. Second operand 6 states. [2019-09-07 22:05:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:25,370 INFO L93 Difference]: Finished difference Result 2931 states and 5018 transitions. [2019-09-07 22:05:25,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:05:25,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-07 22:05:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:25,391 INFO L225 Difference]: With dead ends: 2931 [2019-09-07 22:05:25,391 INFO L226 Difference]: Without dead ends: 1931 [2019-09-07 22:05:25,396 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:05:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2019-09-07 22:05:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1911. [2019-09-07 22:05:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-09-07 22:05:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2935 transitions. [2019-09-07 22:05:25,463 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2935 transitions. Word has length 96 [2019-09-07 22:05:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:25,465 INFO L475 AbstractCegarLoop]: Abstraction has 1911 states and 2935 transitions. [2019-09-07 22:05:25,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:05:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2935 transitions. [2019-09-07 22:05:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 22:05:25,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:25,479 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:05:25,479 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:25,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:25,479 INFO L82 PathProgramCache]: Analyzing trace with hash -796112953, now seen corresponding path program 1 times [2019-09-07 22:05:25,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:25,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:25,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:25,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:25,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:25,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:25,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:05:25,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:05:25,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:05:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:05:25,714 INFO L87 Difference]: Start difference. First operand 1911 states and 2935 transitions. Second operand 6 states. [2019-09-07 22:05:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:29,798 INFO L93 Difference]: Finished difference Result 4746 states and 7234 transitions. [2019-09-07 22:05:29,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:05:29,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-07 22:05:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:29,819 INFO L225 Difference]: With dead ends: 4746 [2019-09-07 22:05:29,820 INFO L226 Difference]: Without dead ends: 2841 [2019-09-07 22:05:29,826 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:05:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2019-09-07 22:05:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2819. [2019-09-07 22:05:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2019-09-07 22:05:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3606 transitions. [2019-09-07 22:05:29,962 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3606 transitions. Word has length 100 [2019-09-07 22:05:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:29,970 INFO L475 AbstractCegarLoop]: Abstraction has 2819 states and 3606 transitions. [2019-09-07 22:05:29,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:05:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3606 transitions. [2019-09-07 22:05:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 22:05:29,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:29,975 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:05:29,975 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:29,975 INFO L82 PathProgramCache]: Analyzing trace with hash -530986166, now seen corresponding path program 1 times [2019-09-07 22:05:29,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:29,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:29,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:05:30,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:05:30,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:05:30,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:05:30,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:05:30,107 INFO L87 Difference]: Start difference. First operand 2819 states and 3606 transitions. Second operand 4 states. [2019-09-07 22:05:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:34,043 INFO L93 Difference]: Finished difference Result 5632 states and 7217 transitions. [2019-09-07 22:05:34,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:05:34,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-07 22:05:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:34,066 INFO L225 Difference]: With dead ends: 5632 [2019-09-07 22:05:34,066 INFO L226 Difference]: Without dead ends: 2819 [2019-09-07 22:05:34,073 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:05:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2019-09-07 22:05:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2819. [2019-09-07 22:05:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2819 states. [2019-09-07 22:05:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3569 transitions. [2019-09-07 22:05:34,143 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3569 transitions. Word has length 130 [2019-09-07 22:05:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:34,145 INFO L475 AbstractCegarLoop]: Abstraction has 2819 states and 3569 transitions. [2019-09-07 22:05:34,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:05:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3569 transitions. [2019-09-07 22:05:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-07 22:05:34,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:34,148 INFO L399 BasicCegarLoop]: trace histogram [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, 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:05:34,149 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash 158509577, now seen corresponding path program 1 times [2019-09-07 22:05:34,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:34,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:34,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:34,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 22:05:34,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:05:34,390 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) [2019-09-07 22:05:34,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:05:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:34,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:05:34,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:05:34,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:34,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:05:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 22:05:34,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:05:34,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-07 22:05:34,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:05:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:05:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:05:34,764 INFO L87 Difference]: Start difference. First operand 2819 states and 3569 transitions. Second operand 10 states. [2019-09-07 22:05:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:05:47,230 INFO L93 Difference]: Finished difference Result 13975 states and 18547 transitions. [2019-09-07 22:05:47,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 22:05:47,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 183 [2019-09-07 22:05:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:05:47,293 INFO L225 Difference]: With dead ends: 13975 [2019-09-07 22:05:47,293 INFO L226 Difference]: Without dead ends: 11162 [2019-09-07 22:05:47,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-07 22:05:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11162 states. [2019-09-07 22:05:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11162 to 10615. [2019-09-07 22:05:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10615 states. [2019-09-07 22:05:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10615 states to 10615 states and 13059 transitions. [2019-09-07 22:05:47,608 INFO L78 Accepts]: Start accepts. Automaton has 10615 states and 13059 transitions. Word has length 183 [2019-09-07 22:05:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:05:47,609 INFO L475 AbstractCegarLoop]: Abstraction has 10615 states and 13059 transitions. [2019-09-07 22:05:47,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:05:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 10615 states and 13059 transitions. [2019-09-07 22:05:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-07 22:05:47,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:05:47,614 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:47,615 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:05:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:05:47,615 INFO L82 PathProgramCache]: Analyzing trace with hash 309309238, now seen corresponding path program 1 times [2019-09-07 22:05:47,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:05:47,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:05:47,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:47,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:47,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:05:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:05:47,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:05:47,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:05:47,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:05:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:05:48,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 22:05:48,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:05:48,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:05:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 22:05:48,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:05:48,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:05:48,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:05:48,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:05:48,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:05:48,208 INFO L87 Difference]: Start difference. First operand 10615 states and 13059 transitions. Second operand 9 states. [2019-09-07 22:06:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:00,436 INFO L93 Difference]: Finished difference Result 29608 states and 37730 transitions. [2019-09-07 22:06:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 22:06:00,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-09-07 22:06:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:00,540 INFO L225 Difference]: With dead ends: 29608 [2019-09-07 22:06:00,541 INFO L226 Difference]: Without dead ends: 18999 [2019-09-07 22:06:00,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2019-09-07 22:06:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18999 states. [2019-09-07 22:06:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18999 to 17444. [2019-09-07 22:06:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17444 states. [2019-09-07 22:06:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17444 states to 17444 states and 21613 transitions. [2019-09-07 22:06:01,197 INFO L78 Accepts]: Start accepts. Automaton has 17444 states and 21613 transitions. Word has length 205 [2019-09-07 22:06:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:01,198 INFO L475 AbstractCegarLoop]: Abstraction has 17444 states and 21613 transitions. [2019-09-07 22:06:01,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:06:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 17444 states and 21613 transitions. [2019-09-07 22:06:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-07 22:06:01,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:01,211 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 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] [2019-09-07 22:06:01,211 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1444727954, now seen corresponding path program 1 times [2019-09-07 22:06:01,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:01,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:01,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:01,808 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-09-07 22:06:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 69 proven. 360 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 22:06:02,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:02,182 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:06:02,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:02,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:06:02,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:02,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:06:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 399 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 22:06:02,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:02,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-07 22:06:02,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 22:06:02,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 22:06:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-07 22:06:02,500 INFO L87 Difference]: Start difference. First operand 17444 states and 21613 transitions. Second operand 15 states. [2019-09-07 22:06:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:12,847 INFO L93 Difference]: Finished difference Result 45904 states and 56877 transitions. [2019-09-07 22:06:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 22:06:12,848 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 357 [2019-09-07 22:06:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:12,942 INFO L225 Difference]: With dead ends: 45904 [2019-09-07 22:06:12,943 INFO L226 Difference]: Without dead ends: 27216 [2019-09-07 22:06:13,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 383 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 22:06:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27216 states. [2019-09-07 22:06:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27216 to 22762. [2019-09-07 22:06:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22762 states. [2019-09-07 22:06:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22762 states to 22762 states and 26756 transitions. [2019-09-07 22:06:13,535 INFO L78 Accepts]: Start accepts. Automaton has 22762 states and 26756 transitions. Word has length 357 [2019-09-07 22:06:13,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:13,535 INFO L475 AbstractCegarLoop]: Abstraction has 22762 states and 26756 transitions. [2019-09-07 22:06:13,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 22:06:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand 22762 states and 26756 transitions. [2019-09-07 22:06:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-07 22:06:13,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:13,545 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 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] [2019-09-07 22:06:13,546 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash 514047712, now seen corresponding path program 1 times [2019-09-07 22:06:13,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:13,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:13,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:13,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:13,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2019-09-07 22:06:14,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:06:14,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 22:06:14,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 22:06:14,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 22:06:14,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 22:06:14,607 INFO L87 Difference]: Start difference. First operand 22762 states and 26756 transitions. Second operand 4 states. [2019-09-07 22:06:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:21,055 INFO L93 Difference]: Finished difference Result 74076 states and 90442 transitions. [2019-09-07 22:06:21,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 22:06:21,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 368 [2019-09-07 22:06:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:21,227 INFO L225 Difference]: With dead ends: 74076 [2019-09-07 22:06:21,227 INFO L226 Difference]: Without dead ends: 51319 [2019-09-07 22:06:21,279 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:06:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51319 states. [2019-09-07 22:06:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51319 to 46480. [2019-09-07 22:06:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46480 states. [2019-09-07 22:06:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46480 states to 46480 states and 57069 transitions. [2019-09-07 22:06:22,350 INFO L78 Accepts]: Start accepts. Automaton has 46480 states and 57069 transitions. Word has length 368 [2019-09-07 22:06:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:22,351 INFO L475 AbstractCegarLoop]: Abstraction has 46480 states and 57069 transitions. [2019-09-07 22:06:22,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 22:06:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 46480 states and 57069 transitions. [2019-09-07 22:06:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-07 22:06:22,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:22,366 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 22:06:22,366 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2126273785, now seen corresponding path program 1 times [2019-09-07 22:06:22,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:22,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 131 proven. 107 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:06:22,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:22,715 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) [2019-09-07 22:06:22,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:06:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:22,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:06:22,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:22,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:22,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 237 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:06:23,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:23,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-07 22:06:23,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:06:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:06:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:06:23,412 INFO L87 Difference]: Start difference. First operand 46480 states and 57069 transitions. Second operand 8 states. [2019-09-07 22:06:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:06:32,883 INFO L93 Difference]: Finished difference Result 124052 states and 155034 transitions. [2019-09-07 22:06:32,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 22:06:32,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 393 [2019-09-07 22:06:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:06:33,105 INFO L225 Difference]: With dead ends: 124052 [2019-09-07 22:06:33,106 INFO L226 Difference]: Without dead ends: 74044 [2019-09-07 22:06:33,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:06:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74044 states. [2019-09-07 22:06:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74044 to 69124. [2019-09-07 22:06:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69124 states. [2019-09-07 22:06:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69124 states to 69124 states and 83288 transitions. [2019-09-07 22:06:34,300 INFO L78 Accepts]: Start accepts. Automaton has 69124 states and 83288 transitions. Word has length 393 [2019-09-07 22:06:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:06:34,300 INFO L475 AbstractCegarLoop]: Abstraction has 69124 states and 83288 transitions. [2019-09-07 22:06:34,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:06:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 69124 states and 83288 transitions. [2019-09-07 22:06:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-07 22:06:34,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:06:34,314 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 22:06:34,314 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:06:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:06:34,314 INFO L82 PathProgramCache]: Analyzing trace with hash 805391659, now seen corresponding path program 1 times [2019-09-07 22:06:34,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:06:34,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:06:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:34,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:06:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:06:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 239 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:06:34,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:06:34,983 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) [2019-09-07 22:06:34,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:06:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:06:35,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 22:06:35,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:06:35,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:35,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:06:35,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:35,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:35,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:35,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:35,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 22:06:35,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:35,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:06:35,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:06:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 255 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 22:06:35,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:06:35,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-09-07 22:06:35,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:06:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:06:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:06:35,607 INFO L87 Difference]: Start difference. First operand 69124 states and 83288 transitions. Second operand 13 states. [2019-09-07 22:06:40,654 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-09-07 22:07:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:03,627 INFO L93 Difference]: Finished difference Result 205640 states and 270242 transitions. [2019-09-07 22:07:03,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 22:07:03,627 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 395 [2019-09-07 22:07:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:04,267 INFO L225 Difference]: With dead ends: 205640 [2019-09-07 22:07:04,267 INFO L226 Difference]: Without dead ends: 132060 [2019-09-07 22:07:04,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 434 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=708, Invalid=3848, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 22:07:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132060 states. [2019-09-07 22:07:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132060 to 124547. [2019-09-07 22:07:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124547 states. [2019-09-07 22:07:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124547 states to 124547 states and 154718 transitions. [2019-09-07 22:07:08,942 INFO L78 Accepts]: Start accepts. Automaton has 124547 states and 154718 transitions. Word has length 395 [2019-09-07 22:07:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:08,943 INFO L475 AbstractCegarLoop]: Abstraction has 124547 states and 154718 transitions. [2019-09-07 22:07:08,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 22:07:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 124547 states and 154718 transitions. [2019-09-07 22:07:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-07 22:07:08,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:08,962 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:07:08,962 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:08,963 INFO L82 PathProgramCache]: Analyzing trace with hash -748698077, now seen corresponding path program 1 times [2019-09-07 22:07:08,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:08,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:08,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 44 proven. 122 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-09-07 22:07:10,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:10,377 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:07:10,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:10,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 22:07:10,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:10,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:10,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 282 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-07 22:07:10,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:07:10,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 22:07:10,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:07:10,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:07:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:07:10,731 INFO L87 Difference]: Start difference. First operand 124547 states and 154718 transitions. Second operand 13 states. [2019-09-07 22:07:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:07:34,993 INFO L93 Difference]: Finished difference Result 308321 states and 390854 transitions. [2019-09-07 22:07:34,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 22:07:34,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 438 [2019-09-07 22:07:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:07:35,762 INFO L225 Difference]: With dead ends: 308321 [2019-09-07 22:07:35,762 INFO L226 Difference]: Without dead ends: 182884 [2019-09-07 22:07:36,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=719, Invalid=4251, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 22:07:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182884 states. [2019-09-07 22:07:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182884 to 175257. [2019-09-07 22:07:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175257 states. [2019-09-07 22:07:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175257 states to 175257 states and 216970 transitions. [2019-09-07 22:07:43,403 INFO L78 Accepts]: Start accepts. Automaton has 175257 states and 216970 transitions. Word has length 438 [2019-09-07 22:07:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:07:43,404 INFO L475 AbstractCegarLoop]: Abstraction has 175257 states and 216970 transitions. [2019-09-07 22:07:43,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 22:07:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 175257 states and 216970 transitions. [2019-09-07 22:07:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-07 22:07:43,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:07:43,426 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 22:07:43,426 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:07:43,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:07:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 605437980, now seen corresponding path program 1 times [2019-09-07 22:07:43,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:07:43,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:07:43,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:43,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:07:43,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:07:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 260 proven. 147 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2019-09-07 22:07:43,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:07:43,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 22:07:43,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 22:07:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:07:44,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 22:07:44,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:07:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,943 WARN L188 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 25 [2019-09-07 22:07:44,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:07:44,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:08:02,608 WARN L188 SmtUtils]: Spent 17.55 s on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-07 22:08:02,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-07 22:08:02,781 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-07 22:08:15,452 WARN L188 SmtUtils]: Spent 10.54 s on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-09-07 22:08:29,824 WARN L188 SmtUtils]: Spent 6.10 s on a formula simplification that was a NOOP. DAG size: 99 [2019-09-07 22:08:29,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:08:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 362 proven. 13 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-09-07 22:08:30,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:08:30,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-09-07 22:08:30,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:08:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:08:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=66, Unknown=5, NotChecked=0, Total=90 [2019-09-07 22:08:30,749 INFO L87 Difference]: Start difference. First operand 175257 states and 216970 transitions. Second operand 10 states. [2019-09-07 22:16:28,505 WARN L188 SmtUtils]: Spent 22.27 s on a formula simplification that was a NOOP. DAG size: 80 [2019-09-07 22:17:33,659 WARN L188 SmtUtils]: Spent 46.87 s on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2019-09-07 22:18:45,583 WARN L188 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 143 DAG size of output: 106