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/Problem13_label57.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:59:50,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:59:50,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:59:50,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:59:50,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:59:50,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:59:50,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:59:50,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:59:50,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:59:50,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:59:50,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:59:50,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:59:50,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:59:50,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:59:50,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:59:50,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:59:50,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:59:50,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:59:50,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:59:50,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:59:50,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:59:50,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:59:50,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:59:50,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:59:50,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:59:50,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:59:50,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:59:50,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:59:50,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:59:50,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:59:50,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:59:50,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:59:50,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:59:50,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:59:50,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:59:50,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:59:50,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:59:50,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:59:50,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:59:50,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:59:50,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:59:50,710 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 19:59:50,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:59:50,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:59:50,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:59:50,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:59:50,731 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:59:50,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:59:50,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:59:50,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:59:50,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:59:50,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:59:50,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:59:50,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:59:50,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:59:50,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:59:50,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:59:50,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:59:50,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:59:50,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:59:50,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:59:50,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:59:50,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:59:50,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:59:50,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:59:50,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:59:50,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:59:50,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:59:50,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:59:50,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:59:50,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:59:50,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:59:50,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:59:50,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:59:50,813 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:59:50,813 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:59:50,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label57.c [2019-09-07 19:59:50,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bceef3323/2580e3e2bf764a45819c845b55cae8ab/FLAG77746a00f [2019-09-07 19:59:51,798 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:59:51,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label57.c [2019-09-07 19:59:51,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bceef3323/2580e3e2bf764a45819c845b55cae8ab/FLAG77746a00f [2019-09-07 19:59:52,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bceef3323/2580e3e2bf764a45819c845b55cae8ab [2019-09-07 19:59:52,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:59:52,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:59:52,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:59:52,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:59:52,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:59:52,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:59:52" (1/1) ... [2019-09-07 19:59:52,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102bfb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:52, skipping insertion in model container [2019-09-07 19:59:52,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:59:52" (1/1) ... [2019-09-07 19:59:52,263 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:59:52,434 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:59:54,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:59:54,133 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:59:54,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:59:54,898 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:59:54,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54 WrapperNode [2019-09-07 19:59:54,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:59:54,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:59:54,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:59:54,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:59:54,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (1/1) ... [2019-09-07 19:59:54,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (1/1) ... [2019-09-07 19:59:54,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (1/1) ... [2019-09-07 19:59:54,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (1/1) ... [2019-09-07 19:59:55,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (1/1) ... [2019-09-07 19:59:55,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (1/1) ... [2019-09-07 19:59:55,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (1/1) ... [2019-09-07 19:59:55,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:59:55,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:59:55,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:59:55,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:59:55,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (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 19:59:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:59:55,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:59:55,342 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:59:55,342 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:59:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:59:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:59:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:59:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:59:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:59:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:59:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:59:55,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:59:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:59:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:59:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:59:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:59:55,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:00:02,410 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:00:02,411 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:00:02,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:00:02 BoogieIcfgContainer [2019-09-07 20:00:02,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:00:02,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:00:02,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:00:02,426 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:00:02,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:59:52" (1/3) ... [2019-09-07 20:00:02,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35351c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:00:02, skipping insertion in model container [2019-09-07 20:00:02,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:59:54" (2/3) ... [2019-09-07 20:00:02,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35351c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:00:02, skipping insertion in model container [2019-09-07 20:00:02,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:00:02" (3/3) ... [2019-09-07 20:00:02,432 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label57.c [2019-09-07 20:00:02,443 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:00:02,454 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:00:02,473 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:00:02,522 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:00:02,523 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:00:02,523 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:00:02,523 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:00:02,523 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:00:02,523 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:00:02,523 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:00:02,524 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:00:02,524 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:00:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 20:00:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 20:00:02,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:02,585 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, 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 20:00:02,588 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:02,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1658720712, now seen corresponding path program 1 times [2019-09-07 20:00:02,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:02,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:02,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:02,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:03,040 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 20:00:03,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:00:03,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:00:03,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:00:03,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:00:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:00:03,066 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 20:00:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:09,140 INFO L93 Difference]: Finished difference Result 3084 states and 5696 transitions. [2019-09-07 20:00:09,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:00:09,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-07 20:00:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:09,179 INFO L225 Difference]: With dead ends: 3084 [2019-09-07 20:00:09,179 INFO L226 Difference]: Without dead ends: 1903 [2019-09-07 20:00:09,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 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 20:00:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-09-07 20:00:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1897. [2019-09-07 20:00:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-09-07 20:00:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3341 transitions. [2019-09-07 20:00:09,379 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3341 transitions. Word has length 67 [2019-09-07 20:00:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:09,381 INFO L475 AbstractCegarLoop]: Abstraction has 1897 states and 3341 transitions. [2019-09-07 20:00:09,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:00:09,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3341 transitions. [2019-09-07 20:00:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 20:00:09,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:09,398 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, 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] [2019-09-07 20:00:09,398 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:09,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1840767741, now seen corresponding path program 1 times [2019-09-07 20:00:09,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:09,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:09,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:09,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:09,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:00:09,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:00:09,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:00:09,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:00:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:00:09,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:00:09,691 INFO L87 Difference]: Start difference. First operand 1897 states and 3341 transitions. Second operand 6 states. [2019-09-07 20:00:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:17,186 INFO L93 Difference]: Finished difference Result 5508 states and 9838 transitions. [2019-09-07 20:00:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:00:17,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-07 20:00:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:17,216 INFO L225 Difference]: With dead ends: 5508 [2019-09-07 20:00:17,216 INFO L226 Difference]: Without dead ends: 3617 [2019-09-07 20:00:17,222 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 20:00:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2019-09-07 20:00:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 3589. [2019-09-07 20:00:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3589 states. [2019-09-07 20:00:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 5781 transitions. [2019-09-07 20:00:17,346 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 5781 transitions. Word has length 143 [2019-09-07 20:00:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:17,348 INFO L475 AbstractCegarLoop]: Abstraction has 3589 states and 5781 transitions. [2019-09-07 20:00:17,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:00:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 5781 transitions. [2019-09-07 20:00:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-07 20:00:17,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:17,355 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, 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] [2019-09-07 20:00:17,355 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:17,357 INFO L82 PathProgramCache]: Analyzing trace with hash -401871347, now seen corresponding path program 1 times [2019-09-07 20:00:17,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:17,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:17,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:17,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:17,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:00:17,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:00:17,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:00:17,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:00:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:00:17,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:00:17,659 INFO L87 Difference]: Start difference. First operand 3589 states and 5781 transitions. Second operand 6 states. [2019-09-07 20:00:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:25,221 INFO L93 Difference]: Finished difference Result 9048 states and 14688 transitions. [2019-09-07 20:00:25,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:00:25,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-09-07 20:00:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:25,253 INFO L225 Difference]: With dead ends: 9048 [2019-09-07 20:00:25,254 INFO L226 Difference]: Without dead ends: 5465 [2019-09-07 20:00:25,264 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 20:00:25,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2019-09-07 20:00:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 5377. [2019-09-07 20:00:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5377 states. [2019-09-07 20:00:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5377 states to 5377 states and 8248 transitions. [2019-09-07 20:00:25,414 INFO L78 Accepts]: Start accepts. Automaton has 5377 states and 8248 transitions. Word has length 174 [2019-09-07 20:00:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:25,415 INFO L475 AbstractCegarLoop]: Abstraction has 5377 states and 8248 transitions. [2019-09-07 20:00:25,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:00:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5377 states and 8248 transitions. [2019-09-07 20:00:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 20:00:25,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:25,420 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:00:25,421 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash 807678088, now seen corresponding path program 1 times [2019-09-07 20:00:25,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:25,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:25,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 120 proven. 71 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:00:25,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:00:25,569 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 20:00:25,587 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 20:00:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:25,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:00:25,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:00:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 61 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 20:00:25,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:00:25,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-07 20:00:25,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:00:25,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:00:25,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:00:25,843 INFO L87 Difference]: Start difference. First operand 5377 states and 8248 transitions. Second operand 6 states. [2019-09-07 20:00:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:34,732 INFO L93 Difference]: Finished difference Result 16538 states and 27147 transitions. [2019-09-07 20:00:34,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:00:34,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-09-07 20:00:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:34,799 INFO L225 Difference]: With dead ends: 16538 [2019-09-07 20:00:34,799 INFO L226 Difference]: Without dead ends: 11167 [2019-09-07 20:00:34,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:00:34,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11167 states. [2019-09-07 20:00:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11167 to 10766. [2019-09-07 20:00:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10766 states. [2019-09-07 20:00:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10766 states to 10766 states and 15779 transitions. [2019-09-07 20:00:35,136 INFO L78 Accepts]: Start accepts. Automaton has 10766 states and 15779 transitions. Word has length 218 [2019-09-07 20:00:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:35,137 INFO L475 AbstractCegarLoop]: Abstraction has 10766 states and 15779 transitions. [2019-09-07 20:00:35,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:00:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 10766 states and 15779 transitions. [2019-09-07 20:00:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-07 20:00:35,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:35,143 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, 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, 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 20:00:35,143 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash 327568164, now seen corresponding path program 1 times [2019-09-07 20:00:35,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:35,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:35,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:35,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:35,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 72 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:00:35,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:00:35,321 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 20:00:35,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:35,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:00:35,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:00:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 20:00:35,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:00:35,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:00:35,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:00:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:00:35,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:00:35,561 INFO L87 Difference]: Start difference. First operand 10766 states and 15779 transitions. Second operand 8 states. [2019-09-07 20:00:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:55,236 INFO L93 Difference]: Finished difference Result 50433 states and 86550 transitions. [2019-09-07 20:00:55,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:00:55,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-09-07 20:00:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:55,475 INFO L225 Difference]: With dead ends: 50433 [2019-09-07 20:00:55,475 INFO L226 Difference]: Without dead ends: 39673 [2019-09-07 20:00:55,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=1399, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 20:00:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39673 states. [2019-09-07 20:00:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39673 to 39320. [2019-09-07 20:00:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39320 states. [2019-09-07 20:00:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39320 states to 39320 states and 61357 transitions. [2019-09-07 20:00:57,069 INFO L78 Accepts]: Start accepts. Automaton has 39320 states and 61357 transitions. Word has length 232 [2019-09-07 20:00:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:57,070 INFO L475 AbstractCegarLoop]: Abstraction has 39320 states and 61357 transitions. [2019-09-07 20:00:57,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:00:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39320 states and 61357 transitions. [2019-09-07 20:00:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-07 20:00:57,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:57,079 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, 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] [2019-09-07 20:00:57,080 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:57,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2032846276, now seen corresponding path program 1 times [2019-09-07 20:00:57,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:57,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:57,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:57,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 20:00:57,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:00:57,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:00:57,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:00:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:00:57,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:00:57,313 INFO L87 Difference]: Start difference. First operand 39320 states and 61357 transitions. Second operand 3 states. [2019-09-07 20:01:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:03,549 INFO L93 Difference]: Finished difference Result 78570 states and 126432 transitions. [2019-09-07 20:01:03,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:01:03,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-09-07 20:01:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:03,758 INFO L225 Difference]: With dead ends: 78570 [2019-09-07 20:01:03,759 INFO L226 Difference]: Without dead ends: 46637 [2019-09-07 20:01:03,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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 20:01:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46637 states. [2019-09-07 20:01:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46637 to 46637. [2019-09-07 20:01:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46637 states. [2019-09-07 20:01:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46637 states to 46637 states and 71815 transitions. [2019-09-07 20:01:05,141 INFO L78 Accepts]: Start accepts. Automaton has 46637 states and 71815 transitions. Word has length 267 [2019-09-07 20:01:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:05,142 INFO L475 AbstractCegarLoop]: Abstraction has 46637 states and 71815 transitions. [2019-09-07 20:01:05,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:01:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 46637 states and 71815 transitions. [2019-09-07 20:01:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-07 20:01:05,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:05,159 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, 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, 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] [2019-09-07 20:01:05,160 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:05,161 INFO L82 PathProgramCache]: Analyzing trace with hash -22620364, now seen corresponding path program 1 times [2019-09-07 20:01:05,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:05,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:05,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:05,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 185 proven. 164 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 20:01:05,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:05,468 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) [2019-09-07 20:01:05,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:01:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:05,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:01:05,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 356 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 20:01:05,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:01:05,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:01:05,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:01:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:01:05,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:05,697 INFO L87 Difference]: Start difference. First operand 46637 states and 71815 transitions. Second operand 9 states. [2019-09-07 20:01:20,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:20,327 INFO L93 Difference]: Finished difference Result 136866 states and 232354 transitions. [2019-09-07 20:01:20,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:01:20,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 349 [2019-09-07 20:01:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:20,849 INFO L225 Difference]: With dead ends: 136866 [2019-09-07 20:01:20,850 INFO L226 Difference]: Without dead ends: 90235 [2019-09-07 20:01:20,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 357 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:01:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90235 states. [2019-09-07 20:01:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90235 to 83560. [2019-09-07 20:01:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83560 states. [2019-09-07 20:01:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83560 states to 83560 states and 126366 transitions. [2019-09-07 20:01:25,186 INFO L78 Accepts]: Start accepts. Automaton has 83560 states and 126366 transitions. Word has length 349 [2019-09-07 20:01:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:25,187 INFO L475 AbstractCegarLoop]: Abstraction has 83560 states and 126366 transitions. [2019-09-07 20:01:25,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:01:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 83560 states and 126366 transitions. [2019-09-07 20:01:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-07 20:01:25,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:25,209 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:01:25,209 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:25,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 683689661, now seen corresponding path program 1 times [2019-09-07 20:01:25,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:25,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:25,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:25,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:25,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 275 proven. 95 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 20:01:25,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:25,737 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 20:01:25,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:25,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:01:25,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 398 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-07 20:01:26,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:01:26,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:01:26,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:01:26,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:01:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:26,137 INFO L87 Difference]: Start difference. First operand 83560 states and 126366 transitions. Second operand 9 states. [2019-09-07 20:01:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:48,759 INFO L93 Difference]: Finished difference Result 216500 states and 402581 transitions. [2019-09-07 20:01:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:01:48,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 360 [2019-09-07 20:01:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:49,618 INFO L225 Difference]: With dead ends: 216500 [2019-09-07 20:01:49,619 INFO L226 Difference]: Without dead ends: 132946 [2019-09-07 20:01:49,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:01:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132946 states. [2019-09-07 20:01:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132946 to 131709. [2019-09-07 20:01:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131709 states. [2019-09-07 20:01:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131709 states to 131709 states and 192446 transitions. [2019-09-07 20:01:54,066 INFO L78 Accepts]: Start accepts. Automaton has 131709 states and 192446 transitions. Word has length 360 [2019-09-07 20:01:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:54,067 INFO L475 AbstractCegarLoop]: Abstraction has 131709 states and 192446 transitions. [2019-09-07 20:01:54,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:01:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 131709 states and 192446 transitions. [2019-09-07 20:01:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-09-07 20:01:54,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:54,085 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:01:54,085 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:54,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:54,085 INFO L82 PathProgramCache]: Analyzing trace with hash -381323123, now seen corresponding path program 1 times [2019-09-07 20:01:54,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:54,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:54,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:54,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:54,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 179 proven. 198 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-07 20:01:54,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:54,422 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 20:01:54,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:54,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:01:54,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:56,995 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 313 proven. 2 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-07 20:01:57,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:01:57,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-07 20:01:57,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:01:57,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:01:57,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:01:57,015 INFO L87 Difference]: Start difference. First operand 131709 states and 192446 transitions. Second operand 13 states. [2019-09-07 20:03:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:14,170 INFO L93 Difference]: Finished difference Result 397936 states and 676351 transitions. [2019-09-07 20:03:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-07 20:03:14,172 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 367 [2019-09-07 20:03:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:15,348 INFO L225 Difference]: With dead ends: 397936 [2019-09-07 20:03:15,348 INFO L226 Difference]: Without dead ends: 267860 [2019-09-07 20:03:15,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3689 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1269, Invalid=8631, Unknown=0, NotChecked=0, Total=9900 [2019-09-07 20:03:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267860 states. [2019-09-07 20:03:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267860 to 217508. [2019-09-07 20:03:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217508 states. [2019-09-07 20:03:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217508 states to 217508 states and 286386 transitions. [2019-09-07 20:03:21,083 INFO L78 Accepts]: Start accepts. Automaton has 217508 states and 286386 transitions. Word has length 367 [2019-09-07 20:03:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:21,083 INFO L475 AbstractCegarLoop]: Abstraction has 217508 states and 286386 transitions. [2019-09-07 20:03:21,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:03:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 217508 states and 286386 transitions. [2019-09-07 20:03:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-09-07 20:03:21,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:21,199 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:03:21,199 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:21,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1224767314, now seen corresponding path program 1 times [2019-09-07 20:03:21,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:21,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:21,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:21,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:21,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-09-07 20:03:25,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:03:25,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:03:25,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:03:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:03:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:03:25,579 INFO L87 Difference]: Start difference. First operand 217508 states and 286386 transitions. Second operand 4 states. [2019-09-07 20:03:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:37,399 INFO L93 Difference]: Finished difference Result 506702 states and 675982 transitions. [2019-09-07 20:03:37,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:03:37,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 591 [2019-09-07 20:03:37,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:39,168 INFO L225 Difference]: With dead ends: 506702 [2019-09-07 20:03:39,168 INFO L226 Difference]: Without dead ends: 290827 [2019-09-07 20:03:39,432 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 20:03:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290827 states. [2019-09-07 20:03:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290827 to 270486. [2019-09-07 20:03:47,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270486 states. [2019-09-07 20:03:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270486 states to 270486 states and 356763 transitions. [2019-09-07 20:03:48,853 INFO L78 Accepts]: Start accepts. Automaton has 270486 states and 356763 transitions. Word has length 591 [2019-09-07 20:03:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:48,854 INFO L475 AbstractCegarLoop]: Abstraction has 270486 states and 356763 transitions. [2019-09-07 20:03:48,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:03:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 270486 states and 356763 transitions. [2019-09-07 20:03:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2019-09-07 20:03:49,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:49,036 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:03:49,036 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1486472119, now seen corresponding path program 1 times [2019-09-07 20:03:49,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:49,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 275 proven. 133 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 20:03:49,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:49,839 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) [2019-09-07 20:03:49,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:03:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:50,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:03:50,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:50,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:03:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:03:54,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:03:54,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:03:54,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:03:54,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:03:54,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:03:54,489 INFO L87 Difference]: Start difference. First operand 270486 states and 356763 transitions. Second operand 8 states. [2019-09-07 20:04:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:16,561 INFO L93 Difference]: Finished difference Result 614162 states and 818236 transitions. [2019-09-07 20:04:16,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:04:16,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 752 [2019-09-07 20:04:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:17,803 INFO L225 Difference]: With dead ends: 614162 [2019-09-07 20:04:17,803 INFO L226 Difference]: Without dead ends: 345309 [2019-09-07 20:04:18,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:04:18,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345309 states. [2019-09-07 20:04:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345309 to 341946. [2019-09-07 20:04:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341946 states. [2019-09-07 20:04:26,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341946 states to 341946 states and 452354 transitions. [2019-09-07 20:04:26,760 INFO L78 Accepts]: Start accepts. Automaton has 341946 states and 452354 transitions. Word has length 752 [2019-09-07 20:04:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:26,761 INFO L475 AbstractCegarLoop]: Abstraction has 341946 states and 452354 transitions. [2019-09-07 20:04:26,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:04:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 341946 states and 452354 transitions. [2019-09-07 20:04:26,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2019-09-07 20:04:26,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:26,984 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:04:26,984 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:26,984 INFO L82 PathProgramCache]: Analyzing trace with hash -720236800, now seen corresponding path program 1 times [2019-09-07 20:04:26,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:26,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:26,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 282 proven. 360 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:04:33,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:33,854 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 20:04:33,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:34,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:04:34,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 547 proven. 2 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 20:04:34,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:04:34,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 20:04:34,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:04:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:04:34,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:04:34,491 INFO L87 Difference]: Start difference. First operand 341946 states and 452354 transitions. Second operand 13 states. [2019-09-07 20:05:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:05:06,701 INFO L93 Difference]: Finished difference Result 759994 states and 1026708 transitions. [2019-09-07 20:05:06,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 20:05:06,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 890 [2019-09-07 20:05:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:05:08,458 INFO L225 Difference]: With dead ends: 759994 [2019-09-07 20:05:08,458 INFO L226 Difference]: Without dead ends: 419681 [2019-09-07 20:05:09,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1053 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1305, Invalid=7251, Unknown=0, NotChecked=0, Total=8556 [2019-09-07 20:05:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419681 states. [2019-09-07 20:05:23,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419681 to 393062. [2019-09-07 20:05:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393062 states. [2019-09-07 20:05:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393062 states to 393062 states and 501767 transitions. [2019-09-07 20:05:24,740 INFO L78 Accepts]: Start accepts. Automaton has 393062 states and 501767 transitions. Word has length 890 [2019-09-07 20:05:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:05:24,741 INFO L475 AbstractCegarLoop]: Abstraction has 393062 states and 501767 transitions. [2019-09-07 20:05:24,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:05:24,742 INFO L276 IsEmpty]: Start isEmpty. Operand 393062 states and 501767 transitions. [2019-09-07 20:05:31,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1018 [2019-09-07 20:05:31,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:05:31,074 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:31,074 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:05:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:05:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1952951072, now seen corresponding path program 1 times [2019-09-07 20:05:31,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:05:31,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:05:31,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:31,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:31,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 507 proven. 604 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-07 20:05:32,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:05:32,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 20:05:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:33,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:05:33,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:05:33,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:05:33,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:05:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 969 proven. 2 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2019-09-07 20:05:33,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:05:33,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-07 20:05:33,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:05:33,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:05:33,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:05:33,956 INFO L87 Difference]: Start difference. First operand 393062 states and 501767 transitions. Second operand 13 states. [2019-09-07 20:05:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:05:54,252 INFO L93 Difference]: Finished difference Result 769710 states and 966219 transitions. [2019-09-07 20:05:54,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:05:54,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1017 [2019-09-07 20:05:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:05:55,241 INFO L225 Difference]: With dead ends: 769710 [2019-09-07 20:05:55,241 INFO L226 Difference]: Without dead ends: 378281 [2019-09-07 20:05:56,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1101 GetRequests, 1052 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=448, Invalid=1904, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 20:05:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378281 states. [2019-09-07 20:06:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378281 to 365109. [2019-09-07 20:06:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365109 states. [2019-09-07 20:06:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365109 states to 365109 states and 419019 transitions. [2019-09-07 20:06:05,093 INFO L78 Accepts]: Start accepts. Automaton has 365109 states and 419019 transitions. Word has length 1017 [2019-09-07 20:06:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:05,094 INFO L475 AbstractCegarLoop]: Abstraction has 365109 states and 419019 transitions. [2019-09-07 20:06:05,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:06:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 365109 states and 419019 transitions. [2019-09-07 20:06:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2019-09-07 20:06:05,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:05,256 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:05,257 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 615514866, now seen corresponding path program 1 times [2019-09-07 20:06:05,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:05,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:05,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:05,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:05,946 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-07 20:06:06,073 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-07 20:06:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 364 proven. 234 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-07 20:06:13,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:13,506 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 20:06:13,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:13,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1375 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 20:06:13,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-07 20:06:14,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:06:14,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-09-07 20:06:14,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:06:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:06:14,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:06:14,189 INFO L87 Difference]: Start difference. First operand 365109 states and 419019 transitions. Second operand 15 states. [2019-09-07 20:06:15,016 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-07 20:06:17,680 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-07 20:06:19,550 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-07 20:06:25,558 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-09-07 20:06:28,087 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-07 20:06:30,576 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-07 20:06:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:40,573 INFO L93 Difference]: Finished difference Result 753788 states and 867716 transitions. [2019-09-07 20:06:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 20:06:40,574 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1009 [2019-09-07 20:06:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:41,492 INFO L225 Difference]: With dead ends: 753788 [2019-09-07 20:06:41,492 INFO L226 Difference]: Without dead ends: 387083 [2019-09-07 20:06:41,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 1039 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=642, Invalid=2010, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 20:06:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387083 states. [2019-09-07 20:06:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387083 to 370901. [2019-09-07 20:06:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370901 states. [2019-09-07 20:06:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370901 states to 370901 states and 416694 transitions. [2019-09-07 20:06:53,682 INFO L78 Accepts]: Start accepts. Automaton has 370901 states and 416694 transitions. Word has length 1009 [2019-09-07 20:06:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:53,683 INFO L475 AbstractCegarLoop]: Abstraction has 370901 states and 416694 transitions. [2019-09-07 20:06:53,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:06:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 370901 states and 416694 transitions. [2019-09-07 20:06:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2019-09-07 20:06:53,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:53,815 INFO L399 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:53,815 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1006219042, now seen corresponding path program 1 times [2019-09-07 20:06:53,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:53,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:53,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:53,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 601 proven. 140 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-09-07 20:06:59,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:59,730 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 20:06:59,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:07:00,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:07:00,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:07:00,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:07:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 889 proven. 2 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2019-09-07 20:07:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:07:00,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 20:07:00,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:07:00,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:07:00,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:07:00,603 INFO L87 Difference]: Start difference. First operand 370901 states and 416694 transitions. Second operand 11 states. [2019-09-07 20:07:40,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:40,163 INFO L93 Difference]: Finished difference Result 826320 states and 932831 transitions. [2019-09-07 20:07:40,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-07 20:07:40,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1052 [2019-09-07 20:07:40,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:41,525 INFO L225 Difference]: With dead ends: 826320 [2019-09-07 20:07:41,526 INFO L226 Difference]: Without dead ends: 466857 [2019-09-07 20:07:41,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1231 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4025 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1331, Invalid=8971, Unknown=0, NotChecked=0, Total=10302 [2019-09-07 20:07:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466857 states. [2019-09-07 20:07:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466857 to 451308. [2019-09-07 20:07:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451308 states. [2019-09-07 20:07:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451308 states to 451308 states and 499826 transitions. [2019-09-07 20:07:52,645 INFO L78 Accepts]: Start accepts. Automaton has 451308 states and 499826 transitions. Word has length 1052 [2019-09-07 20:07:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:52,646 INFO L475 AbstractCegarLoop]: Abstraction has 451308 states and 499826 transitions. [2019-09-07 20:07:52,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:07:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 451308 states and 499826 transitions. [2019-09-07 20:07:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1176 [2019-09-07 20:07:52,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:52,777 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:07:52,778 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:52,778 INFO L82 PathProgramCache]: Analyzing trace with hash 367794365, now seen corresponding path program 1 times [2019-09-07 20:07:52,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:52,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:52,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:52,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:52,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 987 proven. 9 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-09-07 20:08:01,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:01,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:01,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:01,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:08:01,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 895 proven. 2 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2019-09-07 20:08:02,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:02,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 20:08:02,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:08:02,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:08:02,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:08:02,422 INFO L87 Difference]: Start difference. First operand 451308 states and 499826 transitions. Second operand 6 states. [2019-09-07 20:08:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:15,673 INFO L93 Difference]: Finished difference Result 1012083 states and 1118697 transitions. [2019-09-07 20:08:15,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:08:15,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1175 [2019-09-07 20:08:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:17,086 INFO L225 Difference]: With dead ends: 1012083 [2019-09-07 20:08:17,087 INFO L226 Difference]: Without dead ends: 559940 [2019-09-07 20:08:23,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:08:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559940 states. [2019-09-07 20:08:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559940 to 538201. [2019-09-07 20:08:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538201 states. [2019-09-07 20:08:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538201 states to 538201 states and 581402 transitions. [2019-09-07 20:08:30,663 INFO L78 Accepts]: Start accepts. Automaton has 538201 states and 581402 transitions. Word has length 1175 [2019-09-07 20:08:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:30,664 INFO L475 AbstractCegarLoop]: Abstraction has 538201 states and 581402 transitions. [2019-09-07 20:08:30,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:08:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 538201 states and 581402 transitions. [2019-09-07 20:08:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2019-09-07 20:08:30,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:30,812 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:08:30,812 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1605116560, now seen corresponding path program 1 times [2019-09-07 20:08:30,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:30,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:30,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:30,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:30,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 652 proven. 330 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-09-07 20:08:38,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:38,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:38,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:39,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1686 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 20:08:39,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:39,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1762 backedges. 1245 proven. 15 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-09-07 20:08:40,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:40,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2019-09-07 20:08:40,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:08:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:08:40,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:08:40,202 INFO L87 Difference]: Start difference. First operand 538201 states and 581402 transitions. Second operand 11 states. [2019-09-07 20:09:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:04,807 INFO L93 Difference]: Finished difference Result 1134159 states and 1270213 transitions. [2019-09-07 20:09:04,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 20:09:04,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1269 [2019-09-07 20:09:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:07,777 INFO L225 Difference]: With dead ends: 1134159 [2019-09-07 20:09:07,777 INFO L226 Difference]: Without dead ends: 621848 [2019-09-07 20:09:08,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1297 GetRequests, 1274 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2019-09-07 20:09:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621848 states. [2019-09-07 20:09:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621848 to 606809. [2019-09-07 20:09:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606809 states. [2019-09-07 20:09:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606809 states to 606809 states and 655605 transitions. [2019-09-07 20:09:31,821 INFO L78 Accepts]: Start accepts. Automaton has 606809 states and 655605 transitions. Word has length 1269 [2019-09-07 20:09:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:31,822 INFO L475 AbstractCegarLoop]: Abstraction has 606809 states and 655605 transitions. [2019-09-07 20:09:31,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:09:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 606809 states and 655605 transitions. [2019-09-07 20:09:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1398 [2019-09-07 20:09:31,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:31,990 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:09:31,990 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:31,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -390967807, now seen corresponding path program 1 times [2019-09-07 20:09:31,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:31,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:31,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 634 proven. 917 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 20:09:42,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:42,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:42,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:42,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 1791 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 20:09:42,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:42,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1657 backedges. 259 proven. 23 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-09-07 20:09:44,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:44,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-07 20:09:44,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:09:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:09:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:09:44,115 INFO L87 Difference]: Start difference. First operand 606809 states and 655605 transitions. Second operand 15 states.