/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:09:43,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:09:43,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 15:09:43,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:09:43,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:09:43,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:09:43,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:09:43,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:09:43,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:09:43,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:09:43,338 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:09:43,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:09:43,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:09:43,340 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:09:43,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:09:43,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:09:43,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:09:43,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:09:43,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:09:43,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:09:43,342 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:09:43,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:09:43,342 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:09:43,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:09:43,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:09:43,343 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:09:43,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:09:43,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:09:43,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:09:43,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:09:43,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:09:43,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:09:43,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:09:43,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:09:43,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:09:43,346 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 15:09:43,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:09:43,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:09:43,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:09:43,701 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:09:43,701 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:09:43,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:09:44,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:09:45,174 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:09:45,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:09:45,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4266c6116/fd1c52f2cfd24d9b989f520d1b0b121f/FLAGb42738dd8 [2023-08-26 15:09:45,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4266c6116/fd1c52f2cfd24d9b989f520d1b0b121f [2023-08-26 15:09:45,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:09:45,212 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:09:45,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:09:45,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:09:45,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:09:45,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1afc47e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45, skipping insertion in model container [2023-08-26 15:09:45,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,260 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:09:45,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:09:45,608 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:09:45,637 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:09:45,639 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:09:45,683 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:09:45,715 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:09:45,715 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:09:45,721 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:09:45,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45 WrapperNode [2023-08-26 15:09:45,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:09:45,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:09:45,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:09:45,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:09:45,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,800 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-08-26 15:09:45,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:09:45,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:09:45,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:09:45,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:09:45,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:09:45,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:09:45,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:09:45,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:09:45,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (1/1) ... [2023-08-26 15:09:45,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:09:45,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:09:45,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 15:09:45,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 15:09:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:09:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:09:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:09:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:09:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:09:45,928 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:09:45,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:09:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:09:45,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:09:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:09:45,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:09:45,929 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:09:45,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:09:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:09:45,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:09:45,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:09:45,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:09:45,932 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 15:09:46,100 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:09:46,101 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:09:46,390 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:09:46,534 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:09:46,535 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:09:46,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:09:46 BoogieIcfgContainer [2023-08-26 15:09:46,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:09:46,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:09:46,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:09:46,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:09:46,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:09:45" (1/3) ... [2023-08-26 15:09:46,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7beda506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:09:46, skipping insertion in model container [2023-08-26 15:09:46,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:09:45" (2/3) ... [2023-08-26 15:09:46,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7beda506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:09:46, skipping insertion in model container [2023-08-26 15:09:46,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:09:46" (3/3) ... [2023-08-26 15:09:46,544 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.opt_pso.opt_rmo.opt.i [2023-08-26 15:09:46,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:09:46,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 15:09:46,560 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:09:46,624 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:09:46,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 300 flow [2023-08-26 15:09:46,763 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-26 15:09:46,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:09:46,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 15:09:46,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 140 transitions, 300 flow [2023-08-26 15:09:46,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 136 transitions, 284 flow [2023-08-26 15:09:46,776 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:09:46,784 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-26 15:09:46,787 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-26 15:09:46,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 284 flow [2023-08-26 15:09:46,823 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-26 15:09:46,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:09:46,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 15:09:46,826 INFO L119 LiptonReduction]: Number of co-enabled transitions 3228 [2023-08-26 15:09:51,255 INFO L134 LiptonReduction]: Checked pairs total: 9315 [2023-08-26 15:09:51,255 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-26 15:09:51,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:09:51,282 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@336cd099, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:09:51,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 15:09:51,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:09:51,285 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 15:09:51,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:09:51,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:09:51,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:09:51,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:09:51,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:09:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-26 15:09:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:09:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744140218] [2023-08-26 15:09:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:09:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:09:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:09:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:09:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:09:51,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744140218] [2023-08-26 15:09:51,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744140218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:09:51,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:09:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:09:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586312266] [2023-08-26 15:09:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:09:51,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:09:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:09:51,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:09:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:09:51,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 281 [2023-08-26 15:09:51,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:51,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:09:51,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 281 [2023-08-26 15:09:51,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:09:52,358 INFO L124 PetriNetUnfolderBase]: 5049/7179 cut-off events. [2023-08-26 15:09:52,359 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 15:09:52,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14217 conditions, 7179 events. 5049/7179 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 38449 event pairs, 5049 based on Foata normal form. 240/6422 useless extension candidates. Maximal degree in co-relation 14205. Up to 6881 conditions per place. [2023-08-26 15:09:52,403 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-08-26 15:09:52,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-08-26 15:09:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:09:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:09:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-26 15:09:52,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106761565836299 [2023-08-26 15:09:52,423 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-26 15:09:52,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-26 15:09:52,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:09:52,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-26 15:09:52,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:52,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:52,438 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:52,439 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 287 transitions. [2023-08-26 15:09:52,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-08-26 15:09:52,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:09:52,446 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-08-26 15:09:52,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 15:09:52,451 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-26 15:09:52,451 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-08-26 15:09:52,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:52,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:09:52,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:09:52,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:09:52,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:09:52,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:09:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1816473811, now seen corresponding path program 1 times [2023-08-26 15:09:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:09:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247641714] [2023-08-26 15:09:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:09:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:09:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:09:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:09:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:09:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247641714] [2023-08-26 15:09:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247641714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:09:52,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:09:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:09:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517014313] [2023-08-26 15:09:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:09:52,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:09:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:09:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:09:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:09:52,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 281 [2023-08-26 15:09:52,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:52,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:09:52,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 281 [2023-08-26 15:09:52,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:09:53,284 INFO L124 PetriNetUnfolderBase]: 3975/5712 cut-off events. [2023-08-26 15:09:53,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:09:53,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11289 conditions, 5712 events. 3975/5712 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 30277 event pairs, 1089 based on Foata normal form. 0/5291 useless extension candidates. Maximal degree in co-relation 11286. Up to 4303 conditions per place. [2023-08-26 15:09:53,315 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 35 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2023-08-26 15:09:53,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2023-08-26 15:09:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:09:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:09:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 15:09:53,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49466192170818507 [2023-08-26 15:09:53,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 15:09:53,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 15:09:53,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:09:53,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 15:09:53,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:53,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:53,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:53,325 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 417 transitions. [2023-08-26 15:09:53,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2023-08-26 15:09:53,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:09:53,329 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-08-26 15:09:53,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-26 15:09:53,330 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-26 15:09:53,331 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-08-26 15:09:53,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:53,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:09:53,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:09:53,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:09:53,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:09:53,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:09:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash -869183337, now seen corresponding path program 1 times [2023-08-26 15:09:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:09:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064855831] [2023-08-26 15:09:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:09:53,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:09:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:09:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:09:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:09:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064855831] [2023-08-26 15:09:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064855831] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:09:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:09:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:09:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093542475] [2023-08-26 15:09:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:09:53,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:09:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:09:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:09:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:09:53,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 281 [2023-08-26 15:09:53,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:53,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:09:53,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 281 [2023-08-26 15:09:53,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:09:55,206 INFO L124 PetriNetUnfolderBase]: 14475/19832 cut-off events. [2023-08-26 15:09:55,207 INFO L125 PetriNetUnfolderBase]: For 878/878 co-relation queries the response was YES. [2023-08-26 15:09:55,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40867 conditions, 19832 events. 14475/19832 cut-off events. For 878/878 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 105600 event pairs, 4243 based on Foata normal form. 848/20680 useless extension candidates. Maximal degree in co-relation 40863. Up to 10319 conditions per place. [2023-08-26 15:09:55,327 INFO L140 encePairwiseOnDemand]: 271/281 looper letters, 41 selfloop transitions, 8 changer transitions 31/80 dead transitions. [2023-08-26 15:09:55,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 80 transitions, 342 flow [2023-08-26 15:09:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:09:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:09:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-08-26 15:09:55,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45693950177935944 [2023-08-26 15:09:55,330 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-08-26 15:09:55,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-08-26 15:09:55,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:09:55,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-08-26 15:09:55,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:55,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:55,335 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:55,336 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 5 states and 642 transitions. [2023-08-26 15:09:55,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 80 transitions, 342 flow [2023-08-26 15:09:55,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 80 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:09:55,345 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 142 flow [2023-08-26 15:09:55,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-26 15:09:55,347 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-08-26 15:09:55,347 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 142 flow [2023-08-26 15:09:55,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:55,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:09:55,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:09:55,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:09:55,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:09:55,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:09:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1174887850, now seen corresponding path program 1 times [2023-08-26 15:09:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:09:55,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753234370] [2023-08-26 15:09:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:09:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:09:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:09:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:09:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:09:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753234370] [2023-08-26 15:09:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753234370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:09:55,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:09:55,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:09:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075535319] [2023-08-26 15:09:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:09:55,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:09:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:09:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:09:55,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:09:55,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 281 [2023-08-26 15:09:55,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:55,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:09:55,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 281 [2023-08-26 15:09:55,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:09:57,029 INFO L124 PetriNetUnfolderBase]: 13287/18324 cut-off events. [2023-08-26 15:09:57,029 INFO L125 PetriNetUnfolderBase]: For 14384/14384 co-relation queries the response was YES. [2023-08-26 15:09:57,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52007 conditions, 18324 events. 13287/18324 cut-off events. For 14384/14384 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 97467 event pairs, 1115 based on Foata normal form. 636/18960 useless extension candidates. Maximal degree in co-relation 52000. Up to 9643 conditions per place. [2023-08-26 15:09:57,124 INFO L140 encePairwiseOnDemand]: 271/281 looper letters, 52 selfloop transitions, 12 changer transitions 40/104 dead transitions. [2023-08-26 15:09:57,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 104 transitions, 612 flow [2023-08-26 15:09:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:09:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:09:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-08-26 15:09:57,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494153533299441 [2023-08-26 15:09:57,128 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-08-26 15:09:57,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-08-26 15:09:57,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:09:57,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-08-26 15:09:57,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:57,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:57,135 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:57,135 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 142 flow. Second operand 7 states and 884 transitions. [2023-08-26 15:09:57,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 104 transitions, 612 flow [2023-08-26 15:09:57,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 104 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:09:57,175 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 232 flow [2023-08-26 15:09:57,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-26 15:09:57,177 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-08-26 15:09:57,177 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 232 flow [2023-08-26 15:09:57,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:57,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:09:57,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:09:57,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:09:57,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:09:57,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:09:57,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1174889772, now seen corresponding path program 1 times [2023-08-26 15:09:57,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:09:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440602528] [2023-08-26 15:09:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:09:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:09:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:09:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:09:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:09:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440602528] [2023-08-26 15:09:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440602528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:09:57,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:09:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:09:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646350239] [2023-08-26 15:09:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:09:57,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:09:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:09:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:09:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:09:57,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 281 [2023-08-26 15:09:57,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:57,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:09:57,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 281 [2023-08-26 15:09:57,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:09:58,713 INFO L124 PetriNetUnfolderBase]: 12518/17297 cut-off events. [2023-08-26 15:09:58,713 INFO L125 PetriNetUnfolderBase]: For 38431/38431 co-relation queries the response was YES. [2023-08-26 15:09:58,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54825 conditions, 17297 events. 12518/17297 cut-off events. For 38431/38431 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 90133 event pairs, 2539 based on Foata normal form. 774/18071 useless extension candidates. Maximal degree in co-relation 54813. Up to 6833 conditions per place. [2023-08-26 15:09:58,794 INFO L140 encePairwiseOnDemand]: 272/281 looper letters, 60 selfloop transitions, 8 changer transitions 45/113 dead transitions. [2023-08-26 15:09:58,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 113 transitions, 782 flow [2023-08-26 15:09:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:09:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:09:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 881 transitions. [2023-08-26 15:09:58,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44789018810371123 [2023-08-26 15:09:58,797 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 881 transitions. [2023-08-26 15:09:58,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 881 transitions. [2023-08-26 15:09:58,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:09:58,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 881 transitions. [2023-08-26 15:09:58,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.85714285714286) internal successors, (881), 7 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:58,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:58,803 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:58,803 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 232 flow. Second operand 7 states and 881 transitions. [2023-08-26 15:09:58,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 113 transitions, 782 flow [2023-08-26 15:09:59,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 113 transitions, 770 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-26 15:09:59,003 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 314 flow [2023-08-26 15:09:59,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-08-26 15:09:59,007 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-26 15:09:59,007 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 314 flow [2023-08-26 15:09:59,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:59,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:09:59,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:09:59,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:09:59,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:09:59,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:09:59,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1123928353, now seen corresponding path program 1 times [2023-08-26 15:09:59,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:09:59,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602607311] [2023-08-26 15:09:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:09:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:09:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:09:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:09:59,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:09:59,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602607311] [2023-08-26 15:09:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602607311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:09:59,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:09:59,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:09:59,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214192625] [2023-08-26 15:09:59,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:09:59,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:09:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:09:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:09:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:09:59,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 281 [2023-08-26 15:09:59,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:09:59,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:09:59,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 281 [2023-08-26 15:09:59,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:00,228 INFO L124 PetriNetUnfolderBase]: 9412/13645 cut-off events. [2023-08-26 15:10:00,229 INFO L125 PetriNetUnfolderBase]: For 46020/46470 co-relation queries the response was YES. [2023-08-26 15:10:00,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46231 conditions, 13645 events. 9412/13645 cut-off events. For 46020/46470 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 78880 event pairs, 3683 based on Foata normal form. 879/14309 useless extension candidates. Maximal degree in co-relation 46213. Up to 10540 conditions per place. [2023-08-26 15:10:00,313 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 51 selfloop transitions, 8 changer transitions 25/93 dead transitions. [2023-08-26 15:10:00,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 724 flow [2023-08-26 15:10:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:10:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:10:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-26 15:10:00,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718861209964413 [2023-08-26 15:10:00,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-26 15:10:00,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-26 15:10:00,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:00,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-26 15:10:00,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:00,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:00,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:00,320 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 314 flow. Second operand 5 states and 663 transitions. [2023-08-26 15:10:00,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 724 flow [2023-08-26 15:10:00,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 707 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-26 15:10:00,664 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 415 flow [2023-08-26 15:10:00,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-26 15:10:00,665 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-26 15:10:00,665 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 415 flow [2023-08-26 15:10:00,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:00,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:00,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:00,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:10:00,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:00,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash 508786418, now seen corresponding path program 1 times [2023-08-26 15:10:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579980459] [2023-08-26 15:10:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:00,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579980459] [2023-08-26 15:10:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579980459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:00,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:00,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:10:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519167114] [2023-08-26 15:10:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:00,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:10:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:00,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:10:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:10:00,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 15:10:00,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:00,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:00,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 15:10:00,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:01,627 INFO L124 PetriNetUnfolderBase]: 6653/9812 cut-off events. [2023-08-26 15:10:01,627 INFO L125 PetriNetUnfolderBase]: For 29971/31119 co-relation queries the response was YES. [2023-08-26 15:10:01,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32580 conditions, 9812 events. 6653/9812 cut-off events. For 29971/31119 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 58606 event pairs, 1289 based on Foata normal form. 1014/10481 useless extension candidates. Maximal degree in co-relation 32562. Up to 6520 conditions per place. [2023-08-26 15:10:01,688 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 103 selfloop transitions, 10 changer transitions 0/129 dead transitions. [2023-08-26 15:10:01,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 1189 flow [2023-08-26 15:10:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:10:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:10:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-26 15:10:01,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46619217081850534 [2023-08-26 15:10:01,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-26 15:10:01,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-26 15:10:01,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:01,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-26 15:10:01,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:01,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:01,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:01,695 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 415 flow. Second operand 5 states and 655 transitions. [2023-08-26 15:10:01,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 129 transitions, 1189 flow [2023-08-26 15:10:01,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 1139 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-26 15:10:01,761 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 468 flow [2023-08-26 15:10:01,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=468, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2023-08-26 15:10:01,762 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-26 15:10:01,762 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 468 flow [2023-08-26 15:10:01,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:01,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:01,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:01,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:10:01,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:01,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash -654226551, now seen corresponding path program 1 times [2023-08-26 15:10:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290019079] [2023-08-26 15:10:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290019079] [2023-08-26 15:10:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290019079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:01,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:01,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:10:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546840515] [2023-08-26 15:10:01,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:01,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:10:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:10:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:10:01,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 281 [2023-08-26 15:10:01,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 468 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:01,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:01,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 281 [2023-08-26 15:10:01,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:02,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L830-->L837: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_114 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_109 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y$w_buff0_used~0_113 (ite .cse1 0 v_~y$w_buff0_used~0_114)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= 0 (mod v_~y$w_buff1_used~0_108 256))) .cse3)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= v_~y~0_64 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse4 v_~y$w_buff1~0_53 v_~y~0_65))) (= v_~y$w_buff1_used~0_108 (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_109))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_109} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_108} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][79], [24#L807true, 114#L865true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 213#true, 187#true, 153#true, 94#P1EXITtrue, 225#(= ~x~0 1), P1Thread1of1ForFork2InUse, Black: 208#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork3InUse, Black: 205#(= ~x~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 29#L837true, Black: 162#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 165#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 163#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 125#P0EXITtrue, 171#true, Black: 173#(= ~z~0 0), Black: 174#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-26 15:10:02,861 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 15:10:02,861 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 15:10:02,862 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 15:10:02,862 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 15:10:03,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L830-->L837: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_114 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_109 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y$w_buff0_used~0_113 (ite .cse1 0 v_~y$w_buff0_used~0_114)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= 0 (mod v_~y$w_buff1_used~0_108 256))) .cse3)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= v_~y~0_64 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse4 v_~y$w_buff1~0_53 v_~y~0_65))) (= v_~y$w_buff1_used~0_108 (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_109))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_109} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_108} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][79], [24#L807true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 213#true, 84#L872true, 187#true, 153#true, 94#P1EXITtrue, 225#(= ~x~0 1), P1Thread1of1ForFork2InUse, Black: 208#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork3InUse, Black: 205#(= ~x~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 29#L837true, Black: 162#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 165#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 163#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 125#P0EXITtrue, 171#true, Black: 173#(= ~z~0 0), Black: 174#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-26 15:10:03,012 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,012 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,012 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,012 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([499] L872-->L18: Formula: (and (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~x~0_9) (= v_~__unbuffered_p3_EBX~0_6 0) (= 2 v_~__unbuffered_p3_EAX~0_6) (= v_~z~0_10 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~x~0=v_~x~0_9} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_11|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][84], [24#L807true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 213#true, 187#true, 153#true, 105#L18true, 94#P1EXITtrue, P1Thread1of1ForFork2InUse, Black: 208#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork3InUse, Black: 205#(= ~x~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 19#L827true, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 228#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 162#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 165#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 163#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 125#P0EXITtrue, 171#true, Black: 173#(= ~z~0 0), Black: 174#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-26 15:10:03,013 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-26 15:10:03,013 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 15:10:03,013 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 15:10:03,013 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-26 15:10:03,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([499] L872-->L18: Formula: (and (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~x~0_9) (= v_~__unbuffered_p3_EBX~0_6 0) (= 2 v_~__unbuffered_p3_EAX~0_6) (= v_~z~0_10 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~x~0=v_~x~0_9} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_11|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][84], [24#L807true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 213#true, 187#true, 153#true, 105#L18true, 94#P1EXITtrue, P1Thread1of1ForFork2InUse, Black: 208#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork3InUse, Black: 205#(= ~x~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 45#L830true, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 228#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~x~0 1)), Black: 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 162#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 165#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 163#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 125#P0EXITtrue, 171#true, Black: 173#(= ~z~0 0), Black: 174#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-26 15:10:03,013 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,013 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,013 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,014 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 15:10:03,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L830-->L837: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_114 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_109 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y$w_buff0_used~0_113 (ite .cse1 0 v_~y$w_buff0_used~0_114)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= 0 (mod v_~y$w_buff1_used~0_108 256))) .cse3)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= v_~y~0_64 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse4 v_~y$w_buff1~0_53 v_~y~0_65))) (= v_~y$w_buff1_used~0_108 (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_109))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_109} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_108} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][63], [18#P2EXITtrue, 114#L865true, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 213#true, 187#true, 153#true, 94#P1EXITtrue, P1Thread1of1ForFork2InUse, Black: 208#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork3InUse, Black: 205#(= ~x~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 215#(= ~__unbuffered_cnt~0 0), 223#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 29#L837true, Black: 162#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 165#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 163#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 125#P0EXITtrue, 171#true, Black: 173#(= ~z~0 0), Black: 174#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-26 15:10:03,114 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-26 15:10:03,114 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 15:10:03,114 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 15:10:03,114 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-26 15:10:03,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([499] L872-->L18: Formula: (and (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~x~0_9) (= v_~__unbuffered_p3_EBX~0_6 0) (= 2 v_~__unbuffered_p3_EAX~0_6) (= v_~z~0_10 2))) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~x~0=v_~x~0_9} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_11|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_7|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~x~0=v_~x~0_9} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][88], [18#P2EXITtrue, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 213#true, 187#true, 153#true, 105#L18true, 94#P1EXITtrue, P1Thread1of1ForFork2InUse, Black: 208#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 205#(= ~x~0 0), P3Thread1of1ForFork3InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 45#L830true, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 223#true, Black: 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), Black: 162#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 165#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 163#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 125#P0EXITtrue, 171#true, Black: 173#(= ~z~0 0), Black: 174#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-26 15:10:03,193 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,193 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,194 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,194 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L830-->L837: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_113 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_114 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_109 256) 0)) .cse3)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y$w_buff0_used~0_113 (ite .cse1 0 v_~y$w_buff0_used~0_114)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= 0 (mod v_~y$w_buff1_used~0_108 256))) .cse3)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21) (= v_~y~0_64 (ite .cse1 v_~y$w_buff0~0_58 (ite .cse4 v_~y$w_buff1~0_53 v_~y~0_65))) (= v_~y$w_buff1_used~0_108 (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_109))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_109} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_53, ~y$w_buff0~0=v_~y$w_buff0~0_58, ~y~0=v_~y~0_64, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_108} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][63], [18#P2EXITtrue, Black: 189#(= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 213#true, 84#L872true, 187#true, 153#true, 94#P1EXITtrue, P1Thread1of1ForFork2InUse, Black: 208#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork3InUse, Black: 205#(= ~x~0 0), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 223#true, Black: 216#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)), 29#L837true, Black: 162#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 165#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 163#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 125#P0EXITtrue, 171#true, Black: 173#(= ~z~0 0), Black: 174#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-08-26 15:10:03,194 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,194 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,194 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,194 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-26 15:10:03,274 INFO L124 PetriNetUnfolderBase]: 9434/14299 cut-off events. [2023-08-26 15:10:03,275 INFO L125 PetriNetUnfolderBase]: For 46950/47604 co-relation queries the response was YES. [2023-08-26 15:10:03,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58147 conditions, 14299 events. 9434/14299 cut-off events. For 46950/47604 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 92570 event pairs, 4010 based on Foata normal form. 598/14424 useless extension candidates. Maximal degree in co-relation 58129. Up to 7268 conditions per place. [2023-08-26 15:10:03,350 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 62 selfloop transitions, 9 changer transitions 34/114 dead transitions. [2023-08-26 15:10:03,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 114 transitions, 988 flow [2023-08-26 15:10:03,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:10:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:10:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-26 15:10:03,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4718861209964413 [2023-08-26 15:10:03,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-26 15:10:03,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-26 15:10:03,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:03,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-26 15:10:03,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:03,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:03,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:03,358 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 468 flow. Second operand 5 states and 663 transitions. [2023-08-26 15:10:03,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 114 transitions, 988 flow [2023-08-26 15:10:03,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 971 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 15:10:03,596 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 456 flow [2023-08-26 15:10:03,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=456, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2023-08-26 15:10:03,597 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-08-26 15:10:03,597 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 456 flow [2023-08-26 15:10:03,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:03,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:03,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:03,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:10:03,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:03,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash -497178351, now seen corresponding path program 1 times [2023-08-26 15:10:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:03,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717419047] [2023-08-26 15:10:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:03,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717419047] [2023-08-26 15:10:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717419047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:10:03,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890579894] [2023-08-26 15:10:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:03,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:10:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:10:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:10:03,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 15:10:03,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 456 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:03,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:03,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 15:10:03,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:04,666 INFO L124 PetriNetUnfolderBase]: 5702/8898 cut-off events. [2023-08-26 15:10:04,666 INFO L125 PetriNetUnfolderBase]: For 28402/29707 co-relation queries the response was YES. [2023-08-26 15:10:04,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34822 conditions, 8898 events. 5702/8898 cut-off events. For 28402/29707 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 58352 event pairs, 601 based on Foata normal form. 1022/9609 useless extension candidates. Maximal degree in co-relation 34801. Up to 3266 conditions per place. [2023-08-26 15:10:04,698 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 121 selfloop transitions, 17 changer transitions 12/164 dead transitions. [2023-08-26 15:10:04,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 164 transitions, 1598 flow [2023-08-26 15:10:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:10:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:10:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 916 transitions. [2023-08-26 15:10:04,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46568378240976105 [2023-08-26 15:10:04,701 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 916 transitions. [2023-08-26 15:10:04,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 916 transitions. [2023-08-26 15:10:04,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:04,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 916 transitions. [2023-08-26 15:10:04,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:04,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:04,706 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:04,706 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 456 flow. Second operand 7 states and 916 transitions. [2023-08-26 15:10:04,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 164 transitions, 1598 flow [2023-08-26 15:10:04,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 164 transitions, 1465 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-26 15:10:04,758 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 546 flow [2023-08-26 15:10:04,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2023-08-26 15:10:04,758 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-26 15:10:04,759 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 546 flow [2023-08-26 15:10:04,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:04,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:04,759 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] [2023-08-26 15:10:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:10:04,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:04,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash -975370597, now seen corresponding path program 1 times [2023-08-26 15:10:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:04,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241763191] [2023-08-26 15:10:04,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:04,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:04,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241763191] [2023-08-26 15:10:04,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241763191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:04,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:04,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:10:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480194675] [2023-08-26 15:10:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:04,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:10:04,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:10:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:10:04,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 15:10:04,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 546 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:04,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:04,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 15:10:04,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:05,767 INFO L124 PetriNetUnfolderBase]: 5033/7892 cut-off events. [2023-08-26 15:10:05,768 INFO L125 PetriNetUnfolderBase]: For 25363/27553 co-relation queries the response was YES. [2023-08-26 15:10:05,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35069 conditions, 7892 events. 5033/7892 cut-off events. For 25363/27553 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 51666 event pairs, 381 based on Foata normal form. 803/8416 useless extension candidates. Maximal degree in co-relation 35047. Up to 2995 conditions per place. [2023-08-26 15:10:05,811 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 131 selfloop transitions, 26 changer transitions 24/195 dead transitions. [2023-08-26 15:10:05,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 195 transitions, 1833 flow [2023-08-26 15:10:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:10:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:10:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1177 transitions. [2023-08-26 15:10:05,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654013444049031 [2023-08-26 15:10:05,815 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1177 transitions. [2023-08-26 15:10:05,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1177 transitions. [2023-08-26 15:10:05,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:05,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1177 transitions. [2023-08-26 15:10:05,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.77777777777777) internal successors, (1177), 9 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:05,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:05,822 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 281.0) internal successors, (2810), 10 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:05,822 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 546 flow. Second operand 9 states and 1177 transitions. [2023-08-26 15:10:05,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 195 transitions, 1833 flow [2023-08-26 15:10:06,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 195 transitions, 1783 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-26 15:10:06,217 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 670 flow [2023-08-26 15:10:06,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=670, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2023-08-26 15:10:06,218 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-08-26 15:10:06,218 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 670 flow [2023-08-26 15:10:06,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:06,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:06,219 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] [2023-08-26 15:10:06,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:10:06,219 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:06,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:06,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1920250026, now seen corresponding path program 1 times [2023-08-26 15:10:06,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:06,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860378481] [2023-08-26 15:10:06,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:06,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:06,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860378481] [2023-08-26 15:10:06,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860378481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:06,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:06,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:10:06,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725518593] [2023-08-26 15:10:06,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:06,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:10:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:06,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:10:06,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:10:06,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 281 [2023-08-26 15:10:06,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 670 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:06,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:06,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 281 [2023-08-26 15:10:06,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:07,545 INFO L124 PetriNetUnfolderBase]: 7163/11461 cut-off events. [2023-08-26 15:10:07,545 INFO L125 PetriNetUnfolderBase]: For 53779/54700 co-relation queries the response was YES. [2023-08-26 15:10:07,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54464 conditions, 11461 events. 7163/11461 cut-off events. For 53779/54700 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 79665 event pairs, 1191 based on Foata normal form. 260/11571 useless extension candidates. Maximal degree in co-relation 54439. Up to 5899 conditions per place. [2023-08-26 15:10:07,590 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 106 selfloop transitions, 2 changer transitions 49/169 dead transitions. [2023-08-26 15:10:07,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 169 transitions, 1814 flow [2023-08-26 15:10:07,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:10:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:10:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-26 15:10:07,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47046263345195727 [2023-08-26 15:10:07,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-26 15:10:07,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-26 15:10:07,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:07,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-26 15:10:07,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:07,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:07,596 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:07,596 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 670 flow. Second operand 5 states and 661 transitions. [2023-08-26 15:10:07,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 169 transitions, 1814 flow [2023-08-26 15:10:08,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 169 transitions, 1551 flow, removed 98 selfloop flow, removed 5 redundant places. [2023-08-26 15:10:08,509 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 590 flow [2023-08-26 15:10:08,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=590, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2023-08-26 15:10:08,510 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-08-26 15:10:08,510 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 590 flow [2023-08-26 15:10:08,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:08,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:08,510 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] [2023-08-26 15:10:08,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:10:08,510 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:08,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1463972552, now seen corresponding path program 2 times [2023-08-26 15:10:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659309633] [2023-08-26 15:10:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:08,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659309633] [2023-08-26 15:10:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659309633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:08,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:08,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:10:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666715637] [2023-08-26 15:10:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:08,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:10:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:10:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:10:08,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-08-26 15:10:08,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:08,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:08,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-08-26 15:10:08,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:09,834 INFO L124 PetriNetUnfolderBase]: 6469/10261 cut-off events. [2023-08-26 15:10:09,834 INFO L125 PetriNetUnfolderBase]: For 30087/31491 co-relation queries the response was YES. [2023-08-26 15:10:09,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41633 conditions, 10261 events. 6469/10261 cut-off events. For 30087/31491 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 72316 event pairs, 412 based on Foata normal form. 683/10625 useless extension candidates. Maximal degree in co-relation 41605. Up to 2477 conditions per place. [2023-08-26 15:10:09,864 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 55 selfloop transitions, 25 changer transitions 107/197 dead transitions. [2023-08-26 15:10:09,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 197 transitions, 1830 flow [2023-08-26 15:10:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 15:10:09,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 15:10:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1414 transitions. [2023-08-26 15:10:09,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45745713361371726 [2023-08-26 15:10:09,866 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1414 transitions. [2023-08-26 15:10:09,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1414 transitions. [2023-08-26 15:10:09,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:09,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1414 transitions. [2023-08-26 15:10:09,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.54545454545453) internal successors, (1414), 11 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:09,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 281.0) internal successors, (3372), 12 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:09,873 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 281.0) internal successors, (3372), 12 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:09,873 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 590 flow. Second operand 11 states and 1414 transitions. [2023-08-26 15:10:09,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 197 transitions, 1830 flow [2023-08-26 15:10:10,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 197 transitions, 1803 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-26 15:10:10,464 INFO L231 Difference]: Finished difference. Result has 89 places, 55 transitions, 455 flow [2023-08-26 15:10:10,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=455, PETRI_PLACES=89, PETRI_TRANSITIONS=55} [2023-08-26 15:10:10,465 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2023-08-26 15:10:10,465 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 55 transitions, 455 flow [2023-08-26 15:10:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:10,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:10,466 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] [2023-08-26 15:10:10,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:10:10,466 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:10,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash -5713395, now seen corresponding path program 1 times [2023-08-26 15:10:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084530335] [2023-08-26 15:10:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084530335] [2023-08-26 15:10:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084530335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:10,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:10,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:10:10,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497103287] [2023-08-26 15:10:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:10,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:10:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:10:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:10:10,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 281 [2023-08-26 15:10:10,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 55 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:10,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:10,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 281 [2023-08-26 15:10:10,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:10,960 INFO L124 PetriNetUnfolderBase]: 1841/3150 cut-off events. [2023-08-26 15:10:10,960 INFO L125 PetriNetUnfolderBase]: For 13418/13418 co-relation queries the response was YES. [2023-08-26 15:10:10,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14521 conditions, 3150 events. 1841/3150 cut-off events. For 13418/13418 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18460 event pairs, 446 based on Foata normal form. 1/3151 useless extension candidates. Maximal degree in co-relation 14493. Up to 1648 conditions per place. [2023-08-26 15:10:10,976 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 49 selfloop transitions, 5 changer transitions 59/113 dead transitions. [2023-08-26 15:10:10,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 113 transitions, 1167 flow [2023-08-26 15:10:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:10:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:10:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2023-08-26 15:10:10,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843416370106764 [2023-08-26 15:10:10,978 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2023-08-26 15:10:10,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2023-08-26 15:10:10,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:10,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2023-08-26 15:10:10,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:10,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:10,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:10,981 INFO L175 Difference]: Start difference. First operand has 89 places, 55 transitions, 455 flow. Second operand 5 states and 616 transitions. [2023-08-26 15:10:10,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 113 transitions, 1167 flow [2023-08-26 15:10:11,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 113 transitions, 885 flow, removed 57 selfloop flow, removed 19 redundant places. [2023-08-26 15:10:11,027 INFO L231 Difference]: Finished difference. Result has 72 places, 39 transitions, 218 flow [2023-08-26 15:10:11,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=72, PETRI_TRANSITIONS=39} [2023-08-26 15:10:11,027 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-26 15:10:11,027 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 39 transitions, 218 flow [2023-08-26 15:10:11,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:11,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:11,028 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] [2023-08-26 15:10:11,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:10:11,028 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:11,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 647100239, now seen corresponding path program 2 times [2023-08-26 15:10:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:11,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555345931] [2023-08-26 15:10:11,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:11,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:10:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:10:11,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:10:11,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555345931] [2023-08-26 15:10:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555345931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:10:11,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:10:11,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 15:10:11,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810767335] [2023-08-26 15:10:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:10:11,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 15:10:11,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:10:11,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 15:10:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-26 15:10:11,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 281 [2023-08-26 15:10:11,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 39 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:11,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:10:11,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 281 [2023-08-26 15:10:11,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:10:11,940 INFO L124 PetriNetUnfolderBase]: 216/404 cut-off events. [2023-08-26 15:10:11,940 INFO L125 PetriNetUnfolderBase]: For 852/855 co-relation queries the response was YES. [2023-08-26 15:10:11,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 404 events. 216/404 cut-off events. For 852/855 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1461 event pairs, 52 based on Foata normal form. 2/403 useless extension candidates. Maximal degree in co-relation 1417. Up to 212 conditions per place. [2023-08-26 15:10:11,942 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 44 selfloop transitions, 3 changer transitions 27/78 dead transitions. [2023-08-26 15:10:11,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 581 flow [2023-08-26 15:10:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 15:10:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 15:10:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions. [2023-08-26 15:10:11,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-08-26 15:10:11,945 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 843 transitions. [2023-08-26 15:10:11,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions. [2023-08-26 15:10:11,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:10:11,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions. [2023-08-26 15:10:11,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:11,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:11,949 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 281.0) internal successors, (2248), 8 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:11,949 INFO L175 Difference]: Start difference. First operand has 72 places, 39 transitions, 218 flow. Second operand 7 states and 843 transitions. [2023-08-26 15:10:11,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 581 flow [2023-08-26 15:10:11,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 78 transitions, 506 flow, removed 17 selfloop flow, removed 15 redundant places. [2023-08-26 15:10:11,953 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 181 flow [2023-08-26 15:10:11,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2023-08-26 15:10:11,954 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2023-08-26 15:10:11,954 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 181 flow [2023-08-26 15:10:11,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:10:11,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:10:11,955 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] [2023-08-26 15:10:11,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:10:11,956 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P2Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 15:10:11,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:10:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2110902359, now seen corresponding path program 3 times [2023-08-26 15:10:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:10:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770578864] [2023-08-26 15:10:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:10:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:10:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:10:12,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:10:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:10:12,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:10:12,084 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:10:12,084 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 15:10:12,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 15:10:12,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 15:10:12,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 15:10:12,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 15:10:12,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 15:10:12,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 15:10:12,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 15:10:12,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:10:12,091 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:10:12,096 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:10:12,096 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:10:12,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:10:12 BasicIcfg [2023-08-26 15:10:12,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:10:12,188 INFO L158 Benchmark]: Toolchain (without parser) took 26976.44ms. Allocated memory was 388.0MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 362.6MB in the beginning and 1.3GB in the end (delta: -981.9MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-26 15:10:12,188 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 388.0MB. Free memory was 364.8MB in the beginning and 364.6MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:10:12,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.70ms. Allocated memory is still 388.0MB. Free memory was 362.6MB in the beginning and 338.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:10:12,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.27ms. Allocated memory is still 388.0MB. Free memory was 338.9MB in the beginning and 336.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:10:12,189 INFO L158 Benchmark]: Boogie Preprocessor took 41.91ms. Allocated memory is still 388.0MB. Free memory was 336.8MB in the beginning and 334.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:10:12,189 INFO L158 Benchmark]: RCFGBuilder took 692.97ms. Allocated memory is still 388.0MB. Free memory was 334.7MB in the beginning and 296.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 15:10:12,189 INFO L158 Benchmark]: TraceAbstraction took 25648.63ms. Allocated memory was 388.0MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 296.3MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 953.4MB. Max. memory is 16.0GB. [2023-08-26 15:10:12,190 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.14ms. Allocated memory is still 388.0MB. Free memory was 364.8MB in the beginning and 364.6MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 509.70ms. Allocated memory is still 388.0MB. Free memory was 362.6MB in the beginning and 338.9MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 78.27ms. Allocated memory is still 388.0MB. Free memory was 338.9MB in the beginning and 336.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.91ms. Allocated memory is still 388.0MB. Free memory was 336.8MB in the beginning and 334.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 692.97ms. Allocated memory is still 388.0MB. Free memory was 334.7MB in the beginning and 296.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 25648.63ms. Allocated memory was 388.0MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 296.3MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 953.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 146 PlacesBefore, 51 PlacesAfterwards, 136 TransitionsBefore, 39 TransitionsAfterwards, 3228 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 9315 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4286, independent: 4061, independent conditional: 0, independent unconditional: 4061, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1750, independent: 1718, independent conditional: 0, independent unconditional: 1718, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4286, independent: 2343, independent conditional: 0, independent unconditional: 2343, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 1750, unknown conditional: 0, unknown unconditional: 1750] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L854] 0 pthread_t t717; [L855] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t717, ((void *)0), P0, ((void *)0))=-1, t717={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L856] 0 pthread_t t718; [L857] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t718, ((void *)0), P1, ((void *)0))=0, t717={5:0}, t718={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t719; [L859] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t719, ((void *)0), P2, ((void *)0))=1, t717={5:0}, t718={6:0}, t719={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t720; [L861] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t720, ((void *)0), P3, ((void *)0))=2, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L803] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L823] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L826] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L829] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t717={5:0}, t718={6:0}, t719={7:0}, t720={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L874] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix027_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 15 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: 25.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 547 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1672 IncrementalHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 40 mSDtfsCounter, 1672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=10, InterpolantAutomatonStates: 83, 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.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2023-08-26 15:10:12,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...