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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:37:22,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:37:22,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:37:22,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:37:22,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:37:22,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:37:22,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:37:23,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:37:23,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:37:23,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:37:23,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:37:23,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:37:23,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:37:23,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:37:23,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:37:23,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:37:23,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:37:23,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:37:23,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:37:23,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:37:23,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:37:23,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:37:23,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:37:23,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:37:23,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:37:23,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:37:23,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:37:23,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:37:23,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:37:23,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:37:23,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:37:23,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:37:23,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:37:23,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:37:23,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:37:23,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:37:23,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:37:23,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:37:23,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:37:23,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:37:23,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:37:23,058 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:37:23,093 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:37:23,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:37:23,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:37:23,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:37:23,095 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:37:23,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:37:23,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:37:23,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:37:23,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:37:23,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:37:23,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:37:23,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:37:23,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:37:23,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:37:23,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:37:23,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:37:23,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:37:23,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:37:23,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:37:23,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:37:23,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:37:23,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:37:23,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:37:23,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:37:23,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:37:23,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:37:23,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:37:23,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:37:23,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:37:23,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:37:23,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:37:23,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:37:23,182 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:37:23,182 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:37:23,183 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label28.c [2019-09-07 19:37:23,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e60b8ba2/f2cb62696c0f482eb59183c6e6a696ac/FLAG634348081 [2019-09-07 19:37:24,065 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:37:24,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label28.c [2019-09-07 19:37:24,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e60b8ba2/f2cb62696c0f482eb59183c6e6a696ac/FLAG634348081 [2019-09-07 19:37:24,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e60b8ba2/f2cb62696c0f482eb59183c6e6a696ac [2019-09-07 19:37:24,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:37:24,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:37:24,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:37:24,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:37:24,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:37:24,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:37:24" (1/1) ... [2019-09-07 19:37:24,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6501343a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:24, skipping insertion in model container [2019-09-07 19:37:24,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:37:24" (1/1) ... [2019-09-07 19:37:24,599 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:37:24,770 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:37:26,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:37:26,412 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:37:27,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:37:27,259 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:37:27,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27 WrapperNode [2019-09-07 19:37:27,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:37:27,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:37:27,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:37:27,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:37:27,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (1/1) ... [2019-09-07 19:37:27,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (1/1) ... [2019-09-07 19:37:27,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (1/1) ... [2019-09-07 19:37:27,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (1/1) ... [2019-09-07 19:37:27,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (1/1) ... [2019-09-07 19:37:27,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (1/1) ... [2019-09-07 19:37:27,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (1/1) ... [2019-09-07 19:37:27,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:37:27,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:37:27,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:37:27,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:37:27,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (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:37:27,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:37:27,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:37:27,676 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:37:27,676 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:37:27,676 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:37:27,676 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:37:27,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:37:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:37:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:37:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:37:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:37:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:37:27,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:37:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:37:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:37:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:37:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:37:33,666 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:37:33,667 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:37:33,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:37:33 BoogieIcfgContainer [2019-09-07 19:37:33,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:37:33,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:37:33,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:37:33,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:37:33,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:37:24" (1/3) ... [2019-09-07 19:37:33,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d32bca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:37:33, skipping insertion in model container [2019-09-07 19:37:33,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:37:27" (2/3) ... [2019-09-07 19:37:33,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d32bca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:37:33, skipping insertion in model container [2019-09-07 19:37:33,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:37:33" (3/3) ... [2019-09-07 19:37:33,690 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label28.c [2019-09-07 19:37:33,703 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:37:33,714 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:37:33,732 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:37:33,785 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:37:33,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:37:33,786 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:37:33,786 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:37:33,786 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:37:33,786 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:37:33,786 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:37:33,787 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:37:33,787 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:37:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:37:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-07 19:37:33,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:33,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:33,853 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:33,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1844884208, now seen corresponding path program 1 times [2019-09-07 19:37:33,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:33,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:33,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:34,223 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 19:37:34,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:37:34,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:37:34,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:37:34,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:37:34,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:37:34,248 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:37:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:40,597 INFO L93 Difference]: Finished difference Result 3101 states and 5726 transitions. [2019-09-07 19:37:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:37:40,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-07 19:37:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:40,642 INFO L225 Difference]: With dead ends: 3101 [2019-09-07 19:37:40,643 INFO L226 Difference]: Without dead ends: 1920 [2019-09-07 19:37:40,657 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 19:37:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states. [2019-09-07 19:37:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1903. [2019-09-07 19:37:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-09-07 19:37:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 3344 transitions. [2019-09-07 19:37:40,837 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 3344 transitions. Word has length 21 [2019-09-07 19:37:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:40,838 INFO L475 AbstractCegarLoop]: Abstraction has 1903 states and 3344 transitions. [2019-09-07 19:37:40,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:37:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 3344 transitions. [2019-09-07 19:37:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-07 19:37:40,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:40,843 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:40,844 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:40,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1863802953, now seen corresponding path program 1 times [2019-09-07 19:37:40,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:40,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:40,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:37:41,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:37:41,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:37:41,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:37:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:37:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:37:41,013 INFO L87 Difference]: Start difference. First operand 1903 states and 3344 transitions. Second operand 5 states. [2019-09-07 19:37:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:48,369 INFO L93 Difference]: Finished difference Result 5517 states and 9839 transitions. [2019-09-07 19:37:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:37:48,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-07 19:37:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:48,397 INFO L225 Difference]: With dead ends: 5517 [2019-09-07 19:37:48,397 INFO L226 Difference]: Without dead ends: 3620 [2019-09-07 19:37:48,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:37:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2019-09-07 19:37:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3590. [2019-09-07 19:37:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-09-07 19:37:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 5678 transitions. [2019-09-07 19:37:48,508 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 5678 transitions. Word has length 90 [2019-09-07 19:37:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:48,509 INFO L475 AbstractCegarLoop]: Abstraction has 3590 states and 5678 transitions. [2019-09-07 19:37:48,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:37:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 5678 transitions. [2019-09-07 19:37:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 19:37:48,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:48,511 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:48,512 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1455676717, now seen corresponding path program 1 times [2019-09-07 19:37:48,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:48,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:48,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:37:48,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:37:48,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:37:48,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:37:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:37:48,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:37:48,617 INFO L87 Difference]: Start difference. First operand 3590 states and 5678 transitions. Second operand 5 states. [2019-09-07 19:37:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:37:57,534 INFO L93 Difference]: Finished difference Result 10784 states and 17551 transitions. [2019-09-07 19:37:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:37:57,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-07 19:37:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:37:57,579 INFO L225 Difference]: With dead ends: 10784 [2019-09-07 19:37:57,580 INFO L226 Difference]: Without dead ends: 7200 [2019-09-07 19:37:57,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:37:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7200 states. [2019-09-07 19:37:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7200 to 7049. [2019-09-07 19:37:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7049 states. [2019-09-07 19:37:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7049 states to 7049 states and 10340 transitions. [2019-09-07 19:37:57,792 INFO L78 Accepts]: Start accepts. Automaton has 7049 states and 10340 transitions. Word has length 92 [2019-09-07 19:37:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:37:57,792 INFO L475 AbstractCegarLoop]: Abstraction has 7049 states and 10340 transitions. [2019-09-07 19:37:57,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:37:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 7049 states and 10340 transitions. [2019-09-07 19:37:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 19:37:57,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:37:57,795 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:37:57,795 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:37:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:37:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1966701447, now seen corresponding path program 1 times [2019-09-07 19:37:57,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:37:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:37:57,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:57,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:37:57,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:37:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 19:37:57,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:37:57,943 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 19:37:57,973 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 19:37:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:37:58,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:37:58,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:37:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 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 19:37:58,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:37:58,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-09-07 19:37:58,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:37:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:37:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:37:58,165 INFO L87 Difference]: Start difference. First operand 7049 states and 10340 transitions. Second operand 6 states. [2019-09-07 19:38:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:08,675 INFO L93 Difference]: Finished difference Result 27586 states and 43130 transitions. [2019-09-07 19:38:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:38:08,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-09-07 19:38:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:08,814 INFO L225 Difference]: With dead ends: 27586 [2019-09-07 19:38:08,815 INFO L226 Difference]: Without dead ends: 20543 [2019-09-07 19:38:08,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:38:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20543 states. [2019-09-07 19:38:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20543 to 20390. [2019-09-07 19:38:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20390 states. [2019-09-07 19:38:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20390 states to 20390 states and 29330 transitions. [2019-09-07 19:38:09,459 INFO L78 Accepts]: Start accepts. Automaton has 20390 states and 29330 transitions. Word has length 114 [2019-09-07 19:38:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:09,460 INFO L475 AbstractCegarLoop]: Abstraction has 20390 states and 29330 transitions. [2019-09-07 19:38:09,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:38:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20390 states and 29330 transitions. [2019-09-07 19:38:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-07 19:38:09,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:09,471 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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 19:38:09,471 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:09,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash -424523369, now seen corresponding path program 1 times [2019-09-07 19:38:09,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:09,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:09,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:09,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:38:09,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:09,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:38:09,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:09,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:38:09,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-07 19:38:09,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:38:09,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:38:09,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:38:09,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:38:09,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:38:09,924 INFO L87 Difference]: Start difference. First operand 20390 states and 29330 transitions. Second operand 9 states. [2019-09-07 19:38:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:21,147 INFO L93 Difference]: Finished difference Result 62317 states and 98297 transitions. [2019-09-07 19:38:21,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 19:38:21,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2019-09-07 19:38:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:21,332 INFO L225 Difference]: With dead ends: 62317 [2019-09-07 19:38:21,332 INFO L226 Difference]: Without dead ends: 41933 [2019-09-07 19:38:21,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:38:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41933 states. [2019-09-07 19:38:22,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41933 to 41357. [2019-09-07 19:38:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41357 states. [2019-09-07 19:38:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41357 states to 41357 states and 60108 transitions. [2019-09-07 19:38:22,705 INFO L78 Accepts]: Start accepts. Automaton has 41357 states and 60108 transitions. Word has length 178 [2019-09-07 19:38:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:22,706 INFO L475 AbstractCegarLoop]: Abstraction has 41357 states and 60108 transitions. [2019-09-07 19:38:22,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:38:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 41357 states and 60108 transitions. [2019-09-07 19:38:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-07 19:38:22,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:22,710 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:38:22,711 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1924672796, now seen corresponding path program 1 times [2019-09-07 19:38:22,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:22,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:22,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:22,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:22,927 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 19:38:24,051 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 19:38:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:24,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:38:24,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 95 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:24,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:38:24,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:38:24,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:38:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:38:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:38:24,291 INFO L87 Difference]: Start difference. First operand 41357 states and 60108 transitions. Second operand 9 states. [2019-09-07 19:38:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:38:36,090 INFO L93 Difference]: Finished difference Result 151760 states and 245359 transitions. [2019-09-07 19:38:36,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 19:38:36,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2019-09-07 19:38:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:38:36,629 INFO L225 Difference]: With dead ends: 151760 [2019-09-07 19:38:36,629 INFO L226 Difference]: Without dead ends: 111212 [2019-09-07 19:38:36,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:38:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111212 states. [2019-09-07 19:38:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111212 to 107662. [2019-09-07 19:38:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107662 states. [2019-09-07 19:38:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107662 states to 107662 states and 156686 transitions. [2019-09-07 19:38:42,656 INFO L78 Accepts]: Start accepts. Automaton has 107662 states and 156686 transitions. Word has length 210 [2019-09-07 19:38:42,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:38:42,658 INFO L475 AbstractCegarLoop]: Abstraction has 107662 states and 156686 transitions. [2019-09-07 19:38:42,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:38:42,658 INFO L276 IsEmpty]: Start isEmpty. Operand 107662 states and 156686 transitions. [2019-09-07 19:38:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-07 19:38:42,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:38:42,663 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:38:42,663 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:38:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:38:42,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1165521909, now seen corresponding path program 1 times [2019-09-07 19:38:42,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:38:42,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:38:42,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:42,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:38:42,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:38:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:42,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:38:42,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:38:42,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:38:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:38:42,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:38:42,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:38:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:38:43,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:38:43,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:38:43,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:38:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:38:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:38:43,029 INFO L87 Difference]: Start difference. First operand 107662 states and 156686 transitions. Second operand 9 states. [2019-09-07 19:39:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:00,860 INFO L93 Difference]: Finished difference Result 261733 states and 426694 transitions. [2019-09-07 19:39:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:39:00,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 223 [2019-09-07 19:39:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:01,646 INFO L225 Difference]: With dead ends: 261733 [2019-09-07 19:39:01,647 INFO L226 Difference]: Without dead ends: 154880 [2019-09-07 19:39:01,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:39:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154880 states. [2019-09-07 19:39:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154880 to 152926. [2019-09-07 19:39:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152926 states. [2019-09-07 19:39:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152926 states to 152926 states and 241770 transitions. [2019-09-07 19:39:08,421 INFO L78 Accepts]: Start accepts. Automaton has 152926 states and 241770 transitions. Word has length 223 [2019-09-07 19:39:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:08,421 INFO L475 AbstractCegarLoop]: Abstraction has 152926 states and 241770 transitions. [2019-09-07 19:39:08,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:39:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 152926 states and 241770 transitions. [2019-09-07 19:39:08,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-07 19:39:08,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:08,428 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:39:08,429 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:08,429 INFO L82 PathProgramCache]: Analyzing trace with hash 191470957, now seen corresponding path program 1 times [2019-09-07 19:39:08,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:08,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:08,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:08,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:08,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 41 proven. 151 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 19:39:08,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:08,653 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 19:39:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:08,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:39:08,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-07 19:39:08,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:39:08,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 19:39:08,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:39:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:39:08,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:08,791 INFO L87 Difference]: Start difference. First operand 152926 states and 241770 transitions. Second operand 9 states. [2019-09-07 19:39:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:27,010 INFO L93 Difference]: Finished difference Result 352780 states and 551862 transitions. [2019-09-07 19:39:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:39:27,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 262 [2019-09-07 19:39:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:27,740 INFO L225 Difference]: With dead ends: 352780 [2019-09-07 19:39:27,740 INFO L226 Difference]: Without dead ends: 199847 [2019-09-07 19:39:28,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-09-07 19:39:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199847 states. [2019-09-07 19:39:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199847 to 165884. [2019-09-07 19:39:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165884 states. [2019-09-07 19:39:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165884 states to 165884 states and 229808 transitions. [2019-09-07 19:39:32,456 INFO L78 Accepts]: Start accepts. Automaton has 165884 states and 229808 transitions. Word has length 262 [2019-09-07 19:39:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:32,457 INFO L475 AbstractCegarLoop]: Abstraction has 165884 states and 229808 transitions. [2019-09-07 19:39:32,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:39:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 165884 states and 229808 transitions. [2019-09-07 19:39:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-07 19:39:32,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:32,465 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:39:32,466 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1960920371, now seen corresponding path program 1 times [2019-09-07 19:39:32,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:32,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:32,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:32,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:32,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:32,694 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 208 proven. 71 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 19:39:32,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:39:32,696 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 19:39:32,710 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 19:39:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:32,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:39:32,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:39:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 19:39:32,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:39:32,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:39:32,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:39:32,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:39:32,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:39:32,891 INFO L87 Difference]: Start difference. First operand 165884 states and 229808 transitions. Second operand 9 states. [2019-09-07 19:39:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:39:53,733 INFO L93 Difference]: Finished difference Result 348084 states and 510179 transitions. [2019-09-07 19:39:53,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:39:53,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 293 [2019-09-07 19:39:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:39:54,388 INFO L225 Difference]: With dead ends: 348084 [2019-09-07 19:39:54,388 INFO L226 Difference]: Without dead ends: 183009 [2019-09-07 19:39:54,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:39:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183009 states. [2019-09-07 19:39:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183009 to 180339. [2019-09-07 19:39:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180339 states. [2019-09-07 19:39:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180339 states to 180339 states and 247946 transitions. [2019-09-07 19:39:58,123 INFO L78 Accepts]: Start accepts. Automaton has 180339 states and 247946 transitions. Word has length 293 [2019-09-07 19:39:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:39:58,124 INFO L475 AbstractCegarLoop]: Abstraction has 180339 states and 247946 transitions. [2019-09-07 19:39:58,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:39:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 180339 states and 247946 transitions. [2019-09-07 19:39:58,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-07 19:39:58,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:39:58,131 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:39:58,132 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:39:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:39:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1616687997, now seen corresponding path program 1 times [2019-09-07 19:39:58,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:39:58,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:39:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:58,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:39:58,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:39:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:39:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 19:39:58,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:39:58,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:39:58,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:39:58,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:39:58,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:39:58,302 INFO L87 Difference]: Start difference. First operand 180339 states and 247946 transitions. Second operand 3 states. [2019-09-07 19:40:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:07,102 INFO L93 Difference]: Finished difference Result 307091 states and 425141 transitions. [2019-09-07 19:40:07,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:40:07,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-09-07 19:40:07,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:07,618 INFO L225 Difference]: With dead ends: 307091 [2019-09-07 19:40:07,619 INFO L226 Difference]: Without dead ends: 125932 [2019-09-07 19:40:07,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:40:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125932 states. [2019-09-07 19:40:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125932 to 117752. [2019-09-07 19:40:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117752 states. [2019-09-07 19:40:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117752 states to 117752 states and 149071 transitions. [2019-09-07 19:40:10,180 INFO L78 Accepts]: Start accepts. Automaton has 117752 states and 149071 transitions. Word has length 293 [2019-09-07 19:40:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:10,180 INFO L475 AbstractCegarLoop]: Abstraction has 117752 states and 149071 transitions. [2019-09-07 19:40:10,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:40:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 117752 states and 149071 transitions. [2019-09-07 19:40:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-07 19:40:10,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:10,188 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:40:10,188 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:10,189 INFO L82 PathProgramCache]: Analyzing trace with hash -610882315, now seen corresponding path program 1 times [2019-09-07 19:40:10,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:10,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:10,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 133 proven. 69 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 19:40:10,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:10,412 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 19:40:10,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:10,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:40:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 19:40:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:40:10,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:40:10,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:40:10,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:40:10,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:40:10,642 INFO L87 Difference]: Start difference. First operand 117752 states and 149071 transitions. Second operand 9 states. [2019-09-07 19:40:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:40:44,197 INFO L93 Difference]: Finished difference Result 325985 states and 491776 transitions. [2019-09-07 19:40:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 19:40:44,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 299 [2019-09-07 19:40:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:40:45,157 INFO L225 Difference]: With dead ends: 325985 [2019-09-07 19:40:45,158 INFO L226 Difference]: Without dead ends: 209042 [2019-09-07 19:40:45,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2019-09-07 19:40:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209042 states. [2019-09-07 19:40:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209042 to 203491. [2019-09-07 19:40:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203491 states. [2019-09-07 19:40:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203491 states to 203491 states and 276067 transitions. [2019-09-07 19:40:49,819 INFO L78 Accepts]: Start accepts. Automaton has 203491 states and 276067 transitions. Word has length 299 [2019-09-07 19:40:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:40:49,820 INFO L475 AbstractCegarLoop]: Abstraction has 203491 states and 276067 transitions. [2019-09-07 19:40:49,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:40:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 203491 states and 276067 transitions. [2019-09-07 19:40:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-07 19:40:49,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:40:49,831 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:40:49,832 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:40:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:40:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1011341809, now seen corresponding path program 1 times [2019-09-07 19:40:49,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:40:49,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:40:49,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:49,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:40:49,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:40:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-09-07 19:40:53,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:40:53,324 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) [2019-09-07 19:40:53,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:40:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:40:53,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:40:53,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:40:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 19:40:53,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:40:53,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 19:40:53,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:40:53,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:40:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:40:53,635 INFO L87 Difference]: Start difference. First operand 203491 states and 276067 transitions. Second operand 4 states. [2019-09-07 19:41:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:41:01,292 INFO L93 Difference]: Finished difference Result 392212 states and 535970 transitions. [2019-09-07 19:41:01,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:41:01,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2019-09-07 19:41:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:41:01,969 INFO L225 Difference]: With dead ends: 392212 [2019-09-07 19:41:01,969 INFO L226 Difference]: Without dead ends: 202593 [2019-09-07 19:41:02,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:41:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202593 states. [2019-09-07 19:41:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202593 to 202591. [2019-09-07 19:41:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202591 states. [2019-09-07 19:41:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202591 states to 202591 states and 274220 transitions. [2019-09-07 19:41:09,457 INFO L78 Accepts]: Start accepts. Automaton has 202591 states and 274220 transitions. Word has length 380 [2019-09-07 19:41:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:41:09,457 INFO L475 AbstractCegarLoop]: Abstraction has 202591 states and 274220 transitions. [2019-09-07 19:41:09,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:41:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 202591 states and 274220 transitions. [2019-09-07 19:41:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-07 19:41:09,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:41:09,473 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:41:09,474 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:41:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:41:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash -587887470, now seen corresponding path program 1 times [2019-09-07 19:41:09,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:41:09,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:41:09,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:09,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:09,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:41:09,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:41:09,722 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 19:41:09,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:09,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:41:09,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:41:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:41:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-07 19:41:10,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:41:10,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:41:10,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:41:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:41:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:41:10,019 INFO L87 Difference]: Start difference. First operand 202591 states and 274220 transitions. Second operand 8 states. [2019-09-07 19:41:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:41:35,692 INFO L93 Difference]: Finished difference Result 429221 states and 584140 transitions. [2019-09-07 19:41:35,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 19:41:35,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 382 [2019-09-07 19:41:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:41:37,360 INFO L225 Difference]: With dead ends: 429221 [2019-09-07 19:41:37,361 INFO L226 Difference]: Without dead ends: 227439 [2019-09-07 19:41:37,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2019-09-07 19:41:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227439 states. [2019-09-07 19:41:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227439 to 224008. [2019-09-07 19:41:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224008 states. [2019-09-07 19:41:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224008 states to 224008 states and 302315 transitions. [2019-09-07 19:41:42,214 INFO L78 Accepts]: Start accepts. Automaton has 224008 states and 302315 transitions. Word has length 382 [2019-09-07 19:41:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:41:42,214 INFO L475 AbstractCegarLoop]: Abstraction has 224008 states and 302315 transitions. [2019-09-07 19:41:42,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:41:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 224008 states and 302315 transitions. [2019-09-07 19:41:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-07 19:41:42,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:41:42,221 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1] [2019-09-07 19:41:42,222 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:41:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:41:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1536891140, now seen corresponding path program 1 times [2019-09-07 19:41:42,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:41:42,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:41:42,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:42,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:42,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:41:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 107 proven. 285 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-07 19:41:42,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:41:42,551 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 19:41:42,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:41:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:41:42,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:41:42,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:41:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 358 proven. 2 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-09-07 19:41:44,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:41:44,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 19:41:44,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:41:44,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:41:44,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:41:44,100 INFO L87 Difference]: Start difference. First operand 224008 states and 302315 transitions. Second operand 12 states. [2019-09-07 19:42:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:42:35,075 INFO L93 Difference]: Finished difference Result 576476 states and 784426 transitions. [2019-09-07 19:42:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 19:42:35,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 390 [2019-09-07 19:42:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:42:37,188 INFO L225 Difference]: With dead ends: 576476 [2019-09-07 19:42:37,188 INFO L226 Difference]: Without dead ends: 353277 [2019-09-07 19:42:37,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 19:42:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353277 states. [2019-09-07 19:42:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353277 to 315233. [2019-09-07 19:42:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315233 states. [2019-09-07 19:42:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315233 states to 315233 states and 394978 transitions. [2019-09-07 19:42:48,905 INFO L78 Accepts]: Start accepts. Automaton has 315233 states and 394978 transitions. Word has length 390 [2019-09-07 19:42:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:42:48,906 INFO L475 AbstractCegarLoop]: Abstraction has 315233 states and 394978 transitions. [2019-09-07 19:42:48,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:42:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 315233 states and 394978 transitions. [2019-09-07 19:42:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-09-07 19:42:48,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:42:48,919 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-09-07 19:42:48,919 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:42:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:42:48,920 INFO L82 PathProgramCache]: Analyzing trace with hash -190841502, now seen corresponding path program 1 times [2019-09-07 19:42:48,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:42:48,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:42:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:42:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 267 proven. 2 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-09-07 19:42:50,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:42:50,169 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 19:42:50,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:42:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:42:50,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:42:50,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:42:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 267 proven. 2 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-09-07 19:42:50,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:42:50,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 19:42:50,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:42:50,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:42:50,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:42:50,408 INFO L87 Difference]: Start difference. First operand 315233 states and 394978 transitions. Second operand 7 states. [2019-09-07 19:43:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:43:07,909 INFO L93 Difference]: Finished difference Result 614855 states and 773429 transitions. [2019-09-07 19:43:07,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 19:43:07,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 457 [2019-09-07 19:43:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:43:08,852 INFO L225 Difference]: With dead ends: 614855 [2019-09-07 19:43:08,852 INFO L226 Difference]: Without dead ends: 316708 [2019-09-07 19:43:10,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:43:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316708 states. [2019-09-07 19:43:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316708 to 308425. [2019-09-07 19:43:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308425 states. [2019-09-07 19:43:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308425 states to 308425 states and 380360 transitions. [2019-09-07 19:43:21,449 INFO L78 Accepts]: Start accepts. Automaton has 308425 states and 380360 transitions. Word has length 457 [2019-09-07 19:43:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:43:21,450 INFO L475 AbstractCegarLoop]: Abstraction has 308425 states and 380360 transitions. [2019-09-07 19:43:21,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:43:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 308425 states and 380360 transitions. [2019-09-07 19:43:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-09-07 19:43:21,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:43:21,463 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:43:21,463 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:43:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:43:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash 314403709, now seen corresponding path program 1 times [2019-09-07 19:43:21,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:43:21,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:43:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:21,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:43:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:43:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 299 proven. 71 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-09-07 19:43:21,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:43:21,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:43:21,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:43:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:43:21,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:43:21,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:43:22,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:43:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 605 proven. 2 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-07 19:43:23,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:43:23,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 19:43:23,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:43:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:43:23,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:43:23,095 INFO L87 Difference]: Start difference. First operand 308425 states and 380360 transitions. Second operand 11 states. [2019-09-07 19:44:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:44:06,962 INFO L93 Difference]: Finished difference Result 719485 states and 887882 transitions. [2019-09-07 19:44:06,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-07 19:44:06,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 530 [2019-09-07 19:44:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:44:08,581 INFO L225 Difference]: With dead ends: 719485 [2019-09-07 19:44:08,581 INFO L226 Difference]: Without dead ends: 406989 [2019-09-07 19:44:09,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 610 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4247 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1388, Invalid=9324, Unknown=0, NotChecked=0, Total=10712 [2019-09-07 19:44:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406989 states. [2019-09-07 19:44:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406989 to 390588. [2019-09-07 19:44:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390588 states. [2019-09-07 19:44:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390588 states to 390588 states and 466741 transitions. [2019-09-07 19:44:18,646 INFO L78 Accepts]: Start accepts. Automaton has 390588 states and 466741 transitions. Word has length 530 [2019-09-07 19:44:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:44:18,647 INFO L475 AbstractCegarLoop]: Abstraction has 390588 states and 466741 transitions. [2019-09-07 19:44:18,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:44:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 390588 states and 466741 transitions. [2019-09-07 19:44:18,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2019-09-07 19:44:18,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:44:18,663 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-09-07 19:44:18,664 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:44:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:44:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1162069761, now seen corresponding path program 1 times [2019-09-07 19:44:18,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:44:18,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:44:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:18,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:18,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:44:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:26,915 WARN L188 SmtUtils]: Spent 7.61 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-07 19:44:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 378 proven. 430 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-07 19:44:27,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:44:27,871 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 19:44:27,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:44:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:44:28,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:44:28,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:44:28,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:44:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 616 proven. 2 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-09-07 19:44:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:44:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8] total 26 [2019-09-07 19:44:28,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 19:44:28,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 19:44:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2019-09-07 19:44:28,464 INFO L87 Difference]: Start difference. First operand 390588 states and 466741 transitions. Second operand 26 states. [2019-09-07 19:44:47,316 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-07 19:44:49,917 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-07 19:44:52,872 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-07 19:44:53,981 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-07 19:44:55,907 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-07 19:44:56,433 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-07 19:44:56,884 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-07 19:44:59,036 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2019-09-07 19:45:00,177 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-07 19:45:01,872 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-07 19:45:02,942 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-07 19:45:04,735 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-07 19:45:14,850 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-09-07 19:45:16,785 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-07 19:45:22,057 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 19:45:30,172 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-07 19:45:31,215 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-07 19:45:35,697 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-07 19:45:35,917 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-09-07 19:45:36,663 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-09-07 19:45:40,385 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-09-07 19:45:41,629 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-09-07 19:45:51,194 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 19:45:52,589 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 19:46:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:00,819 INFO L93 Difference]: Finished difference Result 858281 states and 1051789 transitions. [2019-09-07 19:46:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2019-09-07 19:46:00,819 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 578 [2019-09-07 19:46:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:46:02,316 INFO L225 Difference]: With dead ends: 858281 [2019-09-07 19:46:02,316 INFO L226 Difference]: Without dead ends: 453079 [2019-09-07 19:46:02,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28587 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=7766, Invalid=59574, Unknown=0, NotChecked=0, Total=67340 [2019-09-07 19:46:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453079 states. [2019-09-07 19:46:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453079 to 434967. [2019-09-07 19:46:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434967 states. [2019-09-07 19:46:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434967 states to 434967 states and 507308 transitions. [2019-09-07 19:46:15,027 INFO L78 Accepts]: Start accepts. Automaton has 434967 states and 507308 transitions. Word has length 578 [2019-09-07 19:46:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:46:15,028 INFO L475 AbstractCegarLoop]: Abstraction has 434967 states and 507308 transitions. [2019-09-07 19:46:15,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 19:46:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 434967 states and 507308 transitions. [2019-09-07 19:46:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-07 19:46:15,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:46:15,034 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:15,034 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:46:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:46:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -855423063, now seen corresponding path program 1 times [2019-09-07 19:46:15,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:46:15,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:46:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:15,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:46:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 268 proven. 69 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-09-07 19:46:21,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:46:21,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:46:21,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:46:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:46:21,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 19:46:21,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:46:21,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:46:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 267 proven. 2 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-09-07 19:46:22,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:46:22,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:46:22,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:46:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:46:22,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:46:22,191 INFO L87 Difference]: Start difference. First operand 434967 states and 507308 transitions. Second operand 9 states. [2019-09-07 19:46:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:46:52,165 INFO L93 Difference]: Finished difference Result 900786 states and 1102659 transitions. [2019-09-07 19:46:52,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 19:46:52,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 609 [2019-09-07 19:46:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:00,161 INFO L225 Difference]: With dead ends: 900786 [2019-09-07 19:47:00,161 INFO L226 Difference]: Without dead ends: 491796 [2019-09-07 19:47:00,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=383, Invalid=1687, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 19:47:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491796 states. [2019-09-07 19:47:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491796 to 483491. [2019-09-07 19:47:07,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483491 states. [2019-09-07 19:47:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483491 states to 483491 states and 564476 transitions. [2019-09-07 19:47:17,804 INFO L78 Accepts]: Start accepts. Automaton has 483491 states and 564476 transitions. Word has length 609 [2019-09-07 19:47:17,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:47:17,805 INFO L475 AbstractCegarLoop]: Abstraction has 483491 states and 564476 transitions. [2019-09-07 19:47:17,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:47:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 483491 states and 564476 transitions. [2019-09-07 19:47:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2019-09-07 19:47:17,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:47:17,820 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 19:47:17,820 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:47:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:47:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2121139877, now seen corresponding path program 1 times [2019-09-07 19:47:17,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:47:17,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:47:17,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:17,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:47:17,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:47:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 319 proven. 156 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-09-07 19:47:20,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:47:20,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:47:20,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:47:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:47:20,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:47:20,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:47:20,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:47:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 353 proven. 2 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-09-07 19:47:20,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:47:20,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 19:47:20,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:47:20,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:47:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:47:20,674 INFO L87 Difference]: Start difference. First operand 483491 states and 564476 transitions. Second operand 10 states. [2019-09-07 19:47:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:47:51,502 INFO L93 Difference]: Finished difference Result 948746 states and 1107640 transitions. [2019-09-07 19:47:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 19:47:51,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 799 [2019-09-07 19:47:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:47:52,723 INFO L225 Difference]: With dead ends: 948746 [2019-09-07 19:47:52,723 INFO L226 Difference]: Without dead ends: 465253 [2019-09-07 19:47:54,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=664, Invalid=2996, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 19:47:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465253 states. [2019-09-07 19:48:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465253 to 442951. [2019-09-07 19:48:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442951 states. [2019-09-07 19:48:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442951 states to 442951 states and 490262 transitions. [2019-09-07 19:48:14,324 INFO L78 Accepts]: Start accepts. Automaton has 442951 states and 490262 transitions. Word has length 799 [2019-09-07 19:48:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:48:14,325 INFO L475 AbstractCegarLoop]: Abstraction has 442951 states and 490262 transitions. [2019-09-07 19:48:14,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 19:48:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 442951 states and 490262 transitions. [2019-09-07 19:48:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2019-09-07 19:48:14,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:48:14,352 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:48:14,352 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:48:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:48:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2124463066, now seen corresponding path program 1 times [2019-09-07 19:48:14,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:48:14,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:48:14,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:14,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:14,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:48:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 86 proven. 595 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-09-07 19:48:15,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:48:15,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:48:15,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:48:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:48:16,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 19:48:16,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:48:16,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:48:16,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:48:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:48:16,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:48:18,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:48:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 733 proven. 2 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 19:48:19,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:48:19,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-09-07 19:48:19,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:48:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:48:19,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=103, Unknown=1, NotChecked=0, Total=132 [2019-09-07 19:48:19,352 INFO L87 Difference]: Start difference. First operand 442951 states and 490262 transitions. Second operand 12 states. [2019-09-07 19:48:24,292 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-09-07 19:48:34,946 WARN L188 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 37 DAG size of output: 17