./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --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 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:24:04,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:24:04,687 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:24:04,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:24:04,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:24:04,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:24:04,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:24:04,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:24:04,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:24:04,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:24:04,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:24:04,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:24:04,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:24:04,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:24:04,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:24:04,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:24:04,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:24:04,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:24:04,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:24:04,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:24:04,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:24:04,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:24:04,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:24:04,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:24:04,773 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:24:04,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:24:04,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:24:04,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:24:04,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:24:04,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:24:04,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:24:04,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:24:04,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:24:04,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:24:04,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:24:04,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:24:04,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:24:04,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:24:04,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:24:04,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:24:04,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:24:04,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:24:04,779 INFO L153 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_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/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_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 131a5c0bb00c7f6e11a814871ba4a0d65133507ca6f79e4b87c2742dbe2c5590 [2024-11-08 19:24:05,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:24:05,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:24:05,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:24:05,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:24:05,129 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:24:05,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/rfi004.i Unable to find full path for "g++" [2024-11-08 19:24:07,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:24:07,307 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:24:07,311 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/sv-benchmarks/c/pthread-wmm/rfi004.i [2024-11-08 19:24:07,325 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/data/fff29fd23/61e81dfd34924a95ae6615aa7250523f/FLAG1dbf152f2 [2024-11-08 19:24:07,340 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/data/fff29fd23/61e81dfd34924a95ae6615aa7250523f [2024-11-08 19:24:07,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:24:07,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:24:07,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:07,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:24:07,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:24:07,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7563c160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:07, skipping insertion in model container [2024-11-08 19:24:07,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:07" (1/1) ... [2024-11-08 19:24:07,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:24:07,649 WARN L250 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_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2024-11-08 19:24:07,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:07,909 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:24:07,925 WARN L250 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_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/sv-benchmarks/c/pthread-wmm/rfi004.i[983,996] [2024-11-08 19:24:07,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:08,033 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:24:08,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08 WrapperNode [2024-11-08 19:24:08,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:08,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:08,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:24:08,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:24:08,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,110 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 112 [2024-11-08 19:24:08,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:08,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:24:08,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:24:08,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:24:08,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,156 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:24:08,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:24:08,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:24:08,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:24:08,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:24:08,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (1/1) ... [2024-11-08 19:24:08,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:24:08,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:08,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:24:08,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:24:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 19:24:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:24:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-08 19:24:08,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-08 19:24:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-08 19:24:08,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-08 19:24:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:24:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 19:24:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:24:08,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:24:08,267 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 19:24:08,443 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:24:08,445 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:24:08,731 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 19:24:08,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:24:08,985 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:24:08,985 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:24:08,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:08 BoogieIcfgContainer [2024-11-08 19:24:08,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:24:08,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:24:08,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:24:08,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:24:08,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:24:07" (1/3) ... [2024-11-08 19:24:08,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fccc2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:24:08, skipping insertion in model container [2024-11-08 19:24:08,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:08" (2/3) ... [2024-11-08 19:24:08,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fccc2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:24:08, skipping insertion in model container [2024-11-08 19:24:08,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:08" (3/3) ... [2024-11-08 19:24:08,994 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004.i [2024-11-08 19:24:09,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:24:09,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 19:24:09,012 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 19:24:09,059 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 19:24:09,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 74 flow [2024-11-08 19:24:09,140 INFO L124 PetriNetUnfolderBase]: 1/31 cut-off events. [2024-11-08 19:24:09,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:24:09,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-08 19:24:09,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 74 flow [2024-11-08 19:24:09,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 68 flow [2024-11-08 19:24:09,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:24:09,170 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5189a49c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:24:09,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-08 19:24:09,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 19:24:09,180 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-08 19:24:09,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:24:09,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:09,181 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-08 19:24:09,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 744662756, now seen corresponding path program 1 times [2024-11-08 19:24:09,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:09,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954839169] [2024-11-08 19:24:09,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954839169] [2024-11-08 19:24:09,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954839169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:09,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:09,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-08 19:24:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17105493] [2024-11-08 19:24:09,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:09,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:24:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:09,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:24:09,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:24:09,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 33 [2024-11-08 19:24:09,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:09,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:09,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 33 [2024-11-08 19:24:09,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:09,950 INFO L124 PetriNetUnfolderBase]: 95/269 cut-off events. [2024-11-08 19:24:09,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 19:24:09,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 269 events. 95/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1456 event pairs, 14 based on Foata normal form. 12/271 useless extension candidates. Maximal degree in co-relation 445. Up to 136 conditions per place. [2024-11-08 19:24:09,956 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2024-11-08 19:24:09,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 120 flow [2024-11-08 19:24:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:24:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 19:24:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-11-08 19:24:09,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2024-11-08 19:24:09,971 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 75 transitions. [2024-11-08 19:24:09,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 120 flow [2024-11-08 19:24:09,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:24:09,977 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2024-11-08 19:24:09,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-11-08 19:24:09,983 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2024-11-08 19:24:09,984 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2024-11-08 19:24:09,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:09,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:09,984 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:09,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:24:09,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1416388167, now seen corresponding path program 1 times [2024-11-08 19:24:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49065809] [2024-11-08 19:24:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:10,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49065809] [2024-11-08 19:24:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49065809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:10,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:10,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:24:10,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019389237] [2024-11-08 19:24:10,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:10,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:24:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:10,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:24:10,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:24:10,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2024-11-08 19:24:10,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:10,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:10,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2024-11-08 19:24:10,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:10,825 INFO L124 PetriNetUnfolderBase]: 252/525 cut-off events. [2024-11-08 19:24:10,826 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-08 19:24:10,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 525 events. 252/525 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3033 event pairs, 82 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1005. Up to 278 conditions per place. [2024-11-08 19:24:10,832 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 22 selfloop transitions, 3 changer transitions 33/68 dead transitions. [2024-11-08 19:24:10,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 274 flow [2024-11-08 19:24:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:24:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 19:24:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-11-08 19:24:10,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2024-11-08 19:24:10,837 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 8 states and 156 transitions. [2024-11-08 19:24:10,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 274 flow [2024-11-08 19:24:10,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 19:24:10,840 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 93 flow [2024-11-08 19:24:10,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2024-11-08 19:24:10,842 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2024-11-08 19:24:10,842 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 93 flow [2024-11-08 19:24:10,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:10,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:10,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:10,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:24:10,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:10,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1488513211, now seen corresponding path program 1 times [2024-11-08 19:24:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584114615] [2024-11-08 19:24:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:10,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:11,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584114615] [2024-11-08 19:24:11,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584114615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:11,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:11,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:24:11,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551141547] [2024-11-08 19:24:11,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:11,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:24:11,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:11,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:24:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:24:11,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2024-11-08 19:24:11,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:11,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:11,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2024-11-08 19:24:11,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:11,382 INFO L124 PetriNetUnfolderBase]: 134/306 cut-off events. [2024-11-08 19:24:11,382 INFO L125 PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES. [2024-11-08 19:24:11,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 306 events. 134/306 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1637 event pairs, 45 based on Foata normal form. 10/306 useless extension candidates. Maximal degree in co-relation 752. Up to 151 conditions per place. [2024-11-08 19:24:11,386 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 3 changer transitions 15/48 dead transitions. [2024-11-08 19:24:11,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 227 flow [2024-11-08 19:24:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:24:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 19:24:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-11-08 19:24:11,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-11-08 19:24:11,391 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 93 flow. Second operand 7 states and 129 transitions. [2024-11-08 19:24:11,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 227 flow [2024-11-08 19:24:11,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 210 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-08 19:24:11,395 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 103 flow [2024-11-08 19:24:11,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2024-11-08 19:24:11,396 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2024-11-08 19:24:11,397 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 103 flow [2024-11-08 19:24:11,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:11,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:11,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:11,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:24:11,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:11,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 588210652, now seen corresponding path program 1 times [2024-11-08 19:24:11,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:11,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443140925] [2024-11-08 19:24:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:11,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443140925] [2024-11-08 19:24:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443140925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:11,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:24:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423237680] [2024-11-08 19:24:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:11,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:24:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:24:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:24:11,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2024-11-08 19:24:11,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:11,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:11,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2024-11-08 19:24:11,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:11,833 INFO L124 PetriNetUnfolderBase]: 162/346 cut-off events. [2024-11-08 19:24:11,833 INFO L125 PetriNetUnfolderBase]: For 272/274 co-relation queries the response was YES. [2024-11-08 19:24:11,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 346 events. 162/346 cut-off events. For 272/274 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1686 event pairs, 23 based on Foata normal form. 23/355 useless extension candidates. Maximal degree in co-relation 832. Up to 147 conditions per place. [2024-11-08 19:24:11,838 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 28 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2024-11-08 19:24:11,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 215 flow [2024-11-08 19:24:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:24:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 19:24:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-08 19:24:11,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2024-11-08 19:24:11,841 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 103 flow. Second operand 4 states and 90 transitions. [2024-11-08 19:24:11,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 215 flow [2024-11-08 19:24:11,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 199 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-08 19:24:11,845 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 113 flow [2024-11-08 19:24:11,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2024-11-08 19:24:11,847 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-11-08 19:24:11,847 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 113 flow [2024-11-08 19:24:11,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:11,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:11,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:11,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:24:11,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:11,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 466267505, now seen corresponding path program 1 times [2024-11-08 19:24:11,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:11,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478001502] [2024-11-08 19:24:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:12,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:12,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478001502] [2024-11-08 19:24:12,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478001502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:12,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:12,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:24:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839530871] [2024-11-08 19:24:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:12,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:24:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:24:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:24:12,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2024-11-08 19:24:12,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:12,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:12,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2024-11-08 19:24:12,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:12,236 INFO L124 PetriNetUnfolderBase]: 87/196 cut-off events. [2024-11-08 19:24:12,236 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-11-08 19:24:12,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 196 events. 87/196 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 710 event pairs, 16 based on Foata normal form. 16/202 useless extension candidates. Maximal degree in co-relation 505. Up to 80 conditions per place. [2024-11-08 19:24:12,237 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 24 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2024-11-08 19:24:12,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 210 flow [2024-11-08 19:24:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:24:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 19:24:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-11-08 19:24:12,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2024-11-08 19:24:12,239 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 113 flow. Second operand 5 states and 102 transitions. [2024-11-08 19:24:12,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 210 flow [2024-11-08 19:24:12,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 182 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-08 19:24:12,242 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 114 flow [2024-11-08 19:24:12,242 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-11-08 19:24:12,242 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2024-11-08 19:24:12,243 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 114 flow [2024-11-08 19:24:12,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:12,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:12,243 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-08 19:24:12,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:24:12,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:12,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:12,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1731714192, now seen corresponding path program 1 times [2024-11-08 19:24:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:12,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842156947] [2024-11-08 19:24:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:12,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842156947] [2024-11-08 19:24:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842156947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:12,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:24:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97049622] [2024-11-08 19:24:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:12,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:24:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:12,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:24:12,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:24:12,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2024-11-08 19:24:12,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:12,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:12,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2024-11-08 19:24:12,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:12,889 INFO L124 PetriNetUnfolderBase]: 110/276 cut-off events. [2024-11-08 19:24:12,889 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-08 19:24:12,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 276 events. 110/276 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1102 event pairs, 30 based on Foata normal form. 4/272 useless extension candidates. Maximal degree in co-relation 628. Up to 120 conditions per place. [2024-11-08 19:24:12,892 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 1 changer transitions 19/51 dead transitions. [2024-11-08 19:24:12,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 240 flow [2024-11-08 19:24:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:24:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 19:24:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-11-08 19:24:12,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-08 19:24:12,894 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 114 flow. Second operand 6 states and 110 transitions. [2024-11-08 19:24:12,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 240 flow [2024-11-08 19:24:12,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 206 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-08 19:24:12,898 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 89 flow [2024-11-08 19:24:12,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2024-11-08 19:24:12,899 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2024-11-08 19:24:12,899 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 89 flow [2024-11-08 19:24:12,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:12,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:12,899 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-08 19:24:12,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:24:12,902 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:12,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1388791588, now seen corresponding path program 2 times [2024-11-08 19:24:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742151609] [2024-11-08 19:24:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:24:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:24:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742151609] [2024-11-08 19:24:13,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742151609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:13,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:13,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:24:13,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194772216] [2024-11-08 19:24:13,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:13,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:24:13,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:24:13,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:24:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:24:13,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2024-11-08 19:24:13,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 89 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:13,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 19:24:13,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2024-11-08 19:24:13,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 19:24:13,892 INFO L124 PetriNetUnfolderBase]: 67/183 cut-off events. [2024-11-08 19:24:13,893 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-08 19:24:13,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 183 events. 67/183 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 631 event pairs, 35 based on Foata normal form. 4/175 useless extension candidates. Maximal degree in co-relation 372. Up to 77 conditions per place. [2024-11-08 19:24:13,894 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 14 selfloop transitions, 2 changer transitions 17/47 dead transitions. [2024-11-08 19:24:13,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 197 flow [2024-11-08 19:24:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:24:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-08 19:24:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-11-08 19:24:13,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2024-11-08 19:24:13,896 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 89 flow. Second operand 8 states and 146 transitions. [2024-11-08 19:24:13,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 197 flow [2024-11-08 19:24:13,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 184 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-08 19:24:13,899 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 96 flow [2024-11-08 19:24:13,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2024-11-08 19:24:13,900 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2024-11-08 19:24:13,900 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 96 flow [2024-11-08 19:24:13,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:24:13,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 19:24:13,901 INFO L204 CegarLoopForPetriNet]: 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] [2024-11-08 19:24:13,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:24:13,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-08 19:24:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash -676441766, now seen corresponding path program 3 times [2024-11-08 19:24:13,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:24:13,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066716208] [2024-11-08 19:24:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:13,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:24:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:24:13,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:24:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:24:14,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:24:14,077 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:24:14,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-08 19:24:14,080 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-08 19:24:14,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-08 19:24:14,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-08 19:24:14,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-08 19:24:14,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:24:14,081 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-11-08 19:24:14,146 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 19:24:14,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:24:14,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:24:14 BasicIcfg [2024-11-08 19:24:14,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:24:14,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:24:14,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:24:14,153 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:24:14,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:08" (3/4) ... [2024-11-08 19:24:14,154 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 19:24:14,273 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 19:24:14,276 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:24:14,277 INFO L158 Benchmark]: Toolchain (without parser) took 6933.19ms. Allocated memory was 134.2MB in the beginning and 260.0MB in the end (delta: 125.8MB). Free memory was 71.3MB in the beginning and 161.7MB in the end (delta: -90.4MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-11-08 19:24:14,278 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:24:14,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.93ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 71.2MB in the beginning and 121.4MB in the end (delta: -50.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:24:14,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.40ms. Allocated memory is still 169.9MB. Free memory was 121.4MB in the beginning and 119.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:24:14,279 INFO L158 Benchmark]: Boogie Preprocessor took 74.87ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 115.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:24:14,279 INFO L158 Benchmark]: RCFGBuilder took 798.56ms. Allocated memory is still 169.9MB. Free memory was 115.7MB in the beginning and 134.1MB in the end (delta: -18.4MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-11-08 19:24:14,279 INFO L158 Benchmark]: TraceAbstraction took 5164.87ms. Allocated memory was 169.9MB in the beginning and 260.0MB in the end (delta: 90.2MB). Free memory was 134.1MB in the beginning and 171.2MB in the end (delta: -37.1MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2024-11-08 19:24:14,280 INFO L158 Benchmark]: Witness Printer took 123.93ms. Allocated memory is still 260.0MB. Free memory was 171.2MB in the beginning and 161.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:24:14,282 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 108.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.93ms. Allocated memory was 134.2MB in the beginning and 169.9MB in the end (delta: 35.7MB). Free memory was 71.2MB in the beginning and 121.4MB in the end (delta: -50.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.40ms. Allocated memory is still 169.9MB. Free memory was 121.4MB in the beginning and 119.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.87ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 115.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 798.56ms. Allocated memory is still 169.9MB. Free memory was 115.7MB in the beginning and 134.1MB in the end (delta: -18.4MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5164.87ms. Allocated memory was 169.9MB in the beginning and 260.0MB in the end (delta: 90.2MB). Free memory was 134.1MB in the beginning and 171.2MB in the end (delta: -37.1MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * Witness Printer took 123.93ms. Allocated memory is still 260.0MB. Free memory was 171.2MB in the beginning and 161.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1649; [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1650; [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L787] 2 __unbuffered_p1_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EAX = y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L793] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649=-2, t1650=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 12 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2024-11-08 19:24:14,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cfcc97a-f8f2-4dcd-98ad-ea208e82e392/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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