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/systemc/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:08:47,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:08:47,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:08:47,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:08:47,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:08:47,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:08:47,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:08:47,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:08:47,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:08:47,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:08:47,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:08:47,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:08:47,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:08:47,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:08:47,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:08:47,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:08:47,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:08:47,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:08:47,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:08:47,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:08:47,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:08:47,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:08:47,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:08:47,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:08:47,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:08:47,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:08:47,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:08:47,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:08:47,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:08:47,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:08:47,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:08:47,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:08:47,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:08:47,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:08:47,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:08:47,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:08:47,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:08:47,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:08:47,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:08:47,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:08:47,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:08:47,749 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-20 13:08:47,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:08:47,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:08:47,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:08:47,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:08:47,787 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:08:47,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:08:47,788 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:08:47,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:08:47,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:08:47,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:08:47,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:08:47,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:08:47,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:08:47,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:08:47,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:08:47,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:08:47,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:08:47,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:08:47,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:08:47,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:08:47,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:08:47,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:08:47,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:08:47,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:08:47,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:08:47,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:08:47,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:08:47,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:08:47,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:08:47,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:08:47,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:08:47,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:08:47,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:08:47,845 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:08:47,846 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-09-20 13:08:47,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9446eb29b/04568d4fb9e84a6fa07ce0148093941a/FLAG5a48a8e53 [2019-09-20 13:08:48,369 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:08:48,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-09-20 13:08:48,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9446eb29b/04568d4fb9e84a6fa07ce0148093941a/FLAG5a48a8e53 [2019-09-20 13:08:48,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9446eb29b/04568d4fb9e84a6fa07ce0148093941a [2019-09-20 13:08:48,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:08:48,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:08:48,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:48,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:08:48,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:08:48,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:48" (1/1) ... [2019-09-20 13:08:48,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24178ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:48, skipping insertion in model container [2019-09-20 13:08:48,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:08:48" (1/1) ... [2019-09-20 13:08:48,744 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:08:48,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:08:49,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:49,026 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:08:49,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:08:49,179 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:08:49,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49 WrapperNode [2019-09-20 13:08:49,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:08:49,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:08:49,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:08:49,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:08:49,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (1/1) ... [2019-09-20 13:08:49,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (1/1) ... [2019-09-20 13:08:49,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (1/1) ... [2019-09-20 13:08:49,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (1/1) ... [2019-09-20 13:08:49,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (1/1) ... [2019-09-20 13:08:49,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (1/1) ... [2019-09-20 13:08:49,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (1/1) ... [2019-09-20 13:08:49,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:08:49,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:08:49,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:08:49,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:08:49,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (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-20 13:08:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:08:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:08:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:08:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-20 13:08:49,296 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-20 13:08:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-20 13:08:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-20 13:08:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-20 13:08:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-20 13:08:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-20 13:08:49,297 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-20 13:08:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:08:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:08:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:08:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:08:49,298 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:08:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:08:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:08:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-20 13:08:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-20 13:08:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-20 13:08:49,299 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:08:49,300 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:08:49,300 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:08:49,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:08:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:08:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:08:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:08:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-20 13:08:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-20 13:08:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-20 13:08:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-20 13:08:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-20 13:08:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-20 13:08:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-20 13:08:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-20 13:08:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-20 13:08:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:08:49,302 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:08:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:08:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:08:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:08:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:08:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:08:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-20 13:08:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-20 13:08:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:08:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:08:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:08:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:08:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:08:49,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:08:49,850 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:08:49,851 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-09-20 13:08:49,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:49 BoogieIcfgContainer [2019-09-20 13:08:49,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:08:49,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:08:49,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:08:49,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:08:49,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:08:48" (1/3) ... [2019-09-20 13:08:49,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648cb6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:49, skipping insertion in model container [2019-09-20 13:08:49,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:08:49" (2/3) ... [2019-09-20 13:08:49,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648cb6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:08:49, skipping insertion in model container [2019-09-20 13:08:49,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:08:49" (3/3) ... [2019-09-20 13:08:49,861 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2019-09-20 13:08:49,871 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:08:49,880 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:08:49,899 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:08:49,934 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:08:49,935 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:08:49,935 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:08:49,935 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:08:49,936 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:08:49,936 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:08:49,936 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:08:49,936 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:08:49,937 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:08:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-09-20 13:08:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:49,977 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:49,978 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:49,981 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:49,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1961190691, now seen corresponding path program 1 times [2019-09-20 13:08:49,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:49,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:50,386 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-20 13:08:50,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:50,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:50,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:50,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:50,417 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 5 states. [2019-09-20 13:08:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:51,094 INFO L93 Difference]: Finished difference Result 412 states and 610 transitions. [2019-09-20 13:08:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:51,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:51,115 INFO L225 Difference]: With dead ends: 412 [2019-09-20 13:08:51,115 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:08:51,124 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:08:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-09-20 13:08:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:08:51,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2019-09-20 13:08:51,253 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 105 [2019-09-20 13:08:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:51,254 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2019-09-20 13:08:51,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2019-09-20 13:08:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:51,268 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:51,269 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:51,269 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -767018655, now seen corresponding path program 1 times [2019-09-20 13:08:51,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:51,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:51,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:51,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:51,511 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-20 13:08:51,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:51,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:51,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:51,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:51,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:51,518 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand 5 states. [2019-09-20 13:08:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:52,082 INFO L93 Difference]: Finished difference Result 391 states and 548 transitions. [2019-09-20 13:08:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:52,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:52,086 INFO L225 Difference]: With dead ends: 391 [2019-09-20 13:08:52,086 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:08:52,089 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:08:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-09-20 13:08:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:08:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 257 transitions. [2019-09-20 13:08:52,113 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 257 transitions. Word has length 105 [2019-09-20 13:08:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:52,114 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 257 transitions. [2019-09-20 13:08:52,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 257 transitions. [2019-09-20 13:08:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:52,116 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:52,116 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:52,117 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:52,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1824856733, now seen corresponding path program 1 times [2019-09-20 13:08:52,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:52,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:52,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:52,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:52,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:52,216 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-20 13:08:52,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:52,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:52,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:52,220 INFO L87 Difference]: Start difference. First operand 190 states and 257 transitions. Second operand 5 states. [2019-09-20 13:08:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:52,704 INFO L93 Difference]: Finished difference Result 389 states and 542 transitions. [2019-09-20 13:08:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:52,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:52,709 INFO L225 Difference]: With dead ends: 389 [2019-09-20 13:08:52,709 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:08:52,711 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:08:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2019-09-20 13:08:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:08:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2019-09-20 13:08:52,744 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 105 [2019-09-20 13:08:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:52,745 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2019-09-20 13:08:52,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2019-09-20 13:08:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:52,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:52,747 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:52,748 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1327608097, now seen corresponding path program 1 times [2019-09-20 13:08:52,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:52,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:52,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:52,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:52,873 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-20 13:08:52,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:52,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:52,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:52,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:52,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:52,875 INFO L87 Difference]: Start difference. First operand 190 states and 256 transitions. Second operand 5 states. [2019-09-20 13:08:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:53,345 INFO L93 Difference]: Finished difference Result 387 states and 536 transitions. [2019-09-20 13:08:53,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:53,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:53,349 INFO L225 Difference]: With dead ends: 387 [2019-09-20 13:08:53,349 INFO L226 Difference]: Without dead ends: 218 [2019-09-20 13:08:53,350 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-20 13:08:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2019-09-20 13:08:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:08:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-09-20 13:08:53,370 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 105 [2019-09-20 13:08:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:53,370 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-09-20 13:08:53,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-09-20 13:08:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:53,372 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:53,372 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:53,372 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1567847843, now seen corresponding path program 1 times [2019-09-20 13:08:53,373 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:53,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:53,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:53,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:53,456 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-20 13:08:53,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:53,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:53,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:53,458 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 5 states. [2019-09-20 13:08:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:53,907 INFO L93 Difference]: Finished difference Result 407 states and 568 transitions. [2019-09-20 13:08:53,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:53,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:53,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:53,910 INFO L225 Difference]: With dead ends: 407 [2019-09-20 13:08:53,910 INFO L226 Difference]: Without dead ends: 238 [2019-09-20 13:08:53,911 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-20 13:08:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2019-09-20 13:08:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:08:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2019-09-20 13:08:53,943 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 105 [2019-09-20 13:08:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:53,944 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2019-09-20 13:08:53,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2019-09-20 13:08:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:53,945 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:53,946 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:53,946 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1888085791, now seen corresponding path program 1 times [2019-09-20 13:08:53,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:53,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:53,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:53,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,031 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-20 13:08:54,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:54,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:54,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:54,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:54,033 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand 5 states. [2019-09-20 13:08:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:54,422 INFO L93 Difference]: Finished difference Result 405 states and 562 transitions. [2019-09-20 13:08:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:54,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:54,426 INFO L225 Difference]: With dead ends: 405 [2019-09-20 13:08:54,426 INFO L226 Difference]: Without dead ends: 236 [2019-09-20 13:08:54,428 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-20 13:08:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 190. [2019-09-20 13:08:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:08:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 253 transitions. [2019-09-20 13:08:54,447 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 253 transitions. Word has length 105 [2019-09-20 13:08:54,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:54,447 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 253 transitions. [2019-09-20 13:08:54,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:54,448 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 253 transitions. [2019-09-20 13:08:54,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:54,449 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:54,449 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:54,450 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:54,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1861020189, now seen corresponding path program 1 times [2019-09-20 13:08:54,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:54,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:54,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:54,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,532 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-20 13:08:54,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:54,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:08:54,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:08:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:08:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:54,534 INFO L87 Difference]: Start difference. First operand 190 states and 253 transitions. Second operand 4 states. [2019-09-20 13:08:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:54,827 INFO L93 Difference]: Finished difference Result 518 states and 714 transitions. [2019-09-20 13:08:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:08:54,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:08:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:54,830 INFO L225 Difference]: With dead ends: 518 [2019-09-20 13:08:54,831 INFO L226 Difference]: Without dead ends: 350 [2019-09-20 13:08:54,832 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:08:54,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-20 13:08:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 345. [2019-09-20 13:08:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-20 13:08:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 459 transitions. [2019-09-20 13:08:54,875 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 459 transitions. Word has length 105 [2019-09-20 13:08:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:54,875 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 459 transitions. [2019-09-20 13:08:54,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:08:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 459 transitions. [2019-09-20 13:08:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:54,878 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:54,878 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:54,879 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash -723391324, now seen corresponding path program 1 times [2019-09-20 13:08:54,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:54,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:54,950 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-20 13:08:54,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:54,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:54,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:54,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:54,952 INFO L87 Difference]: Start difference. First operand 345 states and 459 transitions. Second operand 6 states. [2019-09-20 13:08:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,029 INFO L93 Difference]: Finished difference Result 684 states and 934 transitions. [2019-09-20 13:08:55,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:55,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:08:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,033 INFO L225 Difference]: With dead ends: 684 [2019-09-20 13:08:55,033 INFO L226 Difference]: Without dead ends: 361 [2019-09-20 13:08:55,036 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-20 13:08:55,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2019-09-20 13:08:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-20 13:08:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 463 transitions. [2019-09-20 13:08:55,087 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 463 transitions. Word has length 105 [2019-09-20 13:08:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,088 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 463 transitions. [2019-09-20 13:08:55,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 463 transitions. [2019-09-20 13:08:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:55,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,091 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:55,091 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1140787930, now seen corresponding path program 1 times [2019-09-20 13:08:55,092 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,172 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-20 13:08:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:55,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:55,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:55,174 INFO L87 Difference]: Start difference. First operand 350 states and 463 transitions. Second operand 6 states. [2019-09-20 13:08:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,231 INFO L93 Difference]: Finished difference Result 704 states and 958 transitions. [2019-09-20 13:08:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:55,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:08:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,236 INFO L225 Difference]: With dead ends: 704 [2019-09-20 13:08:55,237 INFO L226 Difference]: Without dead ends: 376 [2019-09-20 13:08:55,239 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-20 13:08:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 360. [2019-09-20 13:08:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:08:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2019-09-20 13:08:55,277 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 105 [2019-09-20 13:08:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,277 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2019-09-20 13:08:55,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2019-09-20 13:08:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:55,281 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,281 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:55,282 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash -264768924, now seen corresponding path program 1 times [2019-09-20 13:08:55,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,354 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-20 13:08:55,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:55,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:55,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:55,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:55,356 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand 6 states. [2019-09-20 13:08:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,416 INFO L93 Difference]: Finished difference Result 718 states and 968 transitions. [2019-09-20 13:08:55,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:55,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:08:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,421 INFO L225 Difference]: With dead ends: 718 [2019-09-20 13:08:55,422 INFO L226 Difference]: Without dead ends: 380 [2019-09-20 13:08:55,424 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-20 13:08:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2019-09-20 13:08:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-20 13:08:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 483 transitions. [2019-09-20 13:08:55,459 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 483 transitions. Word has length 105 [2019-09-20 13:08:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,459 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 483 transitions. [2019-09-20 13:08:55,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:55,460 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 483 transitions. [2019-09-20 13:08:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:55,462 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,462 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:55,462 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash 628717414, now seen corresponding path program 1 times [2019-09-20 13:08:55,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,527 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-20 13:08:55,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:08:55,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:08:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:08:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:55,529 INFO L87 Difference]: Start difference. First operand 370 states and 483 transitions. Second operand 6 states. [2019-09-20 13:08:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:55,584 INFO L93 Difference]: Finished difference Result 732 states and 978 transitions. [2019-09-20 13:08:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:55,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:08:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:55,587 INFO L225 Difference]: With dead ends: 732 [2019-09-20 13:08:55,588 INFO L226 Difference]: Without dead ends: 384 [2019-09-20 13:08:55,589 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-20 13:08:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2019-09-20 13:08:55,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-20 13:08:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 493 transitions. [2019-09-20 13:08:55,621 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 493 transitions. Word has length 105 [2019-09-20 13:08:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:55,621 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 493 transitions. [2019-09-20 13:08:55,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:08:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 493 transitions. [2019-09-20 13:08:55,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:55,623 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:55,623 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:55,624 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash 234350628, now seen corresponding path program 1 times [2019-09-20 13:08:55,624 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:55,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:55,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:55,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:55,699 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-20 13:08:55,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:55,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:55,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:55,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:55,701 INFO L87 Difference]: Start difference. First operand 380 states and 493 transitions. Second operand 5 states. [2019-09-20 13:08:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,295 INFO L93 Difference]: Finished difference Result 896 states and 1184 transitions. [2019-09-20 13:08:56,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:08:56,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:56,299 INFO L225 Difference]: With dead ends: 896 [2019-09-20 13:08:56,299 INFO L226 Difference]: Without dead ends: 539 [2019-09-20 13:08:56,301 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:08:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-20 13:08:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 499. [2019-09-20 13:08:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:08:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 635 transitions. [2019-09-20 13:08:56,341 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 635 transitions. Word has length 105 [2019-09-20 13:08:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,341 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 635 transitions. [2019-09-20 13:08:56,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 635 transitions. [2019-09-20 13:08:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:56,343 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,343 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:56,343 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 509110242, now seen corresponding path program 1 times [2019-09-20 13:08:56,344 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:56,399 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-20 13:08:56,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:56,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:56,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:56,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:56,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:56,401 INFO L87 Difference]: Start difference. First operand 499 states and 635 transitions. Second operand 5 states. [2019-09-20 13:08:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:56,767 INFO L93 Difference]: Finished difference Result 975 states and 1246 transitions. [2019-09-20 13:08:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:56,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:56,771 INFO L225 Difference]: With dead ends: 975 [2019-09-20 13:08:56,771 INFO L226 Difference]: Without dead ends: 499 [2019-09-20 13:08:56,773 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-20 13:08:56,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-09-20 13:08:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:08:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 630 transitions. [2019-09-20 13:08:56,822 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 630 transitions. Word has length 105 [2019-09-20 13:08:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:56,823 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 630 transitions. [2019-09-20 13:08:56,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 630 transitions. [2019-09-20 13:08:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:56,825 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:56,826 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:56,826 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1210710116, now seen corresponding path program 1 times [2019-09-20 13:08:56,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:56,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:56,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:56,919 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-20 13:08:56,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:56,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:56,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:56,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:56,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:56,921 INFO L87 Difference]: Start difference. First operand 499 states and 630 transitions. Second operand 5 states. [2019-09-20 13:08:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:57,441 INFO L93 Difference]: Finished difference Result 975 states and 1236 transitions. [2019-09-20 13:08:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:08:57,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:57,448 INFO L225 Difference]: With dead ends: 975 [2019-09-20 13:08:57,448 INFO L226 Difference]: Without dead ends: 499 [2019-09-20 13:08:57,451 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:08:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-20 13:08:57,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-09-20 13:08:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:08:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 625 transitions. [2019-09-20 13:08:57,518 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 625 transitions. Word has length 105 [2019-09-20 13:08:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:57,519 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 625 transitions. [2019-09-20 13:08:57,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 625 transitions. [2019-09-20 13:08:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:57,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:57,522 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:57,522 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1233342370, now seen corresponding path program 1 times [2019-09-20 13:08:57,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:57,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:57,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:57,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:57,640 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-20 13:08:57,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:57,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:57,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:57,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:57,642 INFO L87 Difference]: Start difference. First operand 499 states and 625 transitions. Second operand 5 states. [2019-09-20 13:08:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:58,199 INFO L93 Difference]: Finished difference Result 1073 states and 1375 transitions. [2019-09-20 13:08:58,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:58,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:58,204 INFO L225 Difference]: With dead ends: 1073 [2019-09-20 13:08:58,204 INFO L226 Difference]: Without dead ends: 596 [2019-09-20 13:08:58,207 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-20 13:08:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 561. [2019-09-20 13:08:58,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-20 13:08:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 697 transitions. [2019-09-20 13:08:58,250 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 697 transitions. Word has length 105 [2019-09-20 13:08:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:58,250 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 697 transitions. [2019-09-20 13:08:58,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 697 transitions. [2019-09-20 13:08:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:58,252 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:58,252 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:58,253 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:58,253 INFO L82 PathProgramCache]: Analyzing trace with hash 723869280, now seen corresponding path program 1 times [2019-09-20 13:08:58,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:58,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:58,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:58,352 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-20 13:08:58,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:58,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:58,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:58,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:58,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:58,357 INFO L87 Difference]: Start difference. First operand 561 states and 697 transitions. Second operand 5 states. [2019-09-20 13:08:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:59,077 INFO L93 Difference]: Finished difference Result 1325 states and 1735 transitions. [2019-09-20 13:08:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:08:59,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:59,085 INFO L225 Difference]: With dead ends: 1325 [2019-09-20 13:08:59,085 INFO L226 Difference]: Without dead ends: 786 [2019-09-20 13:08:59,089 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:08:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-20 13:08:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 647. [2019-09-20 13:08:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-20 13:08:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 786 transitions. [2019-09-20 13:08:59,169 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 786 transitions. Word has length 105 [2019-09-20 13:08:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:59,169 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 786 transitions. [2019-09-20 13:08:59,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 786 transitions. [2019-09-20 13:08:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:59,170 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:59,171 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:59,171 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1647869982, now seen corresponding path program 1 times [2019-09-20 13:08:59,171 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:59,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:59,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:59,268 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-20 13:08:59,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:59,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:08:59,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:08:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:08:59,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:08:59,270 INFO L87 Difference]: Start difference. First operand 647 states and 786 transitions. Second operand 5 states. [2019-09-20 13:08:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:08:59,823 INFO L93 Difference]: Finished difference Result 1474 states and 1904 transitions. [2019-09-20 13:08:59,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:08:59,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:08:59,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:08:59,831 INFO L225 Difference]: With dead ends: 1474 [2019-09-20 13:08:59,831 INFO L226 Difference]: Without dead ends: 849 [2019-09-20 13:08:59,834 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:08:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-09-20 13:08:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 739. [2019-09-20 13:08:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-09-20 13:08:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 886 transitions. [2019-09-20 13:08:59,898 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 886 transitions. Word has length 105 [2019-09-20 13:08:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:08:59,898 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 886 transitions. [2019-09-20 13:08:59,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:08:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2019-09-20 13:08:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:08:59,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:08:59,902 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:08:59,902 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:08:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:08:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1585830368, now seen corresponding path program 1 times [2019-09-20 13:08:59,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:08:59,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:08:59,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:08:59,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:08:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:08:59,942 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-20 13:08:59,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:08:59,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:08:59,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:08:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:08:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:08:59,945 INFO L87 Difference]: Start difference. First operand 739 states and 886 transitions. Second operand 3 states. [2019-09-20 13:09:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:00,043 INFO L93 Difference]: Finished difference Result 2099 states and 2536 transitions. [2019-09-20 13:09:00,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:00,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-20 13:09:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:00,053 INFO L225 Difference]: With dead ends: 2099 [2019-09-20 13:09:00,053 INFO L226 Difference]: Without dead ends: 1385 [2019-09-20 13:09:00,057 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 13:09:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-09-20 13:09:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2019-09-20 13:09:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-20 13:09:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1666 transitions. [2019-09-20 13:09:00,176 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1666 transitions. Word has length 105 [2019-09-20 13:09:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:00,177 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1666 transitions. [2019-09-20 13:09:00,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1666 transitions. [2019-09-20 13:09:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:09:00,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:00,179 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:09:00,180 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:00,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:00,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1038281626, now seen corresponding path program 1 times [2019-09-20 13:09:00,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:00,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:00,238 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-20 13:09:00,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:00,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:00,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:00,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:00,240 INFO L87 Difference]: Start difference. First operand 1382 states and 1666 transitions. Second operand 3 states. [2019-09-20 13:09:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:00,501 INFO L93 Difference]: Finished difference Result 4000 states and 5001 transitions. [2019-09-20 13:09:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:00,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-20 13:09:00,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:00,524 INFO L225 Difference]: With dead ends: 4000 [2019-09-20 13:09:00,524 INFO L226 Difference]: Without dead ends: 2649 [2019-09-20 13:09:00,533 INFO L636 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-20 13:09:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-09-20 13:09:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2643. [2019-09-20 13:09:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-09-20 13:09:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3237 transitions. [2019-09-20 13:09:00,787 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3237 transitions. Word has length 106 [2019-09-20 13:09:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:00,787 INFO L475 AbstractCegarLoop]: Abstraction has 2643 states and 3237 transitions. [2019-09-20 13:09:00,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3237 transitions. [2019-09-20 13:09:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:09:00,791 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:00,791 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:09:00,792 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1706050930, now seen corresponding path program 1 times [2019-09-20 13:09:00,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:00,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:00,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:00,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-20 13:09:00,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:00,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:09:00,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:09:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:09:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:00,846 INFO L87 Difference]: Start difference. First operand 2643 states and 3237 transitions. Second operand 4 states. [2019-09-20 13:09:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:01,109 INFO L93 Difference]: Finished difference Result 4719 states and 5752 transitions. [2019-09-20 13:09:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:09:01,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:09:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:01,125 INFO L225 Difference]: With dead ends: 4719 [2019-09-20 13:09:01,126 INFO L226 Difference]: Without dead ends: 2101 [2019-09-20 13:09:01,138 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:09:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-09-20 13:09:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2042. [2019-09-20 13:09:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-09-20 13:09:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2486 transitions. [2019-09-20 13:09:01,401 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2486 transitions. Word has length 127 [2019-09-20 13:09:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:01,401 INFO L475 AbstractCegarLoop]: Abstraction has 2042 states and 2486 transitions. [2019-09-20 13:09:01,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:09:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2486 transitions. [2019-09-20 13:09:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:09:01,404 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:01,404 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:09:01,405 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash -941553424, now seen corresponding path program 1 times [2019-09-20 13:09:01,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:01,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:01,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:01,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:01,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:09:01,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:01,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:01,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:01,456 INFO L87 Difference]: Start difference. First operand 2042 states and 2486 transitions. Second operand 3 states. [2019-09-20 13:09:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:01,726 INFO L93 Difference]: Finished difference Result 6036 states and 7443 transitions. [2019-09-20 13:09:01,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:01,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-20 13:09:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:01,749 INFO L225 Difference]: With dead ends: 6036 [2019-09-20 13:09:01,749 INFO L226 Difference]: Without dead ends: 3035 [2019-09-20 13:09:01,762 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 13:09:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2019-09-20 13:09:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3035. [2019-09-20 13:09:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-09-20 13:09:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 3687 transitions. [2019-09-20 13:09:02,016 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 3687 transitions. Word has length 127 [2019-09-20 13:09:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:02,016 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 3687 transitions. [2019-09-20 13:09:02,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 3687 transitions. [2019-09-20 13:09:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-20 13:09:02,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:02,022 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:09:02,022 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1911837015, now seen corresponding path program 1 times [2019-09-20 13:09:02,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:02,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:02,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-20 13:09:02,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:09:02,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:09:02,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:09:02,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:09:02,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:09:02,091 INFO L87 Difference]: Start difference. First operand 3035 states and 3687 transitions. Second operand 3 states. [2019-09-20 13:09:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:02,517 INFO L93 Difference]: Finished difference Result 8922 states and 11107 transitions. [2019-09-20 13:09:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:09:02,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-20 13:09:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:02,553 INFO L225 Difference]: With dead ends: 8922 [2019-09-20 13:09:02,553 INFO L226 Difference]: Without dead ends: 5912 [2019-09-20 13:09:02,567 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 13:09:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5912 states. [2019-09-20 13:09:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5912 to 5909. [2019-09-20 13:09:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-09-20 13:09:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 7294 transitions. [2019-09-20 13:09:03,075 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 7294 transitions. Word has length 180 [2019-09-20 13:09:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:03,076 INFO L475 AbstractCegarLoop]: Abstraction has 5909 states and 7294 transitions. [2019-09-20 13:09:03,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:09:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 7294 transitions. [2019-09-20 13:09:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-20 13:09:03,085 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:03,086 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:09:03,087 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:03,087 INFO L82 PathProgramCache]: Analyzing trace with hash -875605821, now seen corresponding path program 1 times [2019-09-20 13:09:03,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:03,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:03,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:03,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:03,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-20 13:09:03,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:09:03,190 INFO L224 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-20 13:09:03,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:03,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:09:03,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:09:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-20 13:09:03,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:09:03,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-20 13:09:03,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:09:03,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:09:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:09:03,583 INFO L87 Difference]: Start difference. First operand 5909 states and 7294 transitions. Second operand 7 states. [2019-09-20 13:09:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:05,782 INFO L93 Difference]: Finished difference Result 17777 states and 23451 transitions. [2019-09-20 13:09:05,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:09:05,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-09-20 13:09:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:05,878 INFO L225 Difference]: With dead ends: 17777 [2019-09-20 13:09:05,878 INFO L226 Difference]: Without dead ends: 11897 [2019-09-20 13:09:05,938 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:09:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11897 states. [2019-09-20 13:09:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11897 to 11894. [2019-09-20 13:09:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11894 states. [2019-09-20 13:09:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11894 states to 11894 states and 14633 transitions. [2019-09-20 13:09:07,819 INFO L78 Accepts]: Start accepts. Automaton has 11894 states and 14633 transitions. Word has length 181 [2019-09-20 13:09:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:07,821 INFO L475 AbstractCegarLoop]: Abstraction has 11894 states and 14633 transitions. [2019-09-20 13:09:07,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:09:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 11894 states and 14633 transitions. [2019-09-20 13:09:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-20 13:09:07,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:07,837 INFO L407 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, 2, 2, 2, 2, 2, 2, 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] [2019-09-20 13:09:07,837 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:07,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1139497071, now seen corresponding path program 1 times [2019-09-20 13:09:07,838 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:07,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:07,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:07,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-20 13:09:07,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:09:07,935 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:09:07,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:08,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:09:08,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:09:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 13:09:08,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:09:08,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-20 13:09:08,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:09:08,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:09:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:09:08,168 INFO L87 Difference]: Start difference. First operand 11894 states and 14633 transitions. Second operand 5 states. [2019-09-20 13:09:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:09:10,933 INFO L93 Difference]: Finished difference Result 48053 states and 64785 transitions. [2019-09-20 13:09:10,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:09:10,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 242 [2019-09-20 13:09:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:09:11,144 INFO L225 Difference]: With dead ends: 48053 [2019-09-20 13:09:11,145 INFO L226 Difference]: Without dead ends: 36192 [2019-09-20 13:09:11,215 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 247 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-20 13:09:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36192 states. [2019-09-20 13:09:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36192 to 35955. [2019-09-20 13:09:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35955 states. [2019-09-20 13:09:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35955 states to 35955 states and 45858 transitions. [2019-09-20 13:09:14,249 INFO L78 Accepts]: Start accepts. Automaton has 35955 states and 45858 transitions. Word has length 242 [2019-09-20 13:09:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:09:14,249 INFO L475 AbstractCegarLoop]: Abstraction has 35955 states and 45858 transitions. [2019-09-20 13:09:14,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:09:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 35955 states and 45858 transitions. [2019-09-20 13:09:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-20 13:09:14,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:09:14,307 INFO L407 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-20 13:09:14,307 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:09:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:09:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1709096844, now seen corresponding path program 1 times [2019-09-20 13:09:14,308 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:09:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:09:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:09:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:09:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-20 13:09:14,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:09:14,403 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:09:14,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:09:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:09:14,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 13:09:14,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:09:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 93 proven. 38 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-20 13:09:15,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:09:15,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-20 13:09:15,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:09:15,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:09:15,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:09:15,629 INFO L87 Difference]: Start difference. First operand 35955 states and 45858 transitions. Second operand 8 states.