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/token_ring.04.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:51:25,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:51:25,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:51:25,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:51:25,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:51:25,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:51:25,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:51:25,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:51:25,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:51:25,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:51:25,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:51:25,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:51:25,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:51:25,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:51:25,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:51:25,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:51:25,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:51:25,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:51:25,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:51:26,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:51:26,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:51:26,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:51:26,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:51:26,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:51:26,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:51:26,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:51:26,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:51:26,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:51:26,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:51:26,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:51:26,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:51:26,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:51:26,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:51:26,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:51:26,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:51:26,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:51:26,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:51:26,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:51:26,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:51:26,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:51:26,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:51:26,036 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-10-13 19:51:26,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:51:26,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:51:26,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:51:26,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:51:26,064 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:51:26,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:51:26,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:51:26,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:51:26,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:51:26,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:51:26,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:51:26,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:51:26,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:51:26,067 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:51:26,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:51:26,068 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:51:26,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:51:26,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:51:26,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:51:26,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:51:26,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:51:26,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:26,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:51:26,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:51:26,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:51:26,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:51:26,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:51:26,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:51:26,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:51:26,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:51:26,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:51:26,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:51:26,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:51:26,427 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:51:26,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-10-13 19:51:26,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4385e07c/be51de22ee7240539cfa18732ee7125d/FLAG6b95d0990 [2019-10-13 19:51:26,998 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:51:26,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-10-13 19:51:27,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4385e07c/be51de22ee7240539cfa18732ee7125d/FLAG6b95d0990 [2019-10-13 19:51:27,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4385e07c/be51de22ee7240539cfa18732ee7125d [2019-10-13 19:51:27,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:51:27,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:51:27,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:27,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:51:27,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:51:27,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691c56bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27, skipping insertion in model container [2019-10-13 19:51:27,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,390 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:51:27,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:51:27,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:27,705 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:51:27,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:51:27,902 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:51:27,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27 WrapperNode [2019-10-13 19:51:27,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:51:27,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:51:27,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:51:27,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:51:27,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... [2019-10-13 19:51:27,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:51:27,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:51:27,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:51:27,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:51:27,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:51:28,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:51:28,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:51:28,036 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 19:51:28,036 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 19:51:28,037 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 19:51:28,037 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 19:51:28,037 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-13 19:51:28,037 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-13 19:51:28,037 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 19:51:28,037 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 19:51:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 19:51:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-13 19:51:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-13 19:51:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 19:51:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 19:51:28,038 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 19:51:28,039 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 19:51:28,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 19:51:28,039 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 19:51:28,039 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 19:51:28,039 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 19:51:28,039 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 19:51:28,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 19:51:28,040 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 19:51:28,040 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 19:51:28,040 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 19:51:28,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:51:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:51:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 19:51:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 19:51:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 19:51:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 19:51:28,041 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-13 19:51:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-13 19:51:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 19:51:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:51:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 19:51:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 19:51:28,042 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 19:51:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-13 19:51:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-13 19:51:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 19:51:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 19:51:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 19:51:28,043 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 19:51:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 19:51:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 19:51:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 19:51:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 19:51:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 19:51:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 19:51:28,044 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 19:51:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 19:51:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:51:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:51:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:51:28,845 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:51:28,846 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-13 19:51:28,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:28 BoogieIcfgContainer [2019-10-13 19:51:28,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:51:28,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:51:28,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:51:28,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:51:28,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:51:27" (1/3) ... [2019-10-13 19:51:28,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2e39f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:28, skipping insertion in model container [2019-10-13 19:51:28,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:51:27" (2/3) ... [2019-10-13 19:51:28,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2e39f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:51:28, skipping insertion in model container [2019-10-13 19:51:28,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:51:28" (3/3) ... [2019-10-13 19:51:28,865 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2019-10-13 19:51:28,876 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:51:28,898 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:51:28,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:51:28,951 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:51:28,951 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:51:28,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:51:28,952 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:51:28,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:51:28,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:51:28,954 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:51:28,954 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:51:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-10-13 19:51:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:29,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:29,022 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:29,025 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1526033595, now seen corresponding path program 1 times [2019-10-13 19:51:29,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:29,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449853774] [2019-10-13 19:51:29,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:29,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:29,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,476 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-10-13 19:51:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:29,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449853774] [2019-10-13 19:51:29,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:29,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:51:29,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802189579] [2019-10-13 19:51:29,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:51:29,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:51:29,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:51:29,825 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 8 states. [2019-10-13 19:51:30,004 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-13 19:51:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:32,660 INFO L93 Difference]: Finished difference Result 602 states and 952 transitions. [2019-10-13 19:51:32,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:51:32,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2019-10-13 19:51:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:32,683 INFO L225 Difference]: With dead ends: 602 [2019-10-13 19:51:32,683 INFO L226 Difference]: Without dead ends: 365 [2019-10-13 19:51:32,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:51:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-10-13 19:51:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 232. [2019-10-13 19:51:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 19:51:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2019-10-13 19:51:32,799 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 120 [2019-10-13 19:51:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:32,799 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2019-10-13 19:51:32,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:51:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2019-10-13 19:51:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:32,805 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:32,806 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:32,806 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash -735539655, now seen corresponding path program 1 times [2019-10-13 19:51:32,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:32,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813178594] [2019-10-13 19:51:32,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:32,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:32,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:33,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813178594] [2019-10-13 19:51:33,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:33,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 19:51:33,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001501927] [2019-10-13 19:51:33,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:51:33,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:51:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:51:33,266 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand 9 states. [2019-10-13 19:51:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:37,216 INFO L93 Difference]: Finished difference Result 878 states and 1309 transitions. [2019-10-13 19:51:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:51:37,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-10-13 19:51:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:37,232 INFO L225 Difference]: With dead ends: 878 [2019-10-13 19:51:37,232 INFO L226 Difference]: Without dead ends: 668 [2019-10-13 19:51:37,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:51:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-10-13 19:51:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 440. [2019-10-13 19:51:37,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 19:51:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 627 transitions. [2019-10-13 19:51:37,351 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 627 transitions. Word has length 120 [2019-10-13 19:51:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:37,353 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 627 transitions. [2019-10-13 19:51:37,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:51:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 627 transitions. [2019-10-13 19:51:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:37,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:37,360 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:37,360 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:37,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash 258713141, now seen corresponding path program 1 times [2019-10-13 19:51:37,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:37,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862293929] [2019-10-13 19:51:37,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:37,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:37,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:37,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862293929] [2019-10-13 19:51:37,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:37,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:37,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666153442] [2019-10-13 19:51:37,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:37,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:37,655 INFO L87 Difference]: Start difference. First operand 440 states and 627 transitions. Second operand 10 states. [2019-10-13 19:51:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:39,835 INFO L93 Difference]: Finished difference Result 1080 states and 1605 transitions. [2019-10-13 19:51:39,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:39,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:51:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:39,847 INFO L225 Difference]: With dead ends: 1080 [2019-10-13 19:51:39,848 INFO L226 Difference]: Without dead ends: 662 [2019-10-13 19:51:39,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:51:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-13 19:51:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 440. [2019-10-13 19:51:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 19:51:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 620 transitions. [2019-10-13 19:51:39,933 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 620 transitions. Word has length 120 [2019-10-13 19:51:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:39,934 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 620 transitions. [2019-10-13 19:51:39,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 620 transitions. [2019-10-13 19:51:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:39,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:39,936 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:39,936 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:39,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1085502159, now seen corresponding path program 1 times [2019-10-13 19:51:39,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:39,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700557423] [2019-10-13 19:51:39,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:39,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:39,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:40,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700557423] [2019-10-13 19:51:40,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:40,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:40,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495325737] [2019-10-13 19:51:40,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:40,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:40,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:40,241 INFO L87 Difference]: Start difference. First operand 440 states and 620 transitions. Second operand 10 states. [2019-10-13 19:51:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:42,643 INFO L93 Difference]: Finished difference Result 1080 states and 1587 transitions. [2019-10-13 19:51:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:42,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:51:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:42,650 INFO L225 Difference]: With dead ends: 1080 [2019-10-13 19:51:42,650 INFO L226 Difference]: Without dead ends: 662 [2019-10-13 19:51:42,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:51:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-13 19:51:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 440. [2019-10-13 19:51:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 19:51:42,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 613 transitions. [2019-10-13 19:51:42,716 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 613 transitions. Word has length 120 [2019-10-13 19:51:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:42,716 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 613 transitions. [2019-10-13 19:51:42,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 613 transitions. [2019-10-13 19:51:42,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:42,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:42,718 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:42,719 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:42,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1969011149, now seen corresponding path program 1 times [2019-10-13 19:51:42,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:42,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467671419] [2019-10-13 19:51:42,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:42,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:42,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:43,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467671419] [2019-10-13 19:51:43,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:43,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:43,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814448381] [2019-10-13 19:51:43,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:43,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:43,074 INFO L87 Difference]: Start difference. First operand 440 states and 613 transitions. Second operand 10 states. [2019-10-13 19:51:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:45,584 INFO L93 Difference]: Finished difference Result 1080 states and 1569 transitions. [2019-10-13 19:51:45,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 19:51:45,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:51:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:45,591 INFO L225 Difference]: With dead ends: 1080 [2019-10-13 19:51:45,592 INFO L226 Difference]: Without dead ends: 662 [2019-10-13 19:51:45,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:51:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-13 19:51:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 440. [2019-10-13 19:51:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 19:51:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 606 transitions. [2019-10-13 19:51:45,713 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 606 transitions. Word has length 120 [2019-10-13 19:51:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:45,713 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 606 transitions. [2019-10-13 19:51:45,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 606 transitions. [2019-10-13 19:51:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:45,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:45,716 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:45,717 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1974879185, now seen corresponding path program 1 times [2019-10-13 19:51:45,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:45,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333720623] [2019-10-13 19:51:45,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:45,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:45,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:45,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333720623] [2019-10-13 19:51:45,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:45,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:45,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379005754] [2019-10-13 19:51:45,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:45,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:45,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:45,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:45,991 INFO L87 Difference]: Start difference. First operand 440 states and 606 transitions. Second operand 10 states. [2019-10-13 19:51:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:49,114 INFO L93 Difference]: Finished difference Result 1299 states and 1947 transitions. [2019-10-13 19:51:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:49,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:51:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:49,122 INFO L225 Difference]: With dead ends: 1299 [2019-10-13 19:51:49,123 INFO L226 Difference]: Without dead ends: 881 [2019-10-13 19:51:49,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:51:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-10-13 19:51:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 552. [2019-10-13 19:51:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-13 19:51:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 737 transitions. [2019-10-13 19:51:49,195 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 737 transitions. Word has length 120 [2019-10-13 19:51:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:49,196 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 737 transitions. [2019-10-13 19:51:49,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 737 transitions. [2019-10-13 19:51:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:49,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:49,201 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:49,202 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1512329902, now seen corresponding path program 1 times [2019-10-13 19:51:49,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:49,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420469912] [2019-10-13 19:51:49,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:49,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:49,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:49,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420469912] [2019-10-13 19:51:49,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:49,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:49,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541322821] [2019-10-13 19:51:49,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:49,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:49,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:49,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:49,478 INFO L87 Difference]: Start difference. First operand 552 states and 737 transitions. Second operand 10 states. [2019-10-13 19:51:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:52,578 INFO L93 Difference]: Finished difference Result 1555 states and 2257 transitions. [2019-10-13 19:51:52,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:51:52,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:51:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:52,588 INFO L225 Difference]: With dead ends: 1555 [2019-10-13 19:51:52,589 INFO L226 Difference]: Without dead ends: 1025 [2019-10-13 19:51:52,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:51:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-10-13 19:51:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 664. [2019-10-13 19:51:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-10-13 19:51:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 864 transitions. [2019-10-13 19:51:52,674 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 864 transitions. Word has length 120 [2019-10-13 19:51:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:52,674 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 864 transitions. [2019-10-13 19:51:52,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 864 transitions. [2019-10-13 19:51:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:52,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:52,676 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:52,676 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:52,676 INFO L82 PathProgramCache]: Analyzing trace with hash -144739762, now seen corresponding path program 1 times [2019-10-13 19:51:52,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:52,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048465354] [2019-10-13 19:51:52,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:52,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:52,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048465354] [2019-10-13 19:51:52,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:52,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:52,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490110788] [2019-10-13 19:51:52,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:52,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:52,903 INFO L87 Difference]: Start difference. First operand 664 states and 864 transitions. Second operand 10 states. [2019-10-13 19:51:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:55,958 INFO L93 Difference]: Finished difference Result 1811 states and 2557 transitions. [2019-10-13 19:51:55,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:55,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:51:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:55,967 INFO L225 Difference]: With dead ends: 1811 [2019-10-13 19:51:55,967 INFO L226 Difference]: Without dead ends: 1169 [2019-10-13 19:51:55,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:51:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-10-13 19:51:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 776. [2019-10-13 19:51:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-10-13 19:51:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 987 transitions. [2019-10-13 19:51:56,074 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 987 transitions. Word has length 120 [2019-10-13 19:51:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:56,075 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 987 transitions. [2019-10-13 19:51:56,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 987 transitions. [2019-10-13 19:51:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:56,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:56,076 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:56,076 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1007754706, now seen corresponding path program 1 times [2019-10-13 19:51:56,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:56,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906507021] [2019-10-13 19:51:56,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:56,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:56,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:56,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906507021] [2019-10-13 19:51:56,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:56,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:56,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457237743] [2019-10-13 19:51:56,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:56,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:56,307 INFO L87 Difference]: Start difference. First operand 776 states and 987 transitions. Second operand 10 states. [2019-10-13 19:51:59,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:59,364 INFO L93 Difference]: Finished difference Result 2067 states and 2849 transitions. [2019-10-13 19:51:59,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:51:59,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:51:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:59,373 INFO L225 Difference]: With dead ends: 2067 [2019-10-13 19:51:59,373 INFO L226 Difference]: Without dead ends: 1313 [2019-10-13 19:51:59,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:51:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-10-13 19:51:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 888. [2019-10-13 19:51:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-13 19:51:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1106 transitions. [2019-10-13 19:51:59,481 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1106 transitions. Word has length 120 [2019-10-13 19:51:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:59,481 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1106 transitions. [2019-10-13 19:51:59,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:51:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1106 transitions. [2019-10-13 19:51:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:51:59,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:59,483 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:59,483 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:59,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash 75100622, now seen corresponding path program 1 times [2019-10-13 19:51:59,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:59,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199158995] [2019-10-13 19:51:59,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:59,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:59,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:51:59,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199158995] [2019-10-13 19:51:59,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:59,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:51:59,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70343295] [2019-10-13 19:51:59,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:51:59,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:51:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:51:59,727 INFO L87 Difference]: Start difference. First operand 888 states and 1106 transitions. Second operand 10 states. [2019-10-13 19:52:00,285 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-10-13 19:52:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:52:03,231 INFO L93 Difference]: Finished difference Result 2111 states and 2760 transitions. [2019-10-13 19:52:03,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:52:03,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-10-13 19:52:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:52:03,241 INFO L225 Difference]: With dead ends: 2111 [2019-10-13 19:52:03,241 INFO L226 Difference]: Without dead ends: 1246 [2019-10-13 19:52:03,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:52:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-10-13 19:52:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 898. [2019-10-13 19:52:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-10-13 19:52:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1108 transitions. [2019-10-13 19:52:03,440 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1108 transitions. Word has length 120 [2019-10-13 19:52:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:52:03,441 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1108 transitions. [2019-10-13 19:52:03,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:52:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1108 transitions. [2019-10-13 19:52:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:52:03,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:52:03,444 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:52:03,444 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:52:03,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:52:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash 962323468, now seen corresponding path program 1 times [2019-10-13 19:52:03,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:52:03,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007130637] [2019-10-13 19:52:03,445 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:52:03,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:52:03,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:52:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:52:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:52:03,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007130637] [2019-10-13 19:52:03,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:52:03,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 19:52:03,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606000892] [2019-10-13 19:52:03,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:52:03,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:52:03,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:52:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-13 19:52:03,886 INFO L87 Difference]: Start difference. First operand 898 states and 1108 transitions. Second operand 10 states.