./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8 --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 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:45:33,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:45:33,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:45:33,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:45:33,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:45:33,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:45:33,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:45:33,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:45:33,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:45:33,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:45:33,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:45:33,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:45:33,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:45:33,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:45:33,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:45:33,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:45:33,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:45:33,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:45:33,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:45:33,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:45:33,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:45:33,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:45:33,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:45:33,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:45:33,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:45:33,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:45:33,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:45:33,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:45:33,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:45:33,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:45:33,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:45:33,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:45:33,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:45:33,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:45:33,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:45:33,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:45:33,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:45:33,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:45:33,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:45:33,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:45:33,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:45:33,993 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:45:34,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:45:34,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:45:34,016 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:45:34,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:45:34,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:45:34,017 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:45:34,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:45:34,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:45:34,018 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:45:34,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:45:34,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:45:34,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:45:34,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:45:34,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:45:34,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:45:34,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:45:34,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:45:34,020 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:45:34,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:45:34,020 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:45:34,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:45:34,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:45:34,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:45:34,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:45:34,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:45:34,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:45:34,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:45:34,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:45:34,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:45:34,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:45:34,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:45:34,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:45:34,022 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:45:34,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:45:34,023 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:45:34,023 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8 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 -> 801b6f5e12b848076bbfeb54a63beac5bc1a1838979fd8d63c3790ee3e78e63f [2022-12-13 16:45:34,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:45:34,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:45:34,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:45:34,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:45:34,251 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:45:34,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2022-12-13 16:45:36,823 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:45:36,980 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:45:36,980 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2022-12-13 16:45:36,991 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/data/d80cd3ab4/87c89303458b4288844043350cf8fe94/FLAGbe85d3669 [2022-12-13 16:45:37,003 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/data/d80cd3ab4/87c89303458b4288844043350cf8fe94 [2022-12-13 16:45:37,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:45:37,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:45:37,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:45:37,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:45:37,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:45:37,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76bfd942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37, skipping insertion in model container [2022-12-13 16:45:37,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:45:37,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:45:37,145 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[914,927] [2022-12-13 16:45:37,181 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[7125,7138] [2022-12-13 16:45:37,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:45:37,220 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:45:37,229 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[914,927] [2022-12-13 16:45:37,242 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.03.cil-2.c[7125,7138] [2022-12-13 16:45:37,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:45:37,273 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:45:37,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37 WrapperNode [2022-12-13 16:45:37,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:45:37,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:45:37,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:45:37,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:45:37,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,310 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 519 [2022-12-13 16:45:37,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:45:37,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:45:37,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:45:37,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:45:37,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:45:37,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:45:37,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:45:37,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:45:37,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (1/1) ... [2022-12-13 16:45:37,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:45:37,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:45:37,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:45:37,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:45:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:45:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 16:45:37,396 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 16:45:37,396 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 16:45:37,396 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 16:45:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 16:45:37,397 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 16:45:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 16:45:37,397 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 16:45:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 16:45:37,397 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 16:45:37,397 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 16:45:37,398 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 16:45:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 16:45:37,398 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 16:45:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 16:45:37,398 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 16:45:37,398 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 16:45:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 16:45:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 16:45:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 16:45:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 16:45:37,399 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 16:45:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:45:37,399 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 16:45:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 16:45:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 16:45:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 16:45:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:45:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:45:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 16:45:37,400 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 16:45:37,471 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:45:37,472 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:45:37,883 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:45:37,890 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:45:37,890 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-12-13 16:45:37,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:45:37 BoogieIcfgContainer [2022-12-13 16:45:37,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:45:37,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:45:37,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:45:37,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:45:37,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:45:37" (1/3) ... [2022-12-13 16:45:37,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49347700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:45:37, skipping insertion in model container [2022-12-13 16:45:37,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:45:37" (2/3) ... [2022-12-13 16:45:37,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49347700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:45:37, skipping insertion in model container [2022-12-13 16:45:37,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:45:37" (3/3) ... [2022-12-13 16:45:37,899 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.03.cil-2.c [2022-12-13 16:45:37,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:45:37,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:45:37,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:45:37,957 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e203068, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:45:37,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 16:45:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 16:45:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 16:45:37,969 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:45:37,970 INFO L195 NwaCegarLoop]: 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] [2022-12-13 16:45:37,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:45:37,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:45:37,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1774585736, now seen corresponding path program 1 times [2022-12-13 16:45:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:45:37,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174582142] [2022-12-13 16:45:37,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:45:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:45:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:45:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:45:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:45:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:45:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:45:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:45:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:45:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:45:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:45:38,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174582142] [2022-12-13 16:45:38,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174582142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:45:38,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:45:38,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:45:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628821352] [2022-12-13 16:45:38,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:45:38,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:45:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:45:38,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:45:38,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:45:38,348 INFO L87 Difference]: Start difference. First operand has 259 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 217 states have internal predecessors, (330), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) 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) [2022-12-13 16:45:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:45:39,044 INFO L93 Difference]: Finished difference Result 635 states and 966 transitions. [2022-12-13 16:45:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:45:39,047 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 [2022-12-13 16:45:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:45:39,059 INFO L225 Difference]: With dead ends: 635 [2022-12-13 16:45:39,059 INFO L226 Difference]: Without dead ends: 385 [2022-12-13 16:45:39,064 INFO L412 NwaCegarLoop]: 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 [2022-12-13 16:45:39,067 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 670 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:45:39,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 916 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:45:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-12-13 16:45:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2022-12-13 16:45:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 285 states have internal predecessors, (403), 43 states have call successors, (43), 21 states have call predecessors, (43), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-12-13 16:45:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 491 transitions. [2022-12-13 16:45:39,146 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 491 transitions. Word has length 59 [2022-12-13 16:45:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:45:39,146 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 491 transitions. [2022-12-13 16:45:39,146 INFO L496 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) [2022-12-13 16:45:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 491 transitions. [2022-12-13 16:45:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 16:45:39,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:45:39,149 INFO L195 NwaCegarLoop]: 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] [2022-12-13 16:45:39,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:45:39,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:45:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:45:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1011936105, now seen corresponding path program 1 times [2022-12-13 16:45:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:45:39,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670649947] [2022-12-13 16:45:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:45:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:45:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:45:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:45:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:45:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:45:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:45:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:45:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:45:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:45:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:45:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670649947] [2022-12-13 16:45:39,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670649947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:45:39,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:45:39,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:45:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639923459] [2022-12-13 16:45:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:45:39,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:45:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:45:39,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:45:39,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:45:39,335 INFO L87 Difference]: Start difference. First operand 345 states and 491 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) [2022-12-13 16:45:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:45:40,134 INFO L93 Difference]: Finished difference Result 694 states and 970 transitions. [2022-12-13 16:45:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 16:45:40,135 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 [2022-12-13 16:45:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:45:40,137 INFO L225 Difference]: With dead ends: 694 [2022-12-13 16:45:40,137 INFO L226 Difference]: Without dead ends: 516 [2022-12-13 16:45:40,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 16:45:40,139 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 728 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:45:40,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1323 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 16:45:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-12-13 16:45:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 441. [2022-12-13 16:45:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 363 states have internal predecessors, (507), 54 states have call successors, (54), 28 states have call predecessors, (54), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-12-13 16:45:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 625 transitions. [2022-12-13 16:45:40,171 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 625 transitions. Word has length 59 [2022-12-13 16:45:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:45:40,171 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 625 transitions. [2022-12-13 16:45:40,171 INFO L496 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) [2022-12-13 16:45:40,171 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 625 transitions. [2022-12-13 16:45:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 16:45:40,173 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:45:40,173 INFO L195 NwaCegarLoop]: 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] [2022-12-13 16:45:40,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:45:40,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:45:40,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:45:40,174 INFO L85 PathProgramCache]: Analyzing trace with hash -118449767, now seen corresponding path program 1 times [2022-12-13 16:45:40,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:45:40,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823325554] [2022-12-13 16:45:40,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:45:40,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:45:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:45:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:45:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:45:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:45:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:45:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:45:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:45:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:45:40,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:45:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823325554] [2022-12-13 16:45:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823325554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:45:40,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:45:40,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:45:40,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109982456] [2022-12-13 16:45:40,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:45:40,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:45:40,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:45:40,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:45:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:45:40,302 INFO L87 Difference]: Start difference. First operand 441 states and 625 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) [2022-12-13 16:45:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:45:40,917 INFO L93 Difference]: Finished difference Result 743 states and 1040 transitions. [2022-12-13 16:45:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:45:40,917 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 [2022-12-13 16:45:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:45:40,921 INFO L225 Difference]: With dead ends: 743 [2022-12-13 16:45:40,921 INFO L226 Difference]: Without dead ends: 475 [2022-12-13 16:45:40,923 INFO L412 NwaCegarLoop]: 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 [2022-12-13 16:45:40,924 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 435 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:45:40,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1274 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:45:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-12-13 16:45:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 446. [2022-12-13 16:45:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 367 states have internal predecessors, (509), 54 states have call successors, (54), 28 states have call predecessors, (54), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-12-13 16:45:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 628 transitions. [2022-12-13 16:45:40,947 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 628 transitions. Word has length 59 [2022-12-13 16:45:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:45:40,947 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 628 transitions. [2022-12-13 16:45:40,947 INFO L496 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) [2022-12-13 16:45:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 628 transitions. [2022-12-13 16:45:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 16:45:40,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:45:40,949 INFO L195 NwaCegarLoop]: 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] [2022-12-13 16:45:40,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:45:40,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:45:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:45:40,949 INFO L85 PathProgramCache]: Analyzing trace with hash 156309847, now seen corresponding path program 1 times [2022-12-13 16:45:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:45:40,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991239548] [2022-12-13 16:45:40,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:45:40,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:45:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:45:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:45:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:45:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:45:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:45:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:45:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:45:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:45:41,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:45:41,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991239548] [2022-12-13 16:45:41,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991239548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:45:41,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:45:41,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:45:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33029454] [2022-12-13 16:45:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:45:41,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:45:41,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:45:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:45:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:45:41,066 INFO L87 Difference]: Start difference. First operand 446 states and 628 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) [2022-12-13 16:45:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:45:41,714 INFO L93 Difference]: Finished difference Result 765 states and 1062 transitions. [2022-12-13 16:45:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:45:41,715 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 [2022-12-13 16:45:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:45:41,717 INFO L225 Difference]: With dead ends: 765 [2022-12-13 16:45:41,718 INFO L226 Difference]: Without dead ends: 492 [2022-12-13 16:45:41,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:45:41,720 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 297 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:45:41,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1427 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:45:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-12-13 16:45:41,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 461. [2022-12-13 16:45:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 379 states have internal predecessors, (521), 54 states have call successors, (54), 28 states have call predecessors, (54), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-12-13 16:45:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 643 transitions. [2022-12-13 16:45:41,752 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 643 transitions. Word has length 59 [2022-12-13 16:45:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:45:41,752 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 643 transitions. [2022-12-13 16:45:41,753 INFO L496 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) [2022-12-13 16:45:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 643 transitions. [2022-12-13 16:45:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 16:45:41,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:45:41,754 INFO L195 NwaCegarLoop]: 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] [2022-12-13 16:45:41,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:45:41,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:45:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:45:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1649128487, now seen corresponding path program 1 times [2022-12-13 16:45:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:45:41,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437482591] [2022-12-13 16:45:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:45:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:45:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:45:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:45:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:45:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:45:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:45:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:45:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:45:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:45:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:45:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:45:41,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437482591] [2022-12-13 16:45:41,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437482591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:45:41,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:45:41,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:45:41,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188092595] [2022-12-13 16:45:41,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:45:41,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:45:41,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:45:41,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:45:41,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:45:41,908 INFO L87 Difference]: Start difference. First operand 461 states and 643 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) [2022-12-13 16:45:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:45:42,564 INFO L93 Difference]: Finished difference Result 855 states and 1156 transitions. [2022-12-13 16:45:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 16:45:42,565 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 [2022-12-13 16:45:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:45:42,567 INFO L225 Difference]: With dead ends: 855 [2022-12-13 16:45:42,567 INFO L226 Difference]: Without dead ends: 569 [2022-12-13 16:45:42,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-12-13 16:45:42,568 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 719 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:45:42,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1100 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:45:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-12-13 16:45:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 473. [2022-12-13 16:45:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 380 states have (on average 1.3973684210526316) internal successors, (531), 389 states have internal predecessors, (531), 55 states have call successors, (55), 29 states have call predecessors, (55), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2022-12-13 16:45:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 653 transitions. [2022-12-13 16:45:42,596 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 653 transitions. Word has length 59 [2022-12-13 16:45:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:45:42,596 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 653 transitions. [2022-12-13 16:45:42,596 INFO L496 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) [2022-12-13 16:45:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 653 transitions. [2022-12-13 16:45:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 16:45:42,597 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:45:42,597 INFO L195 NwaCegarLoop]: 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] [2022-12-13 16:45:42,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:45:42,598 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:45:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:45:42,598 INFO L85 PathProgramCache]: Analyzing trace with hash 651694103, now seen corresponding path program 1 times [2022-12-13 16:45:42,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:45:42,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136539310] [2022-12-13 16:45:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:45:42,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:45:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:45:42,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:45:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:45:42,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:45:42,637 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:45:42,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 16:45:42,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 16:45:42,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:45:42,641 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 16:45:42,644 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:45:42,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:45:42 BoogieIcfgContainer [2022-12-13 16:45:42,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:45:42,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:45:42,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:45:42,693 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:45:42,694 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:45:37" (3/4) ... [2022-12-13 16:45:42,695 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:45:42,741 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:45:42,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:45:42,741 INFO L158 Benchmark]: Toolchain (without parser) took 5735.29ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 80.6MB in the beginning and 97.4MB in the end (delta: -16.8MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2022-12-13 16:45:42,742 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory was 83.6MB in the beginning and 83.5MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:45:42,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.47ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 62.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 16:45:42,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.68ms. Allocated memory is still 119.5MB. Free memory was 62.0MB in the beginning and 58.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:45:42,743 INFO L158 Benchmark]: Boogie Preprocessor took 26.12ms. Allocated memory is still 119.5MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:45:42,743 INFO L158 Benchmark]: RCFGBuilder took 554.56ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 114.0MB in the end (delta: -57.9MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-12-13 16:45:42,743 INFO L158 Benchmark]: TraceAbstraction took 4798.71ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 105.8MB in the end (delta: 7.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2022-12-13 16:45:42,744 INFO L158 Benchmark]: Witness Printer took 47.75ms. Allocated memory is still 161.5MB. Free memory was 105.8MB in the beginning and 97.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 16:45:42,745 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.16ms. Allocated memory is still 119.5MB. Free memory was 83.6MB in the beginning and 83.5MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.47ms. Allocated memory is still 119.5MB. Free memory was 80.1MB in the beginning and 62.0MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.68ms. Allocated memory is still 119.5MB. Free memory was 62.0MB in the beginning and 58.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.12ms. Allocated memory is still 119.5MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.56ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 56.2MB in the beginning and 114.0MB in the end (delta: -57.9MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4798.71ms. Allocated memory is still 161.5MB. Free memory was 112.9MB in the beginning and 105.8MB in the end (delta: 7.2MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 47.75ms. Allocated memory is still 161.5MB. Free memory was 105.8MB in the beginning and 97.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 t3_pc = 0; [L504] int m_st ; [L505] int t1_st ; [L506] int t2_st ; [L507] int t3_st ; [L508] int m_i ; [L509] int t1_i ; [L510] int t2_i ; [L511] int t3_i ; [L512] int M_E = 2; [L513] int T1_E = 2; [L514] int T2_E = 2; [L515] int T3_E = 2; [L516] int E_M = 2; [L517] int E_1 = 2; [L518] int E_2 = 2; [L519] int E_3 = 2; [L525] int token ; [L527] 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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L1212] COND TRUE __VERIFIER_nondet_int() [L1213] 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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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_3=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, T3_E=2, t3_i=0, t3_pc=0, t3_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, 259 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2900 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2849 mSDsluCounter, 6040 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4882 mSDsCounter, 579 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4944 IncrementalHoareTripleChecker+Invalid, 5523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 579 mSolverCounterUnsat, 1158 mSDtfsCounter, 4944 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=5, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 271 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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! [2022-12-13 16:45:42,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c1abd3e-a0dd-40a0-b671-04f7bc705167/bin/uautomizer-uyxdKDjOR8/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