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/Problem15_label32.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 20:39:36,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 20:39:36,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 20:39:36,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 20:39:36,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 20:39:36,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 20:39:36,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 20:39:36,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 20:39:36,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 20:39:36,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 20:39:36,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 20:39:36,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 20:39:36,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 20:39:36,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 20:39:36,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 20:39:36,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 20:39:36,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 20:39:36,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 20:39:36,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 20:39:36,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 20:39:36,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 20:39:36,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 20:39:36,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 20:39:36,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 20:39:36,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 20:39:36,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 20:39:36,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 20:39:36,970 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 20:39:36,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 20:39:36,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 20:39:36,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 20:39:36,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 20:39:36,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 20:39:36,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 20:39:36,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 20:39:36,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 20:39:36,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 20:39:36,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 20:39:36,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 20:39:36,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 20:39:36,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 20:39:36,979 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:39:36,993 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 20:39:36,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 20:39:36,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 20:39:36,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 20:39:36,995 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 20:39:36,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 20:39:36,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 20:39:36,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 20:39:36,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 20:39:36,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 20:39:36,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 20:39:36,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 20:39:36,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 20:39:36,997 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 20:39:36,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 20:39:36,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 20:39:36,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 20:39:36,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 20:39:36,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 20:39:36,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 20:39:36,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 20:39:36,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 20:39:36,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 20:39:36,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 20:39:36,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 20:39:36,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 20:39:36,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 20:39:37,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 20:39:37,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 20:39:37,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 20:39:37,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 20:39:37,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 20:39:37,056 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 20:39:37,056 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 20:39:37,057 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label32.c [2019-09-07 20:39:37,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f75f2c93/85c3fba4a29348f986e27e913ecf19e9/FLAGc7d24dc03 [2019-09-07 20:39:37,781 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 20:39:37,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label32.c [2019-09-07 20:39:37,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f75f2c93/85c3fba4a29348f986e27e913ecf19e9/FLAGc7d24dc03 [2019-09-07 20:39:37,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f75f2c93/85c3fba4a29348f986e27e913ecf19e9 [2019-09-07 20:39:37,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 20:39:37,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 20:39:37,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 20:39:37,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 20:39:37,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 20:39:37,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:39:37" (1/1) ... [2019-09-07 20:39:37,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb7ab14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:37, skipping insertion in model container [2019-09-07 20:39:37,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 08:39:37" (1/1) ... [2019-09-07 20:39:37,993 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 20:39:38,082 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 20:39:39,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:39:39,182 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 20:39:39,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 20:39:39,520 INFO L192 MainTranslator]: Completed translation [2019-09-07 20:39:39,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39 WrapperNode [2019-09-07 20:39:39,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 20:39:39,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 20:39:39,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 20:39:39,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 20:39:39,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (1/1) ... [2019-09-07 20:39:39,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (1/1) ... [2019-09-07 20:39:39,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (1/1) ... [2019-09-07 20:39:39,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (1/1) ... [2019-09-07 20:39:39,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (1/1) ... [2019-09-07 20:39:39,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (1/1) ... [2019-09-07 20:39:39,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (1/1) ... [2019-09-07 20:39:39,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 20:39:39,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 20:39:39,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 20:39:39,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 20:39:39,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (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:39:39,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 20:39:39,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 20:39:39,828 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 20:39:39,829 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 20:39:39,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 20:39:39,830 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 20:39:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 20:39:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 20:39:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 20:39:39,831 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 20:39:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 20:39:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 20:39:39,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 20:39:43,474 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 20:39:43,474 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 20:39:43,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:39:43 BoogieIcfgContainer [2019-09-07 20:39:43,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 20:39:43,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 20:39:43,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 20:39:43,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 20:39:43,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 08:39:37" (1/3) ... [2019-09-07 20:39:43,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a88ff9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:39:43, skipping insertion in model container [2019-09-07 20:39:43,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 08:39:39" (2/3) ... [2019-09-07 20:39:43,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a88ff9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 08:39:43, skipping insertion in model container [2019-09-07 20:39:43,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 08:39:43" (3/3) ... [2019-09-07 20:39:43,484 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label32.c [2019-09-07 20:39:43,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 20:39:43,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 20:39:43,523 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 20:39:43,576 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 20:39:43,577 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 20:39:43,577 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 20:39:43,577 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 20:39:43,577 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 20:39:43,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 20:39:43,578 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 20:39:43,578 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 20:39:43,578 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 20:39:43,624 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states. [2019-09-07 20:39:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 20:39:43,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:39:43,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:39:43,639 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:39:43,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:39:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1729407227, now seen corresponding path program 1 times [2019-09-07 20:39:43,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:39:43,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:39:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:43,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:39:43,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:39:44,104 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:39:44,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:39:44,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:39:44,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:39:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:39:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:39:44,130 INFO L87 Difference]: Start difference. First operand 437 states. Second operand 3 states. [2019-09-07 20:39:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:39:47,324 INFO L93 Difference]: Finished difference Result 1189 states and 2144 transitions. [2019-09-07 20:39:47,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:39:47,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-07 20:39:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:39:47,355 INFO L225 Difference]: With dead ends: 1189 [2019-09-07 20:39:47,355 INFO L226 Difference]: Without dead ends: 690 [2019-09-07 20:39:47,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:39:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-07 20:39:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2019-09-07 20:39:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2019-09-07 20:39:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1151 transitions. [2019-09-07 20:39:47,484 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1151 transitions. Word has length 55 [2019-09-07 20:39:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:39:47,485 INFO L475 AbstractCegarLoop]: Abstraction has 690 states and 1151 transitions. [2019-09-07 20:39:47,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:39:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1151 transitions. [2019-09-07 20:39:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 20:39:47,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:39:47,494 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:47,494 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:39:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:39:47,495 INFO L82 PathProgramCache]: Analyzing trace with hash -381958887, now seen corresponding path program 1 times [2019-09-07 20:39:47,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:39:47,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:39:47,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:47,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:39:47,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:39:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:39:47,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:39:47,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 20:39:47,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:39:47,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:39:47,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:39:47,742 INFO L87 Difference]: Start difference. First operand 690 states and 1151 transitions. Second operand 3 states. [2019-09-07 20:39:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:39:50,437 INFO L93 Difference]: Finished difference Result 1993 states and 3370 transitions. [2019-09-07 20:39:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:39:50,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-09-07 20:39:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:39:50,447 INFO L225 Difference]: With dead ends: 1993 [2019-09-07 20:39:50,447 INFO L226 Difference]: Without dead ends: 1309 [2019-09-07 20:39:50,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:39:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2019-09-07 20:39:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2019-09-07 20:39:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-07 20:39:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1885 transitions. [2019-09-07 20:39:50,495 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1885 transitions. Word has length 135 [2019-09-07 20:39:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:39:50,496 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1885 transitions. [2019-09-07 20:39:50,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:39:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1885 transitions. [2019-09-07 20:39:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 20:39:50,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:39:50,502 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:50,502 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:39:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:39:50,502 INFO L82 PathProgramCache]: Analyzing trace with hash -908449366, now seen corresponding path program 1 times [2019-09-07 20:39:50,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:39:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:39:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:50,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:39:50,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:39:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:39:50,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:39:50,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 20:39:50,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 20:39:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 20:39:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 20:39:50,769 INFO L87 Difference]: Start difference. First operand 1309 states and 1885 transitions. Second operand 6 states. [2019-09-07 20:39:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:39:55,152 INFO L93 Difference]: Finished difference Result 3274 states and 4920 transitions. [2019-09-07 20:39:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 20:39:55,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-07 20:39:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:39:55,172 INFO L225 Difference]: With dead ends: 3274 [2019-09-07 20:39:55,173 INFO L226 Difference]: Without dead ends: 1971 [2019-09-07 20:39:55,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:39:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2019-09-07 20:39:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1956. [2019-09-07 20:39:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1956 states. [2019-09-07 20:39:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1956 states and 2653 transitions. [2019-09-07 20:39:55,256 INFO L78 Accepts]: Start accepts. Automaton has 1956 states and 2653 transitions. Word has length 154 [2019-09-07 20:39:55,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:39:55,262 INFO L475 AbstractCegarLoop]: Abstraction has 1956 states and 2653 transitions. [2019-09-07 20:39:55,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 20:39:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1956 states and 2653 transitions. [2019-09-07 20:39:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-07 20:39:55,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:39:55,275 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:39:55,275 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:39:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:39:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219750, now seen corresponding path program 1 times [2019-09-07 20:39:55,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:39:55,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:39:55,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:55,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:39:55,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:39:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:39:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 96 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 20:39:55,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:39:55,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:39:55,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:39:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:39:55,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 20:39:55,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:39:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 20:39:55,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:39:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:39:55,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:39:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:39:55,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:39:55,900 INFO L87 Difference]: Start difference. First operand 1956 states and 2653 transitions. Second operand 9 states. [2019-09-07 20:40:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:40:01,567 INFO L93 Difference]: Finished difference Result 5882 states and 8150 transitions. [2019-09-07 20:40:01,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 20:40:01,568 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 239 [2019-09-07 20:40:01,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:40:01,588 INFO L225 Difference]: With dead ends: 5882 [2019-09-07 20:40:01,588 INFO L226 Difference]: Without dead ends: 3932 [2019-09-07 20:40:01,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:40:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-09-07 20:40:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3904. [2019-09-07 20:40:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3904 states. [2019-09-07 20:40:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 4989 transitions. [2019-09-07 20:40:01,705 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 4989 transitions. Word has length 239 [2019-09-07 20:40:01,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:40:01,705 INFO L475 AbstractCegarLoop]: Abstraction has 3904 states and 4989 transitions. [2019-09-07 20:40:01,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:40:01,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 4989 transitions. [2019-09-07 20:40:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-07 20:40:01,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:40:01,715 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:01,716 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:40:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:40:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 395716226, now seen corresponding path program 1 times [2019-09-07 20:40:01,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:40:01,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:40:01,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:01,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 149 proven. 253 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 20:40:02,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:40:02,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:40:02,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:02,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:40:02,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:40:02,369 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 277 proven. 2 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-07 20:40:02,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:40:02,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 20:40:02,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 20:40:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 20:40:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 20:40:02,384 INFO L87 Difference]: Start difference. First operand 3904 states and 4989 transitions. Second operand 7 states. [2019-09-07 20:40:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:40:07,282 INFO L93 Difference]: Finished difference Result 11396 states and 15066 transitions. [2019-09-07 20:40:07,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 20:40:07,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 364 [2019-09-07 20:40:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:40:07,315 INFO L225 Difference]: With dead ends: 11396 [2019-09-07 20:40:07,315 INFO L226 Difference]: Without dead ends: 6210 [2019-09-07 20:40:07,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:40:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6210 states. [2019-09-07 20:40:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6210 to 6134. [2019-09-07 20:40:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2019-09-07 20:40:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7250 transitions. [2019-09-07 20:40:07,483 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7250 transitions. Word has length 364 [2019-09-07 20:40:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:40:07,484 INFO L475 AbstractCegarLoop]: Abstraction has 6134 states and 7250 transitions. [2019-09-07 20:40:07,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:40:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7250 transitions. [2019-09-07 20:40:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-09-07 20:40:07,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:40:07,496 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:07,496 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:40:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:40:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 602907516, now seen corresponding path program 1 times [2019-09-07 20:40:07,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:40:07,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:40:07,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:07,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:07,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:08,379 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 317 proven. 81 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 20:40:08,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:40:08,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:40:08,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:08,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:40:08,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:40:08,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:40:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-07 20:40:08,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:40:08,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-07 20:40:08,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 20:40:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 20:40:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:40:08,895 INFO L87 Difference]: Start difference. First operand 6134 states and 7250 transitions. Second operand 13 states. [2019-09-07 20:40:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:40:21,810 INFO L93 Difference]: Finished difference Result 17288 states and 22442 transitions. [2019-09-07 20:40:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 20:40:21,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 450 [2019-09-07 20:40:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:40:21,894 INFO L225 Difference]: With dead ends: 17288 [2019-09-07 20:40:21,895 INFO L226 Difference]: Without dead ends: 11160 [2019-09-07 20:40:21,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=767, Invalid=2655, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 20:40:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11160 states. [2019-09-07 20:40:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11160 to 8719. [2019-09-07 20:40:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8719 states. [2019-09-07 20:40:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8719 states to 8719 states and 10362 transitions. [2019-09-07 20:40:22,234 INFO L78 Accepts]: Start accepts. Automaton has 8719 states and 10362 transitions. Word has length 450 [2019-09-07 20:40:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:40:22,236 INFO L475 AbstractCegarLoop]: Abstraction has 8719 states and 10362 transitions. [2019-09-07 20:40:22,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 20:40:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8719 states and 10362 transitions. [2019-09-07 20:40:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-09-07 20:40:22,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:40:22,262 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,263 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:40:22,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:40:22,263 INFO L82 PathProgramCache]: Analyzing trace with hash -59080898, now seen corresponding path program 1 times [2019-09-07 20:40:22,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:40:22,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:40:22,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:22,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:22,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 379 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-07 20:40:23,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:40:23,027 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:40:23,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:23,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:40:23,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:40:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 379 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:40:23,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:40:23,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:40:23,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:40:23,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:40:23,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:40:23,444 INFO L87 Difference]: Start difference. First operand 8719 states and 10362 transitions. Second operand 9 states. [2019-09-07 20:40:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:40:30,554 INFO L93 Difference]: Finished difference Result 18588 states and 23053 transitions. [2019-09-07 20:40:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 20:40:30,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 563 [2019-09-07 20:40:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:40:30,593 INFO L225 Difference]: With dead ends: 18588 [2019-09-07 20:40:30,593 INFO L226 Difference]: Without dead ends: 10182 [2019-09-07 20:40:30,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:40:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10182 states. [2019-09-07 20:40:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 9826. [2019-09-07 20:40:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9826 states. [2019-09-07 20:40:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9826 states to 9826 states and 11425 transitions. [2019-09-07 20:40:30,872 INFO L78 Accepts]: Start accepts. Automaton has 9826 states and 11425 transitions. Word has length 563 [2019-09-07 20:40:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:40:30,873 INFO L475 AbstractCegarLoop]: Abstraction has 9826 states and 11425 transitions. [2019-09-07 20:40:30,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:40:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 9826 states and 11425 transitions. [2019-09-07 20:40:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-09-07 20:40:30,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:40:30,907 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:30,907 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:40:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:40:30,908 INFO L82 PathProgramCache]: Analyzing trace with hash 814879544, now seen corresponding path program 1 times [2019-09-07 20:40:30,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:40:30,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:40:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:30,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:30,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:40:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 410 proven. 2 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-07 20:40:31,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:40:31,561 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:40:31,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:40:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:40:31,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:40:31,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:40:31,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:40:31,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:40:31,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:31,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:40:45,420 WARN L188 SmtUtils]: Spent 13.45 s on a formula simplification. DAG size of input: 98 DAG size of output: 50 [2019-09-07 20:40:45,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:40:45,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:40:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 405 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:40:45,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:40:45,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-09-07 20:40:45,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:40:45,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:40:45,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:40:45,750 INFO L87 Difference]: Start difference. First operand 9826 states and 11425 transitions. Second operand 12 states. [2019-09-07 20:40:59,709 WARN L188 SmtUtils]: Spent 10.30 s on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-09-07 20:41:11,817 WARN L188 SmtUtils]: Spent 10.29 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 20:41:18,276 WARN L188 SmtUtils]: Spent 5.14 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-07 20:41:24,959 WARN L188 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 20:41:35,438 WARN L188 SmtUtils]: Spent 10.44 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-09-07 20:41:44,748 WARN L188 SmtUtils]: Spent 5.13 s on a formula simplification that was a NOOP. DAG size: 59 [2019-09-07 20:41:55,137 WARN L188 SmtUtils]: Spent 10.29 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-07 20:42:00,562 WARN L188 SmtUtils]: Spent 5.26 s on a formula simplification that was a NOOP. DAG size: 60 [2019-09-07 20:42:06,085 WARN L188 SmtUtils]: Spent 5.20 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 20:42:14,225 WARN L188 SmtUtils]: Spent 5.25 s on a formula simplification that was a NOOP. DAG size: 60 [2019-09-07 20:42:21,444 WARN L188 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 56 [2019-09-07 20:42:31,946 WARN L188 SmtUtils]: Spent 10.37 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 20:42:39,507 WARN L188 SmtUtils]: Spent 5.15 s on a formula simplification that was a NOOP. DAG size: 59 [2019-09-07 20:42:45,995 WARN L188 SmtUtils]: Spent 5.19 s on a formula simplification that was a NOOP. DAG size: 59 [2019-09-07 20:42:51,362 WARN L188 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 20:42:59,797 WARN L188 SmtUtils]: Spent 5.15 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 20:43:05,173 WARN L188 SmtUtils]: Spent 5.18 s on a formula simplification that was a NOOP. DAG size: 62 [2019-09-07 20:43:10,581 WARN L188 SmtUtils]: Spent 5.24 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 20:43:17,666 WARN L188 SmtUtils]: Spent 5.21 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 20:43:31,873 WARN L188 SmtUtils]: Spent 10.38 s on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-07 20:43:40,928 WARN L188 SmtUtils]: Spent 5.08 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 20:43:46,270 WARN L188 SmtUtils]: Spent 5.08 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-07 20:43:51,724 WARN L188 SmtUtils]: Spent 5.13 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-07 20:43:56,968 WARN L188 SmtUtils]: Spent 5.14 s on a formula simplification that was a NOOP. DAG size: 59 [2019-09-07 20:44:03,462 WARN L188 SmtUtils]: Spent 5.21 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-07 20:44:13,931 WARN L188 SmtUtils]: Spent 10.42 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 20:44:19,163 WARN L188 SmtUtils]: Spent 5.19 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-07 20:44:31,345 WARN L188 SmtUtils]: Spent 10.37 s on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-09-07 20:44:46,200 WARN L188 SmtUtils]: Spent 10.57 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-07 20:44:53,145 WARN L188 SmtUtils]: Spent 5.33 s on a formula simplification that was a NOOP. DAG size: 61 [2019-09-07 20:45:01,463 WARN L188 SmtUtils]: Spent 5.33 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-07 20:45:18,486 WARN L188 SmtUtils]: Spent 10.40 s on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-07 20:45:26,961 WARN L188 SmtUtils]: Spent 5.26 s on a formula simplification that was a NOOP. DAG size: 63 [2019-09-07 20:45:38,405 WARN L188 SmtUtils]: Spent 10.37 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-09-07 20:45:43,823 WARN L188 SmtUtils]: Spent 5.26 s on a formula simplification that was a NOOP. DAG size: 64 [2019-09-07 20:45:51,953 WARN L188 SmtUtils]: Spent 5.19 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-07 20:46:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:04,333 INFO L93 Difference]: Finished difference Result 27134 states and 31769 transitions. [2019-09-07 20:46:04,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-09-07 20:46:04,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 594 [2019-09-07 20:46:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:04,397 INFO L225 Difference]: With dead ends: 27134 [2019-09-07 20:46:04,397 INFO L226 Difference]: Without dead ends: 17928 [2019-09-07 20:46:04,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6654 ImplicationChecksByTransitivity, 261.0s TimeCoverageRelationStatistics Valid=1795, Invalid=14975, Unknown=0, NotChecked=0, Total=16770 [2019-09-07 20:46:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17928 states. [2019-09-07 20:46:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17928 to 15315. [2019-09-07 20:46:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15315 states. [2019-09-07 20:46:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15315 states to 15315 states and 16739 transitions. [2019-09-07 20:46:04,881 INFO L78 Accepts]: Start accepts. Automaton has 15315 states and 16739 transitions. Word has length 594 [2019-09-07 20:46:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:04,882 INFO L475 AbstractCegarLoop]: Abstraction has 15315 states and 16739 transitions. [2019-09-07 20:46:04,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:46:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 15315 states and 16739 transitions. [2019-09-07 20:46:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-09-07 20:46:04,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:04,916 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:04,916 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2023799936, now seen corresponding path program 1 times [2019-09-07 20:46:04,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:04,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2019-09-07 20:46:05,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:05,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 20:46:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:05,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:46:05,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-07 20:46:06,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:46:06,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:46:06,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:46:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:46:06,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:06,105 INFO L87 Difference]: Start difference. First operand 15315 states and 16739 transitions. Second operand 3 states. [2019-09-07 20:46:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:10,045 INFO L93 Difference]: Finished difference Result 30922 states and 33869 transitions. [2019-09-07 20:46:10,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:46:10,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 667 [2019-09-07 20:46:10,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:10,086 INFO L225 Difference]: With dead ends: 30922 [2019-09-07 20:46:10,086 INFO L226 Difference]: Without dead ends: 15920 [2019-09-07 20:46:10,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15920 states. [2019-09-07 20:46:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15920 to 15305. [2019-09-07 20:46:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15305 states. [2019-09-07 20:46:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15305 states to 15305 states and 16721 transitions. [2019-09-07 20:46:10,406 INFO L78 Accepts]: Start accepts. Automaton has 15305 states and 16721 transitions. Word has length 667 [2019-09-07 20:46:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:10,407 INFO L475 AbstractCegarLoop]: Abstraction has 15305 states and 16721 transitions. [2019-09-07 20:46:10,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:46:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15305 states and 16721 transitions. [2019-09-07 20:46:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-09-07 20:46:10,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:10,427 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:10,427 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:10,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1740901083, now seen corresponding path program 1 times [2019-09-07 20:46:10,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:10,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:10,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:10,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 551 proven. 2 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 20:46:11,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:11,159 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:46:11,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:11,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 20:46:11,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 551 proven. 2 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-07 20:46:11,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:46:11,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-09-07 20:46:11,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 20:46:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 20:46:11,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-07 20:46:11,696 INFO L87 Difference]: Start difference. First operand 15305 states and 16721 transitions. Second operand 8 states. [2019-09-07 20:46:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:18,853 INFO L93 Difference]: Finished difference Result 39365 states and 43867 transitions. [2019-09-07 20:46:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 20:46:18,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 692 [2019-09-07 20:46:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:18,886 INFO L225 Difference]: With dead ends: 39365 [2019-09-07 20:46:18,886 INFO L226 Difference]: Without dead ends: 19302 [2019-09-07 20:46:18,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-07 20:46:18,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19302 states. [2019-09-07 20:46:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19302 to 17965. [2019-09-07 20:46:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17965 states. [2019-09-07 20:46:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17965 states to 17965 states and 19025 transitions. [2019-09-07 20:46:19,206 INFO L78 Accepts]: Start accepts. Automaton has 17965 states and 19025 transitions. Word has length 692 [2019-09-07 20:46:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:19,207 INFO L475 AbstractCegarLoop]: Abstraction has 17965 states and 19025 transitions. [2019-09-07 20:46:19,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 20:46:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17965 states and 19025 transitions. [2019-09-07 20:46:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-09-07 20:46:19,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:19,227 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:19,227 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:19,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash 168085431, now seen corresponding path program 1 times [2019-09-07 20:46:19,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:19,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2019-09-07 20:46:19,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:19,816 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:46:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:20,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:46:20,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-09-07 20:46:20,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:46:20,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:46:20,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:46:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:46:20,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:20,315 INFO L87 Difference]: Start difference. First operand 17965 states and 19025 transitions. Second operand 3 states. [2019-09-07 20:46:22,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:22,328 INFO L93 Difference]: Finished difference Result 43351 states and 46193 transitions. [2019-09-07 20:46:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:46:22,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-09-07 20:46:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:22,385 INFO L225 Difference]: With dead ends: 43351 [2019-09-07 20:46:22,386 INFO L226 Difference]: Without dead ends: 25699 [2019-09-07 20:46:22,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25699 states. [2019-09-07 20:46:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25699 to 21987. [2019-09-07 20:46:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21987 states. [2019-09-07 20:46:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21987 states to 21987 states and 23429 transitions. [2019-09-07 20:46:22,788 INFO L78 Accepts]: Start accepts. Automaton has 21987 states and 23429 transitions. Word has length 732 [2019-09-07 20:46:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:22,789 INFO L475 AbstractCegarLoop]: Abstraction has 21987 states and 23429 transitions. [2019-09-07 20:46:22,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:46:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 21987 states and 23429 transitions. [2019-09-07 20:46:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2019-09-07 20:46:22,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:22,812 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:22,812 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1132765063, now seen corresponding path program 1 times [2019-09-07 20:46:22,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:22,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:22,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 206 proven. 2 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-09-07 20:46:23,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:23,572 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) [2019-09-07 20:46:23,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:46:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:23,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 20:46:23,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2019-09-07 20:46:24,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:46:24,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 20:46:24,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 20:46:24,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 20:46:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:24,165 INFO L87 Difference]: Start difference. First operand 21987 states and 23429 transitions. Second operand 3 states. [2019-09-07 20:46:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:46:25,949 INFO L93 Difference]: Finished difference Result 45792 states and 48848 transitions. [2019-09-07 20:46:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 20:46:25,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 749 [2019-09-07 20:46:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:46:25,998 INFO L225 Difference]: With dead ends: 45792 [2019-09-07 20:46:25,998 INFO L226 Difference]: Without dead ends: 24118 [2019-09-07 20:46:26,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 20:46:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24118 states. [2019-09-07 20:46:26,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24118 to 22888. [2019-09-07 20:46:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22888 states. [2019-09-07 20:46:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22888 states to 22888 states and 24290 transitions. [2019-09-07 20:46:26,329 INFO L78 Accepts]: Start accepts. Automaton has 22888 states and 24290 transitions. Word has length 749 [2019-09-07 20:46:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:46:26,330 INFO L475 AbstractCegarLoop]: Abstraction has 22888 states and 24290 transitions. [2019-09-07 20:46:26,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 20:46:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22888 states and 24290 transitions. [2019-09-07 20:46:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2019-09-07 20:46:26,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:46:26,347 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:46:26,347 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:46:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:46:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2035587658, now seen corresponding path program 1 times [2019-09-07 20:46:26,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:46:26,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:46:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:26,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:46:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 203 proven. 650 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-07 20:46:27,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:46:27,761 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:46:27,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:46:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:46:28,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:46:28,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:46:28,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:28,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:34,286 WARN L188 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-09-07 20:46:36,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:37,822 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_834 Int)) (let ((.cse0 (mod v_~a0~0_834 299926))) (and (<= (+ v_~a0~0_834 44) 0) (<= .cse0 (+ c_~a0~0 300072)) (= 0 .cse0)))) (exists ((v_prenex_8 Int)) (let ((.cse1 (mod v_prenex_8 299926))) (and (not (= 0 .cse1)) (< v_prenex_8 0) (<= (+ v_prenex_8 44) 0) (<= .cse1 (+ c_~a0~0 599998)))))) is different from true [2019-09-07 20:46:37,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:37,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:49,961 WARN L188 SmtUtils]: Spent 6.05 s on a formula simplification that was a NOOP. DAG size: 27 [2019-09-07 20:46:56,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:46:56,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:46:56,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:47:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 573 refuted. 2 times theorem prover too weak. 355 trivial. 15 not checked. [2019-09-07 20:47:02,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:47:02,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-09-07 20:47:02,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 20:47:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 20:47:02,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=229, Unknown=8, NotChecked=30, Total=306 [2019-09-07 20:47:02,817 INFO L87 Difference]: Start difference. First operand 22888 states and 24290 transitions. Second operand 18 states. [2019-09-07 20:47:06,179 WARN L188 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 29 [2019-09-07 20:50:06,770 WARN L188 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-09-07 20:52:16,084 WARN L188 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-09-07 20:53:05,219 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-07 20:53:27,857 WARN L188 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 55 DAG size of output: 35