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/Problem14_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:08:39,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:08:39,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:08:39,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:08:39,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:08:39,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:08:39,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:08:39,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:08:39,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:08:39,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:08:39,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:08:39,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:08:39,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:08:39,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:08:39,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:08:39,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:08:39,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:08:39,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:08:39,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:08:39,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:08:39,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:08:39,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:08:39,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:08:39,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:08:39,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:08:39,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:08:39,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:08:39,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:08:39,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:08:39,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:08:39,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:08:39,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:08:39,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:08:39,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:08:39,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:08:39,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:08:39,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:08:39,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:08:39,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:08:39,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:08:39,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:08:39,665 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 20:08:39,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:08:39,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:08:39,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:08:39,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:08:39,695 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:08:39,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:08:39,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:08:39,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:08:39,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:08:39,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:08:39,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:08:39,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:08:39,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:08:39,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:08:39,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:08:39,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:08:39,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:08:39,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:08:39,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:08:39,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:08:39,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:08:39,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:08:39,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:08:39,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:08:39,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:08:39,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:08:39,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:08:39,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:08:39,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:08:39,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:08:39,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:08:39,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:08:39,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:08:39,750 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:08:39,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label13.c [2019-09-07 20:08:39,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6a334e8/a52e1630f3d14aaf8a23d5993b95750a/FLAGb810f3580 [2019-09-07 20:08:40,365 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:08:40,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label13.c [2019-09-07 20:08:40,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6a334e8/a52e1630f3d14aaf8a23d5993b95750a/FLAGb810f3580 [2019-09-07 20:08:40,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6a334e8/a52e1630f3d14aaf8a23d5993b95750a [2019-09-07 20:08:40,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:08:40,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:08:40,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:08:40,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:08:40,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:08:40,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:08:40" (1/1) ... [2019-09-07 20:08:40,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f22801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:40, skipping insertion in model container [2019-09-07 20:08:40,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:08:40" (1/1) ... [2019-09-07 20:08:40,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:08:40,700 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:08:41,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:08:41,338 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:08:41,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:08:41,534 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:08:41,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41 WrapperNode [2019-09-07 20:08:41,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:08:41,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:08:41,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:08:41,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:08:41,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (1/1) ... [2019-09-07 20:08:41,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (1/1) ... [2019-09-07 20:08:41,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (1/1) ... [2019-09-07 20:08:41,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (1/1) ... [2019-09-07 20:08:41,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (1/1) ... [2019-09-07 20:08:41,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (1/1) ... [2019-09-07 20:08:41,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (1/1) ... [2019-09-07 20:08:41,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:08:41,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:08:41,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:08:41,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:08:41,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (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 20:08:41,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:08:41,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:08:41,754 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:08:41,754 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:08:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:08:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:08:41,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:08:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:08:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:08:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:08:41,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:08:43,081 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:08:43,082 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:08:43,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:08:43 BoogieIcfgContainer [2019-09-07 20:08:43,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:08:43,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:08:43,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:08:43,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:08:43,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:08:40" (1/3) ... [2019-09-07 20:08:43,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b21f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:08:43, skipping insertion in model container [2019-09-07 20:08:43,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:08:41" (2/3) ... [2019-09-07 20:08:43,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b21f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:08:43, skipping insertion in model container [2019-09-07 20:08:43,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:08:43" (3/3) ... [2019-09-07 20:08:43,106 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label13.c [2019-09-07 20:08:43,117 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:08:43,127 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:08:43,145 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:08:43,187 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:08:43,188 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:08:43,188 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:08:43,188 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:08:43,188 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:08:43,189 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:08:43,189 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:08:43,189 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:08:43,189 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:08:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-07 20:08:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 20:08:43,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:43,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:08:43,237 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2000136683, now seen corresponding path program 1 times [2019-09-07 20:08:43,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:43,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:43,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:43,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:43,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:08:43,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:08:43,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:08:43,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:08:43,577 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-09-07 20:08:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:44,710 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-09-07 20:08:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:08:44,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 20:08:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:44,728 INFO L225 Difference]: With dead ends: 688 [2019-09-07 20:08:44,729 INFO L226 Difference]: Without dead ends: 372 [2019-09-07 20:08:44,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:08:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-07 20:08:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-09-07 20:08:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-07 20:08:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-09-07 20:08:44,820 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 30 [2019-09-07 20:08:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:44,821 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-09-07 20:08:44,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:08:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-09-07 20:08:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 20:08:44,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:44,832 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:08:44,832 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:44,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash -133245227, now seen corresponding path program 1 times [2019-09-07 20:08:44,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:44,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:44,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:44,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:44,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:45,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:45,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:08:45,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:08:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:08:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:08:45,129 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-09-07 20:08:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:46,422 INFO L93 Difference]: Finished difference Result 1122 states and 1837 transitions. [2019-09-07 20:08:46,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:08:46,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-07 20:08:46,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:46,429 INFO L225 Difference]: With dead ends: 1122 [2019-09-07 20:08:46,429 INFO L226 Difference]: Without dead ends: 756 [2019-09-07 20:08:46,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:08:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-09-07 20:08:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 752. [2019-09-07 20:08:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-09-07 20:08:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1190 transitions. [2019-09-07 20:08:46,488 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1190 transitions. Word has length 99 [2019-09-07 20:08:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:46,488 INFO L475 AbstractCegarLoop]: Abstraction has 752 states and 1190 transitions. [2019-09-07 20:08:46,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:08:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1190 transitions. [2019-09-07 20:08:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 20:08:46,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:46,491 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:08:46,491 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:46,492 INFO L82 PathProgramCache]: Analyzing trace with hash 426369582, now seen corresponding path program 1 times [2019-09-07 20:08:46,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:46,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:46,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:46,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:46,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:46,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:46,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:08:46,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:08:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:08:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:08:46,612 INFO L87 Difference]: Start difference. First operand 752 states and 1190 transitions. Second operand 5 states. [2019-09-07 20:08:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:47,787 INFO L93 Difference]: Finished difference Result 1904 states and 3099 transitions. [2019-09-07 20:08:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 20:08:47,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-07 20:08:47,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:47,802 INFO L225 Difference]: With dead ends: 1904 [2019-09-07 20:08:47,803 INFO L226 Difference]: Without dead ends: 1158 [2019-09-07 20:08:47,806 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 20:08:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-07 20:08:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1138. [2019-09-07 20:08:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2019-09-07 20:08:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1632 transitions. [2019-09-07 20:08:47,876 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1632 transitions. Word has length 100 [2019-09-07 20:08:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:47,877 INFO L475 AbstractCegarLoop]: Abstraction has 1138 states and 1632 transitions. [2019-09-07 20:08:47,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:08:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1632 transitions. [2019-09-07 20:08:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 20:08:47,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:47,888 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:08:47,888 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2046973942, now seen corresponding path program 1 times [2019-09-07 20:08:47,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:47,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:47,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:47,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:47,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:48,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:48,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 20:08:48,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 20:08:48,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 20:08:48,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 20:08:48,027 INFO L87 Difference]: Start difference. First operand 1138 states and 1632 transitions. Second operand 5 states. [2019-09-07 20:08:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:50,268 INFO L93 Difference]: Finished difference Result 2880 states and 4162 transitions. [2019-09-07 20:08:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 20:08:50,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-07 20:08:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:50,279 INFO L225 Difference]: With dead ends: 2880 [2019-09-07 20:08:50,280 INFO L226 Difference]: Without dead ends: 1748 [2019-09-07 20:08:50,283 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 20:08:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-09-07 20:08:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1326. [2019-09-07 20:08:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-09-07 20:08:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1863 transitions. [2019-09-07 20:08:50,345 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1863 transitions. Word has length 102 [2019-09-07 20:08:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:50,345 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 1863 transitions. [2019-09-07 20:08:50,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 20:08:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1863 transitions. [2019-09-07 20:08:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 20:08:50,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:50,351 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:08:50,351 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:50,351 INFO L82 PathProgramCache]: Analyzing trace with hash -829635937, now seen corresponding path program 1 times [2019-09-07 20:08:50,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:50,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:50,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:50,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 20:08:50,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:50,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:08:50,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:08:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:08:50,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:08:50,473 INFO L87 Difference]: Start difference. First operand 1326 states and 1863 transitions. Second operand 4 states. [2019-09-07 20:08:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:51,883 INFO L93 Difference]: Finished difference Result 4128 states and 5824 transitions. [2019-09-07 20:08:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:08:51,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-07 20:08:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:51,900 INFO L225 Difference]: With dead ends: 4128 [2019-09-07 20:08:51,900 INFO L226 Difference]: Without dead ends: 2808 [2019-09-07 20:08:51,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:08:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-09-07 20:08:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1712. [2019-09-07 20:08:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1712 states. [2019-09-07 20:08:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2319 transitions. [2019-09-07 20:08:51,961 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2319 transitions. Word has length 186 [2019-09-07 20:08:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:51,962 INFO L475 AbstractCegarLoop]: Abstraction has 1712 states and 2319 transitions. [2019-09-07 20:08:51,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:08:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2319 transitions. [2019-09-07 20:08:51,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-07 20:08:51,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:51,968 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:08:51,968 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 394049049, now seen corresponding path program 1 times [2019-09-07 20:08:51,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:51,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:08:52,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:52,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:08:52,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:52,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:08:52,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:53,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:08:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 20:08:53,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:08:53,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-07 20:08:53,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:08:53,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:08:53,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:08:53,142 INFO L87 Difference]: Start difference. First operand 1712 states and 2319 transitions. Second operand 13 states. [2019-09-07 20:08:57,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:57,663 INFO L93 Difference]: Finished difference Result 3698 states and 5205 transitions. [2019-09-07 20:08:57,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 20:08:57,664 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 246 [2019-09-07 20:08:57,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:57,676 INFO L225 Difference]: With dead ends: 3698 [2019-09-07 20:08:57,677 INFO L226 Difference]: Without dead ends: 1992 [2019-09-07 20:08:57,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 252 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=347, Invalid=1135, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 20:08:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2019-09-07 20:08:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1918. [2019-09-07 20:08:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1918 states. [2019-09-07 20:08:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 2422 transitions. [2019-09-07 20:08:57,744 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 2422 transitions. Word has length 246 [2019-09-07 20:08:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:57,744 INFO L475 AbstractCegarLoop]: Abstraction has 1918 states and 2422 transitions. [2019-09-07 20:08:57,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:08:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2422 transitions. [2019-09-07 20:08:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-07 20:08:57,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:57,752 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:08:57,753 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash 137289564, now seen corresponding path program 1 times [2019-09-07 20:08:57,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:57,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:57,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 155 proven. 182 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:08:59,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:08:59,005 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 20:08:59,033 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 20:08:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:59,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 20:08:59,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:08:59,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:08:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 264 proven. 53 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 20:08:59,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:08:59,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-09-07 20:08:59,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:08:59,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:08:59,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:08:59,595 INFO L87 Difference]: Start difference. First operand 1918 states and 2422 transitions. Second operand 15 states. [2019-09-07 20:09:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:02,346 INFO L93 Difference]: Finished difference Result 3937 states and 4987 transitions. [2019-09-07 20:09:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:09:02,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 348 [2019-09-07 20:09:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:02,355 INFO L225 Difference]: With dead ends: 3937 [2019-09-07 20:09:02,355 INFO L226 Difference]: Without dead ends: 1974 [2019-09-07 20:09:02,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-09-07 20:09:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-09-07 20:09:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1908. [2019-09-07 20:09:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1908 states. [2019-09-07 20:09:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2253 transitions. [2019-09-07 20:09:02,406 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2253 transitions. Word has length 348 [2019-09-07 20:09:02,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:02,406 INFO L475 AbstractCegarLoop]: Abstraction has 1908 states and 2253 transitions. [2019-09-07 20:09:02,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 20:09:02,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2253 transitions. [2019-09-07 20:09:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-07 20:09:02,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:02,414 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:09:02,414 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:02,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:02,415 INFO L82 PathProgramCache]: Analyzing trace with hash -615657617, now seen corresponding path program 1 times [2019-09-07 20:09:02,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:02,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:02,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:02,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 278 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 20:09:02,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:02,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:09:02,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:02,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:09:02,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:02,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:09:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-07 20:09:02,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:09:02,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 20:09:02,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:09:02,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:09:02,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:09:02,873 INFO L87 Difference]: Start difference. First operand 1908 states and 2253 transitions. Second operand 8 states. [2019-09-07 20:09:06,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:06,187 INFO L93 Difference]: Finished difference Result 5878 states and 7078 transitions. [2019-09-07 20:09:06,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 20:09:06,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 373 [2019-09-07 20:09:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:06,203 INFO L225 Difference]: With dead ends: 5878 [2019-09-07 20:09:06,204 INFO L226 Difference]: Without dead ends: 3976 [2019-09-07 20:09:06,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2019-09-07 20:09:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states. [2019-09-07 20:09:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 3588. [2019-09-07 20:09:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-09-07 20:09:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 4104 transitions. [2019-09-07 20:09:06,290 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 4104 transitions. Word has length 373 [2019-09-07 20:09:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:06,291 INFO L475 AbstractCegarLoop]: Abstraction has 3588 states and 4104 transitions. [2019-09-07 20:09:06,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:09:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 4104 transitions. [2019-09-07 20:09:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2019-09-07 20:09:06,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:06,304 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 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] [2019-09-07 20:09:06,304 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:06,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1902727541, now seen corresponding path program 1 times [2019-09-07 20:09:06,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:06,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:06,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 206 proven. 441 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 20:09:06,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:06,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:06,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:07,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:09:07,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:07,359 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 636 proven. 2 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-07 20:09:07,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:07,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 20:09:07,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 20:09:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 20:09:07,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-07 20:09:07,374 INFO L87 Difference]: Start difference. First operand 3588 states and 4104 transitions. Second operand 11 states. [2019-09-07 20:09:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:10,476 INFO L93 Difference]: Finished difference Result 8494 states and 9849 transitions. [2019-09-07 20:09:10,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-07 20:09:10,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 508 [2019-09-07 20:09:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:10,500 INFO L225 Difference]: With dead ends: 8494 [2019-09-07 20:09:10,501 INFO L226 Difference]: Without dead ends: 5094 [2019-09-07 20:09:10,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 529 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 20:09:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2019-09-07 20:09:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 4514. [2019-09-07 20:09:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4514 states. [2019-09-07 20:09:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4514 states to 4514 states and 5124 transitions. [2019-09-07 20:09:10,627 INFO L78 Accepts]: Start accepts. Automaton has 4514 states and 5124 transitions. Word has length 508 [2019-09-07 20:09:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:10,628 INFO L475 AbstractCegarLoop]: Abstraction has 4514 states and 5124 transitions. [2019-09-07 20:09:10,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:09:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4514 states and 5124 transitions. [2019-09-07 20:09:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-09-07 20:09:10,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:10,650 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-09-07 20:09:10,650 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:10,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1891437924, now seen corresponding path program 1 times [2019-09-07 20:09:10,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:10,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:10,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:10,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 438 proven. 499 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-07 20:09:11,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:11,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:11,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:12,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 20:09:12,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:12,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-07 20:09:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1127 backedges. 830 proven. 2 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-09-07 20:09:12,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:12,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-09-07 20:09:12,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:09:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:09:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:09:12,454 INFO L87 Difference]: Start difference. First operand 4514 states and 5124 transitions. Second operand 13 states. [2019-09-07 20:09:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:14,626 INFO L93 Difference]: Finished difference Result 9013 states and 10549 transitions. [2019-09-07 20:09:14,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:09:14,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 592 [2019-09-07 20:09:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:14,650 INFO L225 Difference]: With dead ends: 9013 [2019-09-07 20:09:14,650 INFO L226 Difference]: Without dead ends: 4640 [2019-09-07 20:09:14,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:09:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2019-09-07 20:09:14,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4150. [2019-09-07 20:09:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4150 states. [2019-09-07 20:09:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 4591 transitions. [2019-09-07 20:09:14,793 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 4591 transitions. Word has length 592 [2019-09-07 20:09:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:14,794 INFO L475 AbstractCegarLoop]: Abstraction has 4150 states and 4591 transitions. [2019-09-07 20:09:14,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:09:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 4591 transitions. [2019-09-07 20:09:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2019-09-07 20:09:14,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:14,807 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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 20:09:14,807 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash -77773250, now seen corresponding path program 1 times [2019-09-07 20:09:14,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:14,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:14,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:14,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:14,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 460 proven. 104 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-09-07 20:09:15,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:15,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:15,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:09:15,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 840 proven. 2 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-07 20:09:16,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:16,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:09:16,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:09:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:09:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:09:16,189 INFO L87 Difference]: Start difference. First operand 4150 states and 4591 transitions. Second operand 7 states. [2019-09-07 20:09:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:17,870 INFO L93 Difference]: Finished difference Result 10192 states and 12127 transitions. [2019-09-07 20:09:17,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 20:09:17,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 642 [2019-09-07 20:09:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:17,897 INFO L225 Difference]: With dead ends: 10192 [2019-09-07 20:09:17,897 INFO L226 Difference]: Without dead ends: 6048 [2019-09-07 20:09:17,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:09:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2019-09-07 20:09:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 5470. [2019-09-07 20:09:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5470 states. [2019-09-07 20:09:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5470 states to 5470 states and 6090 transitions. [2019-09-07 20:09:18,072 INFO L78 Accepts]: Start accepts. Automaton has 5470 states and 6090 transitions. Word has length 642 [2019-09-07 20:09:18,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:18,073 INFO L475 AbstractCegarLoop]: Abstraction has 5470 states and 6090 transitions. [2019-09-07 20:09:18,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:09:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5470 states and 6090 transitions. [2019-09-07 20:09:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2019-09-07 20:09:18,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:18,087 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-07 20:09:18,087 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1102463221, now seen corresponding path program 1 times [2019-09-07 20:09:18,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:18,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:18,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:18,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:18,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 467 proven. 104 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-09-07 20:09:18,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:18,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:18,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:18,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:09:18,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 847 proven. 2 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 20:09:19,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:19,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:09:19,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:09:19,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:09:19,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:09:19,368 INFO L87 Difference]: Start difference. First operand 5470 states and 6090 transitions. Second operand 7 states. [2019-09-07 20:09:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:23,058 INFO L93 Difference]: Finished difference Result 13410 states and 15958 transitions. [2019-09-07 20:09:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 20:09:23,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 649 [2019-09-07 20:09:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:23,100 INFO L225 Difference]: With dead ends: 13410 [2019-09-07 20:09:23,101 INFO L226 Difference]: Without dead ends: 7946 [2019-09-07 20:09:23,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:09:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7946 states. [2019-09-07 20:09:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7946 to 7522. [2019-09-07 20:09:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-09-07 20:09:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 8424 transitions. [2019-09-07 20:09:23,293 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 8424 transitions. Word has length 649 [2019-09-07 20:09:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:23,294 INFO L475 AbstractCegarLoop]: Abstraction has 7522 states and 8424 transitions. [2019-09-07 20:09:23,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:09:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 8424 transitions. [2019-09-07 20:09:23,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2019-09-07 20:09:23,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:23,321 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2019-09-07 20:09:23,321 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1769437000, now seen corresponding path program 1 times [2019-09-07 20:09:23,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:23,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:23,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1777 backedges. 499 proven. 857 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-09-07 20:09:25,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:25,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:25,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:25,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 20:09:25,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:25,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1777 backedges. 1103 proven. 2 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-09-07 20:09:25,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:25,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 18 [2019-09-07 20:09:25,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:09:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:09:25,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:09:25,930 INFO L87 Difference]: Start difference. First operand 7522 states and 8424 transitions. Second operand 18 states. [2019-09-07 20:09:29,461 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-07 20:09:32,078 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-07 20:09:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:33,069 INFO L93 Difference]: Finished difference Result 18432 states and 20804 transitions. [2019-09-07 20:09:33,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 20:09:33,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 775 [2019-09-07 20:09:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:33,109 INFO L225 Difference]: With dead ends: 18432 [2019-09-07 20:09:33,109 INFO L226 Difference]: Without dead ends: 10916 [2019-09-07 20:09:33,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=762, Invalid=3398, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 20:09:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10916 states. [2019-09-07 20:09:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10916 to 8802. [2019-09-07 20:09:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8802 states. [2019-09-07 20:09:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8802 states to 8802 states and 9760 transitions. [2019-09-07 20:09:33,321 INFO L78 Accepts]: Start accepts. Automaton has 8802 states and 9760 transitions. Word has length 775 [2019-09-07 20:09:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:33,322 INFO L475 AbstractCegarLoop]: Abstraction has 8802 states and 9760 transitions. [2019-09-07 20:09:33,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:09:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 8802 states and 9760 transitions. [2019-09-07 20:09:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-09-07 20:09:33,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:33,342 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:09:33,342 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1313246661, now seen corresponding path program 1 times [2019-09-07 20:09:33,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:33,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:34,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 656 proven. 104 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2019-09-07 20:09:34,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:34,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:34,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:34,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:09:34,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 1136 proven. 2 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2019-09-07 20:09:34,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:34,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:09:34,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:09:34,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:09:34,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:09:34,729 INFO L87 Difference]: Start difference. First operand 8802 states and 9760 transitions. Second operand 7 states. [2019-09-07 20:09:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:35,849 INFO L93 Difference]: Finished difference Result 18296 states and 20364 transitions. [2019-09-07 20:09:35,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 20:09:35,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 808 [2019-09-07 20:09:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:35,872 INFO L225 Difference]: With dead ends: 18296 [2019-09-07 20:09:35,873 INFO L226 Difference]: Without dead ends: 9500 [2019-09-07 20:09:35,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 814 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:09:35,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9500 states. [2019-09-07 20:09:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9500 to 9122. [2019-09-07 20:09:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9122 states. [2019-09-07 20:09:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9122 states to 9122 states and 10124 transitions. [2019-09-07 20:09:36,066 INFO L78 Accepts]: Start accepts. Automaton has 9122 states and 10124 transitions. Word has length 808 [2019-09-07 20:09:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:36,067 INFO L475 AbstractCegarLoop]: Abstraction has 9122 states and 10124 transitions. [2019-09-07 20:09:36,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:09:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 9122 states and 10124 transitions. [2019-09-07 20:09:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2019-09-07 20:09:36,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:36,089 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:09:36,089 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:36,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1651961426, now seen corresponding path program 1 times [2019-09-07 20:09:36,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:36,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:36,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 534 proven. 1133 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2019-09-07 20:09:38,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:38,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:38,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:38,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 20:09:38,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 1662 proven. 2 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-09-07 20:09:39,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:39,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-09-07 20:09:39,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:09:39,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:09:39,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-09-07 20:09:39,122 INFO L87 Difference]: Start difference. First operand 9122 states and 10124 transitions. Second operand 18 states. [2019-09-07 20:09:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:44,954 INFO L93 Difference]: Finished difference Result 19202 states and 21299 transitions. [2019-09-07 20:09:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 20:09:44,955 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 902 [2019-09-07 20:09:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:44,969 INFO L225 Difference]: With dead ends: 19202 [2019-09-07 20:09:44,970 INFO L226 Difference]: Without dead ends: 10086 [2019-09-07 20:09:44,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 925 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=627, Invalid=2679, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 20:09:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10086 states. [2019-09-07 20:09:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10086 to 8764. [2019-09-07 20:09:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8764 states. [2019-09-07 20:09:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8764 states to 8764 states and 9640 transitions. [2019-09-07 20:09:45,173 INFO L78 Accepts]: Start accepts. Automaton has 8764 states and 9640 transitions. Word has length 902 [2019-09-07 20:09:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:45,174 INFO L475 AbstractCegarLoop]: Abstraction has 8764 states and 9640 transitions. [2019-09-07 20:09:45,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 20:09:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 8764 states and 9640 transitions. [2019-09-07 20:09:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2019-09-07 20:09:45,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:45,217 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:09:45,218 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash 746479230, now seen corresponding path program 1 times [2019-09-07 20:09:45,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:45,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:45,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:45,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:45,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2899 backedges. 1669 proven. 176 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2019-09-07 20:09:46,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:46,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:46,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:46,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:09:46,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:09:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2899 backedges. 1442 proven. 6 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2019-09-07 20:09:47,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:47,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-09-07 20:09:47,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:09:47,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:09:47,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:09:47,102 INFO L87 Difference]: Start difference. First operand 8764 states and 9640 transitions. Second operand 14 states. [2019-09-07 20:09:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:51,781 INFO L93 Difference]: Finished difference Result 20544 states and 22824 transitions. [2019-09-07 20:09:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 20:09:51,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 983 [2019-09-07 20:09:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:51,803 INFO L225 Difference]: With dead ends: 20544 [2019-09-07 20:09:51,803 INFO L226 Difference]: Without dead ends: 11786 [2019-09-07 20:09:51,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 1000 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2019-09-07 20:09:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11786 states. [2019-09-07 20:09:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11786 to 10432. [2019-09-07 20:09:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10432 states. [2019-09-07 20:09:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10432 states to 10432 states and 11467 transitions. [2019-09-07 20:09:52,000 INFO L78 Accepts]: Start accepts. Automaton has 10432 states and 11467 transitions. Word has length 983 [2019-09-07 20:09:52,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:09:52,001 INFO L475 AbstractCegarLoop]: Abstraction has 10432 states and 11467 transitions. [2019-09-07 20:09:52,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:09:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 10432 states and 11467 transitions. [2019-09-07 20:09:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-09-07 20:09:52,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:09:52,029 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:09:52,030 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:09:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:09:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash 923008216, now seen corresponding path program 1 times [2019-09-07 20:09:52,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:09:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:09:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:52,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:09:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3614 backedges. 717 proven. 1878 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2019-09-07 20:09:53,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:09:53,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:09:53,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:09:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:09:53,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:09:53,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:09:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3614 backedges. 1684 proven. 2 refuted. 0 times theorem prover too weak. 1928 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:09:54,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:09:54,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-07 20:09:54,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 20:09:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 20:09:54,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-07 20:09:54,737 INFO L87 Difference]: Start difference. First operand 10432 states and 11467 transitions. Second operand 14 states. [2019-09-07 20:09:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:09:59,835 INFO L93 Difference]: Finished difference Result 23504 states and 26300 transitions. [2019-09-07 20:09:59,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 20:09:59,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1020 [2019-09-07 20:09:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:09:59,855 INFO L225 Difference]: With dead ends: 23504 [2019-09-07 20:09:59,856 INFO L226 Difference]: Without dead ends: 8902 [2019-09-07 20:09:59,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=518, Invalid=1932, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 20:09:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8902 states. [2019-09-07 20:09:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8902 to 5410. [2019-09-07 20:09:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5410 states. [2019-09-07 20:10:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5410 states to 5410 states and 5748 transitions. [2019-09-07 20:10:00,006 INFO L78 Accepts]: Start accepts. Automaton has 5410 states and 5748 transitions. Word has length 1020 [2019-09-07 20:10:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:10:00,007 INFO L475 AbstractCegarLoop]: Abstraction has 5410 states and 5748 transitions. [2019-09-07 20:10:00,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 20:10:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5410 states and 5748 transitions. [2019-09-07 20:10:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1125 [2019-09-07 20:10:00,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:10:00,028 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:10:00,029 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:10:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:10:00,029 INFO L82 PathProgramCache]: Analyzing trace with hash 157721960, now seen corresponding path program 1 times [2019-09-07 20:10:00,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:10:00,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:10:00,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:10:00,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:10:00,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:10:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:10:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 1578 proven. 297 refuted. 0 times theorem prover too weak. 2068 trivial. 0 not checked. [2019-09-07 20:10:01,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:10:01,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:10:01,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:10:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:10:02,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:10:02,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:10:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 1811 proven. 2 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2019-09-07 20:10:02,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:10:02,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 20:10:02,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 20:10:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 20:10:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-07 20:10:02,706 INFO L87 Difference]: Start difference. First operand 5410 states and 5748 transitions. Second operand 10 states. [2019-09-07 20:10:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:10:04,724 INFO L93 Difference]: Finished difference Result 10454 states and 11053 transitions. [2019-09-07 20:10:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:10:04,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1124 [2019-09-07 20:10:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:10:04,729 INFO L225 Difference]: With dead ends: 10454 [2019-09-07 20:10:04,729 INFO L226 Difference]: Without dead ends: 2958 [2019-09-07 20:10:04,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 1131 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-09-07 20:10:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-09-07 20:10:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2956. [2019-09-07 20:10:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-09-07 20:10:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 3025 transitions. [2019-09-07 20:10:04,781 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 3025 transitions. Word has length 1124 [2019-09-07 20:10:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:10:04,781 INFO L475 AbstractCegarLoop]: Abstraction has 2956 states and 3025 transitions. [2019-09-07 20:10:04,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 20:10:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 3025 transitions. [2019-09-07 20:10:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2019-09-07 20:10:04,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:10:04,799 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:10:04,800 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:10:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:10:04,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1558512527, now seen corresponding path program 1 times [2019-09-07 20:10:04,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:10:04,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:10:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:10:04,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:10:04,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:10:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:10:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4754 backedges. 877 proven. 2173 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2019-09-07 20:10:08,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:10:08,704 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 20:10:08,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:10:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:10:08,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:10:09,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:10:09,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:10:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4754 backedges. 1938 proven. 2 refuted. 0 times theorem prover too weak. 2814 trivial. 0 not checked. [2019-09-07 20:10:09,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:10:09,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 20:10:09,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 20:10:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 20:10:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:10:09,748 INFO L87 Difference]: Start difference. First operand 2956 states and 3025 transitions. Second operand 19 states. [2019-09-07 20:10:11,779 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-07 20:10:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:10:13,560 INFO L93 Difference]: Finished difference Result 5730 states and 5873 transitions. [2019-09-07 20:10:13,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 20:10:13,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1236 [2019-09-07 20:10:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:10:13,565 INFO L225 Difference]: With dead ends: 5730 [2019-09-07 20:10:13,565 INFO L226 Difference]: Without dead ends: 2964 [2019-09-07 20:10:13,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1293 GetRequests, 1252 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=416, Invalid=1224, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 20:10:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2019-09-07 20:10:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2954. [2019-09-07 20:10:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2019-09-07 20:10:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3008 transitions. [2019-09-07 20:10:13,603 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3008 transitions. Word has length 1236 [2019-09-07 20:10:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:10:13,604 INFO L475 AbstractCegarLoop]: Abstraction has 2954 states and 3008 transitions. [2019-09-07 20:10:13,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 20:10:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3008 transitions. [2019-09-07 20:10:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2019-09-07 20:10:13,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:10:13,621 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:10:13,622 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:10:13,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:10:13,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1805761515, now seen corresponding path program 1 times [2019-09-07 20:10:13,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:10:13,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:10:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:10:13,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:10:13,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:10:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:10:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 20:10:14,081 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 20:10:14,086 INFO L168 Benchmark]: Toolchain (without parser) took 93471.72 ms. Allocated memory was 131.1 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 85.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-07 20:10:14,087 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 20:10:14,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 921.52 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 84.8 MB in the beginning and 153.2 MB in the end (delta: -68.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-09-07 20:10:14,088 INFO L168 Benchmark]: Boogie Preprocessor took 154.22 ms. Allocated memory is still 199.2 MB. Free memory was 153.2 MB in the beginning and 147.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-09-07 20:10:14,089 INFO L168 Benchmark]: RCFGBuilder took 1395.18 ms. Allocated memory was 199.2 MB in the beginning and 219.7 MB in the end (delta: 20.4 MB). Free memory was 147.7 MB in the beginning and 142.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-09-07 20:10:14,090 INFO L168 Benchmark]: TraceAbstraction took 90996.31 ms. Allocated memory was 219.7 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 142.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-07 20:10:14,093 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 921.52 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 84.8 MB in the beginning and 153.2 MB in the end (delta: -68.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 154.22 ms. Allocated memory is still 199.2 MB. Free memory was 153.2 MB in the beginning and 147.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1395.18 ms. Allocated memory was 199.2 MB in the beginning and 219.7 MB in the end (delta: 20.4 MB). Free memory was 147.7 MB in the beginning and 142.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90996.31 ms. Allocated memory was 219.7 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 142.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...