/usr/bin/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.04.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:24:55,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:24:55,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:24:55,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:24:55,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:24:55,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:24:55,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:24:55,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:24:55,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:24:56,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:24:56,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:24:56,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:24:56,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:24:56,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:24:56,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:24:56,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:24:56,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:24:56,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:24:56,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:24:56,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:24:56,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:24:56,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:24:56,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:24:56,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:24:56,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:24:56,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:24:56,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:24:56,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:24:56,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:24:56,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:24:56,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:24:56,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:24:56,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:24:56,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:24:56,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:24:56,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:24:56,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:24:56,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:24:56,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:24:56,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:24:56,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:24:56,045 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-11-06 22:24:56,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:24:56,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:24:56,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:24:56,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:24:56,078 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:24:56,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:24:56,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:24:56,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:24:56,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:24:56,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:24:56,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:24:56,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:24:56,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:24:56,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:24:56,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:24:56,081 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:24:56,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:24:56,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:24:56,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:24:56,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:24:56,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:24:56,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:56,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:24:56,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:24:56,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:24:56,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:24:56,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:24:56,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:24:56,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:24:56,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:24:56,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:24:56,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:24:56,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:24:56,376 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:24:56,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-11-06 22:24:56,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febcf0f92/7170b82e35f7475c90a698938463753c/FLAG84786617f [2019-11-06 22:24:56,912 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:24:56,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.04.cil.c [2019-11-06 22:24:56,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febcf0f92/7170b82e35f7475c90a698938463753c/FLAG84786617f [2019-11-06 22:24:57,273 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/febcf0f92/7170b82e35f7475c90a698938463753c [2019-11-06 22:24:57,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:24:57,285 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:24:57,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:57,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:24:57,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:24:57,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3ba52e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57, skipping insertion in model container [2019-11-06 22:24:57,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,303 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:24:57,363 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:24:57,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:57,612 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:24:57,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:57,802 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:24:57,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57 WrapperNode [2019-11-06 22:24:57,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:57,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:24:57,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:24:57,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:24:57,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2019-11-06 22:24:57,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:24:57,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:24:57,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:24:57,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:24:57,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (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-11-06 22:24:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:24:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:24:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:24:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-06 22:24:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-06 22:24:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-11-06 22:24:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-11-06 22:24:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-11-06 22:24:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-06 22:24:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-06 22:24:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-11-06 22:24:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-11-06 22:24:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-11-06 22:24:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-06 22:24:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-06 22:24:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-06 22:24:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:24:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-06 22:24:57,944 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-06 22:24:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-06 22:24:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-06 22:24:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-06 22:24:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-06 22:24:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-06 22:24:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-06 22:24:57,945 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:24:57,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:24:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:24:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:24:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:24:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-06 22:24:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-06 22:24:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-11-06 22:24:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-11-06 22:24:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-11-06 22:24:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-06 22:24:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-06 22:24:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-06 22:24:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-11-06 22:24:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-11-06 22:24:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-11-06 22:24:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-06 22:24:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-06 22:24:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-06 22:24:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:24:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-06 22:24:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-06 22:24:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-06 22:24:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-06 22:24:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-06 22:24:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-06 22:24:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-06 22:24:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:24:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:24:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:24:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:24:58,655 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:24:58,655 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-06 22:24:58,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:58 BoogieIcfgContainer [2019-11-06 22:24:58,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:24:58,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:24:58,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:24:58,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:24:58,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:57" (1/3) ... [2019-11-06 22:24:58,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42da5587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:58, skipping insertion in model container [2019-11-06 22:24:58,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (2/3) ... [2019-11-06 22:24:58,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42da5587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:58, skipping insertion in model container [2019-11-06 22:24:58,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:58" (3/3) ... [2019-11-06 22:24:58,675 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2019-11-06 22:24:58,685 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:24:58,708 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:24:58,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:24:58,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:24:58,761 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:24:58,762 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:24:58,762 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:24:58,762 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:24:58,763 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:24:58,764 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:24:58,764 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:24:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states. [2019-11-06 22:24:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:58,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:58,809 INFO L410 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-11-06 22:24:58,811 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1449217388, now seen corresponding path program 1 times [2019-11-06 22:24:58,826 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:58,827 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638567395] [2019-11-06 22:24:58,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:59,591 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638567395] [2019-11-06 22:24:59,592 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:59,593 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:24:59,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683321952] [2019-11-06 22:24:59,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:24:59,602 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:59,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:24:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:59,623 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 9 states. [2019-11-06 22:25:03,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:03,731 INFO L93 Difference]: Finished difference Result 863 states and 1387 transitions. [2019-11-06 22:25:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:03,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-11-06 22:25:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:03,769 INFO L225 Difference]: With dead ends: 863 [2019-11-06 22:25:03,770 INFO L226 Difference]: Without dead ends: 637 [2019-11-06 22:25:03,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-11-06 22:25:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 416. [2019-11-06 22:25:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-06 22:25:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 582 transitions. [2019-11-06 22:25:03,927 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 582 transitions. Word has length 120 [2019-11-06 22:25:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:03,928 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 582 transitions. [2019-11-06 22:25:03,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:25:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 582 transitions. [2019-11-06 22:25:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:03,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:03,933 INFO L410 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-11-06 22:25:03,933 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:03,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1789018706, now seen corresponding path program 1 times [2019-11-06 22:25:03,934 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:03,934 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966952685] [2019-11-06 22:25:03,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:04,318 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966952685] [2019-11-06 22:25:04,318 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:04,319 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:04,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245855680] [2019-11-06 22:25:04,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:04,326 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:04,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:04,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:04,327 INFO L87 Difference]: Start difference. First operand 416 states and 582 transitions. Second operand 10 states. [2019-11-06 22:25:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:06,550 INFO L93 Difference]: Finished difference Result 1022 states and 1494 transitions. [2019-11-06 22:25:06,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:25:06,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:06,558 INFO L225 Difference]: With dead ends: 1022 [2019-11-06 22:25:06,558 INFO L226 Difference]: Without dead ends: 628 [2019-11-06 22:25:06,560 INFO L630 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-11-06 22:25:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-06 22:25:06,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 416. [2019-11-06 22:25:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-06 22:25:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 575 transitions. [2019-11-06 22:25:06,618 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 575 transitions. Word has length 120 [2019-11-06 22:25:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:06,619 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 575 transitions. [2019-11-06 22:25:06,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 575 transitions. [2019-11-06 22:25:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:06,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:06,622 INFO L410 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-11-06 22:25:06,623 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash 896420626, now seen corresponding path program 1 times [2019-11-06 22:25:06,623 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:06,624 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122882367] [2019-11-06 22:25:06,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:06,896 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122882367] [2019-11-06 22:25:06,896 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:06,896 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:06,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089928460] [2019-11-06 22:25:06,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:06,897 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:06,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:06,898 INFO L87 Difference]: Start difference. First operand 416 states and 575 transitions. Second operand 10 states. [2019-11-06 22:25:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:09,045 INFO L93 Difference]: Finished difference Result 1018 states and 1472 transitions. [2019-11-06 22:25:09,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:25:09,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:09,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:09,053 INFO L225 Difference]: With dead ends: 1018 [2019-11-06 22:25:09,053 INFO L226 Difference]: Without dead ends: 624 [2019-11-06 22:25:09,055 INFO L630 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-11-06 22:25:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-11-06 22:25:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 416. [2019-11-06 22:25:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-06 22:25:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 568 transitions. [2019-11-06 22:25:09,102 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 568 transitions. Word has length 120 [2019-11-06 22:25:09,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:09,103 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 568 transitions. [2019-11-06 22:25:09,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:09,103 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 568 transitions. [2019-11-06 22:25:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:09,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:09,106 INFO L410 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-11-06 22:25:09,106 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash -794940846, now seen corresponding path program 1 times [2019-11-06 22:25:09,107 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:09,107 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326673524] [2019-11-06 22:25:09,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:09,359 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326673524] [2019-11-06 22:25:09,359 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:09,359 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:09,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299046939] [2019-11-06 22:25:09,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:09,360 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:09,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:09,361 INFO L87 Difference]: Start difference. First operand 416 states and 568 transitions. Second operand 10 states. [2019-11-06 22:25:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:11,257 INFO L93 Difference]: Finished difference Result 1014 states and 1450 transitions. [2019-11-06 22:25:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:25:11,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:11,269 INFO L225 Difference]: With dead ends: 1014 [2019-11-06 22:25:11,270 INFO L226 Difference]: Without dead ends: 620 [2019-11-06 22:25:11,272 INFO L630 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-11-06 22:25:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-11-06 22:25:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 416. [2019-11-06 22:25:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-06 22:25:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 561 transitions. [2019-11-06 22:25:11,364 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 561 transitions. Word has length 120 [2019-11-06 22:25:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:11,364 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 561 transitions. [2019-11-06 22:25:11,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 561 transitions. [2019-11-06 22:25:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:11,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:11,368 INFO L410 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-11-06 22:25:11,369 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1403690222, now seen corresponding path program 1 times [2019-11-06 22:25:11,370 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:11,370 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580695531] [2019-11-06 22:25:11,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:11,658 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580695531] [2019-11-06 22:25:11,658 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:11,658 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:11,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3685509] [2019-11-06 22:25:11,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:11,659 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:11,660 INFO L87 Difference]: Start difference. First operand 416 states and 561 transitions. Second operand 10 states. [2019-11-06 22:25:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:14,444 INFO L93 Difference]: Finished difference Result 1233 states and 1825 transitions. [2019-11-06 22:25:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:14,445 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:14,451 INFO L225 Difference]: With dead ends: 1233 [2019-11-06 22:25:14,451 INFO L226 Difference]: Without dead ends: 839 [2019-11-06 22:25:14,454 INFO L630 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-11-06 22:25:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-11-06 22:25:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 528. [2019-11-06 22:25:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-06 22:25:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 691 transitions. [2019-11-06 22:25:14,526 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 691 transitions. Word has length 120 [2019-11-06 22:25:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:14,526 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 691 transitions. [2019-11-06 22:25:14,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 691 transitions. [2019-11-06 22:25:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:14,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:14,528 INFO L410 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-11-06 22:25:14,529 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash 973327314, now seen corresponding path program 1 times [2019-11-06 22:25:14,529 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:14,529 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338049043] [2019-11-06 22:25:14,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:14,766 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338049043] [2019-11-06 22:25:14,767 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:14,767 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:14,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122725059] [2019-11-06 22:25:14,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:14,768 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:14,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:14,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:14,769 INFO L87 Difference]: Start difference. First operand 528 states and 691 transitions. Second operand 10 states. [2019-11-06 22:25:17,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:17,564 INFO L93 Difference]: Finished difference Result 1489 states and 2131 transitions. [2019-11-06 22:25:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:17,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:17,574 INFO L225 Difference]: With dead ends: 1489 [2019-11-06 22:25:17,574 INFO L226 Difference]: Without dead ends: 983 [2019-11-06 22:25:17,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:25:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-11-06 22:25:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 640. [2019-11-06 22:25:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-11-06 22:25:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 817 transitions. [2019-11-06 22:25:17,640 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 817 transitions. Word has length 120 [2019-11-06 22:25:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:17,641 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 817 transitions. [2019-11-06 22:25:17,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 817 transitions. [2019-11-06 22:25:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:17,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:17,643 INFO L410 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-11-06 22:25:17,643 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash 518555283, now seen corresponding path program 1 times [2019-11-06 22:25:17,644 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:17,644 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334198674] [2019-11-06 22:25:17,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:18,024 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334198674] [2019-11-06 22:25:18,024 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:18,024 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:18,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662199081] [2019-11-06 22:25:18,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:18,025 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:18,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:18,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:18,026 INFO L87 Difference]: Start difference. First operand 640 states and 817 transitions. Second operand 10 states. [2019-11-06 22:25:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:20,874 INFO L93 Difference]: Finished difference Result 1745 states and 2429 transitions. [2019-11-06 22:25:20,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:20,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:20,882 INFO L225 Difference]: With dead ends: 1745 [2019-11-06 22:25:20,882 INFO L226 Difference]: Without dead ends: 1127 [2019-11-06 22:25:20,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:25:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-11-06 22:25:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 752. [2019-11-06 22:25:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-11-06 22:25:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 939 transitions. [2019-11-06 22:25:20,964 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 939 transitions. Word has length 120 [2019-11-06 22:25:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:20,965 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 939 transitions. [2019-11-06 22:25:20,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 939 transitions. [2019-11-06 22:25:20,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:20,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:20,967 INFO L410 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-11-06 22:25:20,967 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:20,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash -658850126, now seen corresponding path program 1 times [2019-11-06 22:25:20,968 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:20,968 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329182792] [2019-11-06 22:25:20,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:21,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:21,178 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329182792] [2019-11-06 22:25:21,178 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:21,178 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:21,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588478338] [2019-11-06 22:25:21,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:21,179 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:21,180 INFO L87 Difference]: Start difference. First operand 752 states and 939 transitions. Second operand 10 states. [2019-11-06 22:25:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:23,623 INFO L93 Difference]: Finished difference Result 1991 states and 2707 transitions. [2019-11-06 22:25:23,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:25:23,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:23,632 INFO L225 Difference]: With dead ends: 1991 [2019-11-06 22:25:23,632 INFO L226 Difference]: Without dead ends: 1261 [2019-11-06 22:25:23,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:25:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-11-06 22:25:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 858. [2019-11-06 22:25:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-11-06 22:25:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1051 transitions. [2019-11-06 22:25:23,778 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1051 transitions. Word has length 120 [2019-11-06 22:25:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:23,778 INFO L462 AbstractCegarLoop]: Abstraction has 858 states and 1051 transitions. [2019-11-06 22:25:23,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1051 transitions. [2019-11-06 22:25:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:23,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:23,780 INFO L410 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-11-06 22:25:23,780 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:23,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:23,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1767945777, now seen corresponding path program 1 times [2019-11-06 22:25:23,781 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:23,781 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533541860] [2019-11-06 22:25:23,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:24,011 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533541860] [2019-11-06 22:25:24,013 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:24,013 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:24,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836278157] [2019-11-06 22:25:24,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:24,014 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:24,014 INFO L87 Difference]: Start difference. First operand 858 states and 1051 transitions. Second operand 10 states. [2019-11-06 22:25:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:26,641 INFO L93 Difference]: Finished difference Result 2086 states and 2698 transitions. [2019-11-06 22:25:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:25:26,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:26,650 INFO L225 Difference]: With dead ends: 2086 [2019-11-06 22:25:26,650 INFO L226 Difference]: Without dead ends: 1251 [2019-11-06 22:25:26,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:25:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-11-06 22:25:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 883. [2019-11-06 22:25:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-11-06 22:25:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1071 transitions. [2019-11-06 22:25:26,752 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1071 transitions. Word has length 120 [2019-11-06 22:25:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:26,753 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1071 transitions. [2019-11-06 22:25:26,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1071 transitions. [2019-11-06 22:25:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:26,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:26,755 INFO L410 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-11-06 22:25:26,755 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash -792917069, now seen corresponding path program 1 times [2019-11-06 22:25:26,756 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:26,756 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567914076] [2019-11-06 22:25:26,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:26,992 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567914076] [2019-11-06 22:25:26,993 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:26,993 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:26,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749195798] [2019-11-06 22:25:26,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:26,995 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:26,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:26,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:26,995 INFO L87 Difference]: Start difference. First operand 883 states and 1071 transitions. Second operand 10 states. [2019-11-06 22:25:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:29,772 INFO L93 Difference]: Finished difference Result 2075 states and 2647 transitions. [2019-11-06 22:25:29,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:29,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:29,780 INFO L225 Difference]: With dead ends: 2075 [2019-11-06 22:25:29,780 INFO L226 Difference]: Without dead ends: 1215 [2019-11-06 22:25:29,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-11-06 22:25:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 893. [2019-11-06 22:25:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-11-06 22:25:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1073 transitions. [2019-11-06 22:25:29,896 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1073 transitions. Word has length 120 [2019-11-06 22:25:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:29,897 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1073 transitions. [2019-11-06 22:25:29,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1073 transitions. [2019-11-06 22:25:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:29,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:29,899 INFO L410 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-11-06 22:25:29,899 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1524884495, now seen corresponding path program 1 times [2019-11-06 22:25:29,900 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:29,901 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864979675] [2019-11-06 22:25:29,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:30,150 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864979675] [2019-11-06 22:25:30,150 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:30,150 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:30,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333545881] [2019-11-06 22:25:30,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:30,151 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:30,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:30,151 INFO L87 Difference]: Start difference. First operand 893 states and 1073 transitions. Second operand 10 states. [2019-11-06 22:25:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:25:33,413 INFO L93 Difference]: Finished difference Result 2082 states and 2625 transitions. [2019-11-06 22:25:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:25:33,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:25:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:25:33,421 INFO L225 Difference]: With dead ends: 2082 [2019-11-06 22:25:33,421 INFO L226 Difference]: Without dead ends: 1212 [2019-11-06 22:25:33,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:25:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-11-06 22:25:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 903. [2019-11-06 22:25:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-11-06 22:25:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1075 transitions. [2019-11-06 22:25:33,516 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1075 transitions. Word has length 120 [2019-11-06 22:25:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:25:33,516 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1075 transitions. [2019-11-06 22:25:33,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:25:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1075 transitions. [2019-11-06 22:25:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:25:33,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:25:33,518 INFO L410 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-11-06 22:25:33,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:25:33,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:25:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -263967245, now seen corresponding path program 1 times [2019-11-06 22:25:33,519 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:25:33,519 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9608892] [2019-11-06 22:25:33,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:25:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:25:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:25:33,726 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9608892] [2019-11-06 22:25:33,726 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:25:33,726 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:25:33,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920013077] [2019-11-06 22:25:33,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:25:33,727 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:25:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:25:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:25:33,728 INFO L87 Difference]: Start difference. First operand 903 states and 1075 transitions. Second operand 10 states.