./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:14:08,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:14:08,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:14:08,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:14:08,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:14:08,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:14:08,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:14:08,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:14:08,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:14:08,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:14:08,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:14:08,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:14:08,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:14:08,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:14:08,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:14:08,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:14:08,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:14:08,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:14:08,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:14:08,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:14:08,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:14:08,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:14:08,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:14:08,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:14:08,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:14:08,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:14:08,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:14:08,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:14:08,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:14:08,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:14:08,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:14:08,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:14:08,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:14:08,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:14:08,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:14:08,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:14:08,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:14:08,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:14:08,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:14:08,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:14:08,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:14:08,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:14:08,759 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:14:08,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:14:08,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:14:08,760 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:14:08,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:14:08,761 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:14:08,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:14:08,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:14:08,762 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:14:08,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:14:08,762 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:14:08,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:14:08,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:14:08,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:14:08,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:14:08,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:14:08,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:14:08,764 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:14:08,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:14:08,764 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:14:08,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:14:08,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:14:08,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:14:08,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:14:08,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:14:08,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:14:08,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:14:08,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:14:08,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:14:08,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:14:08,767 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:14:08,767 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:14:08,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:14:08,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:14:08,769 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2021-12-22 13:14:09,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:14:09,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:14:09,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:14:09,033 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:14:09,033 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:14:09,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2021-12-22 13:14:09,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5744680b9/9a4f0e20b2604320af5fabf40ec216da/FLAG2571061d4 [2021-12-22 13:14:09,539 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:14:09,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2021-12-22 13:14:09,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5744680b9/9a4f0e20b2604320af5fabf40ec216da/FLAG2571061d4 [2021-12-22 13:14:09,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5744680b9/9a4f0e20b2604320af5fabf40ec216da [2021-12-22 13:14:09,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:14:09,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:14:09,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:14:09,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:14:09,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:14:09,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:14:09" (1/1) ... [2021-12-22 13:14:09,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122d47e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:09, skipping insertion in model container [2021-12-22 13:14:09,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:14:09" (1/1) ... [2021-12-22 13:14:09,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:14:09,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:14:10,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2021-12-22 13:14:10,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2021-12-22 13:14:10,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:14:10,218 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:14:10,234 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2021-12-22 13:14:10,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2021-12-22 13:14:10,293 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:14:10,312 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:14:10,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10 WrapperNode [2021-12-22 13:14:10,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:14:10,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:14:10,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:14:10,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:14:10,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,385 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 461 [2021-12-22 13:14:10,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:14:10,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:14:10,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:14:10,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:14:10,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:14:10,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:14:10,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:14:10,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:14:10,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (1/1) ... [2021-12-22 13:14:10,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:14:10,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:14:10,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 13:14:10,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 13:14:10,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:14:10,510 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-22 13:14:10,511 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-22 13:14:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-22 13:14:10,511 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-22 13:14:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-22 13:14:10,511 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-22 13:14:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-22 13:14:10,512 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-22 13:14:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-22 13:14:10,512 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-22 13:14:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-22 13:14:10,512 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-22 13:14:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-22 13:14:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-22 13:14:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-22 13:14:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-22 13:14:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-22 13:14:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-22 13:14:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-22 13:14:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-22 13:14:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-22 13:14:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-22 13:14:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:14:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-22 13:14:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-22 13:14:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-22 13:14:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-22 13:14:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:14:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:14:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-22 13:14:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-22 13:14:10,589 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:14:10,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:14:11,021 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:14:11,030 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:14:11,030 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-22 13:14:11,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:11 BoogieIcfgContainer [2021-12-22 13:14:11,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:14:11,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:14:11,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:14:11,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:14:11,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:14:09" (1/3) ... [2021-12-22 13:14:11,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603e03bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:14:11, skipping insertion in model container [2021-12-22 13:14:11,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:14:10" (2/3) ... [2021-12-22 13:14:11,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603e03bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:14:11, skipping insertion in model container [2021-12-22 13:14:11,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:11" (3/3) ... [2021-12-22 13:14:11,043 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2021-12-22 13:14:11,047 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:14:11,048 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:14:11,098 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:14:11,110 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 13:14:11,110 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-22 13:14:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-22 13:14:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:11,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:11,147 INFO L514 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] [2021-12-22 13:14:11,148 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash 381071048, now seen corresponding path program 1 times [2021-12-22 13:14:11,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:11,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5194986] [2021-12-22 13:14:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:11,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:11,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:11,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:11,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5194986] [2021-12-22 13:14:11,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5194986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:11,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:11,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:14:11,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712916551] [2021-12-22 13:14:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:11,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:14:11,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:11,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:14:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:14:11,521 INFO L87 Difference]: Start difference. First operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 13:14:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:12,040 INFO L93 Difference]: Finished difference Result 469 states and 703 transitions. [2021-12-22 13:14:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 13:14:12,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-22 13:14:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:12,061 INFO L225 Difference]: With dead ends: 469 [2021-12-22 13:14:12,062 INFO L226 Difference]: Without dead ends: 242 [2021-12-22 13:14:12,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:14:12,073 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 459 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:12,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 730 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 13:14:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-22 13:14:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2021-12-22 13:14:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-22 13:14:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2021-12-22 13:14:12,131 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 59 [2021-12-22 13:14:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:12,131 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2021-12-22 13:14:12,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 13:14:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2021-12-22 13:14:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:12,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:12,134 INFO L514 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] [2021-12-22 13:14:12,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:14:12,135 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 862151306, now seen corresponding path program 1 times [2021-12-22 13:14:12,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:12,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062479196] [2021-12-22 13:14:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:12,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:12,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:12,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062479196] [2021-12-22 13:14:12,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062479196] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:12,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:12,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:14:12,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479523057] [2021-12-22 13:14:12,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:12,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:14:12,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:12,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:14:12,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:12,273 INFO L87 Difference]: Start difference. First operand 224 states and 317 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 13:14:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:12,956 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2021-12-22 13:14:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:14:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-22 13:14:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:12,964 INFO L225 Difference]: With dead ends: 449 [2021-12-22 13:14:12,964 INFO L226 Difference]: Without dead ends: 360 [2021-12-22 13:14:12,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-22 13:14:12,971 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 598 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:12,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 1071 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 13:14:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-12-22 13:14:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 320. [2021-12-22 13:14:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2021-12-22 13:14:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2021-12-22 13:14:13,017 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 59 [2021-12-22 13:14:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:13,017 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2021-12-22 13:14:13,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 13:14:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2021-12-22 13:14:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:13,020 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:13,020 INFO L514 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] [2021-12-22 13:14:13,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:14:13,021 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1624800937, now seen corresponding path program 1 times [2021-12-22 13:14:13,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:13,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653559925] [2021-12-22 13:14:13,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:13,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:13,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:13,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653559925] [2021-12-22 13:14:13,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653559925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:13,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:13,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:14:13,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060098575] [2021-12-22 13:14:13,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:13,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:14:13,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:14:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:13,183 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 13:14:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:13,735 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2021-12-22 13:14:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:14:13,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-22 13:14:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:13,739 INFO L225 Difference]: With dead ends: 535 [2021-12-22 13:14:13,739 INFO L226 Difference]: Without dead ends: 357 [2021-12-22 13:14:13,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-22 13:14:13,748 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 368 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:13,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 1379 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:14:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-12-22 13:14:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 325. [2021-12-22 13:14:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2021-12-22 13:14:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 452 transitions. [2021-12-22 13:14:13,779 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 452 transitions. Word has length 59 [2021-12-22 13:14:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:13,780 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 452 transitions. [2021-12-22 13:14:13,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 13:14:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 452 transitions. [2021-12-22 13:14:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:13,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:13,783 INFO L514 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] [2021-12-22 13:14:13,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:14:13,783 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:13,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1899560551, now seen corresponding path program 1 times [2021-12-22 13:14:13,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:13,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896446085] [2021-12-22 13:14:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:13,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:13,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:13,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896446085] [2021-12-22 13:14:13,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896446085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:13,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:13,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:14:13,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445279658] [2021-12-22 13:14:13,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:13,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:14:13,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:14:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:14:13,916 INFO L87 Difference]: Start difference. First operand 325 states and 452 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-22 13:14:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:15,395 INFO L93 Difference]: Finished difference Result 1239 states and 1680 transitions. [2021-12-22 13:14:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 13:14:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2021-12-22 13:14:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:15,403 INFO L225 Difference]: With dead ends: 1239 [2021-12-22 13:14:15,403 INFO L226 Difference]: Without dead ends: 1044 [2021-12-22 13:14:15,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-22 13:14:15,405 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 2085 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:15,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2101 Valid, 1472 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-22 13:14:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-12-22 13:14:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 906. [2021-12-22 13:14:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2021-12-22 13:14:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1193 transitions. [2021-12-22 13:14:15,455 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1193 transitions. Word has length 59 [2021-12-22 13:14:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:15,456 INFO L470 AbstractCegarLoop]: Abstraction has 906 states and 1193 transitions. [2021-12-22 13:14:15,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-22 13:14:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1193 transitions. [2021-12-22 13:14:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:15,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:15,458 INFO L514 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] [2021-12-22 13:14:15,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:14:15,459 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:15,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash 927885864, now seen corresponding path program 1 times [2021-12-22 13:14:15,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:15,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52724128] [2021-12-22 13:14:15,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:15,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:15,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:15,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52724128] [2021-12-22 13:14:15,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52724128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:15,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:15,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:14:15,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924913494] [2021-12-22 13:14:15,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:15,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:14:15,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:14:15,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:14:15,561 INFO L87 Difference]: Start difference. First operand 906 states and 1193 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 13:14:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:16,122 INFO L93 Difference]: Finished difference Result 1788 states and 2337 transitions. [2021-12-22 13:14:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:14:16,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-22 13:14:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:16,128 INFO L225 Difference]: With dead ends: 1788 [2021-12-22 13:14:16,128 INFO L226 Difference]: Without dead ends: 1018 [2021-12-22 13:14:16,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 13:14:16,131 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 369 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:16,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 1360 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 13:14:16,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-12-22 13:14:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 926. [2021-12-22 13:14:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2021-12-22 13:14:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1208 transitions. [2021-12-22 13:14:16,186 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1208 transitions. Word has length 59 [2021-12-22 13:14:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:16,187 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1208 transitions. [2021-12-22 13:14:16,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-22 13:14:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1208 transitions. [2021-12-22 13:14:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:16,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:16,188 INFO L514 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] [2021-12-22 13:14:16,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:14:16,189 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:16,190 INFO L85 PathProgramCache]: Analyzing trace with hash -877552470, now seen corresponding path program 1 times [2021-12-22 13:14:16,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:16,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197037748] [2021-12-22 13:14:16,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:16,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-22 13:14:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-22 13:14:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-22 13:14:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:14:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 13:14:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-22 13:14:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-22 13:14:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:14:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:14:16,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:14:16,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197037748] [2021-12-22 13:14:16,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197037748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:14:16,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:14:16,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:14:16,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656543169] [2021-12-22 13:14:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:14:16,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:14:16,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:14:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:14:16,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:14:16,303 INFO L87 Difference]: Start difference. First operand 926 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 13:14:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:14:17,025 INFO L93 Difference]: Finished difference Result 2496 states and 3157 transitions. [2021-12-22 13:14:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:14:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-22 13:14:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:14:17,056 INFO L225 Difference]: With dead ends: 2496 [2021-12-22 13:14:17,056 INFO L226 Difference]: Without dead ends: 1707 [2021-12-22 13:14:17,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-22 13:14:17,060 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 637 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 13:14:17,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 1118 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 13:14:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-12-22 13:14:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1374. [2021-12-22 13:14:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2021-12-22 13:14:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1775 transitions. [2021-12-22 13:14:17,128 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1775 transitions. Word has length 59 [2021-12-22 13:14:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:14:17,129 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 1775 transitions. [2021-12-22 13:14:17,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-22 13:14:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1775 transitions. [2021-12-22 13:14:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:14:17,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:14:17,132 INFO L514 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] [2021-12-22 13:14:17,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:14:17,132 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:14:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:14:17,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1423270120, now seen corresponding path program 1 times [2021-12-22 13:14:17,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:14:17,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079479246] [2021-12-22 13:14:17,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:14:17,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:14:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:14:17,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:14:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:14:17,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:14:17,188 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:14:17,189 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-22 13:14:17,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-22 13:14:17,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:14:17,198 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:14:17,202 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:14:17,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:14:17 BoogieIcfgContainer [2021-12-22 13:14:17,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:14:17,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:14:17,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:14:17,287 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:14:17,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:14:11" (3/4) ... [2021-12-22 13:14:17,289 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:14:17,355 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:14:17,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:14:17,356 INFO L158 Benchmark]: Toolchain (without parser) took 7462.94ms. Allocated memory was 90.2MB in the beginning and 132.1MB in the end (delta: 41.9MB). Free memory was 53.5MB in the beginning and 44.5MB in the end (delta: 9.0MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2021-12-22 13:14:17,356 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 90.2MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 43.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:14:17,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.76ms. Allocated memory is still 90.2MB. Free memory was 53.3MB in the beginning and 61.2MB in the end (delta: -8.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2021-12-22 13:14:17,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.32ms. Allocated memory is still 90.2MB. Free memory was 61.2MB in the beginning and 58.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:17,357 INFO L158 Benchmark]: Boogie Preprocessor took 59.53ms. Allocated memory is still 90.2MB. Free memory was 58.4MB in the beginning and 56.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:14:17,357 INFO L158 Benchmark]: RCFGBuilder took 584.68ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.8MB in the beginning and 79.8MB in the end (delta: -24.0MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2021-12-22 13:14:17,358 INFO L158 Benchmark]: TraceAbstraction took 6251.37ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 79.3MB in the beginning and 56.1MB in the end (delta: 23.3MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2021-12-22 13:14:17,358 INFO L158 Benchmark]: Witness Printer took 68.33ms. Allocated memory is still 132.1MB. Free memory was 56.1MB in the beginning and 44.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 13:14:17,360 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.41ms. Allocated memory is still 90.2MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 43.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.76ms. Allocated memory is still 90.2MB. Free memory was 53.3MB in the beginning and 61.2MB in the end (delta: -8.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.32ms. Allocated memory is still 90.2MB. Free memory was 61.2MB in the beginning and 58.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.53ms. Allocated memory is still 90.2MB. Free memory was 58.4MB in the beginning and 56.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 584.68ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.8MB in the beginning and 79.8MB in the end (delta: -24.0MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6251.37ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 79.3MB in the beginning and 56.1MB in the end (delta: 23.3MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * Witness Printer took 68.33ms. Allocated memory is still 132.1MB. Free memory was 56.1MB in the beginning and 44.5MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 234 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4569 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4516 mSDsluCounter, 7130 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5126 mSDsCounter, 1259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4090 IncrementalHoareTripleChecker+Invalid, 5349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1259 mSolverCounterUnsat, 2004 mSDtfsCounter, 4090 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374occurred in iteration=6, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 653 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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! [2021-12-22 13:14:17,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE