./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-exp-term-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-exp-term-subst.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-8857f20-m [2024-01-29 22:56:21,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:21,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:21,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:21,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:21,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:21,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:21,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:21,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:21,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:21,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:21,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:21,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:21,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:21,461 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:21,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:21,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:21,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:21,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:21,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:21,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:21,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:21,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:21,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:21,464 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:21,464 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:21,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:21,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:21,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:21,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:21,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:21,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:21,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:21,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:21,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:21,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:21,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:21,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:21,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:21,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:21,468 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:21,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:21,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:21,468 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:56:21,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:21,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:21,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:21,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:21,770 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:21,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2024-01-29 22:56:23,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:23,191 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:23,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c [2024-01-29 22:56:23,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660ed2f27/e30964172e01411ab13f89e7d68d99ff/FLAG4104cec0d [2024-01-29 22:56:23,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660ed2f27/e30964172e01411ab13f89e7d68d99ff [2024-01-29 22:56:23,215 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:23,215 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:23,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-exp-term-subst.wvr.yml/witness.yml [2024-01-29 22:56:23,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:23,311 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:23,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:23,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:23,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:23,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:23" (1/2) ... [2024-01-29 22:56:23,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174c17f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:23, skipping insertion in model container [2024-01-29 22:56:23,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:23" (1/2) ... [2024-01-29 22:56:23,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b8a941b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:23, skipping insertion in model container [2024-01-29 22:56:23,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:23" (2/2) ... [2024-01-29 22:56:23,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174c17f9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23, skipping insertion in model container [2024-01-29 22:56:23,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:23" (2/2) ... [2024-01-29 22:56:23,325 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:23,365 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:23,366 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] 1 <= b [2024-01-29 22:56:23,366 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (1 <= b) && (b != 0) [2024-01-29 22:56:23,366 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 22:56:23,367 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 22:56:23,367 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((sort_label_0 == 0) && (sort_label_2 == 0)) && (result_6 == 0) [2024-01-29 22:56:23,367 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (sort_label_0 == 0) && (sort_label_2 == 0) [2024-01-29 22:56:23,367 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (((sort_label_0 == 0) && (sort_label_2 == 0)) && (result_6 == 0)) && (result_8 == 0) [2024-01-29 22:56:23,367 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (((sort_label_0 == 0) && (sort_label_2 == 0)) && (result_6 == 0)) && (sort_label_is_null_1 == (_Bool)0) [2024-01-29 22:56:23,368 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (((sort_label_0 == 0) && (sort_label_2 == 0)) && (result_6 == 0)) && (sort_label_is_null_3 == (_Bool)0) [2024-01-29 22:56:23,368 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] sort_label_0 == 0 [2024-01-29 22:56:23,368 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (((sort_label_0 == 0) && (sort_label_2 == 0)) && (result_6 == 0)) && (result_7 == 0) [2024-01-29 22:56:23,368 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (((sort_label_0 == 0) && (sort_label_2 == 0)) && (result_6 == 0)) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,368 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((sort_label_0 == 0) && (sort_label_2 == 0)) && (sort_label_4 == 0) [2024-01-29 22:56:23,369 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_6 == 0 [2024-01-29 22:56:23,369 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:23,369 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1) [2024-01-29 22:56:23,369 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (result_8 == 0) [2024-01-29 22:56:23,369 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (sort_label_is_null_3 == (_Bool)0 || sort_label_is_null_3 == (_Bool)1) [2024-01-29 22:56:23,369 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_6 == 0) && (sort_label_is_null_5 == (_Bool)0 || sort_label_is_null_5 == (_Bool)1) [2024-01-29 22:56:23,370 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:23,370 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_6 == 0) && (result_7 == 0)) && (sort_label_is_null_3 == (_Bool)0 || sort_label_is_null_3 == (_Bool)1) [2024-01-29 22:56:23,371 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_6 == 0) && (result_7 == 0)) && (result_8 == 0) [2024-01-29 22:56:23,371 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_6 == 0) && (result_7 == 0)) && (sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1) [2024-01-29 22:56:23,371 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_6 == 0) && (result_7 == 0)) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,371 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_6 == 0 [2024-01-29 22:56:23,371 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_6 == 0) && (result_8 == 0)) && (sort_label_is_null_3 == (_Bool)0 || sort_label_is_null_3 == (_Bool)1) [2024-01-29 22:56:23,371 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (((result_6 == 0) && (result_8 == 0)) && (sort_label_is_null_3 == (_Bool)0 || sort_label_is_null_3 == (_Bool)1)) && (val == (_Bool)0 || val == (_Bool)1) [2024-01-29 22:56:23,372 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (result_6 == 0) && (result_8 == 0) [2024-01-29 22:56:23,372 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_6 == 0) && (result_8 == 0)) && (sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1) [2024-01-29 22:56:23,372 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_6 == 0 [2024-01-29 22:56:23,372 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_6 == 0) && (result_8 == 0)) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,372 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:23,373 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] (b <= -1) && (b != 0) [2024-01-29 22:56:23,373 INFO L98 nessWitnessExtractor]: Location invariant before [L88-L88] b <= -1 [2024-01-29 22:56:23,373 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_6 == 0 [2024-01-29 22:56:23,374 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (result_6 == 0) && (sort_label_is_null_1 == (_Bool)0) [2024-01-29 22:56:23,374 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (result_6 == 0) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,374 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:23,375 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (result_6 == 0) && (result_8 == 0) [2024-01-29 22:56:23,376 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (result_6 == 0) && (sort_label_is_null_3 == (_Bool)0) [2024-01-29 22:56:23,376 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((sort_label_4 == 0) && (result_6 == 0)) && (result_7 == 0)) && (sort_label_is_null_3 == (_Bool)0) [2024-01-29 22:56:23,376 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((sort_label_4 == 0) && (result_6 == 0)) && (result_7 == 0) [2024-01-29 22:56:23,376 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((((sort_label_4 == 0) && (result_6 == 0)) && (result_7 == 0)) && (sort_label_is_null_3 == (_Bool)0)) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,376 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((sort_label_4 == 0) && (result_6 == 0)) && (result_7 == 0)) && (sort_label_is_null_1 == (_Bool)0) [2024-01-29 22:56:23,376 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (sort_label_4 == 0) && (result_6 == 0) [2024-01-29 22:56:23,377 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (((sort_label_4 == 0) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-29 22:56:23,377 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] sort_label_4 == 0 [2024-01-29 22:56:23,377 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-29 22:56:23,377 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-29 22:56:23,378 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-29 22:56:23,378 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (((result_6 == 0) && (result_7 == 0)) && (sort_label_is_null_5 == (_Bool)0)) && (sort_label_is_null_1 == (_Bool)0 || sort_label_is_null_1 == (_Bool)1) [2024-01-29 22:56:23,378 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_6 == 0) && (result_7 == 0)) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,378 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (result_6 == 0) && (result_7 == 0) [2024-01-29 22:56:23,379 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_6 == 0) && (result_7 == 0)) && (result_8 == 0) [2024-01-29 22:56:23,379 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_6 == 0) && (result_7 == 0)) && (sort_label_is_null_3 == (_Bool)0) [2024-01-29 22:56:23,380 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_6 == 0 [2024-01-29 22:56:23,380 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] sort_label_4 == 0 [2024-01-29 22:56:23,380 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (sort_label_4 == 0) && (sort_label_is_null_3 == (_Bool)0) [2024-01-29 22:56:23,381 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (sort_label_4 == 0) && (result_6 == 0) [2024-01-29 22:56:23,381 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (sort_label_4 == 0) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,381 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (sort_label_4 == 0) && (result_8 == 0) [2024-01-29 22:56:23,381 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (sort_label_4 == 0) && (result_7 == 0) [2024-01-29 22:56:23,381 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (sort_label_4 == 0) && (sort_label_is_null_1 == (_Bool)0) [2024-01-29 22:56:23,381 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-29 22:56:23,382 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (sort_label_2 == 0) && (sort_label_4 == 0) [2024-01-29 22:56:23,382 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] sort_label_2 == 0 [2024-01-29 22:56:23,382 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((sort_label_2 == 0) && (sort_label_4 == 0)) && (result_6 == 0) [2024-01-29 22:56:23,382 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((sort_label_2 == 0) && (sort_label_4 == 0)) && (sort_label_is_null_5 == (_Bool)0) [2024-01-29 22:56:23,382 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((sort_label_2 == 0) && (sort_label_4 == 0)) && (sort_label_is_null_3 == (_Bool)0) [2024-01-29 22:56:23,382 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((sort_label_2 == 0) && (sort_label_4 == 0)) && (result_7 == 0) [2024-01-29 22:56:23,383 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((sort_label_2 == 0) && (sort_label_4 == 0)) && (sort_label_is_null_1 == (_Bool)0) [2024-01-29 22:56:23,383 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((sort_label_2 == 0) && (sort_label_4 == 0)) && (result_8 == 0) [2024-01-29 22:56:23,419 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:56:23,593 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c[3111,3124] [2024-01-29 22:56:23,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:23,611 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:56:23,618 WARN L424 MainDispatcher]: Unable to annotate __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function) with a witness entry [2024-01-29 22:56:23,619 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:23,669 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-exp-term-subst.wvr.c[3111,3124] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:23,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:23,685 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:56:23,686 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23 WrapperNode [2024-01-29 22:56:23,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:23,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:23,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:56:23,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:56:23,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,746 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 250 [2024-01-29 22:56:23,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:23,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:56:23,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:56:23,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:56:23,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,772 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 22:56:23,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:56:23,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:56:23,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:56:23,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:56:23,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (1/1) ... [2024-01-29 22:56:23,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:23,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:23,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 22:56:23,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 22:56:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:56:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:56:23,863 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:56:23,863 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:56:23,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:56:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:56:23,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:56:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:56:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:56:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:56:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:56:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:56:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:56:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:56:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:56:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:56:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:56:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:56:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:56:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:56:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:56:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:56:23,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:56:23,867 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:56:23,983 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:56:23,985 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:56:24,374 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:56:24,376 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:56:24,545 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:56:24,545 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:56:24,546 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:24 BoogieIcfgContainer [2024-01-29 22:56:24,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:56:24,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:56:24,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:56:24,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:56:24,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:23" (1/4) ... [2024-01-29 22:56:24,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e45d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:24, skipping insertion in model container [2024-01-29 22:56:24,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:23" (2/4) ... [2024-01-29 22:56:24,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e45d73 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:24, skipping insertion in model container [2024-01-29 22:56:24,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:23" (3/4) ... [2024-01-29 22:56:24,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e45d73 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:24, skipping insertion in model container [2024-01-29 22:56:24,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:24" (4/4) ... [2024-01-29 22:56:24,558 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2024-01-29 22:56:24,572 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:56:24,572 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-01-29 22:56:24,573 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:56:24,652 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 22:56:24,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 180 transitions, 381 flow [2024-01-29 22:56:24,746 INFO L124 PetriNetUnfolderBase]: 9/177 cut-off events. [2024-01-29 22:56:24,746 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:24,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 177 events. 9/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 316 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 149. Up to 2 conditions per place. [2024-01-29 22:56:24,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 180 transitions, 381 flow [2024-01-29 22:56:24,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 176 transitions, 370 flow [2024-01-29 22:56:24,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:56:24,776 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=false, 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;@6507398f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:56:24,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-01-29 22:56:24,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:56:24,779 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:56:24,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:24,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:24,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:56:24,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:24,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 22251, now seen corresponding path program 1 times [2024-01-29 22:56:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:24,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124508184] [2024-01-29 22:56:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:25,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124508184] [2024-01-29 22:56:25,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124508184] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:25,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522912051] [2024-01-29 22:56:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:25,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:25,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:25,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:25,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 180 [2024-01-29 22:56:25,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 176 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:25,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:25,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 180 [2024-01-29 22:56:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:25,845 INFO L124 PetriNetUnfolderBase]: 3203/5405 cut-off events. [2024-01-29 22:56:25,846 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2024-01-29 22:56:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10060 conditions, 5405 events. 3203/5405 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41573 event pairs, 2653 based on Foata normal form. 2/4332 useless extension candidates. Maximal degree in co-relation 9035. Up to 4430 conditions per place. [2024-01-29 22:56:25,880 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 46 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2024-01-29 22:56:25,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 173 transitions, 460 flow [2024-01-29 22:56:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2024-01-29 22:56:25,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2024-01-29 22:56:25,892 INFO L175 Difference]: Start difference. First operand has 177 places, 176 transitions, 370 flow. Second operand 3 states and 435 transitions. [2024-01-29 22:56:25,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 173 transitions, 460 flow [2024-01-29 22:56:25,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 173 transitions, 448 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-29 22:56:25,901 INFO L231 Difference]: Finished difference. Result has 170 places, 173 transitions, 356 flow [2024-01-29 22:56:25,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=170, PETRI_TRANSITIONS=173} [2024-01-29 22:56:25,905 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -7 predicate places. [2024-01-29 22:56:25,905 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 173 transitions, 356 flow [2024-01-29 22:56:25,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:25,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:25,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:56:25,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:56:25,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:25,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:25,907 INFO L85 PathProgramCache]: Analyzing trace with hash 690464, now seen corresponding path program 1 times [2024-01-29 22:56:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:25,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442856379] [2024-01-29 22:56:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:25,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442856379] [2024-01-29 22:56:26,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442856379] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922264388] [2024-01-29 22:56:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 180 [2024-01-29 22:56:26,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 173 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:26,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 180 [2024-01-29 22:56:26,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:26,706 INFO L124 PetriNetUnfolderBase]: 3203/5403 cut-off events. [2024-01-29 22:56:26,706 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:26,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 5403 events. 3203/5403 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41454 event pairs, 2653 based on Foata normal form. 2/4333 useless extension candidates. Maximal degree in co-relation 9894. Up to 4434 conditions per place. [2024-01-29 22:56:26,734 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 49 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-01-29 22:56:26,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 454 flow [2024-01-29 22:56:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:26,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2024-01-29 22:56:26,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7870370370370371 [2024-01-29 22:56:26,737 INFO L175 Difference]: Start difference. First operand has 170 places, 173 transitions, 356 flow. Second operand 3 states and 425 transitions. [2024-01-29 22:56:26,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 171 transitions, 454 flow [2024-01-29 22:56:26,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:26,740 INFO L231 Difference]: Finished difference. Result has 168 places, 171 transitions, 352 flow [2024-01-29 22:56:26,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=168, PETRI_TRANSITIONS=171} [2024-01-29 22:56:26,741 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -9 predicate places. [2024-01-29 22:56:26,741 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 171 transitions, 352 flow [2024-01-29 22:56:26,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:26,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:26,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:56:26,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:56:26,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:26,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash 21405201, now seen corresponding path program 1 times [2024-01-29 22:56:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182381513] [2024-01-29 22:56:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:26,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182381513] [2024-01-29 22:56:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182381513] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904257186] [2024-01-29 22:56:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:26,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:26,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:26,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 180 [2024-01-29 22:56:26,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:26,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:26,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 180 [2024-01-29 22:56:26,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:27,339 INFO L124 PetriNetUnfolderBase]: 3203/5402 cut-off events. [2024-01-29 22:56:27,340 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:27,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9917 conditions, 5402 events. 3203/5402 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41489 event pairs, 2653 based on Foata normal form. 0/4331 useless extension candidates. Maximal degree in co-relation 9896. Up to 4436 conditions per place. [2024-01-29 22:56:27,365 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 52 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-01-29 22:56:27,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 170 transitions, 458 flow [2024-01-29 22:56:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-01-29 22:56:27,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.774074074074074 [2024-01-29 22:56:27,367 INFO L175 Difference]: Start difference. First operand has 168 places, 171 transitions, 352 flow. Second operand 3 states and 418 transitions. [2024-01-29 22:56:27,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 170 transitions, 458 flow [2024-01-29 22:56:27,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 170 transitions, 454 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:27,370 INFO L231 Difference]: Finished difference. Result has 167 places, 170 transitions, 350 flow [2024-01-29 22:56:27,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=167, PETRI_TRANSITIONS=170} [2024-01-29 22:56:27,370 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -10 predicate places. [2024-01-29 22:56:27,371 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 170 transitions, 350 flow [2024-01-29 22:56:27,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:27,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:27,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:56:27,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:56:27,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:27,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash -904411889, now seen corresponding path program 1 times [2024-01-29 22:56:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128388769] [2024-01-29 22:56:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:27,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128388769] [2024-01-29 22:56:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128388769] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:27,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:27,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:27,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776647039] [2024-01-29 22:56:27,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:27,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:27,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 180 [2024-01-29 22:56:27,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 170 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:27,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:27,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 180 [2024-01-29 22:56:27,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,117 INFO L124 PetriNetUnfolderBase]: 3203/5401 cut-off events. [2024-01-29 22:56:28,118 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:28,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9913 conditions, 5401 events. 3203/5401 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41475 event pairs, 2653 based on Foata normal form. 1/4332 useless extension candidates. Maximal degree in co-relation 9894. Up to 4434 conditions per place. [2024-01-29 22:56:28,139 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 49 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2024-01-29 22:56:28,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 169 transitions, 450 flow [2024-01-29 22:56:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2024-01-29 22:56:28,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7851851851851852 [2024-01-29 22:56:28,141 INFO L175 Difference]: Start difference. First operand has 167 places, 170 transitions, 350 flow. Second operand 3 states and 424 transitions. [2024-01-29 22:56:28,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 169 transitions, 450 flow [2024-01-29 22:56:28,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 169 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,143 INFO L231 Difference]: Finished difference. Result has 166 places, 169 transitions, 348 flow [2024-01-29 22:56:28,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=166, PETRI_TRANSITIONS=169} [2024-01-29 22:56:28,144 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -11 predicate places. [2024-01-29 22:56:28,145 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 169 transitions, 348 flow [2024-01-29 22:56:28,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:28,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:56:28,146 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:28,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2028003309, now seen corresponding path program 1 times [2024-01-29 22:56:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495091496] [2024-01-29 22:56:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495091496] [2024-01-29 22:56:28,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495091496] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342570988] [2024-01-29 22:56:28,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 180 [2024-01-29 22:56:28,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 169 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:28,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 180 [2024-01-29 22:56:28,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:28,787 INFO L124 PetriNetUnfolderBase]: 3203/5400 cut-off events. [2024-01-29 22:56:28,787 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:28,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9912 conditions, 5400 events. 3203/5400 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41589 event pairs, 2653 based on Foata normal form. 1/4332 useless extension candidates. Maximal degree in co-relation 9894. Up to 4434 conditions per place. [2024-01-29 22:56:28,814 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 49 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2024-01-29 22:56:28,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 168 transitions, 448 flow [2024-01-29 22:56:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2024-01-29 22:56:28,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7851851851851852 [2024-01-29 22:56:28,816 INFO L175 Difference]: Start difference. First operand has 166 places, 169 transitions, 348 flow. Second operand 3 states and 424 transitions. [2024-01-29 22:56:28,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 168 transitions, 448 flow [2024-01-29 22:56:28,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 168 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:28,818 INFO L231 Difference]: Finished difference. Result has 165 places, 168 transitions, 346 flow [2024-01-29 22:56:28,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=165, PETRI_TRANSITIONS=168} [2024-01-29 22:56:28,819 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -12 predicate places. [2024-01-29 22:56:28,820 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 168 transitions, 346 flow [2024-01-29 22:56:28,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:28,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:28,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:28,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:56:28,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:28,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:28,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1556406155, now seen corresponding path program 1 times [2024-01-29 22:56:28,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:28,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903694578] [2024-01-29 22:56:28,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903694578] [2024-01-29 22:56:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903694578] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605747115] [2024-01-29 22:56:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:28,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:28,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 180 [2024-01-29 22:56:28,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 168 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:28,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:28,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 180 [2024-01-29 22:56:28,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,359 INFO L124 PetriNetUnfolderBase]: 3203/5399 cut-off events. [2024-01-29 22:56:29,359 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:29,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9912 conditions, 5399 events. 3203/5399 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41627 event pairs, 2653 based on Foata normal form. 0/4331 useless extension candidates. Maximal degree in co-relation 9894. Up to 4434 conditions per place. [2024-01-29 22:56:29,385 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 50 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2024-01-29 22:56:29,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 167 transitions, 448 flow [2024-01-29 22:56:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2024-01-29 22:56:29,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7814814814814814 [2024-01-29 22:56:29,387 INFO L175 Difference]: Start difference. First operand has 165 places, 168 transitions, 346 flow. Second operand 3 states and 422 transitions. [2024-01-29 22:56:29,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 167 transitions, 448 flow [2024-01-29 22:56:29,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 167 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,389 INFO L231 Difference]: Finished difference. Result has 164 places, 167 transitions, 344 flow [2024-01-29 22:56:29,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=164, PETRI_TRANSITIONS=167} [2024-01-29 22:56:29,390 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -13 predicate places. [2024-01-29 22:56:29,390 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 167 transitions, 344 flow [2024-01-29 22:56:29,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:29,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:56:29,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:29,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1571897529, now seen corresponding path program 1 times [2024-01-29 22:56:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146243991] [2024-01-29 22:56:29,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146243991] [2024-01-29 22:56:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146243991] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888965886] [2024-01-29 22:56:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:29,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2024-01-29 22:56:29,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 167 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:29,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:29,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2024-01-29 22:56:29,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:29,918 INFO L124 PetriNetUnfolderBase]: 3203/5396 cut-off events. [2024-01-29 22:56:29,918 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:29,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9903 conditions, 5396 events. 3203/5396 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41576 event pairs, 2653 based on Foata normal form. 1/4329 useless extension candidates. Maximal degree in co-relation 9886. Up to 4427 conditions per place. [2024-01-29 22:56:29,944 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 44 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2024-01-29 22:56:29,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 430 flow [2024-01-29 22:56:29,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2024-01-29 22:56:29,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.812962962962963 [2024-01-29 22:56:29,946 INFO L175 Difference]: Start difference. First operand has 164 places, 167 transitions, 344 flow. Second operand 3 states and 439 transitions. [2024-01-29 22:56:29,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 430 flow [2024-01-29 22:56:29,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:29,948 INFO L231 Difference]: Finished difference. Result has 161 places, 164 transitions, 338 flow [2024-01-29 22:56:29,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=161, PETRI_TRANSITIONS=164} [2024-01-29 22:56:29,949 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -16 predicate places. [2024-01-29 22:56:29,949 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 164 transitions, 338 flow [2024-01-29 22:56:29,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:29,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:29,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:29,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:56:29,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:29,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1484183881, now seen corresponding path program 1 times [2024-01-29 22:56:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852441828] [2024-01-29 22:56:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852441828] [2024-01-29 22:56:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852441828] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602217245] [2024-01-29 22:56:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:29,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:29,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:30,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 180 [2024-01-29 22:56:30,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 164 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:30,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 180 [2024-01-29 22:56:30,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:30,628 INFO L124 PetriNetUnfolderBase]: 4092/7313 cut-off events. [2024-01-29 22:56:30,628 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-01-29 22:56:30,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12953 conditions, 7313 events. 4092/7313 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 59960 event pairs, 3363 based on Foata normal form. 0/5483 useless extension candidates. Maximal degree in co-relation 12915. Up to 5535 conditions per place. [2024-01-29 22:56:30,671 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 55 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2024-01-29 22:56:30,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 163 transitions, 450 flow [2024-01-29 22:56:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2024-01-29 22:56:30,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7685185185185185 [2024-01-29 22:56:30,673 INFO L175 Difference]: Start difference. First operand has 161 places, 164 transitions, 338 flow. Second operand 3 states and 415 transitions. [2024-01-29 22:56:30,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 163 transitions, 450 flow [2024-01-29 22:56:30,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 446 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:30,676 INFO L231 Difference]: Finished difference. Result has 160 places, 163 transitions, 336 flow [2024-01-29 22:56:30,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=160, PETRI_TRANSITIONS=163} [2024-01-29 22:56:30,676 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -17 predicate places. [2024-01-29 22:56:30,677 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 163 transitions, 336 flow [2024-01-29 22:56:30,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:30,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:30,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:56:30,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:30,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1234939237, now seen corresponding path program 1 times [2024-01-29 22:56:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957433447] [2024-01-29 22:56:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:30,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:30,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957433447] [2024-01-29 22:56:30,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957433447] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:30,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:30,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:30,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836228518] [2024-01-29 22:56:30,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:30,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:30,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:30,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2024-01-29 22:56:30,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 163 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:30,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:30,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2024-01-29 22:56:30,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,190 INFO L124 PetriNetUnfolderBase]: 3203/5394 cut-off events. [2024-01-29 22:56:31,190 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:31,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9901 conditions, 5394 events. 3203/5394 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41502 event pairs, 2653 based on Foata normal form. 0/4328 useless extension candidates. Maximal degree in co-relation 9871. Up to 4427 conditions per place. [2024-01-29 22:56:31,223 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 44 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2024-01-29 22:56:31,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 162 transitions, 426 flow [2024-01-29 22:56:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2024-01-29 22:56:31,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8092592592592592 [2024-01-29 22:56:31,225 INFO L175 Difference]: Start difference. First operand has 160 places, 163 transitions, 336 flow. Second operand 3 states and 437 transitions. [2024-01-29 22:56:31,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 162 transitions, 426 flow [2024-01-29 22:56:31,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 162 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,228 INFO L231 Difference]: Finished difference. Result has 159 places, 162 transitions, 334 flow [2024-01-29 22:56:31,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=159, PETRI_TRANSITIONS=162} [2024-01-29 22:56:31,228 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -18 predicate places. [2024-01-29 22:56:31,229 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 162 transitions, 334 flow [2024-01-29 22:56:31,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:31,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:56:31,230 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:31,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash 371590071, now seen corresponding path program 1 times [2024-01-29 22:56:31,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186086796] [2024-01-29 22:56:31,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186086796] [2024-01-29 22:56:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186086796] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745275065] [2024-01-29 22:56:31,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:31,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:31,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:31,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 180 [2024-01-29 22:56:31,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 162 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 180 [2024-01-29 22:56:31,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:31,820 INFO L124 PetriNetUnfolderBase]: 3643/6421 cut-off events. [2024-01-29 22:56:31,820 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-01-29 22:56:31,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11438 conditions, 6421 events. 3643/6421 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 51746 event pairs, 2973 based on Foata normal form. 0/5210 useless extension candidates. Maximal degree in co-relation 11402. Up to 4930 conditions per place. [2024-01-29 22:56:31,845 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 55 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2024-01-29 22:56:31,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 161 transitions, 446 flow [2024-01-29 22:56:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:31,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2024-01-29 22:56:31,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7685185185185185 [2024-01-29 22:56:31,847 INFO L175 Difference]: Start difference. First operand has 159 places, 162 transitions, 334 flow. Second operand 3 states and 415 transitions. [2024-01-29 22:56:31,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 161 transitions, 446 flow [2024-01-29 22:56:31,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 161 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:31,849 INFO L231 Difference]: Finished difference. Result has 158 places, 161 transitions, 332 flow [2024-01-29 22:56:31,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=158, PETRI_TRANSITIONS=161} [2024-01-29 22:56:31,850 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -19 predicate places. [2024-01-29 22:56:31,850 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 161 transitions, 332 flow [2024-01-29 22:56:31,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:31,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:31,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:56:31,851 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:31,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1365608913, now seen corresponding path program 1 times [2024-01-29 22:56:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814279416] [2024-01-29 22:56:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814279416] [2024-01-29 22:56:31,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814279416] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:31,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141299006] [2024-01-29 22:56:31,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:31,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:31,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:31,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 180 [2024-01-29 22:56:31,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 161 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 180 [2024-01-29 22:56:31,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,299 INFO L124 PetriNetUnfolderBase]: 3203/5392 cut-off events. [2024-01-29 22:56:32,299 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:32,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9910 conditions, 5392 events. 3203/5392 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41618 event pairs, 2653 based on Foata normal form. 0/4333 useless extension candidates. Maximal degree in co-relation 9875. Up to 4431 conditions per place. [2024-01-29 22:56:32,327 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 55 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-01-29 22:56:32,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 160 transitions, 444 flow [2024-01-29 22:56:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2024-01-29 22:56:32,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7685185185185185 [2024-01-29 22:56:32,329 INFO L175 Difference]: Start difference. First operand has 158 places, 161 transitions, 332 flow. Second operand 3 states and 415 transitions. [2024-01-29 22:56:32,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 160 transitions, 444 flow [2024-01-29 22:56:32,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 160 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,331 INFO L231 Difference]: Finished difference. Result has 157 places, 160 transitions, 330 flow [2024-01-29 22:56:32,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=157, PETRI_TRANSITIONS=160} [2024-01-29 22:56:32,332 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -20 predicate places. [2024-01-29 22:56:32,332 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 160 transitions, 330 flow [2024-01-29 22:56:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:56:32,333 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:32,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 615797343, now seen corresponding path program 1 times [2024-01-29 22:56:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895816672] [2024-01-29 22:56:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895816672] [2024-01-29 22:56:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895816672] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765577351] [2024-01-29 22:56:32,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 180 [2024-01-29 22:56:32,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 160 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 180 [2024-01-29 22:56:32,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,770 INFO L124 PetriNetUnfolderBase]: 3203/5391 cut-off events. [2024-01-29 22:56:32,770 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:32,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9903 conditions, 5391 events. 3203/5391 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41573 event pairs, 2653 based on Foata normal form. 0/4329 useless extension candidates. Maximal degree in co-relation 9876. Up to 4432 conditions per place. [2024-01-29 22:56:32,796 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 49 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2024-01-29 22:56:32,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 159 transitions, 430 flow [2024-01-29 22:56:32,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2024-01-29 22:56:32,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7907407407407407 [2024-01-29 22:56:32,798 INFO L175 Difference]: Start difference. First operand has 157 places, 160 transitions, 330 flow. Second operand 3 states and 427 transitions. [2024-01-29 22:56:32,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 159 transitions, 430 flow [2024-01-29 22:56:32,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 159 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:32,800 INFO L231 Difference]: Finished difference. Result has 156 places, 159 transitions, 328 flow [2024-01-29 22:56:32,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=156, PETRI_TRANSITIONS=159} [2024-01-29 22:56:32,801 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -21 predicate places. [2024-01-29 22:56:32,801 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 159 transitions, 328 flow [2024-01-29 22:56:32,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:32,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:56:32,802 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:32,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1414003174, now seen corresponding path program 1 times [2024-01-29 22:56:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448222116] [2024-01-29 22:56:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448222116] [2024-01-29 22:56:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448222116] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183650753] [2024-01-29 22:56:32,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 180 [2024-01-29 22:56:32,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 180 [2024-01-29 22:56:32,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,153 INFO L124 PetriNetUnfolderBase]: 3203/5390 cut-off events. [2024-01-29 22:56:33,153 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:33,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 5390 events. 3203/5390 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41554 event pairs, 2653 based on Foata normal form. 0/4332 useless extension candidates. Maximal degree in co-relation 9875. Up to 4425 conditions per place. [2024-01-29 22:56:33,239 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 55 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2024-01-29 22:56:33,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 158 transitions, 440 flow [2024-01-29 22:56:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2024-01-29 22:56:33,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7796296296296297 [2024-01-29 22:56:33,241 INFO L175 Difference]: Start difference. First operand has 156 places, 159 transitions, 328 flow. Second operand 3 states and 421 transitions. [2024-01-29 22:56:33,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 158 transitions, 440 flow [2024-01-29 22:56:33,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 158 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,256 INFO L231 Difference]: Finished difference. Result has 155 places, 158 transitions, 326 flow [2024-01-29 22:56:33,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=155, PETRI_TRANSITIONS=158} [2024-01-29 22:56:33,257 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -22 predicate places. [2024-01-29 22:56:33,257 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 158 transitions, 326 flow [2024-01-29 22:56:33,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:56:33,258 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:33,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 884426180, now seen corresponding path program 1 times [2024-01-29 22:56:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912549888] [2024-01-29 22:56:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912549888] [2024-01-29 22:56:33,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912549888] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060959338] [2024-01-29 22:56:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 180 [2024-01-29 22:56:33,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 158 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 180 [2024-01-29 22:56:33,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,706 INFO L124 PetriNetUnfolderBase]: 3203/5387 cut-off events. [2024-01-29 22:56:33,706 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:33,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9905 conditions, 5387 events. 3203/5387 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 41404 event pairs, 2653 based on Foata normal form. 2/4335 useless extension candidates. Maximal degree in co-relation 9867. Up to 4437 conditions per place. [2024-01-29 22:56:33,737 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 55 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-01-29 22:56:33,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 155 transitions, 434 flow [2024-01-29 22:56:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-01-29 22:56:33,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-01-29 22:56:33,740 INFO L175 Difference]: Start difference. First operand has 155 places, 158 transitions, 326 flow. Second operand 3 states and 414 transitions. [2024-01-29 22:56:33,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 155 transitions, 434 flow [2024-01-29 22:56:33,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 155 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,742 INFO L231 Difference]: Finished difference. Result has 152 places, 155 transitions, 320 flow [2024-01-29 22:56:33,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=152, PETRI_TRANSITIONS=155} [2024-01-29 22:56:33,743 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -25 predicate places. [2024-01-29 22:56:33,743 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 155 transitions, 320 flow [2024-01-29 22:56:33,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:33,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:56:33,744 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:33,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -469942634, now seen corresponding path program 1 times [2024-01-29 22:56:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955380400] [2024-01-29 22:56:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955380400] [2024-01-29 22:56:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955380400] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781986866] [2024-01-29 22:56:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:33,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 180 [2024-01-29 22:56:33,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 155 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 180 [2024-01-29 22:56:33,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,383 INFO L124 PetriNetUnfolderBase]: 4092/7304 cut-off events. [2024-01-29 22:56:34,383 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-01-29 22:56:34,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12951 conditions, 7304 events. 4092/7304 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 59959 event pairs, 3363 based on Foata normal form. 0/5481 useless extension candidates. Maximal degree in co-relation 12909. Up to 5543 conditions per place. [2024-01-29 22:56:34,422 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 62 selfloop transitions, 2 changer transitions 0/154 dead transitions. [2024-01-29 22:56:34,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 154 transitions, 446 flow [2024-01-29 22:56:34,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2024-01-29 22:56:34,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.737037037037037 [2024-01-29 22:56:34,424 INFO L175 Difference]: Start difference. First operand has 152 places, 155 transitions, 320 flow. Second operand 3 states and 398 transitions. [2024-01-29 22:56:34,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 154 transitions, 446 flow [2024-01-29 22:56:34,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 154 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,426 INFO L231 Difference]: Finished difference. Result has 151 places, 154 transitions, 318 flow [2024-01-29 22:56:34,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=151, PETRI_TRANSITIONS=154} [2024-01-29 22:56:34,426 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -26 predicate places. [2024-01-29 22:56:34,427 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 154 transitions, 318 flow [2024-01-29 22:56:34,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:56:34,427 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:34,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1683318964, now seen corresponding path program 1 times [2024-01-29 22:56:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923469173] [2024-01-29 22:56:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923469173] [2024-01-29 22:56:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923469173] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530998755] [2024-01-29 22:56:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:56:34,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:56:34,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:56:34,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 180 [2024-01-29 22:56:34,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 154 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 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) [2024-01-29 22:56:34,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 180 [2024-01-29 22:56:34,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,117 INFO L124 PetriNetUnfolderBase]: 3643/6412 cut-off events. [2024-01-29 22:56:35,117 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-01-29 22:56:35,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11446 conditions, 6412 events. 3643/6412 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 51770 event pairs, 2973 based on Foata normal form. 1/5209 useless extension candidates. Maximal degree in co-relation 11404. Up to 4946 conditions per place. [2024-01-29 22:56:35,139 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 72 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2024-01-29 22:56:35,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 152 transitions, 462 flow [2024-01-29 22:56:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2024-01-29 22:56:35,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6962962962962963 [2024-01-29 22:56:35,141 INFO L175 Difference]: Start difference. First operand has 151 places, 154 transitions, 318 flow. Second operand 3 states and 376 transitions. [2024-01-29 22:56:35,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 152 transitions, 462 flow [2024-01-29 22:56:35,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 152 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,143 INFO L231 Difference]: Finished difference. Result has 149 places, 152 transitions, 314 flow [2024-01-29 22:56:35,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=149, PETRI_TRANSITIONS=152} [2024-01-29 22:56:35,144 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -28 predicate places. [2024-01-29 22:56:35,144 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 152 transitions, 314 flow [2024-01-29 22:56:35,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 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) [2024-01-29 22:56:35,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:56:35,144 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:35,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 283617964, now seen corresponding path program 1 times [2024-01-29 22:56:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296595998] [2024-01-29 22:56:35,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296595998] [2024-01-29 22:56:35,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296595998] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513679292] [2024-01-29 22:56:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:35,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:35,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:35,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 180 [2024-01-29 22:56:35,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 152 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 180 [2024-01-29 22:56:35,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,730 INFO L124 PetriNetUnfolderBase]: 3959/7703 cut-off events. [2024-01-29 22:56:35,730 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-29 22:56:35,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13250 conditions, 7703 events. 3959/7703 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 69507 event pairs, 927 based on Foata normal form. 0/6461 useless extension candidates. Maximal degree in co-relation 13204. Up to 2631 conditions per place. [2024-01-29 22:56:35,767 INFO L140 encePairwiseOnDemand]: 167/180 looper letters, 114 selfloop transitions, 7 changer transitions 0/190 dead transitions. [2024-01-29 22:56:35,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 190 transitions, 636 flow [2024-01-29 22:56:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2024-01-29 22:56:35,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-01-29 22:56:35,769 INFO L175 Difference]: Start difference. First operand has 149 places, 152 transitions, 314 flow. Second operand 4 states and 512 transitions. [2024-01-29 22:56:35,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 190 transitions, 636 flow [2024-01-29 22:56:35,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 190 transitions, 632 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,772 INFO L231 Difference]: Finished difference. Result has 147 places, 150 transitions, 338 flow [2024-01-29 22:56:35,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2024-01-29 22:56:35,773 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -30 predicate places. [2024-01-29 22:56:35,773 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 338 flow [2024-01-29 22:56:35,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:56:35,774 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:35,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 202223077, now seen corresponding path program 1 times [2024-01-29 22:56:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718521419] [2024-01-29 22:56:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718521419] [2024-01-29 22:56:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718521419] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669478409] [2024-01-29 22:56:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 180 [2024-01-29 22:56:35,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 180 [2024-01-29 22:56:35,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,262 INFO L124 PetriNetUnfolderBase]: 3691/6433 cut-off events. [2024-01-29 22:56:36,262 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2024-01-29 22:56:36,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12859 conditions, 6433 events. 3691/6433 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 52605 event pairs, 1525 based on Foata normal form. 0/5366 useless extension candidates. Maximal degree in co-relation 4472. Up to 2657 conditions per place. [2024-01-29 22:56:36,297 INFO L140 encePairwiseOnDemand]: 175/180 looper letters, 77 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2024-01-29 22:56:36,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 177 transitions, 572 flow [2024-01-29 22:56:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2024-01-29 22:56:36,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2024-01-29 22:56:36,298 INFO L175 Difference]: Start difference. First operand has 147 places, 150 transitions, 338 flow. Second operand 3 states and 448 transitions. [2024-01-29 22:56:36,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 177 transitions, 572 flow [2024-01-29 22:56:36,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 177 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:36,302 INFO L231 Difference]: Finished difference. Result has 147 places, 151 transitions, 358 flow [2024-01-29 22:56:36,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=147, PETRI_TRANSITIONS=151} [2024-01-29 22:56:36,302 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -30 predicate places. [2024-01-29 22:56:36,302 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 358 flow [2024-01-29 22:56:36,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:36,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:36,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:56:36,303 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:36,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1973948762, now seen corresponding path program 1 times [2024-01-29 22:56:36,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657994858] [2024-01-29 22:56:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:36,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657994858] [2024-01-29 22:56:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657994858] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119499623] [2024-01-29 22:56:36,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 180 [2024-01-29 22:56:36,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 151 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:36,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 180 [2024-01-29 22:56:36,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,901 INFO L124 PetriNetUnfolderBase]: 3721/6438 cut-off events. [2024-01-29 22:56:36,902 INFO L125 PetriNetUnfolderBase]: For 1622/1622 co-relation queries the response was YES. [2024-01-29 22:56:36,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13489 conditions, 6438 events. 3721/6438 cut-off events. For 1622/1622 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 52539 event pairs, 1767 based on Foata normal form. 0/5413 useless extension candidates. Maximal degree in co-relation 6333. Up to 2690 conditions per place. [2024-01-29 22:56:36,939 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 89 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2024-01-29 22:56:36,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 178 transitions, 635 flow [2024-01-29 22:56:36,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2024-01-29 22:56:36,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2024-01-29 22:56:36,941 INFO L175 Difference]: Start difference. First operand has 147 places, 151 transitions, 358 flow. Second operand 3 states and 426 transitions. [2024-01-29 22:56:36,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 178 transitions, 635 flow [2024-01-29 22:56:36,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 178 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:36,945 INFO L231 Difference]: Finished difference. Result has 145 places, 152 transitions, 400 flow [2024-01-29 22:56:36,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=145, PETRI_TRANSITIONS=152} [2024-01-29 22:56:36,945 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -32 predicate places. [2024-01-29 22:56:36,946 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 152 transitions, 400 flow [2024-01-29 22:56:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:36,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:36,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:56:36,946 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:36,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1062870248, now seen corresponding path program 1 times [2024-01-29 22:56:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220588797] [2024-01-29 22:56:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220588797] [2024-01-29 22:56:36,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220588797] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180567293] [2024-01-29 22:56:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:37,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 180 [2024-01-29 22:56:37,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 152 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:37,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 180 [2024-01-29 22:56:37,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,890 INFO L124 PetriNetUnfolderBase]: 4665/9157 cut-off events. [2024-01-29 22:56:37,891 INFO L125 PetriNetUnfolderBase]: For 3615/3629 co-relation queries the response was YES. [2024-01-29 22:56:37,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18912 conditions, 9157 events. 4665/9157 cut-off events. For 3615/3629 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 85364 event pairs, 1633 based on Foata normal form. 0/7954 useless extension candidates. Maximal degree in co-relation 8932. Up to 2783 conditions per place. [2024-01-29 22:56:37,945 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 113 selfloop transitions, 21 changer transitions 0/198 dead transitions. [2024-01-29 22:56:37,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 198 transitions, 832 flow [2024-01-29 22:56:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2024-01-29 22:56:37,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7069444444444445 [2024-01-29 22:56:37,947 INFO L175 Difference]: Start difference. First operand has 145 places, 152 transitions, 400 flow. Second operand 4 states and 509 transitions. [2024-01-29 22:56:37,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 198 transitions, 832 flow [2024-01-29 22:56:37,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 198 transitions, 821 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:37,956 INFO L231 Difference]: Finished difference. Result has 148 places, 161 transitions, 534 flow [2024-01-29 22:56:37,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=534, PETRI_PLACES=148, PETRI_TRANSITIONS=161} [2024-01-29 22:56:37,956 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -29 predicate places. [2024-01-29 22:56:37,956 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 161 transitions, 534 flow [2024-01-29 22:56:37,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:37,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:37,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:56:37,957 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:37,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1410759950, now seen corresponding path program 1 times [2024-01-29 22:56:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27163859] [2024-01-29 22:56:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27163859] [2024-01-29 22:56:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27163859] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525818991] [2024-01-29 22:56:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:37,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:38,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 180 [2024-01-29 22:56:38,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 161 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:38,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 180 [2024-01-29 22:56:38,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,020 INFO L124 PetriNetUnfolderBase]: 6235/11919 cut-off events. [2024-01-29 22:56:39,020 INFO L125 PetriNetUnfolderBase]: For 8711/8746 co-relation queries the response was YES. [2024-01-29 22:56:39,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26975 conditions, 11919 events. 6235/11919 cut-off events. For 8711/8746 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 108669 event pairs, 1752 based on Foata normal form. 3/10673 useless extension candidates. Maximal degree in co-relation 12361. Up to 5140 conditions per place. [2024-01-29 22:56:39,104 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 117 selfloop transitions, 33 changer transitions 0/211 dead transitions. [2024-01-29 22:56:39,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 211 transitions, 1068 flow [2024-01-29 22:56:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2024-01-29 22:56:39,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-01-29 22:56:39,106 INFO L175 Difference]: Start difference. First operand has 148 places, 161 transitions, 534 flow. Second operand 4 states and 504 transitions. [2024-01-29 22:56:39,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 211 transitions, 1068 flow [2024-01-29 22:56:39,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 211 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:39,115 INFO L231 Difference]: Finished difference. Result has 151 places, 174 transitions, 748 flow [2024-01-29 22:56:39,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=748, PETRI_PLACES=151, PETRI_TRANSITIONS=174} [2024-01-29 22:56:39,116 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -26 predicate places. [2024-01-29 22:56:39,116 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 174 transitions, 748 flow [2024-01-29 22:56:39,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:39,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:39,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:56:39,117 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:39,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1693924604, now seen corresponding path program 1 times [2024-01-29 22:56:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134111226] [2024-01-29 22:56:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134111226] [2024-01-29 22:56:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134111226] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:39,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406432542] [2024-01-29 22:56:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:39,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 180 [2024-01-29 22:56:39,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 174 transitions, 748 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:39,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 180 [2024-01-29 22:56:39,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,191 INFO L124 PetriNetUnfolderBase]: 5565/10826 cut-off events. [2024-01-29 22:56:40,191 INFO L125 PetriNetUnfolderBase]: For 12194/12379 co-relation queries the response was YES. [2024-01-29 22:56:40,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26000 conditions, 10826 events. 5565/10826 cut-off events. For 12194/12379 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 100295 event pairs, 1321 based on Foata normal form. 38/9874 useless extension candidates. Maximal degree in co-relation 11185. Up to 4405 conditions per place. [2024-01-29 22:56:40,260 INFO L140 encePairwiseOnDemand]: 173/180 looper letters, 124 selfloop transitions, 20 changer transitions 0/219 dead transitions. [2024-01-29 22:56:40,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 219 transitions, 1178 flow [2024-01-29 22:56:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2024-01-29 22:56:40,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2024-01-29 22:56:40,262 INFO L175 Difference]: Start difference. First operand has 151 places, 174 transitions, 748 flow. Second operand 4 states and 530 transitions. [2024-01-29 22:56:40,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 219 transitions, 1178 flow [2024-01-29 22:56:40,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 219 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:40,272 INFO L231 Difference]: Finished difference. Result has 153 places, 176 transitions, 786 flow [2024-01-29 22:56:40,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=786, PETRI_PLACES=153, PETRI_TRANSITIONS=176} [2024-01-29 22:56:40,272 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -24 predicate places. [2024-01-29 22:56:40,273 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 176 transitions, 786 flow [2024-01-29 22:56:40,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:40,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:40,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:56:40,273 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:40,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash -972054412, now seen corresponding path program 1 times [2024-01-29 22:56:40,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746825160] [2024-01-29 22:56:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746825160] [2024-01-29 22:56:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746825160] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:40,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485814512] [2024-01-29 22:56:40,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:40,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:40,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:40,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 180 [2024-01-29 22:56:40,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 176 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:40,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 180 [2024-01-29 22:56:40,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,037 INFO L124 PetriNetUnfolderBase]: 5339/9545 cut-off events. [2024-01-29 22:56:41,037 INFO L125 PetriNetUnfolderBase]: For 16262/16307 co-relation queries the response was YES. [2024-01-29 22:56:41,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25229 conditions, 9545 events. 5339/9545 cut-off events. For 16262/16307 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 81525 event pairs, 1611 based on Foata normal form. 3/8448 useless extension candidates. Maximal degree in co-relation 10431. Up to 5512 conditions per place. [2024-01-29 22:56:41,089 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 99 selfloop transitions, 11 changer transitions 0/203 dead transitions. [2024-01-29 22:56:41,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 203 transitions, 1106 flow [2024-01-29 22:56:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2024-01-29 22:56:41,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2024-01-29 22:56:41,091 INFO L175 Difference]: Start difference. First operand has 153 places, 176 transitions, 786 flow. Second operand 3 states and 435 transitions. [2024-01-29 22:56:41,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 203 transitions, 1106 flow [2024-01-29 22:56:41,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 203 transitions, 1068 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,103 INFO L231 Difference]: Finished difference. Result has 152 places, 177 transitions, 800 flow [2024-01-29 22:56:41,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=152, PETRI_TRANSITIONS=177} [2024-01-29 22:56:41,104 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -25 predicate places. [2024-01-29 22:56:41,104 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 177 transitions, 800 flow [2024-01-29 22:56:41,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:41,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:41,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:56:41,105 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:41,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2136365010, now seen corresponding path program 1 times [2024-01-29 22:56:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348932612] [2024-01-29 22:56:41,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348932612] [2024-01-29 22:56:41,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348932612] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:41,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:41,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:41,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882914750] [2024-01-29 22:56:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:41,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:41,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:41,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:41,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:41,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 180 [2024-01-29 22:56:41,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 177 transitions, 800 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:41,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:41,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 180 [2024-01-29 22:56:41,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,968 INFO L124 PetriNetUnfolderBase]: 5333/10433 cut-off events. [2024-01-29 22:56:41,968 INFO L125 PetriNetUnfolderBase]: For 15870/15921 co-relation queries the response was YES. [2024-01-29 22:56:42,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26922 conditions, 10433 events. 5333/10433 cut-off events. For 15870/15921 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 96321 event pairs, 1286 based on Foata normal form. 11/9318 useless extension candidates. Maximal degree in co-relation 11303. Up to 4328 conditions per place. [2024-01-29 22:56:42,042 INFO L140 encePairwiseOnDemand]: 172/180 looper letters, 119 selfloop transitions, 26 changer transitions 0/220 dead transitions. [2024-01-29 22:56:42,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 220 transitions, 1243 flow [2024-01-29 22:56:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:42,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2024-01-29 22:56:42,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7375 [2024-01-29 22:56:42,044 INFO L175 Difference]: Start difference. First operand has 152 places, 177 transitions, 800 flow. Second operand 4 states and 531 transitions. [2024-01-29 22:56:42,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 220 transitions, 1243 flow [2024-01-29 22:56:42,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 220 transitions, 1229 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:56:42,058 INFO L231 Difference]: Finished difference. Result has 153 places, 180 transitions, 886 flow [2024-01-29 22:56:42,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=886, PETRI_PLACES=153, PETRI_TRANSITIONS=180} [2024-01-29 22:56:42,058 INFO L281 CegarLoopForPetriNet]: 177 programPoint places, -24 predicate places. [2024-01-29 22:56:42,059 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 180 transitions, 886 flow [2024-01-29 22:56:42,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:42,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:42,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:42,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:56:42,059 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 85 more)] === [2024-01-29 22:56:42,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1802805077, now seen corresponding path program 1 times [2024-01-29 22:56:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878645610] [2024-01-29 22:56:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:42,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-29 22:56:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-29 22:56:42,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-29 22:56:42,089 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-29 22:56:42,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 88 remaining) [2024-01-29 22:56:42,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 88 remaining) [2024-01-29 22:56:42,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 88 remaining) [2024-01-29 22:56:42,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 88 remaining) [2024-01-29 22:56:42,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 88 remaining) [2024-01-29 22:56:42,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 88 remaining) [2024-01-29 22:56:42,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 88 remaining) [2024-01-29 22:56:42,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 88 remaining) [2024-01-29 22:56:42,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 88 remaining) [2024-01-29 22:56:42,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 88 remaining) [2024-01-29 22:56:42,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 88 remaining) [2024-01-29 22:56:42,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION (21 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 88 remaining) [2024-01-29 22:56:42,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err5ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 88 remaining) [2024-01-29 22:56:42,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 88 remaining) [2024-01-29 22:56:42,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 88 remaining) [2024-01-29 22:56:42,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 88 remaining) [2024-01-29 22:56:42,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 88 remaining) [2024-01-29 22:56:42,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:56:42,101 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:42,107 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-29 22:56:42,107 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-29 22:56:42,142 INFO L503 ceAbstractionStarter]: Automizer considered 66 witness invariants [2024-01-29 22:56:42,143 INFO L504 ceAbstractionStarter]: WitnessConsidered=66 [2024-01-29 22:56:42,144 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:56:42 BasicIcfg [2024-01-29 22:56:42,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-29 22:56:42,144 INFO L158 Benchmark]: Toolchain (without parser) took 18833.19ms. Allocated memory was 140.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 65.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-29 22:56:42,144 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 140.5MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:42,144 INFO L158 Benchmark]: Witness Parser took 0.31ms. Allocated memory is still 140.5MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-29 22:56:42,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.83ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 64.8MB in the beginning and 138.5MB in the end (delta: -73.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-01-29 22:56:42,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.09ms. Allocated memory is still 174.1MB. Free memory was 138.5MB in the beginning and 135.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-29 22:56:42,145 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 174.1MB. Free memory was 135.3MB in the beginning and 132.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-29 22:56:42,145 INFO L158 Benchmark]: RCFGBuilder took 759.49ms. Allocated memory is still 174.1MB. Free memory was 132.2MB in the beginning and 138.2MB in the end (delta: -6.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-01-29 22:56:42,145 INFO L158 Benchmark]: TraceAbstraction took 17593.94ms. Allocated memory was 174.1MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 137.3MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-29 22:56:42,146 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 140.5MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.31ms. Allocated memory is still 140.5MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.83ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 64.8MB in the beginning and 138.5MB in the end (delta: -73.7MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.09ms. Allocated memory is still 174.1MB. Free memory was 138.5MB in the beginning and 135.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 174.1MB. Free memory was 135.3MB in the beginning and 132.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 759.49ms. Allocated memory is still 174.1MB. Free memory was 132.2MB in the beginning and 138.2MB in the end (delta: -6.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17593.94ms. Allocated memory was 174.1MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 137.3MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 68]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] int sort_label_0, sort_label_2, sort_label_4, result_6, result_7, result_8; [L39] _Bool sort_label_is_null_1, sort_label_is_null_3, sort_label_is_null_5; [L62] pthread_t t1, t2, t3; VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] [L64] sort_label_0 = __VERIFIER_nondet_int() [L65] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]]]] [L65] sort_label_2 = __VERIFIER_nondet_int() [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] [L66] sort_label_4 = __VERIFIER_nondet_int() [L67] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] [L67] sort_label_is_null_1 = __VERIFIER_nondet_bool() [L68] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[sort_label_is_null_1],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]]] VAL [result_6=0, result_7=0, result_8=0, sort_label_0=0, sort_label_2=0, sort_label_4=0, sort_label_is_null_1=2, sort_label_is_null_3=0, sort_label_is_null_5=0, t1={5:0}, t2={3:0}, t3={6:0}] - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 235 locations, 88 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5480 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2436 mSDsluCounter, 465 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 447 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6183 IncrementalHoareTripleChecker+Invalid, 6630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 447 mSolverCounterUnsat, 413 mSDtfsCounter, 6183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=886occurred in iteration=24, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 4603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-29 22:56:42,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE