/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:57:11,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:57:11,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:57:11,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:57:11,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:57:11,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:57:11,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:57:11,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:57:11,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:57:11,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:57:11,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:57:11,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:57:11,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:57:11,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:57:11,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:57:11,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:57:11,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:57:11,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:57:11,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:57:11,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:57:11,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:57:11,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:57:11,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:57:11,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:57:11,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:57:11,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:57:11,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:57:11,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:57:11,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:57:11,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:57:11,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:57:11,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:57:11,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:57:11,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:57:11,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:57:11,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:57:11,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:57:11,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:57:11,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:57:11,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:57:11,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:57:11,382 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 [2020-10-23 18:57:11,447 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:57:11,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:57:11,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:57:11,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:57:11,453 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:57:11,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:57:11,454 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:57:11,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:57:11,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:57:11,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:57:11,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:57:11,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:57:11,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:57:11,457 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:57:11,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:57:11,457 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:57:11,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:57:11,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:57:11,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:57:11,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:57:11,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:57:11,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:57:11,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:57:11,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:57:11,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:57:11,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:57:11,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:57:11,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:57:11,460 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:57:11,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 18:57:11,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:57:11,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:57:11,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:57:11,973 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:57:11,974 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:57:11,975 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-10-23 18:57:12,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085f207c1/24b932ac96304fbc9a44a98a4afe22a4/FLAGc7bf7ed7b [2020-10-23 18:57:12,825 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:57:12,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.01.cil.c [2020-10-23 18:57:12,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085f207c1/24b932ac96304fbc9a44a98a4afe22a4/FLAGc7bf7ed7b [2020-10-23 18:57:13,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085f207c1/24b932ac96304fbc9a44a98a4afe22a4 [2020-10-23 18:57:13,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:57:13,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:57:13,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:57:13,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:57:13,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:57:13,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59405cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13, skipping insertion in model container [2020-10-23 18:57:13,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:57:13,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:57:13,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:57:13,496 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:57:13,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:57:13,585 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:57:13,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13 WrapperNode [2020-10-23 18:57:13,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:57:13,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:57:13,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:57:13,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:57:13,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (1/1) ... [2020-10-23 18:57:13,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:57:13,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:57:13,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:57:13,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:57:13,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (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 [2020-10-23 18:57:13,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:57:13,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:57:13,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:57:13,765 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-10-23 18:57:13,765 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-10-23 18:57:13,765 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-10-23 18:57:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-10-23 18:57:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-10-23 18:57:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-10-23 18:57:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-10-23 18:57:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-10-23 18:57:13,766 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-10-23 18:57:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-10-23 18:57:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-10-23 18:57:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-10-23 18:57:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-10-23 18:57:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-10-23 18:57:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-10-23 18:57:13,768 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-10-23 18:57:13,768 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-10-23 18:57:13,768 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-10-23 18:57:13,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:57:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:57:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:57:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:57:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:57:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:57:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-10-23 18:57:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-10-23 18:57:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-10-23 18:57:13,769 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-10-23 18:57:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-10-23 18:57:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-10-23 18:57:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-10-23 18:57:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-10-23 18:57:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-10-23 18:57:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-10-23 18:57:13,770 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-10-23 18:57:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-10-23 18:57:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-10-23 18:57:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-10-23 18:57:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-10-23 18:57:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-10-23 18:57:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-10-23 18:57:13,771 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-10-23 18:57:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:57:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:57:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:57:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:57:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:57:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:57:13,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:57:14,667 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:57:14,669 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-23 18:57:14,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:14 BoogieIcfgContainer [2020-10-23 18:57:14,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:57:14,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:57:14,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:57:14,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:57:14,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:57:13" (1/3) ... [2020-10-23 18:57:14,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631fad88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:14, skipping insertion in model container [2020-10-23 18:57:14,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:57:13" (2/3) ... [2020-10-23 18:57:14,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631fad88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:57:14, skipping insertion in model container [2020-10-23 18:57:14,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:57:14" (3/3) ... [2020-10-23 18:57:14,687 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2020-10-23 18:57:14,704 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:57:14,711 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:57:14,728 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:57:14,774 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:57:14,774 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:57:14,775 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:57:14,775 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:57:14,775 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:57:14,776 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:57:14,776 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:57:14,776 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:57:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2020-10-23 18:57:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 18:57:14,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:14,828 INFO L422 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] [2020-10-23 18:57:14,828 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:14,842 INFO L82 PathProgramCache]: Analyzing trace with hash -154404590, now seen corresponding path program 1 times [2020-10-23 18:57:14,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:14,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286647403] [2020-10-23 18:57:14,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:15,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286647403] [2020-10-23 18:57:15,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:15,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:57:15,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080456271] [2020-10-23 18:57:15,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:57:15,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:15,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:57:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:57:15,467 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 8 states. [2020-10-23 18:57:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:17,177 INFO L93 Difference]: Finished difference Result 337 states and 496 transitions. [2020-10-23 18:57:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:57:17,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-10-23 18:57:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:17,216 INFO L225 Difference]: With dead ends: 337 [2020-10-23 18:57:17,216 INFO L226 Difference]: Without dead ends: 197 [2020-10-23 18:57:17,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-10-23 18:57:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-10-23 18:57:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 131. [2020-10-23 18:57:17,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-23 18:57:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 167 transitions. [2020-10-23 18:57:17,307 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 167 transitions. Word has length 76 [2020-10-23 18:57:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:17,308 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 167 transitions. [2020-10-23 18:57:17,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:57:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 167 transitions. [2020-10-23 18:57:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 18:57:17,312 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:17,313 INFO L422 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] [2020-10-23 18:57:17,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:57:17,313 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:17,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash -356228524, now seen corresponding path program 1 times [2020-10-23 18:57:17,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:17,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266051064] [2020-10-23 18:57:17,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:17,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266051064] [2020-10-23 18:57:17,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:17,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 18:57:17,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65966585] [2020-10-23 18:57:17,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 18:57:17,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 18:57:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:57:17,699 INFO L87 Difference]: Start difference. First operand 131 states and 167 transitions. Second operand 9 states. [2020-10-23 18:57:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:20,352 INFO L93 Difference]: Finished difference Result 454 states and 637 transitions. [2020-10-23 18:57:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:20,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2020-10-23 18:57:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:20,370 INFO L225 Difference]: With dead ends: 454 [2020-10-23 18:57:20,370 INFO L226 Difference]: Without dead ends: 342 [2020-10-23 18:57:20,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-10-23 18:57:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-10-23 18:57:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 234. [2020-10-23 18:57:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-10-23 18:57:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 300 transitions. [2020-10-23 18:57:20,451 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 300 transitions. Word has length 76 [2020-10-23 18:57:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:20,451 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 300 transitions. [2020-10-23 18:57:20,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 18:57:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 300 transitions. [2020-10-23 18:57:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 18:57:20,454 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:20,454 INFO L422 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] [2020-10-23 18:57:20,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:57:20,455 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1645780151, now seen corresponding path program 1 times [2020-10-23 18:57:20,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:20,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128777400] [2020-10-23 18:57:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:20,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128777400] [2020-10-23 18:57:20,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:20,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:20,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876641794] [2020-10-23 18:57:20,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:20,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:20,774 INFO L87 Difference]: Start difference. First operand 234 states and 300 transitions. Second operand 10 states. [2020-10-23 18:57:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:22,214 INFO L93 Difference]: Finished difference Result 547 states and 745 transitions. [2020-10-23 18:57:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:57:22,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-10-23 18:57:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:22,225 INFO L225 Difference]: With dead ends: 547 [2020-10-23 18:57:22,226 INFO L226 Difference]: Without dead ends: 332 [2020-10-23 18:57:22,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 18:57:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-23 18:57:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 234. [2020-10-23 18:57:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-10-23 18:57:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 293 transitions. [2020-10-23 18:57:22,302 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 293 transitions. Word has length 76 [2020-10-23 18:57:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:22,303 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 293 transitions. [2020-10-23 18:57:22,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 293 transitions. [2020-10-23 18:57:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 18:57:22,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:22,306 INFO L422 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] [2020-10-23 18:57:22,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 18:57:22,306 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1711128525, now seen corresponding path program 1 times [2020-10-23 18:57:22,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:22,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291053076] [2020-10-23 18:57:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:22,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291053076] [2020-10-23 18:57:22,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:22,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:22,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439596256] [2020-10-23 18:57:22,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:22,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:22,600 INFO L87 Difference]: Start difference. First operand 234 states and 293 transitions. Second operand 10 states. [2020-10-23 18:57:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:24,632 INFO L93 Difference]: Finished difference Result 564 states and 764 transitions. [2020-10-23 18:57:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:57:24,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-10-23 18:57:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:24,640 INFO L225 Difference]: With dead ends: 564 [2020-10-23 18:57:24,640 INFO L226 Difference]: Without dead ends: 350 [2020-10-23 18:57:24,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-10-23 18:57:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 244. [2020-10-23 18:57:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-10-23 18:57:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 303 transitions. [2020-10-23 18:57:24,718 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 303 transitions. Word has length 76 [2020-10-23 18:57:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:24,721 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 303 transitions. [2020-10-23 18:57:24,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 303 transitions. [2020-10-23 18:57:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 18:57:24,730 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:24,730 INFO L422 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] [2020-10-23 18:57:24,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 18:57:24,730 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:24,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:24,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1009528651, now seen corresponding path program 1 times [2020-10-23 18:57:24,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:24,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826451150] [2020-10-23 18:57:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:24,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:24,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:24,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:24,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:24,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:25,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826451150] [2020-10-23 18:57:25,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:25,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 18:57:25,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543840427] [2020-10-23 18:57:25,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:57:25,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:57:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:57:25,059 INFO L87 Difference]: Start difference. First operand 244 states and 303 transitions. Second operand 10 states. [2020-10-23 18:57:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:27,117 INFO L93 Difference]: Finished difference Result 702 states and 934 transitions. [2020-10-23 18:57:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 18:57:27,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-10-23 18:57:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:27,123 INFO L225 Difference]: With dead ends: 702 [2020-10-23 18:57:27,123 INFO L226 Difference]: Without dead ends: 477 [2020-10-23 18:57:27,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2020-10-23 18:57:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2020-10-23 18:57:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 290. [2020-10-23 18:57:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-23 18:57:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 345 transitions. [2020-10-23 18:57:27,201 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 345 transitions. Word has length 76 [2020-10-23 18:57:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:27,202 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 345 transitions. [2020-10-23 18:57:27,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:57:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 345 transitions. [2020-10-23 18:57:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-23 18:57:27,203 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:27,203 INFO L422 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] [2020-10-23 18:57:27,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 18:57:27,204 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:27,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash -868980041, now seen corresponding path program 1 times [2020-10-23 18:57:27,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:27,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343819049] [2020-10-23 18:57:27,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:27,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343819049] [2020-10-23 18:57:27,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:27,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:57:27,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097551656] [2020-10-23 18:57:27,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:57:27,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:57:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:57:27,416 INFO L87 Difference]: Start difference. First operand 290 states and 345 transitions. Second operand 8 states. [2020-10-23 18:57:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:29,612 INFO L93 Difference]: Finished difference Result 1021 states and 1379 transitions. [2020-10-23 18:57:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 18:57:29,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2020-10-23 18:57:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:29,620 INFO L225 Difference]: With dead ends: 1021 [2020-10-23 18:57:29,620 INFO L226 Difference]: Without dead ends: 752 [2020-10-23 18:57:29,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-10-23 18:57:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 497. [2020-10-23 18:57:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-10-23 18:57:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 609 transitions. [2020-10-23 18:57:29,713 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 609 transitions. Word has length 76 [2020-10-23 18:57:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:29,714 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 609 transitions. [2020-10-23 18:57:29,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:57:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 609 transitions. [2020-10-23 18:57:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-23 18:57:29,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:29,715 INFO L422 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] [2020-10-23 18:57:29,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 18:57:29,716 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1749976708, now seen corresponding path program 1 times [2020-10-23 18:57:29,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:29,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635312454] [2020-10-23 18:57:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:57:29,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635312454] [2020-10-23 18:57:29,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:29,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 18:57:29,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216116405] [2020-10-23 18:57:29,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 18:57:29,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 18:57:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-23 18:57:29,903 INFO L87 Difference]: Start difference. First operand 497 states and 609 transitions. Second operand 7 states. [2020-10-23 18:57:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:32,001 INFO L93 Difference]: Finished difference Result 1704 states and 2354 transitions. [2020-10-23 18:57:32,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 18:57:32,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-10-23 18:57:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:32,013 INFO L225 Difference]: With dead ends: 1704 [2020-10-23 18:57:32,013 INFO L226 Difference]: Without dead ends: 1227 [2020-10-23 18:57:32,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:57:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-10-23 18:57:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1023. [2020-10-23 18:57:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2020-10-23 18:57:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1328 transitions. [2020-10-23 18:57:32,176 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1328 transitions. Word has length 77 [2020-10-23 18:57:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:32,177 INFO L481 AbstractCegarLoop]: Abstraction has 1023 states and 1328 transitions. [2020-10-23 18:57:32,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 18:57:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1328 transitions. [2020-10-23 18:57:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-10-23 18:57:32,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:32,179 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:32,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 18:57:32,180 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:32,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:32,180 INFO L82 PathProgramCache]: Analyzing trace with hash 824465844, now seen corresponding path program 1 times [2020-10-23 18:57:32,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:32,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112509830] [2020-10-23 18:57:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:57:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:57:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-23 18:57:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-23 18:57:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-10-23 18:57:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2020-10-23 18:57:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-23 18:57:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:57:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-10-23 18:57:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-10-23 18:57:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-10-23 18:57:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-23 18:57:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:57:32,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:57:32,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112509830] [2020-10-23 18:57:32,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:57:32,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 18:57:32,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834455988] [2020-10-23 18:57:32,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:57:32,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:57:32,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:57:32,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:57:32,377 INFO L87 Difference]: Start difference. First operand 1023 states and 1328 transitions. Second operand 8 states. [2020-10-23 18:57:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:57:35,061 INFO L93 Difference]: Finished difference Result 3514 states and 5024 transitions. [2020-10-23 18:57:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:57:35,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-10-23 18:57:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:57:35,081 INFO L225 Difference]: With dead ends: 3514 [2020-10-23 18:57:35,081 INFO L226 Difference]: Without dead ends: 1927 [2020-10-23 18:57:35,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-10-23 18:57:35,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2020-10-23 18:57:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1663. [2020-10-23 18:57:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1663 states. [2020-10-23 18:57:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2233 transitions. [2020-10-23 18:57:35,311 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2233 transitions. Word has length 96 [2020-10-23 18:57:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:57:35,311 INFO L481 AbstractCegarLoop]: Abstraction has 1663 states and 2233 transitions. [2020-10-23 18:57:35,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:57:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2233 transitions. [2020-10-23 18:57:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-10-23 18:57:35,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:57:35,315 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:57:35,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 18:57:35,315 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:57:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:57:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 52839137, now seen corresponding path program 1 times [2020-10-23 18:57:35,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:57:35,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996676192] [2020-10-23 18:57:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:57:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:57:35,339 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:57:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:57:35,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:57:35,427 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:57:35,427 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:57:35,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:57:35,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:57:35 BoogieIcfgContainer [2020-10-23 18:57:35,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:57:35,600 INFO L168 Benchmark]: Toolchain (without parser) took 22415.14 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 129.9 MB in the beginning and 178.6 MB in the end (delta: -48.7 MB). Peak memory consumption was 185.9 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:35,601 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 155.2 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:57:35,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.77 ms. Allocated memory is still 155.2 MB. Free memory was 129.2 MB in the beginning and 116.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:35,603 INFO L168 Benchmark]: Boogie Preprocessor took 80.32 ms. Allocated memory is still 155.2 MB. Free memory was 116.9 MB in the beginning and 115.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:35,603 INFO L168 Benchmark]: RCFGBuilder took 1003.67 ms. Allocated memory is still 155.2 MB. Free memory was 114.8 MB in the beginning and 121.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:35,604 INFO L168 Benchmark]: TraceAbstraction took 20920.85 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 121.1 MB in the beginning and 178.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 177.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:57:35,608 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 155.2 MB. Free memory is still 126.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 392.77 ms. Allocated memory is still 155.2 MB. Free memory was 129.2 MB in the beginning and 116.9 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 80.32 ms. Allocated memory is still 155.2 MB. Free memory was 116.9 MB in the beginning and 115.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1003.67 ms. Allocated memory is still 155.2 MB. Free memory was 114.8 MB in the beginning and 121.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 16.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20920.85 ms. Allocated memory was 155.2 MB in the beginning and 389.0 MB in the end (delta: 233.8 MB). Free memory was 121.1 MB in the beginning and 178.6 MB in the end (delta: -57.5 MB). Peak memory consumption was 177.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int E_1 = 2; VAL [\old(E_1)=65, \old(M_E)=62, \old(m_i)=53, \old(m_pc)=58, \old(m_st)=56, \old(T1_E)=50, \old(t1_i)=63, \old(t1_pc)=54, \old(t1_st)=51, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L441] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L445] CALL init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L356] m_i = 1 [L357] t1_i = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L445] RET init_model() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L446] CALL start_simulation() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L382] int kernel_st ; [L383] int tmp ; [L384] int tmp___0 ; [L388] kernel_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L389] FCALL update_channels() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] CALL init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L153] COND TRUE m_i == 1 [L154] m_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L158] COND TRUE t1_i == 1 [L159] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L390] RET init_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] CALL fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L242] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L247] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L252] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L391] RET fire_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L392] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L285] int tmp ; [L286] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L290] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L104] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L107] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L119] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L290] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L298] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L126] COND FALSE !(t1_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L138] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=0, __retres1=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L298] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, is_transmit1_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0] [L298] tmp___0 = is_transmit1_triggered() [L300] COND FALSE !(\read(tmp___0)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0] [L392] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L393] CALL reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L265] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L270] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L275] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L393] RET reset_delta_events() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L396] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L399] kernel_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, kernel_st=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L400] CALL eval() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L189] int tmp ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L193] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L196] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L168] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L184] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L196] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND FALSE !(\read(tmp_ndt_1)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L223] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L74] COND TRUE t1_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L87] t1_pc = 1 [L88] t1_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L223] RET transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L193] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L196] CALL, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L168] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L171] COND TRUE m_st == 0 [L172] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L184] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, \result=1, __retres1=1, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L196] RET, EXPR exists_runnable_thread() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L196] tmp = exists_runnable_thread() [L198] COND TRUE \read(tmp) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1] [L203] COND TRUE m_st == 0 [L204] int tmp_ndt_1; [L205] tmp_ndt_1 = __VERIFIER_nondet_int() [L206] COND TRUE \read(tmp_ndt_1) [L208] m_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-1] [L209] CALL master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L33] COND TRUE m_pc == 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L44] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L47] E_1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L48] CALL immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L314] CALL activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L285] int tmp ; [L286] int tmp___0 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L290] CALL, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L104] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L107] COND FALSE !(m_pc == 1) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] __retres1 = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L119] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=0, __retres1=0, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L290] RET, EXPR is_master_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_master_triggered()=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L290] tmp = is_master_triggered() [L292] COND FALSE !(\read(tmp)) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L298] CALL, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L123] int __retres1 ; VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L126] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L127] COND TRUE E_1 == 1 [L128] __retres1 = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L138] return (__retres1); VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, \result=1, __retres1=1, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L298] RET, EXPR is_transmit1_triggered() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, is_transmit1_triggered()=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0] [L298] tmp___0 = is_transmit1_triggered() [L300] COND TRUE \read(tmp___0) [L301] t1_st = 0 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1] [L314] RET activate_threads() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L48] RET immediate_notify() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L49] E_1 = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] COND TRUE 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L54] m_pc = 1 [L55] m_st = 2 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=1, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=2, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L209] RET master() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-1] [L217] COND TRUE t1_st == 0 [L218] int tmp_ndt_2; [L219] tmp_ndt_2 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp_ndt_2) [L222] t1_st = 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=0, \old(t1_st)=0, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3] [L223] CALL transmit1() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L74] COND FALSE !(t1_pc == 0) VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L77] COND TRUE t1_pc == 1 VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L93] CALL error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L13] CALL reach_error() VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L3] __assert_fail("0", "transmitter.01.cil.c", 3, "reach_error") VAL [\old(E_1)=2, \old(M_E)=2, \old(m_i)=0, \old(m_pc)=0, \old(m_st)=0, \old(T1_E)=2, \old(t1_i)=0, \old(t1_pc)=1, \old(t1_st)=1, E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 143 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.6s, OverallIterations: 9, TraceHistogramMax: 2, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1042 SDtfs, 3632 SDslu, 298 SDs, 0 SdLazy, 6104 SolverSat, 2260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1663occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 759 NumberOfCodeBlocks, 759 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 621 ConstructedInterpolants, 0 QuantifiedInterpolants, 130931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 15/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...