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/Problem12_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:08:05,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:08:05,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:08:05,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:08:05,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:08:05,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:08:05,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:08:05,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:08:05,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:08:05,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:08:05,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:08:05,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:08:05,971 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:08:05,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:08:05,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:08:05,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:08:05,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:08:05,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:08:05,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:08:05,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:08:05,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:08:05,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:08:05,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:08:05,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:08:05,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:08:05,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:08:05,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:08:05,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:08:05,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:08:05,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:08:05,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:08:05,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:08:05,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:08:05,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:08:05,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:08:05,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:08:05,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:08:05,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:08:05,995 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:08:05,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:08:05,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:08:05,997 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 19:08:06,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:08:06,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:08:06,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:08:06,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:08:06,014 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:08:06,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:08:06,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:08:06,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:08:06,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:08:06,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:08:06,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:08:06,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:08:06,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:08:06,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:08:06,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:08:06,016 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:08:06,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:08:06,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:08:06,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:08:06,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:08:06,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:08:06,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:08:06,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:08:06,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:08:06,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:08:06,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:08:06,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:08:06,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:08:06,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:08:06,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:08:06,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:08:06,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:08:06,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:08:06,063 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:08:06,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem12_label47.c [2019-09-07 19:08:06,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749dfec5a/ca40ebb9a5eb49bd93b873bafce6587b/FLAG25649c0ee [2019-09-07 19:08:06,857 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:08:06,860 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem12_label47.c [2019-09-07 19:08:06,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749dfec5a/ca40ebb9a5eb49bd93b873bafce6587b/FLAG25649c0ee [2019-09-07 19:08:06,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749dfec5a/ca40ebb9a5eb49bd93b873bafce6587b [2019-09-07 19:08:06,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:08:06,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:08:06,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:08:06,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:08:06,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:08:06,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:08:06" (1/1) ... [2019-09-07 19:08:06,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4ace30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:06, skipping insertion in model container [2019-09-07 19:08:06,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:08:06" (1/1) ... [2019-09-07 19:08:06,999 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:08:07,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:08:08,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:08:08,661 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:08:09,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:08:09,410 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:08:09,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09 WrapperNode [2019-09-07 19:08:09,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:08:09,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:08:09,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:08:09,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:08:09,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... [2019-09-07 19:08:09,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... [2019-09-07 19:08:09,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... [2019-09-07 19:08:09,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... [2019-09-07 19:08:09,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... [2019-09-07 19:08:09,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... [2019-09-07 19:08:09,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... [2019-09-07 19:08:09,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:08:09,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:08:09,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:08:09,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:08:09,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:08:09,784 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:08:09,785 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:08:09,785 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:08:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:08:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:08:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:08:09,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:08:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:08:09,787 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:08:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:08:09,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:08:09,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:08:14,831 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:08:14,832 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:08:14,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:08:14 BoogieIcfgContainer [2019-09-07 19:08:14,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:08:14,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:08:14,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:08:14,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:08:14,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:08:06" (1/3) ... [2019-09-07 19:08:14,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16af3589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:08:14, skipping insertion in model container [2019-09-07 19:08:14,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:08:09" (2/3) ... [2019-09-07 19:08:14,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16af3589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:08:14, skipping insertion in model container [2019-09-07 19:08:14,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:08:14" (3/3) ... [2019-09-07 19:08:14,843 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem12_label47.c [2019-09-07 19:08:14,853 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:08:14,861 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:08:14,878 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:08:14,916 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:08:14,916 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:08:14,917 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:08:14,917 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:08:14,917 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:08:14,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:08:14,917 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:08:14,917 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:08:14,917 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:08:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states. [2019-09-07 19:08:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 19:08:14,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:08:14,963 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] [2019-09-07 19:08:14,965 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:08:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:08:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash 890059533, now seen corresponding path program 1 times [2019-09-07 19:08:14,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:08:14,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:08:15,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:15,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:15,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:08:15,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:08:15,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:08:15,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:08:15,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:08:15,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:08:15,323 INFO L87 Difference]: Start difference. First operand 839 states. Second operand 3 states. [2019-09-07 19:08:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:08:20,544 INFO L93 Difference]: Finished difference Result 2443 states and 4697 transitions. [2019-09-07 19:08:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:08:20,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-07 19:08:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:08:20,595 INFO L225 Difference]: With dead ends: 2443 [2019-09-07 19:08:20,595 INFO L226 Difference]: Without dead ends: 1542 [2019-09-07 19:08:20,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:08:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-09-07 19:08:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2019-09-07 19:08:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2019-09-07 19:08:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2750 transitions. [2019-09-07 19:08:20,756 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2750 transitions. Word has length 44 [2019-09-07 19:08:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:08:20,757 INFO L475 AbstractCegarLoop]: Abstraction has 1542 states and 2750 transitions. [2019-09-07 19:08:20,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:08:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2750 transitions. [2019-09-07 19:08:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-07 19:08:20,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:08:20,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:08:20,769 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:08:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:08:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash -376675783, now seen corresponding path program 1 times [2019-09-07 19:08:20,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:08:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:08:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:20,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:08:21,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:08:21,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:08:21,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:08:21,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:08:21,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:08:21,075 INFO L87 Difference]: Start difference. First operand 1542 states and 2750 transitions. Second operand 5 states. [2019-09-07 19:08:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:08:27,845 INFO L93 Difference]: Finished difference Result 4690 states and 8403 transitions. [2019-09-07 19:08:27,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:08:27,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-07 19:08:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:08:27,868 INFO L225 Difference]: With dead ends: 4690 [2019-09-07 19:08:27,869 INFO L226 Difference]: Without dead ends: 3154 [2019-09-07 19:08:27,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:08:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2019-09-07 19:08:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3122. [2019-09-07 19:08:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-09-07 19:08:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5336 transitions. [2019-09-07 19:08:27,980 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5336 transitions. Word has length 117 [2019-09-07 19:08:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:08:27,980 INFO L475 AbstractCegarLoop]: Abstraction has 3122 states and 5336 transitions. [2019-09-07 19:08:27,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:08:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5336 transitions. [2019-09-07 19:08:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-07 19:08:27,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:08:27,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:08:27,984 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:08:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:08:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1712276588, now seen corresponding path program 1 times [2019-09-07 19:08:27,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:08:27,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:08:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:27,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:27,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:08:28,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:08:28,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:08:28,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:08:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:08:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:08:28,162 INFO L87 Difference]: Start difference. First operand 3122 states and 5336 transitions. Second operand 6 states. [2019-09-07 19:08:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:08:35,302 INFO L93 Difference]: Finished difference Result 9491 states and 16483 transitions. [2019-09-07 19:08:35,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:08:35,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-09-07 19:08:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:08:35,347 INFO L225 Difference]: With dead ends: 9491 [2019-09-07 19:08:35,350 INFO L226 Difference]: Without dead ends: 6375 [2019-09-07 19:08:35,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:08:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-09-07 19:08:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6333. [2019-09-07 19:08:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6333 states. [2019-09-07 19:08:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 10771 transitions. [2019-09-07 19:08:35,559 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 10771 transitions. Word has length 122 [2019-09-07 19:08:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:08:35,560 INFO L475 AbstractCegarLoop]: Abstraction has 6333 states and 10771 transitions. [2019-09-07 19:08:35,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:08:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 10771 transitions. [2019-09-07 19:08:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 19:08:35,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:08:35,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:08:35,563 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:08:35,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:08:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2146736644, now seen corresponding path program 1 times [2019-09-07 19:08:35,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:08:35,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:08:35,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:35,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:35,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:08:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:08:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:08:35,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:08:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:08:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:08:35,711 INFO L87 Difference]: Start difference. First operand 6333 states and 10771 transitions. Second operand 6 states. [2019-09-07 19:08:41,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:08:41,828 INFO L93 Difference]: Finished difference Result 15980 states and 27530 transitions. [2019-09-07 19:08:41,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:08:41,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-07 19:08:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:08:41,886 INFO L225 Difference]: With dead ends: 15980 [2019-09-07 19:08:41,886 INFO L226 Difference]: Without dead ends: 9653 [2019-09-07 19:08:41,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:08:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9653 states. [2019-09-07 19:08:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9653 to 9576. [2019-09-07 19:08:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9576 states. [2019-09-07 19:08:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9576 states to 9576 states and 15608 transitions. [2019-09-07 19:08:42,168 INFO L78 Accepts]: Start accepts. Automaton has 9576 states and 15608 transitions. Word has length 130 [2019-09-07 19:08:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:08:42,169 INFO L475 AbstractCegarLoop]: Abstraction has 9576 states and 15608 transitions. [2019-09-07 19:08:42,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:08:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 9576 states and 15608 transitions. [2019-09-07 19:08:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 19:08:42,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:08:42,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:08:42,176 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:08:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:08:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 523890461, now seen corresponding path program 1 times [2019-09-07 19:08:42,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:08:42,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:08:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:42,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:42,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:08:42,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:08:42,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:08:42,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:08:42,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:08:42,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:08:42,394 INFO L87 Difference]: Start difference. First operand 9576 states and 15608 transitions. Second operand 6 states. [2019-09-07 19:08:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:08:57,556 INFO L93 Difference]: Finished difference Result 37844 states and 68765 transitions. [2019-09-07 19:08:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:08:57,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-07 19:08:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:08:57,721 INFO L225 Difference]: With dead ends: 37844 [2019-09-07 19:08:57,721 INFO L226 Difference]: Without dead ends: 28274 [2019-09-07 19:08:57,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:08:57,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28274 states. [2019-09-07 19:08:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28274 to 28091. [2019-09-07 19:08:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28091 states. [2019-09-07 19:08:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28091 states to 28091 states and 45130 transitions. [2019-09-07 19:08:58,659 INFO L78 Accepts]: Start accepts. Automaton has 28091 states and 45130 transitions. Word has length 147 [2019-09-07 19:08:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:08:58,660 INFO L475 AbstractCegarLoop]: Abstraction has 28091 states and 45130 transitions. [2019-09-07 19:08:58,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:08:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28091 states and 45130 transitions. [2019-09-07 19:08:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 19:08:58,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:08:58,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:08:58,666 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:08:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:08:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash -492282216, now seen corresponding path program 1 times [2019-09-07 19:08:58,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:08:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:08:58,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:08:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:08:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:08:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:08:58,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:08:58,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:08:58,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:08:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:08:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:08:58,948 INFO L87 Difference]: Start difference. First operand 28091 states and 45130 transitions. Second operand 6 states. [2019-09-07 19:09:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:09:06,552 INFO L93 Difference]: Finished difference Result 69315 states and 116444 transitions. [2019-09-07 19:09:06,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:09:06,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-09-07 19:09:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:09:06,745 INFO L225 Difference]: With dead ends: 69315 [2019-09-07 19:09:06,745 INFO L226 Difference]: Without dead ends: 41230 [2019-09-07 19:09:06,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:09:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41230 states. [2019-09-07 19:09:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41230 to 41135. [2019-09-07 19:09:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41135 states. [2019-09-07 19:09:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41135 states to 41135 states and 62352 transitions. [2019-09-07 19:09:08,127 INFO L78 Accepts]: Start accepts. Automaton has 41135 states and 62352 transitions. Word has length 168 [2019-09-07 19:09:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:09:08,128 INFO L475 AbstractCegarLoop]: Abstraction has 41135 states and 62352 transitions. [2019-09-07 19:09:08,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:09:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 41135 states and 62352 transitions. [2019-09-07 19:09:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-07 19:09:08,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:09:08,133 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:09:08,133 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:09:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:09:08,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1792334508, now seen corresponding path program 1 times [2019-09-07 19:09:08,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:09:08,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:09:08,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:08,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:09:08,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 74 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:09:08,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:09:08,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:09:08,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:09:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:08,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:09:08,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:09:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:09:09,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:09:09,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-09-07 19:09:09,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:09:09,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:09:09,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:09:09,381 INFO L87 Difference]: Start difference. First operand 41135 states and 62352 transitions. Second operand 7 states. [2019-09-07 19:09:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:09:18,011 INFO L93 Difference]: Finished difference Result 115306 states and 187004 transitions. [2019-09-07 19:09:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:09:18,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-09-07 19:09:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:09:18,429 INFO L225 Difference]: With dead ends: 115306 [2019-09-07 19:09:18,429 INFO L226 Difference]: Without dead ends: 74177 [2019-09-07 19:09:18,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:09:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74177 states. [2019-09-07 19:09:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74177 to 69195. [2019-09-07 19:09:20,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69195 states. [2019-09-07 19:09:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69195 states to 69195 states and 104332 transitions. [2019-09-07 19:09:20,951 INFO L78 Accepts]: Start accepts. Automaton has 69195 states and 104332 transitions. Word has length 201 [2019-09-07 19:09:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:09:20,952 INFO L475 AbstractCegarLoop]: Abstraction has 69195 states and 104332 transitions. [2019-09-07 19:09:20,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:09:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 69195 states and 104332 transitions. [2019-09-07 19:09:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-07 19:09:20,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:09:20,962 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:09:20,963 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:09:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:09:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 204497568, now seen corresponding path program 1 times [2019-09-07 19:09:20,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:09:20,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:09:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:09:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 147 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:09:21,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:09:21,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:09:21,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:09:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:21,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:09:21,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:09:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 147 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:09:21,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:09:21,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:09:21,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:09:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:09:21,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:09:21,576 INFO L87 Difference]: Start difference. First operand 69195 states and 104332 transitions. Second operand 9 states. [2019-09-07 19:09:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:09:39,011 INFO L93 Difference]: Finished difference Result 174981 states and 315294 transitions. [2019-09-07 19:09:39,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:09:39,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 243 [2019-09-07 19:09:39,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:09:39,634 INFO L225 Difference]: With dead ends: 174981 [2019-09-07 19:09:39,635 INFO L226 Difference]: Without dead ends: 97434 [2019-09-07 19:09:39,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:09:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97434 states. [2019-09-07 19:09:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97434 to 93392. [2019-09-07 19:09:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93392 states. [2019-09-07 19:09:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93392 states to 93392 states and 144403 transitions. [2019-09-07 19:09:43,081 INFO L78 Accepts]: Start accepts. Automaton has 93392 states and 144403 transitions. Word has length 243 [2019-09-07 19:09:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:09:43,081 INFO L475 AbstractCegarLoop]: Abstraction has 93392 states and 144403 transitions. [2019-09-07 19:09:43,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:09:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 93392 states and 144403 transitions. [2019-09-07 19:09:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-07 19:09:43,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:09:43,089 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:09:43,089 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:09:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:09:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2107322753, now seen corresponding path program 1 times [2019-09-07 19:09:43,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:09:43,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:09:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:09:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:09:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 69 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:09:43,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:09:43,476 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 19:09:43,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:09:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:09:43,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:09:43,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:09:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 19:09:43,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:09:43,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-07 19:09:43,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:09:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:09:43,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:09:43,752 INFO L87 Difference]: Start difference. First operand 93392 states and 144403 transitions. Second operand 9 states. [2019-09-07 19:10:10,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:10:10,421 INFO L93 Difference]: Finished difference Result 224236 states and 365407 transitions. [2019-09-07 19:10:10,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 19:10:10,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 292 [2019-09-07 19:10:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:10:10,916 INFO L225 Difference]: With dead ends: 224236 [2019-09-07 19:10:10,916 INFO L226 Difference]: Without dead ends: 130854 [2019-09-07 19:10:11,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2019-09-07 19:10:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130854 states. [2019-09-07 19:10:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130854 to 120847. [2019-09-07 19:10:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120847 states. [2019-09-07 19:10:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120847 states to 120847 states and 147668 transitions. [2019-09-07 19:10:13,770 INFO L78 Accepts]: Start accepts. Automaton has 120847 states and 147668 transitions. Word has length 292 [2019-09-07 19:10:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:10:13,771 INFO L475 AbstractCegarLoop]: Abstraction has 120847 states and 147668 transitions. [2019-09-07 19:10:13,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:10:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 120847 states and 147668 transitions. [2019-09-07 19:10:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-07 19:10:13,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:10:13,781 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:10:13,782 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:10:13,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:10:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash -611314063, now seen corresponding path program 1 times [2019-09-07 19:10:13,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:10:13,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:10:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:13,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-07 19:10:16,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:10:16,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:10:16,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:10:16,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:10:16,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:10:16,970 INFO L87 Difference]: Start difference. First operand 120847 states and 147668 transitions. Second operand 4 states. [2019-09-07 19:10:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:10:24,796 INFO L93 Difference]: Finished difference Result 292881 states and 362725 transitions. [2019-09-07 19:10:24,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:10:24,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-09-07 19:10:24,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:10:25,253 INFO L225 Difference]: With dead ends: 292881 [2019-09-07 19:10:25,253 INFO L226 Difference]: Without dead ends: 172807 [2019-09-07 19:10:25,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:10:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172807 states. [2019-09-07 19:10:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172807 to 165091. [2019-09-07 19:10:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165091 states. [2019-09-07 19:10:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165091 states to 165091 states and 203507 transitions. [2019-09-07 19:10:31,174 INFO L78 Accepts]: Start accepts. Automaton has 165091 states and 203507 transitions. Word has length 337 [2019-09-07 19:10:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:10:31,175 INFO L475 AbstractCegarLoop]: Abstraction has 165091 states and 203507 transitions. [2019-09-07 19:10:31,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:10:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 165091 states and 203507 transitions. [2019-09-07 19:10:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-07 19:10:31,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:10:31,186 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:10:31,186 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:10:31,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:10:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1504360271, now seen corresponding path program 1 times [2019-09-07 19:10:31,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:10:31,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:10:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:31,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 220 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:10:31,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:10:31,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:10:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:10:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:31,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:10:31,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:10:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 220 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:10:31,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:10:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:10:31,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:10:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:10:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:10:31,848 INFO L87 Difference]: Start difference. First operand 165091 states and 203507 transitions. Second operand 9 states. [2019-09-07 19:10:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:10:44,014 INFO L93 Difference]: Finished difference Result 380870 states and 496840 transitions. [2019-09-07 19:10:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 19:10:44,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 382 [2019-09-07 19:10:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:10:44,765 INFO L225 Difference]: With dead ends: 380870 [2019-09-07 19:10:44,765 INFO L226 Difference]: Without dead ends: 216552 [2019-09-07 19:10:45,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:10:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216552 states. [2019-09-07 19:10:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216552 to 211216. [2019-09-07 19:10:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211216 states. [2019-09-07 19:10:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211216 states to 211216 states and 267903 transitions. [2019-09-07 19:10:53,819 INFO L78 Accepts]: Start accepts. Automaton has 211216 states and 267903 transitions. Word has length 382 [2019-09-07 19:10:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:10:53,820 INFO L475 AbstractCegarLoop]: Abstraction has 211216 states and 267903 transitions. [2019-09-07 19:10:53,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:10:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 211216 states and 267903 transitions. [2019-09-07 19:10:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2019-09-07 19:10:53,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:10:53,855 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:10:53,856 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:10:53,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:10:53,856 INFO L82 PathProgramCache]: Analyzing trace with hash 155739457, now seen corresponding path program 1 times [2019-09-07 19:10:53,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:10:53,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:10:53,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:53,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:53,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:10:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 321 proven. 36 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-07 19:10:54,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:10:54,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:10:54,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:10:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:10:54,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:10:54,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:10:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-09-07 19:10:54,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:10:54,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-09-07 19:10:54,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:10:54,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:10:54,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:10:54,499 INFO L87 Difference]: Start difference. First operand 211216 states and 267903 transitions. Second operand 4 states. [2019-09-07 19:11:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:02,706 INFO L93 Difference]: Finished difference Result 420569 states and 542714 transitions. [2019-09-07 19:11:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 19:11:02,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 504 [2019-09-07 19:11:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:03,382 INFO L225 Difference]: With dead ends: 420569 [2019-09-07 19:11:03,382 INFO L226 Difference]: Without dead ends: 220149 [2019-09-07 19:11:08,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 507 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:11:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220149 states. [2019-09-07 19:11:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220149 to 216073. [2019-09-07 19:11:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216073 states. [2019-09-07 19:11:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216073 states to 216073 states and 264060 transitions. [2019-09-07 19:11:11,376 INFO L78 Accepts]: Start accepts. Automaton has 216073 states and 264060 transitions. Word has length 504 [2019-09-07 19:11:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:11,377 INFO L475 AbstractCegarLoop]: Abstraction has 216073 states and 264060 transitions. [2019-09-07 19:11:11,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:11:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 216073 states and 264060 transitions. [2019-09-07 19:11:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-07 19:11:11,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:11,415 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:11:11,415 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 569008889, now seen corresponding path program 1 times [2019-09-07 19:11:11,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:11,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:11,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:11,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 567 proven. 6 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-09-07 19:11:11,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:11:11,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:11:11,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:11,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:11:11,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:11:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 482 proven. 2 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-07 19:11:12,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:11:12,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 19:11:12,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:12,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:12,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:12,105 INFO L87 Difference]: Start difference. First operand 216073 states and 264060 transitions. Second operand 6 states. [2019-09-07 19:11:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:11:25,976 INFO L93 Difference]: Finished difference Result 499009 states and 615913 transitions. [2019-09-07 19:11:25,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 19:11:25,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 564 [2019-09-07 19:11:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:11:26,711 INFO L225 Difference]: With dead ends: 499009 [2019-09-07 19:11:26,711 INFO L226 Difference]: Without dead ends: 283709 [2019-09-07 19:11:27,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:11:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283709 states. [2019-09-07 19:11:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283709 to 275919. [2019-09-07 19:11:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275919 states. [2019-09-07 19:11:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275919 states to 275919 states and 333156 transitions. [2019-09-07 19:11:36,828 INFO L78 Accepts]: Start accepts. Automaton has 275919 states and 333156 transitions. Word has length 564 [2019-09-07 19:11:36,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:11:36,829 INFO L475 AbstractCegarLoop]: Abstraction has 275919 states and 333156 transitions. [2019-09-07 19:11:36,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:11:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 275919 states and 333156 transitions. [2019-09-07 19:11:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2019-09-07 19:11:37,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:11:37,060 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:11:37,061 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:11:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:11:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash -336131401, now seen corresponding path program 1 times [2019-09-07 19:11:37,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:11:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:11:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:37,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:37,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:11:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 581 proven. 2 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-09-07 19:11:38,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:11:38,787 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:11:38,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:11:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:11:39,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 19:11:39,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:11:39,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:11:39,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:11:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-09-07 19:11:39,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:11:39,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 19:11:39,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:11:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:11:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:11:39,568 INFO L87 Difference]: Start difference. First operand 275919 states and 333156 transitions. Second operand 6 states. [2019-09-07 19:12:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:12:03,249 INFO L93 Difference]: Finished difference Result 702661 states and 855587 transitions. [2019-09-07 19:12:03,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 19:12:03,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 844 [2019-09-07 19:12:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:12:03,258 INFO L225 Difference]: With dead ends: 702661 [2019-09-07 19:12:03,258 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 19:12:04,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-09-07 19:12:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 19:12:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 19:12:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 19:12:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 19:12:04,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 844 [2019-09-07 19:12:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:12:04,119 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 19:12:04,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:12:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 19:12:04,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 19:12:04,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 19:12:05,155 WARN L188 SmtUtils]: Spent 823.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-09-07 19:12:09,560 WARN L188 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-09-07 19:12:12,572 WARN L188 SmtUtils]: Spent 627.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-07 19:12:16,788 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 1 [2019-09-07 19:14:31,526 WARN L188 SmtUtils]: Spent 2.22 m on a formula simplification. DAG size of input: 4338 DAG size of output: 4019 [2019-09-07 19:16:45,092 WARN L188 SmtUtils]: Spent 2.23 m on a formula simplification. DAG size of input: 4338 DAG size of output: 4019 [2019-09-07 19:17:03,796 WARN L188 SmtUtils]: Spent 18.61 s on a formula simplification. DAG size of input: 1416 DAG size of output: 94 [2019-09-07 19:17:22,082 WARN L188 SmtUtils]: Spent 18.07 s on a formula simplification. DAG size of input: 1416 DAG size of output: 94 [2019-09-07 19:17:39,995 WARN L188 SmtUtils]: Spent 17.85 s on a formula simplification. DAG size of input: 1416 DAG size of output: 94 [2019-09-07 19:17:58,287 WARN L188 SmtUtils]: Spent 18.23 s on a formula simplification. DAG size of input: 1416 DAG size of output: 94 [2019-09-07 19:18:16,794 WARN L188 SmtUtils]: Spent 18.46 s on a formula simplification. DAG size of input: 1416 DAG size of output: 94 [2019-09-07 19:18:34,897 WARN L188 SmtUtils]: Spent 17.90 s on a formula simplification. DAG size of input: 1416 DAG size of output: 94 [2019-09-07 19:18:52,815 WARN L188 SmtUtils]: Spent 17.84 s on a formula simplification. DAG size of input: 1416 DAG size of output: 94