./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/02_inc_cas.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu --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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:47:25,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:47:25,874 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:47:25,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:47:25,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:47:25,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:47:25,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:47:25,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:47:25,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:47:25,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:47:25,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:47:25,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:47:25,914 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:47:25,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:47:25,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:47:25,916 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:47:25,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:47:25,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:47:25,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:47:25,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:47:25,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:47:25,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:47:25,921 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:47:25,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:47:25,922 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:47:25,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:47:25,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:47:25,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:47:25,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:25,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:47:25,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:47:25,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:47:25,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:47:25,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:47:25,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:47:25,927 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:47:25,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:47:25,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:47:25,929 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:47:25,929 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_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/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_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2023-11-19 07:47:26,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:47:26,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:47:26,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:47:26,286 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:47:26,287 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:47:26,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2023-11-19 07:47:29,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:47:29,759 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:47:29,760 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2023-11-19 07:47:29,777 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/data/f88d141e6/63211204a39c4f628ee6f5105e0f0ef3/FLAGeebb8478b [2023-11-19 07:47:29,790 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/data/f88d141e6/63211204a39c4f628ee6f5105e0f0ef3 [2023-11-19 07:47:29,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:47:29,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:47:29,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:29,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:47:29,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:47:29,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:29" (1/1) ... [2023-11-19 07:47:29,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738ad194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:29, skipping insertion in model container [2023-11-19 07:47:29,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:47:29" (1/1) ... [2023-11-19 07:47:29,882 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:47:30,062 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 07:47:30,250 WARN L240 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_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-19 07:47:30,261 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:30,274 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:47:30,307 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-19 07:47:30,351 WARN L240 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_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2023-11-19 07:47:30,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:47:30,406 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:47:30,407 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:47:30,407 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:47:30,416 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:47:30,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30 WrapperNode [2023-11-19 07:47:30,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:47:30,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:30,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:47:30,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:47:30,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,505 INFO L138 Inliner]: procedures = 171, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-19 07:47:30,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:47:30,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:47:30,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:47:30,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:47:30,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:47:30,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:47:30,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:47:30,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:47:30,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (1/1) ... [2023-11-19 07:47:30,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:47:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:30,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:47:30,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:47:30,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:47:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-19 07:47:30,679 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-19 07:47:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:47:30,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:47:30,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:47:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:47:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:47:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:47:30,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:47:30,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:47:30,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:47:30,686 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:47:30,865 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:47:30,868 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:47:31,108 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:47:31,296 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:47:31,296 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:47:31,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:31 BoogieIcfgContainer [2023-11-19 07:47:31,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:47:31,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:47:31,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:47:31,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:47:31,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:47:29" (1/3) ... [2023-11-19 07:47:31,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a32610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:31, skipping insertion in model container [2023-11-19 07:47:31,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:47:30" (2/3) ... [2023-11-19 07:47:31,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a32610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:47:31, skipping insertion in model container [2023-11-19 07:47:31,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:47:31" (3/3) ... [2023-11-19 07:47:31,319 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-19 07:47:31,331 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:47:31,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:47:31,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:47:31,344 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:47:31,435 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:47:31,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 51 transitions, 106 flow [2023-11-19 07:47:31,561 INFO L124 PetriNetUnfolderBase]: 5/62 cut-off events. [2023-11-19 07:47:31,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:31,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 5/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2023-11-19 07:47:31,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 51 transitions, 106 flow [2023-11-19 07:47:31,580 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 51 transitions, 106 flow [2023-11-19 07:47:31,587 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:47:31,614 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 51 transitions, 106 flow [2023-11-19 07:47:31,617 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 51 transitions, 106 flow [2023-11-19 07:47:31,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 51 transitions, 106 flow [2023-11-19 07:47:31,640 INFO L124 PetriNetUnfolderBase]: 5/62 cut-off events. [2023-11-19 07:47:31,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:31,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 5/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2023-11-19 07:47:31,643 INFO L119 LiptonReduction]: Number of co-enabled transitions 672 [2023-11-19 07:47:33,208 INFO L134 LiptonReduction]: Checked pairs total: 909 [2023-11-19 07:47:33,208 INFO L136 LiptonReduction]: Total number of compositions: 38 [2023-11-19 07:47:33,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:33,238 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@19f704a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:33,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-19 07:47:33,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:47:33,245 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-11-19 07:47:33,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:47:33,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:33,246 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 07:47:33,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:33,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash -371508666, now seen corresponding path program 1 times [2023-11-19 07:47:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:33,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402894374] [2023-11-19 07:47:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:33,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:47:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:33,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:47:33,454 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:47:33,456 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-19 07:47:33,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-19 07:47:33,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-19 07:47:33,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:47:33,461 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-19 07:47:33,466 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:47:33,466 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 07:47:33,506 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:47:33,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 162 flow [2023-11-19 07:47:33,541 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2023-11-19 07:47:33,541 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:47:33,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 249 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2023-11-19 07:47:33,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 76 transitions, 162 flow [2023-11-19 07:47:33,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 76 transitions, 162 flow [2023-11-19 07:47:33,546 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:47:33,546 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 76 transitions, 162 flow [2023-11-19 07:47:33,547 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 76 transitions, 162 flow [2023-11-19 07:47:33,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 162 flow [2023-11-19 07:47:33,573 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2023-11-19 07:47:33,573 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 07:47:33,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 249 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2023-11-19 07:47:33,579 INFO L119 LiptonReduction]: Number of co-enabled transitions 2544 [2023-11-19 07:47:35,502 INFO L134 LiptonReduction]: Checked pairs total: 4114 [2023-11-19 07:47:35,503 INFO L136 LiptonReduction]: Total number of compositions: 53 [2023-11-19 07:47:35,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:35,511 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@19f704a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:35,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 07:47:35,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:47:35,524 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-19 07:47:35,525 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:47:35,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:35,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:47:35,526 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-19 07:47:35,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash -112939069, now seen corresponding path program 1 times [2023-11-19 07:47:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:35,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503158487] [2023-11-19 07:47:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:35,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503158487] [2023-11-19 07:47:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503158487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:35,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:35,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:47:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841750490] [2023-11-19 07:47:35,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:35,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:47:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:35,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:47:35,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:47:35,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 129 [2023-11-19 07:47:35,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 70 flow. Second operand has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 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) [2023-11-19 07:47:35,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:35,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 129 [2023-11-19 07:47:35,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:35,994 INFO L124 PetriNetUnfolderBase]: 300/502 cut-off events. [2023-11-19 07:47:35,994 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-19 07:47:36,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 502 events. 300/502 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2201 event pairs, 224 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 414. Up to 483 conditions per place. [2023-11-19 07:47:36,010 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-11-19 07:47:36,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 112 flow [2023-11-19 07:47:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:47:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:47:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 151 transitions. [2023-11-19 07:47:36,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5852713178294574 [2023-11-19 07:47:36,033 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 151 transitions. [2023-11-19 07:47:36,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 151 transitions. [2023-11-19 07:47:36,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:36,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 151 transitions. [2023-11-19 07:47:36,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 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) [2023-11-19 07:47:36,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-11-19 07:47:36,047 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-11-19 07:47:36,049 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 70 flow. Second operand 2 states and 151 transitions. [2023-11-19 07:47:36,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 112 flow [2023-11-19 07:47:36,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:47:36,056 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2023-11-19 07:47:36,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-11-19 07:47:36,067 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-11-19 07:47:36,068 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2023-11-19 07:47:36,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 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) [2023-11-19 07:47:36,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:36,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:47:36,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-19 07:47:36,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:36,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1159074226, now seen corresponding path program 1 times [2023-11-19 07:47:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358506948] [2023-11-19 07:47:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:36,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:36,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358506948] [2023-11-19 07:47:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358506948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:36,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:36,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111261321] [2023-11-19 07:47:36,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:36,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:47:36,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:47:36,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:37,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 129 [2023-11-19 07:47:37,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-19 07:47:37,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:37,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 129 [2023-11-19 07:47:37,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:37,658 INFO L124 PetriNetUnfolderBase]: 530/861 cut-off events. [2023-11-19 07:47:37,659 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-19 07:47:37,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 861 events. 530/861 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4409 event pairs, 49 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1749. Up to 298 conditions per place. [2023-11-19 07:47:37,667 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 86 selfloop transitions, 39 changer transitions 0/128 dead transitions. [2023-11-19 07:47:37,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 128 transitions, 541 flow [2023-11-19 07:47:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:47:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-19 07:47:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 699 transitions. [2023-11-19 07:47:37,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41681574239713776 [2023-11-19 07:47:37,680 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 699 transitions. [2023-11-19 07:47:37,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 699 transitions. [2023-11-19 07:47:37,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:37,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 699 transitions. [2023-11-19 07:47:37,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 53.76923076923077) internal successors, (699), 13 states have internal predecessors, (699), 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) [2023-11-19 07:47:37,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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) [2023-11-19 07:47:37,695 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 129.0) internal successors, (1806), 14 states have internal predecessors, (1806), 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) [2023-11-19 07:47:37,695 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 13 states and 699 transitions. [2023-11-19 07:47:37,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 128 transitions, 541 flow [2023-11-19 07:47:37,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 128 transitions, 541 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:47:37,719 INFO L231 Difference]: Finished difference. Result has 48 places, 67 transitions, 304 flow [2023-11-19 07:47:37,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=304, PETRI_PLACES=48, PETRI_TRANSITIONS=67} [2023-11-19 07:47:37,721 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2023-11-19 07:47:37,721 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 67 transitions, 304 flow [2023-11-19 07:47:37,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.0) internal successors, (360), 8 states have internal predecessors, (360), 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) [2023-11-19 07:47:37,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:37,722 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 07:47:37,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:47:37,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-19 07:47:37,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:37,723 INFO L85 PathProgramCache]: Analyzing trace with hash -617549398, now seen corresponding path program 1 times [2023-11-19 07:47:37,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:37,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556127181] [2023-11-19 07:47:37,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:37,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:37,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:47:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:47:37,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:47:37,749 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:47:37,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-19 07:47:37,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-19 07:47:37,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-19 07:47:37,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-19 07:47:37,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:47:37,751 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-19 07:47:37,751 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 07:47:37,752 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 07:47:37,785 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:47:37,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 220 flow [2023-11-19 07:47:37,807 INFO L124 PetriNetUnfolderBase]: 13/138 cut-off events. [2023-11-19 07:47:37,807 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:47:37,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 13/138 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 384 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2023-11-19 07:47:37,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 101 transitions, 220 flow [2023-11-19 07:47:37,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 101 transitions, 220 flow [2023-11-19 07:47:37,811 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:47:37,811 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 101 transitions, 220 flow [2023-11-19 07:47:37,812 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 101 transitions, 220 flow [2023-11-19 07:47:37,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 220 flow [2023-11-19 07:47:37,830 INFO L124 PetriNetUnfolderBase]: 13/138 cut-off events. [2023-11-19 07:47:37,830 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 07:47:37,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 13/138 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 384 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2023-11-19 07:47:37,836 INFO L119 LiptonReduction]: Number of co-enabled transitions 5616 [2023-11-19 07:47:39,729 INFO L134 LiptonReduction]: Checked pairs total: 9478 [2023-11-19 07:47:39,729 INFO L136 LiptonReduction]: Total number of compositions: 69 [2023-11-19 07:47:39,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:47:39,732 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@19f704a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:47:39,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-19 07:47:39,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:47:39,738 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-19 07:47:39,738 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 07:47:39,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:39,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 07:47:39,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:47:39,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1352057717, now seen corresponding path program 1 times [2023-11-19 07:47:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524048282] [2023-11-19 07:47:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:39,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:39,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524048282] [2023-11-19 07:47:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524048282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:47:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934477297] [2023-11-19 07:47:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:39,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:47:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:47:39,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:47:39,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 170 [2023-11-19 07:47:39,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 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) [2023-11-19 07:47:39,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:39,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 170 [2023-11-19 07:47:39,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:40,621 INFO L124 PetriNetUnfolderBase]: 4512/6328 cut-off events. [2023-11-19 07:47:40,622 INFO L125 PetriNetUnfolderBase]: For 655/655 co-relation queries the response was YES. [2023-11-19 07:47:40,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12838 conditions, 6328 events. 4512/6328 cut-off events. For 655/655 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 32546 event pairs, 3464 based on Foata normal form. 0/4683 useless extension candidates. Maximal degree in co-relation 1023. Up to 6153 conditions per place. [2023-11-19 07:47:40,684 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 35 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2023-11-19 07:47:40,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 164 flow [2023-11-19 07:47:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:47:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:47:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 201 transitions. [2023-11-19 07:47:40,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5911764705882353 [2023-11-19 07:47:40,687 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 201 transitions. [2023-11-19 07:47:40,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 201 transitions. [2023-11-19 07:47:40,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:40,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 201 transitions. [2023-11-19 07:47:40,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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) [2023-11-19 07:47:40,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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) [2023-11-19 07:47:40,691 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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) [2023-11-19 07:47:40,691 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 102 flow. Second operand 2 states and 201 transitions. [2023-11-19 07:47:40,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 164 flow [2023-11-19 07:47:40,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 162 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 07:47:40,695 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 92 flow [2023-11-19 07:47:40,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-11-19 07:47:40,697 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-19 07:47:40,697 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 92 flow [2023-11-19 07:47:40,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.0) internal successors, (168), 2 states have internal predecessors, (168), 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) [2023-11-19 07:47:40,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:40,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:40,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:47:40,699 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:47:40,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2045144881, now seen corresponding path program 1 times [2023-11-19 07:47:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:40,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080067636] [2023-11-19 07:47:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080067636] [2023-11-19 07:47:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080067636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:47:41,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:47:41,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:47:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507281268] [2023-11-19 07:47:41,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:47:41,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:47:41,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:41,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:47:41,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:47:41,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 170 [2023-11-19 07:47:41,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 64.0) internal successors, (512), 8 states have internal predecessors, (512), 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) [2023-11-19 07:47:41,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:41,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 170 [2023-11-19 07:47:41,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:42,616 INFO L124 PetriNetUnfolderBase]: 4522/6347 cut-off events. [2023-11-19 07:47:42,616 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2023-11-19 07:47:42,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12796 conditions, 6347 events. 4522/6347 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 32718 event pairs, 2556 based on Foata normal form. 0/4701 useless extension candidates. Maximal degree in co-relation 12790. Up to 6160 conditions per place. [2023-11-19 07:47:42,675 INFO L140 encePairwiseOnDemand]: 161/170 looper letters, 38 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2023-11-19 07:47:42,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 230 flow [2023-11-19 07:47:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:47:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:47:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 557 transitions. [2023-11-19 07:47:42,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40955882352941175 [2023-11-19 07:47:42,679 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 557 transitions. [2023-11-19 07:47:42,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 557 transitions. [2023-11-19 07:47:42,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:47:42,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 557 transitions. [2023-11-19 07:47:42,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 69.625) internal successors, (557), 8 states have internal predecessors, (557), 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) [2023-11-19 07:47:42,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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) [2023-11-19 07:47:42,688 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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) [2023-11-19 07:47:42,688 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 92 flow. Second operand 8 states and 557 transitions. [2023-11-19 07:47:42,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 230 flow [2023-11-19 07:47:42,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:47:42,694 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 180 flow [2023-11-19 07:47:42,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=51} [2023-11-19 07:47:42,698 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-11-19 07:47:42,698 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 180 flow [2023-11-19 07:47:42,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 64.0) internal successors, (512), 8 states have internal predecessors, (512), 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) [2023-11-19 07:47:42,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:47:42,699 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:42,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:47:42,699 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-19 07:47:42,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2035471429, now seen corresponding path program 1 times [2023-11-19 07:47:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:42,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35378329] [2023-11-19 07:47:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:43,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35378329] [2023-11-19 07:47:43,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35378329] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:47:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489631955] [2023-11-19 07:47:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:43,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:47:43,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:43,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:47:43,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ec44e37-a1ee-4265-bd14-35b9e3783fe0/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:47:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:43,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-19 07:47:43,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:47:44,048 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 07:47:44,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-19 07:47:44,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:47:44,182 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-19 07:47:44,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-19 07:47:44,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-11-19 07:47:44,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-19 07:47:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:44,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:47:44,816 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (* (div |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)) (.cse3 (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse0 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse1 (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of3ForFork0_~v~0#1|) (+ .cse2 .cse1)))))) .cse3) (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse6 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse6 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread1of3ForFork0_~v~0#1| (* (div .cse5 4294967296) 4294967296)) (+ .cse2 .cse5)))))) (not .cse3))))) is different from false [2023-11-19 07:47:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:47:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489631955] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:47:45,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:47:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2023-11-19 07:47:45,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540090294] [2023-11-19 07:47:45,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:47:45,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-19 07:47:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:47:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 07:47:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=301, Unknown=11, NotChecked=36, Total=420 [2023-11-19 07:47:45,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 170 [2023-11-19 07:47:45,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 180 flow. Second operand has 21 states, 21 states have (on average 48.23809523809524) internal successors, (1013), 21 states have internal predecessors, (1013), 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) [2023-11-19 07:47:45,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:47:45,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 170 [2023-11-19 07:47:45,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:47:51,227 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse21 |c_~#value~0.offset|))) (let ((.cse22 (mod .cse1 4294967296))) (let ((.cse2 (* (div .cse1 4294967296) 4294967296)) (.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| (+ 1 .cse1)))) (.cse5 (= .cse22 4294967295)) (.cse10 (* (div |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)) (.cse11 (= .cse22 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse0 (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse0 4294967296)) .cse1) (+ .cse2 .cse0))) (= (mod (select (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse5) (or (forall ((v_ArrVal_86 (Array Int Int)) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store (store .cse4 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| (store (select .cse4 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse6 (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse6 4294967296) 4294967296) .cse1) (+ .cse6 .cse2))) (not (= 0 (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|))) (= (mod (select (select .cse7 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse5) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse9 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse9 4294967296) 4294967296) |c_thr1Thread1of3ForFork0_~v~0#1|) (+ .cse10 .cse9)))))) .cse11) (forall ((v_ArrVal_86 (Array Int Int)) (v_ArrVal_80 (Array Int Int)) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_80))) (let ((.cse17 (select .cse16 |c_~#value~0.base|))) (let ((.cse12 (select .cse17 |c_~#value~0.offset|))) (let ((.cse14 (store (let ((.cse15 (store .cse17 |c_~#value~0.offset| (+ .cse12 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse15) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| (store (select (store .cse16 |c_~#value~0.base| .cse15) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse13 (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse12 (* (div .cse13 4294967296) 4294967296)) (+ (* 4294967296 (div .cse12 4294967296)) .cse13))) (not (= 0 (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|))) (= (mod (select (select .cse14 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= (mod .cse12 4294967296) 4294967295))))))) (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse18 (store (let ((.cse20 (store |c_#memory_int| |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse20 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse20 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse18 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse19 (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread1of3ForFork0_~v~0#1| (* (div .cse19 4294967296) 4294967296)) (+ .cse10 .cse19)))))) (not .cse11))))))) is different from false [2023-11-19 07:47:52,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse5 (mod .cse1 4294967296))) (let ((.cse8 (* (div |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)) (.cse9 (= .cse5 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse1))))) (store .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse0 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse0 4294967296)) .cse1) (+ (* (div .cse1 4294967296) 4294967296) .cse0))) (= (mod (select (select .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (= .cse5 4294967295)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse6 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse7 (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse7 4294967296) 4294967296) |c_thr1Thread1of3ForFork0_~v~0#1|) (+ .cse8 .cse7)))))) .cse9) (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse12 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse12 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse10 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse11 (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread1of3ForFork0_~v~0#1| (* (div .cse11 4294967296) 4294967296)) (+ .cse8 .cse11)))))) (not .cse9))))))) is different from false [2023-11-19 07:47:57,194 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse15 |c_~#value~0.offset|))) (let ((.cse16 (mod .cse1 4294967296))) (let ((.cse2 (* (div .cse1 4294967296) 4294967296)) (.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ 1 .cse1)))) (.cse5 (= .cse16 4294967295)) (.cse10 (* (div |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)) (.cse11 (= .cse16 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse0 (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse0 4294967296)) .cse1) (+ .cse2 .cse0))) (= (mod (select (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse5) (or (forall ((v_ArrVal_86 (Array Int Int)) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store (store .cse4 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| (store (select .cse4 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse6 (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse6 4294967296) 4294967296) .cse1) (+ .cse6 .cse2))) (not (= 0 (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|))) (= (mod (select (select .cse7 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse5) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse9 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse9 4294967296) 4294967296) |c_thr1Thread1of3ForFork0_~v~0#1|) (+ .cse10 .cse9)))))) .cse11) (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (store (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse14 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse14 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse12 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse13 (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread1of3ForFork0_~v~0#1| (* (div .cse13 4294967296) 4294967296)) (+ .cse10 .cse13)))))) (not .cse11))))))) is different from false [2023-11-19 07:47:59,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:47:59,509 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse5 (mod .cse1 4294967296))) (let ((.cse8 (* (div |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)) (.cse9 (= .cse5 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ 1 .cse1))))) (store .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse0 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse0 4294967296)) .cse1) (+ (* (div .cse1 4294967296) 4294967296) .cse0))) (= (mod (select (select .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (= .cse5 4294967295)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse6 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse7 (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse7 4294967296) 4294967296) |c_thr1Thread1of3ForFork0_~v~0#1|) (+ .cse8 .cse7)))))) .cse9) (forall ((v_ArrVal_86 (Array Int Int)) (v_ArrVal_80 (Array Int Int)) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_80))) (let ((.cse15 (select .cse14 |c_~#value~0.base|))) (let ((.cse10 (select .cse15 |c_~#value~0.offset|))) (let ((.cse12 (store (let ((.cse13 (store .cse15 |c_~#value~0.offset| (+ .cse10 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse13) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| (store (select (store .cse14 |c_~#value~0.base| .cse13) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse11 (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse10 (* (div .cse11 4294967296) 4294967296)) (+ (* 4294967296 (div .cse10 4294967296)) .cse11))) (not (= 0 (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|))) (= (mod (select (select .cse12 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= (mod .cse10 4294967296) 4294967295))))))) (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse16 (store (let ((.cse18 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse18 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse18 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse16 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse17 (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread1of3ForFork0_~v~0#1| (* (div .cse17 4294967296) 4294967296)) (+ .cse8 .cse17)))))) (not .cse9))))))) is different from false [2023-11-19 07:48:03,471 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse10 |c_~#value~0.offset|))) (let ((.cse2 (* (div .cse1 4294967296) 4294967296)) (.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ 1 .cse1)))) (.cse5 (= (mod .cse1 4294967296) 4294967295))) (and (or (forall ((v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse0 (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse0 4294967296)) .cse1) (+ .cse2 .cse0))) (= (mod (select (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse5) (or (forall ((v_ArrVal_86 (Array Int Int)) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store (store .cse4 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47| (store (select .cse4 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (let ((.cse6 (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse6 4294967296) 4294967296) .cse1) (+ .cse6 .cse2))) (not (= 0 (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|))) (= (mod (select (select .cse7 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_47|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse5) (forall ((v_ArrVal_86 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (or (= (mod (select (select .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse9 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse9 4294967296) 4294967296) |c_thr1Thread1of3ForFork0_~v~0#1|) (+ (* (div |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse9)))))))))) is different from false [2023-11-19 07:48:06,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-19 07:48:08,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-19 07:48:12,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:48:15,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:48:21,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]