/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 -i ../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 08:27:57,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 08:27:57,827 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-24 08:27:57,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 08:27:57,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 08:27:57,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 08:27:57,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 08:27:57,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 08:27:57,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 08:27:57,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 08:27:57,882 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 08:27:57,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 08:27:57,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 08:27:57,883 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 08:27:57,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 08:27:57,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 08:27:57,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 08:27:57,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 08:27:57,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 08:27:57,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 08:27:57,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 08:27:57,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 08:27:57,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 08:27:57,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 08:27:57,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 08:27:57,887 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 08:27:57,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 08:27:57,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:27:57,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 08:27:57,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 08:27:57,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 08:27:57,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 08:27:57,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 08:27:57,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 08:27:57,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 08:27:57,889 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 [2023-08-24 08:27:58,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 08:27:58,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 08:27:58,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 08:27:58,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 08:27:58,240 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 08:27:58,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2023-08-24 08:27:59,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 08:27:59,532 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 08:27:59,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c [2023-08-24 08:27:59,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a81ed535/8eb91b22766d400e9cc53da2cd24a223/FLAGde56fdc5f [2023-08-24 08:27:59,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a81ed535/8eb91b22766d400e9cc53da2cd24a223 [2023-08-24 08:27:59,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 08:27:59,563 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 08:27:59,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 08:27:59,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 08:27:59,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 08:27:59,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2173f72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59, skipping insertion in model container [2023-08-24 08:27:59,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,599 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 08:27:59,781 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c[3963,3976] [2023-08-24 08:27:59,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:27:59,794 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 08:27:59,828 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-5.wvr.c[3963,3976] [2023-08-24 08:27:59,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:27:59,845 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:27:59,845 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:27:59,850 INFO L206 MainTranslator]: Completed translation [2023-08-24 08:27:59,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59 WrapperNode [2023-08-24 08:27:59,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 08:27:59,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 08:27:59,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 08:27:59,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 08:27:59,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,897 INFO L138 Inliner]: procedures = 24, calls = 85, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 247 [2023-08-24 08:27:59,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 08:27:59,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 08:27:59,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 08:27:59,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 08:27:59,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 08:27:59,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 08:27:59,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 08:27:59,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 08:27:59,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (1/1) ... [2023-08-24 08:27:59,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:27:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:27:59,959 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-24 08:27:59,961 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-24 08:27:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 08:27:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 08:27:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 08:27:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 08:27:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 08:27:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 08:27:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 08:27:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 08:27:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 08:27:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 08:27:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 08:27:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 08:27:59,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 08:27:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 08:27:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 08:27:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 08:27:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 08:27:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 08:27:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 08:27:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 08:27:59,989 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 08:28:00,079 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 08:28:00,081 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 08:28:00,335 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 08:28:00,445 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 08:28:00,446 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 08:28:00,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:28:00 BoogieIcfgContainer [2023-08-24 08:28:00,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 08:28:00,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 08:28:00,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 08:28:00,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 08:28:00,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 08:27:59" (1/3) ... [2023-08-24 08:28:00,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ad4a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:28:00, skipping insertion in model container [2023-08-24 08:28:00,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:27:59" (2/3) ... [2023-08-24 08:28:00,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ad4a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:28:00, skipping insertion in model container [2023-08-24 08:28:00,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:28:00" (3/3) ... [2023-08-24 08:28:00,456 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2023-08-24 08:28:00,471 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 08:28:00,471 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 08:28:00,471 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 08:28:00,559 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-08-24 08:28:00,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 167 transitions, 374 flow [2023-08-24 08:28:00,709 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events. [2023-08-24 08:28:00,709 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-24 08:28:00,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 162 events. 2/162 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-24 08:28:00,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 167 transitions, 374 flow [2023-08-24 08:28:00,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 148 transitions, 326 flow [2023-08-24 08:28:00,725 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 08:28:00,736 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 148 transitions, 326 flow [2023-08-24 08:28:00,740 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 148 transitions, 326 flow [2023-08-24 08:28:00,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 148 transitions, 326 flow [2023-08-24 08:28:00,791 INFO L124 PetriNetUnfolderBase]: 2/148 cut-off events. [2023-08-24 08:28:00,791 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-24 08:28:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 148 events. 2/148 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2023-08-24 08:28:00,795 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2023-08-24 08:28:05,263 INFO L134 LiptonReduction]: Checked pairs total: 10775 [2023-08-24 08:28:05,264 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-24 08:28:05,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 08:28:05,278 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;@2fce1749, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 08:28:05,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 08:28:05,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 08:28:05,285 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2023-08-24 08:28:05,285 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-24 08:28:05,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:28:05,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:28:05,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:28:05,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:28:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1886582129, now seen corresponding path program 1 times [2023-08-24 08:28:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:28:05,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325506148] [2023-08-24 08:28:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:28:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:28:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:28:06,766 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-24 08:28:06,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:28:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325506148] [2023-08-24 08:28:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325506148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:28:06,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:28:06,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:28:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113632715] [2023-08-24 08:28:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:28:06,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 08:28:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:28:06,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 08:28:06,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 08:28:06,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-08-24 08:28:06,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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-24 08:28:06,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:28:06,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-08-24 08:28:06,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:28:12,246 INFO L124 PetriNetUnfolderBase]: 64349/83635 cut-off events. [2023-08-24 08:28:12,246 INFO L125 PetriNetUnfolderBase]: For 4613/4613 co-relation queries the response was YES. [2023-08-24 08:28:12,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171328 conditions, 83635 events. 64349/83635 cut-off events. For 4613/4613 co-relation queries the response was YES. Maximal size of possible extension queue 2000. Compared 446620 event pairs, 18588 based on Foata normal form. 1/83636 useless extension candidates. Maximal degree in co-relation 170159. Up to 34609 conditions per place. [2023-08-24 08:28:12,678 INFO L140 encePairwiseOnDemand]: 268/281 looper letters, 138 selfloop transitions, 22 changer transitions 11/171 dead transitions. [2023-08-24 08:28:12,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 171 transitions, 771 flow [2023-08-24 08:28:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 08:28:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 08:28:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1140 transitions. [2023-08-24 08:28:12,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071174377224199 [2023-08-24 08:28:12,699 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1140 transitions. [2023-08-24 08:28:12,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1140 transitions. [2023-08-24 08:28:12,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:28:12,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1140 transitions. [2023-08-24 08:28:12,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 142.5) internal successors, (1140), 8 states have internal predecessors, (1140), 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-24 08:28:12,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 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-24 08:28:12,722 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 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-24 08:28:12,723 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 114 flow. Second operand 8 states and 1140 transitions. [2023-08-24 08:28:12,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 171 transitions, 771 flow [2023-08-24 08:28:12,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 171 transitions, 713 flow, removed 0 selfloop flow, removed 10 redundant places. [2023-08-24 08:28:12,950 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 248 flow [2023-08-24 08:28:12,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2023-08-24 08:28:12,955 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2023-08-24 08:28:12,955 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 248 flow [2023-08-24 08:28:12,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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-24 08:28:12,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:28:12,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:28:12,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 08:28:12,957 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:28:12,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:28:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash 243042977, now seen corresponding path program 2 times [2023-08-24 08:28:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:28:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49445525] [2023-08-24 08:28:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:28:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:28:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:28:13,251 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-24 08:28:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:28:13,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49445525] [2023-08-24 08:28:13,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49445525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:28:13,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:28:13,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:28:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738465748] [2023-08-24 08:28:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:28:13,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 08:28:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:28:13,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 08:28:13,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 08:28:13,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:28:13,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 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-24 08:28:13,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:28:13,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:28:13,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:28:15,704 INFO L124 PetriNetUnfolderBase]: 25829/36686 cut-off events. [2023-08-24 08:28:15,704 INFO L125 PetriNetUnfolderBase]: For 14666/18436 co-relation queries the response was YES. [2023-08-24 08:28:15,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89643 conditions, 36686 events. 25829/36686 cut-off events. For 14666/18436 co-relation queries the response was YES. Maximal size of possible extension queue 1812. Compared 242211 event pairs, 4662 based on Foata normal form. 472/34974 useless extension candidates. Maximal degree in co-relation 62878. Up to 26422 conditions per place. [2023-08-24 08:28:16,053 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 103 selfloop transitions, 25 changer transitions 0/148 dead transitions. [2023-08-24 08:28:16,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 148 transitions, 721 flow [2023-08-24 08:28:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 08:28:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 08:28:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1040 transitions. [2023-08-24 08:28:16,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5287239450940519 [2023-08-24 08:28:16,060 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1040 transitions. [2023-08-24 08:28:16,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1040 transitions. [2023-08-24 08:28:16,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:28:16,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1040 transitions. [2023-08-24 08:28:16,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.57142857142858) internal successors, (1040), 7 states have internal predecessors, (1040), 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-24 08:28:16,073 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-24 08:28:16,074 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-24 08:28:16,074 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 248 flow. Second operand 7 states and 1040 transitions. [2023-08-24 08:28:16,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 148 transitions, 721 flow [2023-08-24 08:28:16,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 148 transitions, 707 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 08:28:16,089 INFO L231 Difference]: Finished difference. Result has 67 places, 80 transitions, 357 flow [2023-08-24 08:28:16,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=357, PETRI_PLACES=67, PETRI_TRANSITIONS=80} [2023-08-24 08:28:16,092 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2023-08-24 08:28:16,098 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 80 transitions, 357 flow [2023-08-24 08:28:16,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 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-24 08:28:16,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:28:16,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:28:16,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 08:28:16,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:28:16,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:28:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1774123449, now seen corresponding path program 3 times [2023-08-24 08:28:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:28:16,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081917789] [2023-08-24 08:28:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:28:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:28:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:28:16,405 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-24 08:28:16,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:28:16,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081917789] [2023-08-24 08:28:16,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081917789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:28:16,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:28:16,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 08:28:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52911947] [2023-08-24 08:28:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:28:16,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 08:28:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:28:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 08:28:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-24 08:28:16,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:28:16,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 80 transitions, 357 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-24 08:28:16,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:28:16,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:28:16,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:28:20,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][272], [220#(<= (+ ~s~0 4) ~t~0), 24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 86#L160-4true, 84#L131true, 133#thread4EXITtrue, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 199#true, 45#L93true]) [2023-08-24 08:28:20,373 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 08:28:20,373 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:20,373 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:20,373 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:20,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][272], [220#(<= (+ ~s~0 4) ~t~0), 24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 133#thread4EXITtrue, 84#L131true, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 199#true, 98#L161-1true, 45#L93true]) [2023-08-24 08:28:20,733 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:28:20,733 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:20,733 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:20,733 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:21,278 INFO L124 PetriNetUnfolderBase]: 48852/71415 cut-off events. [2023-08-24 08:28:21,278 INFO L125 PetriNetUnfolderBase]: For 64375/79285 co-relation queries the response was YES. [2023-08-24 08:28:21,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211573 conditions, 71415 events. 48852/71415 cut-off events. For 64375/79285 co-relation queries the response was YES. Maximal size of possible extension queue 3745. Compared 553046 event pairs, 10731 based on Foata normal form. 1660/67713 useless extension candidates. Maximal degree in co-relation 74576. Up to 19815 conditions per place. [2023-08-24 08:28:21,921 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 190 selfloop transitions, 134 changer transitions 0/344 dead transitions. [2023-08-24 08:28:21,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 344 transitions, 1901 flow [2023-08-24 08:28:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 08:28:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 08:28:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2360 transitions. [2023-08-24 08:28:21,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5249110320284698 [2023-08-24 08:28:21,927 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2360 transitions. [2023-08-24 08:28:21,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2360 transitions. [2023-08-24 08:28:21,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:28:21,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2360 transitions. [2023-08-24 08:28:21,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 147.5) internal successors, (2360), 16 states have internal predecessors, (2360), 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-24 08:28:21,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 281.0) internal successors, (4777), 17 states have internal predecessors, (4777), 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-24 08:28:21,942 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 281.0) internal successors, (4777), 17 states have internal predecessors, (4777), 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-24 08:28:21,942 INFO L175 Difference]: Start difference. First operand has 67 places, 80 transitions, 357 flow. Second operand 16 states and 2360 transitions. [2023-08-24 08:28:21,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 344 transitions, 1901 flow [2023-08-24 08:28:21,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 344 transitions, 1895 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 08:28:21,961 INFO L231 Difference]: Finished difference. Result has 86 places, 201 transitions, 1394 flow [2023-08-24 08:28:21,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1394, PETRI_PLACES=86, PETRI_TRANSITIONS=201} [2023-08-24 08:28:21,962 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2023-08-24 08:28:21,962 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 201 transitions, 1394 flow [2023-08-24 08:28:21,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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-24 08:28:21,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:28:21,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:28:21,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 08:28:21,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:28:21,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:28:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1987591499, now seen corresponding path program 4 times [2023-08-24 08:28:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:28:21,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293613711] [2023-08-24 08:28:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:28:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:28:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:28:22,526 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-24 08:28:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:28:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293613711] [2023-08-24 08:28:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293613711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:28:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:28:22,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 08:28:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857802461] [2023-08-24 08:28:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:28:22,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 08:28:22,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:28:22,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 08:28:22,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-24 08:28:22,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-08-24 08:28:22,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 201 transitions, 1394 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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-24 08:28:22,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:28:22,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-08-24 08:28:22,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:28:33,790 INFO L124 PetriNetUnfolderBase]: 123278/163632 cut-off events. [2023-08-24 08:28:33,790 INFO L125 PetriNetUnfolderBase]: For 405546/405546 co-relation queries the response was YES. [2023-08-24 08:28:34,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626429 conditions, 163632 events. 123278/163632 cut-off events. For 405546/405546 co-relation queries the response was YES. Maximal size of possible extension queue 4233. Compared 1013833 event pairs, 21168 based on Foata normal form. 1/163633 useless extension candidates. Maximal degree in co-relation 254470. Up to 61357 conditions per place. [2023-08-24 08:28:34,833 INFO L140 encePairwiseOnDemand]: 267/281 looper letters, 599 selfloop transitions, 34 changer transitions 71/704 dead transitions. [2023-08-24 08:28:34,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 704 transitions, 6273 flow [2023-08-24 08:28:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 08:28:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 08:28:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1153 transitions. [2023-08-24 08:28:34,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129003558718861 [2023-08-24 08:28:34,836 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1153 transitions. [2023-08-24 08:28:34,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1153 transitions. [2023-08-24 08:28:34,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:28:34,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1153 transitions. [2023-08-24 08:28:34,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.125) internal successors, (1153), 8 states have internal predecessors, (1153), 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-24 08:28:34,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 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-24 08:28:34,843 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 281.0) internal successors, (2529), 9 states have internal predecessors, (2529), 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-24 08:28:34,843 INFO L175 Difference]: Start difference. First operand has 86 places, 201 transitions, 1394 flow. Second operand 8 states and 1153 transitions. [2023-08-24 08:28:34,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 704 transitions, 6273 flow [2023-08-24 08:28:40,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 704 transitions, 5879 flow, removed 194 selfloop flow, removed 1 redundant places. [2023-08-24 08:28:40,903 INFO L231 Difference]: Finished difference. Result has 97 places, 212 transitions, 1496 flow [2023-08-24 08:28:40,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1496, PETRI_PLACES=97, PETRI_TRANSITIONS=212} [2023-08-24 08:28:40,904 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 39 predicate places. [2023-08-24 08:28:40,904 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 212 transitions, 1496 flow [2023-08-24 08:28:40,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 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-24 08:28:40,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:28:40,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:28:40,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 08:28:40,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:28:40,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:28:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash -742100429, now seen corresponding path program 5 times [2023-08-24 08:28:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:28:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811452899] [2023-08-24 08:28:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:28:40,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:28:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:28:41,190 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-24 08:28:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:28:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811452899] [2023-08-24 08:28:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811452899] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:28:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:28:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-24 08:28:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470552016] [2023-08-24 08:28:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:28:41,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 08:28:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:28:41,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 08:28:41,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-24 08:28:41,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:28:41,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 212 transitions, 1496 flow. Second operand has 9 states, 9 states have (on average 134.0) internal successors, (1206), 9 states have internal predecessors, (1206), 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-24 08:28:41,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:28:41,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:28:41,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:28:43,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][203], [24#L52true, Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), 44#L67true, Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 86#L160-4true, 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 138#L128true, 45#L93true, 245#true, 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 148#L112true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 08:28:43,420 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 08:28:43,420 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:43,420 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:43,420 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:43,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][203], [24#L52true, Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), 44#L67true, Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 138#L128true, 98#L161-1true, 45#L93true, 245#true, 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 148#L112true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0)]) [2023-08-24 08:28:43,862 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-24 08:28:43,862 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 08:28:43,862 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 08:28:43,863 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 08:28:45,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][267], [220#(<= (+ ~s~0 4) ~t~0), 24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 86#L160-4true, 84#L131true, 133#thread4EXITtrue, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 245#true, 45#L93true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 199#true]) [2023-08-24 08:28:45,586 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,586 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,586 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,586 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][220], [24#L52true, 220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 104#L74true, 86#L160-4true, 133#thread4EXITtrue, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 245#true, 45#L93true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 199#true]) [2023-08-24 08:28:45,586 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,587 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,587 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,587 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:45,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][220], [220#(<= (+ ~s~0 4) ~t~0), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 104#L74true, 86#L160-4true, 133#thread4EXITtrue, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 45#L93true, 245#true, 80#L55true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 199#true]) [2023-08-24 08:28:45,787 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,788 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,788 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,788 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][267], [24#L52true, 220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 104#L74true, 133#thread4EXITtrue, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 45#L93true, 245#true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 199#true]) [2023-08-24 08:28:45,836 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,836 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,836 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,836 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][220], [24#L52true, 220#(<= (+ ~s~0 4) ~t~0), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 104#L74true, 84#L131true, 133#thread4EXITtrue, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 45#L93true, 245#true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 199#true]) [2023-08-24 08:28:45,837 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,837 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,837 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:45,837 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:46,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][220], [220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 257#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1)) (<= 0 ~b~0)), 104#L74true, 84#L131true, 133#thread4EXITtrue, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 45#L93true, 245#true, 80#L55true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 199#true]) [2023-08-24 08:28:46,007 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 08:28:46,007 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:28:46,007 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:28:46,007 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:28:46,390 INFO L124 PetriNetUnfolderBase]: 48294/71208 cut-off events. [2023-08-24 08:28:46,391 INFO L125 PetriNetUnfolderBase]: For 234053/270733 co-relation queries the response was YES. [2023-08-24 08:28:46,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290494 conditions, 71208 events. 48294/71208 cut-off events. For 234053/270733 co-relation queries the response was YES. Maximal size of possible extension queue 3512. Compared 554908 event pairs, 7799 based on Foata normal form. 4252/71215 useless extension candidates. Maximal degree in co-relation 193577. Up to 16305 conditions per place. [2023-08-24 08:28:47,183 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 169 selfloop transitions, 150 changer transitions 1/351 dead transitions. [2023-08-24 08:28:47,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 351 transitions, 2661 flow [2023-08-24 08:28:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 08:28:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 08:28:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1923 transitions. [2023-08-24 08:28:47,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5264166438543663 [2023-08-24 08:28:47,188 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1923 transitions. [2023-08-24 08:28:47,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1923 transitions. [2023-08-24 08:28:47,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:28:47,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1923 transitions. [2023-08-24 08:28:47,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 147.92307692307693) internal successors, (1923), 13 states have internal predecessors, (1923), 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-24 08:28:47,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 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-24 08:28:47,199 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 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-24 08:28:47,199 INFO L175 Difference]: Start difference. First operand has 97 places, 212 transitions, 1496 flow. Second operand 13 states and 1923 transitions. [2023-08-24 08:28:47,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 351 transitions, 2661 flow [2023-08-24 08:28:49,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 351 transitions, 2603 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-24 08:28:49,270 INFO L231 Difference]: Finished difference. Result has 108 places, 228 transitions, 1898 flow [2023-08-24 08:28:49,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1898, PETRI_PLACES=108, PETRI_TRANSITIONS=228} [2023-08-24 08:28:49,271 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 50 predicate places. [2023-08-24 08:28:49,271 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 228 transitions, 1898 flow [2023-08-24 08:28:49,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 134.0) internal successors, (1206), 9 states have internal predecessors, (1206), 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-24 08:28:49,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:28:49,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:28:49,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 08:28:49,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:28:49,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:28:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1360546795, now seen corresponding path program 6 times [2023-08-24 08:28:49,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:28:49,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435422304] [2023-08-24 08:28:49,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:28:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:28:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:28:49,479 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-24 08:28:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:28:49,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435422304] [2023-08-24 08:28:49,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435422304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:28:49,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:28:49,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 08:28:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092989159] [2023-08-24 08:28:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:28:49,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 08:28:49,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:28:49,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 08:28:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 08:28:49,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:28:49,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 228 transitions, 1898 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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-24 08:28:49,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:28:49,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:28:49,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:28:51,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][188], [24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), 44#L67true, Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 86#L160-4true, 84#L131true, 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 37#L86true, 148#L112true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), 291#(<= (+ 2 ~s~0) ~t~0)]) [2023-08-24 08:28:51,888 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-24 08:28:51,889 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 08:28:51,889 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 08:28:51,889 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-24 08:28:52,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][188], [24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), 44#L67true, Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 86#L160-4true, 84#L131true, 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 148#L112true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), 40#L90true, Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), 291#(<= (+ 2 ~s~0) ~t~0)]) [2023-08-24 08:28:52,441 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 08:28:52,442 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:52,442 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:52,442 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:52,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][188], [24#L52true, Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), 44#L67true, Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 84#L131true, 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 37#L86true, 148#L112true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), 291#(<= (+ 2 ~s~0) ~t~0)]) [2023-08-24 08:28:52,475 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-24 08:28:52,475 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:52,475 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:52,475 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-24 08:28:53,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] L109-->L112: Formula: (= (ite (= (ite (or (not (= (mod v_~b~0_6 256) 0)) (= v_~x~0_5 1)) 1 0) 0) 0 1) v_~b~0_5) InVars {~b~0=v_~b~0_6, ~x~0=v_~x~0_5} OutVars{~b~0=v_~b~0_5, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[~b~0][188], [24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), 44#L67true, Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 84#L131true, 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 148#L112true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 40#L90true, Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), 291#(<= (+ 2 ~s~0) ~t~0)]) [2023-08-24 08:28:53,229 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-24 08:28:53,230 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 08:28:53,230 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 08:28:53,230 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-24 08:28:55,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][218], [220#(<= (+ ~s~0 4) ~t~0), 24#L52true, Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 86#L160-4true, 84#L131true, 133#thread4EXITtrue, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true]) [2023-08-24 08:28:55,803 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 08:28:55,803 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:55,803 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:55,803 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:28:56,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][218], [220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 86#L160-4true, 84#L131true, 133#thread4EXITtrue, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 80#L55true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true]) [2023-08-24 08:28:56,265 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:28:56,265 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:56,265 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:56,266 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:56,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][218], [24#L52true, 220#(<= (+ ~s~0 4) ~t~0), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 84#L131true, 133#thread4EXITtrue, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true]) [2023-08-24 08:28:56,309 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:28:56,309 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:56,309 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:56,309 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:28:58,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][218], [220#(<= (+ ~s~0 4) ~t~0), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 84#L131true, 133#thread4EXITtrue, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 80#L55true, Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true]) [2023-08-24 08:28:58,492 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 08:28:58,492 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:28:58,492 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:28:58,492 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:29:00,502 INFO L124 PetriNetUnfolderBase]: 67324/101045 cut-off events. [2023-08-24 08:29:00,502 INFO L125 PetriNetUnfolderBase]: For 359151/384641 co-relation queries the response was YES. [2023-08-24 08:29:00,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432262 conditions, 101045 events. 67324/101045 cut-off events. For 359151/384641 co-relation queries the response was YES. Maximal size of possible extension queue 4925. Compared 835728 event pairs, 11713 based on Foata normal form. 4666/100915 useless extension candidates. Maximal degree in co-relation 232714. Up to 31774 conditions per place. [2023-08-24 08:29:01,388 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 191 selfloop transitions, 199 changer transitions 0/421 dead transitions. [2023-08-24 08:29:01,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 421 transitions, 3941 flow [2023-08-24 08:29:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 08:29:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 08:29:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1338 transitions. [2023-08-24 08:29:01,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290628706998813 [2023-08-24 08:29:01,392 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1338 transitions. [2023-08-24 08:29:01,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1338 transitions. [2023-08-24 08:29:01,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:29:01,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1338 transitions. [2023-08-24 08:29:01,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.66666666666666) internal successors, (1338), 9 states have internal predecessors, (1338), 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-24 08:29:01,544 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-24 08:29:01,545 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-24 08:29:01,545 INFO L175 Difference]: Start difference. First operand has 108 places, 228 transitions, 1898 flow. Second operand 9 states and 1338 transitions. [2023-08-24 08:29:01,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 421 transitions, 3941 flow [2023-08-24 08:29:06,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 421 transitions, 3566 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 08:29:06,185 INFO L231 Difference]: Finished difference. Result has 111 places, 314 transitions, 3077 flow [2023-08-24 08:29:06,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3077, PETRI_PLACES=111, PETRI_TRANSITIONS=314} [2023-08-24 08:29:06,185 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 53 predicate places. [2023-08-24 08:29:06,185 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 314 transitions, 3077 flow [2023-08-24 08:29:06,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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-24 08:29:06,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:29:06,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:29:06,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 08:29:06,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:29:06,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:29:06,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1425565647, now seen corresponding path program 7 times [2023-08-24 08:29:06,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:29:06,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038848844] [2023-08-24 08:29:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:29:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:29:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:29:06,408 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-24 08:29:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:29:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038848844] [2023-08-24 08:29:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038848844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:29:06,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:29:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 08:29:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147545155] [2023-08-24 08:29:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:29:06,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 08:29:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:29:06,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 08:29:06,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-24 08:29:06,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:29:06,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 314 transitions, 3077 flow. Second operand has 8 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-24 08:29:06,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:29:06,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:29:06,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:29:14,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [220#(<= (+ ~s~0 4) ~t~0), 24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 86#L160-4true, 133#thread4EXITtrue, 84#L131true, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0)]) [2023-08-24 08:29:14,839 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 08:29:14,839 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:29:14,839 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:29:14,839 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:29:15,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 86#L160-4true, 133#thread4EXITtrue, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 80#L55true, Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0)]) [2023-08-24 08:29:15,531 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,531 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,531 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,531 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [220#(<= (+ ~s~0 4) ~t~0), 24#L52true, Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 133#thread4EXITtrue, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0)]) [2023-08-24 08:29:15,606 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,606 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,606 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,606 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:15,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 133#thread4EXITtrue, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 45#L93true, Black: 282#(and (<= (+ ~s~0 4) ~t~0) (<= (+ ~s~0 4) ~m5~0)), Black: 280#(and (<= (+ ~s~0 4) ~t~0) (= ~s~0 ~m1~0) (<= (+ ~s~0 4) ~m5~0)), 80#L55true, Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0)]) [2023-08-24 08:29:15,943 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 08:29:15,943 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:29:15,943 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:29:15,944 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:29:17,128 INFO L124 PetriNetUnfolderBase]: 74486/112615 cut-off events. [2023-08-24 08:29:17,128 INFO L125 PetriNetUnfolderBase]: For 557074/599221 co-relation queries the response was YES. [2023-08-24 08:29:17,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508384 conditions, 112615 events. 74486/112615 cut-off events. For 557074/599221 co-relation queries the response was YES. Maximal size of possible extension queue 5382. Compared 958527 event pairs, 11905 based on Foata normal form. 7158/114459 useless extension candidates. Maximal degree in co-relation 267828. Up to 31689 conditions per place. [2023-08-24 08:29:18,458 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 188 selfloop transitions, 299 changer transitions 0/518 dead transitions. [2023-08-24 08:29:18,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 518 transitions, 5490 flow [2023-08-24 08:29:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 08:29:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 08:29:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1641 transitions. [2023-08-24 08:29:18,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530896150113232 [2023-08-24 08:29:18,461 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1641 transitions. [2023-08-24 08:29:18,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1641 transitions. [2023-08-24 08:29:18,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:29:18,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1641 transitions. [2023-08-24 08:29:18,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 149.1818181818182) internal successors, (1641), 11 states have internal predecessors, (1641), 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-24 08:29:18,469 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-24 08:29:18,469 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-24 08:29:18,469 INFO L175 Difference]: Start difference. First operand has 111 places, 314 transitions, 3077 flow. Second operand 11 states and 1641 transitions. [2023-08-24 08:29:18,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 518 transitions, 5490 flow [2023-08-24 08:29:24,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 518 transitions, 5418 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-24 08:29:24,230 INFO L231 Difference]: Finished difference. Result has 120 places, 400 transitions, 4787 flow [2023-08-24 08:29:24,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=3042, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4787, PETRI_PLACES=120, PETRI_TRANSITIONS=400} [2023-08-24 08:29:24,231 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 62 predicate places. [2023-08-24 08:29:24,231 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 400 transitions, 4787 flow [2023-08-24 08:29:24,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-24 08:29:24,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:29:24,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:29:24,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 08:29:24,232 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:29:24,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:29:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1336226381, now seen corresponding path program 8 times [2023-08-24 08:29:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:29:24,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880335829] [2023-08-24 08:29:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:29:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:29:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:29:24,468 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-24 08:29:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:29:24,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880335829] [2023-08-24 08:29:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880335829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:29:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:29:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 08:29:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927895959] [2023-08-24 08:29:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:29:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 08:29:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:29:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 08:29:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 08:29:24,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:29:24,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 400 transitions, 4787 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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-24 08:29:24,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:29:24,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:29:24,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:29:33,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [Black: 316#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 318#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), 24#L52true, 220#(<= (+ ~s~0 4) ~t~0), Black: 307#(<= (+ ~s~0 1) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 86#L160-4true, 84#L131true, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 328#(<= (+ 2 ~s~0) ~t~0), 148#L112true, Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0), 31#thread3EXITtrue]) [2023-08-24 08:29:33,999 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 08:29:33,999 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:29:33,999 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:29:33,999 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 08:29:34,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [Black: 316#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 318#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), 220#(<= (+ ~s~0 4) ~t~0), Black: 307#(<= (+ ~s~0 1) ~t~0), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 86#L160-4true, 84#L131true, Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), 271#(<= (+ ~s~0 4) ~t~0), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 80#L55true, 328#(<= (+ 2 ~s~0) ~t~0), 148#L112true, Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0), 31#thread3EXITtrue]) [2023-08-24 08:29:34,860 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:29:34,860 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:34,860 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:34,860 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:34,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [Black: 316#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 318#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 307#(<= (+ ~s~0 1) ~t~0), 24#L52true, 220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 328#(<= (+ 2 ~s~0) ~t~0), 148#L112true, Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0), 31#thread3EXITtrue]) [2023-08-24 08:29:34,861 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 08:29:34,861 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:34,861 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:34,861 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 08:29:35,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([491] L128-->L131: Formula: (= v_~b~0_7 (ite (= (ite (or (= v_~x~0_6 1) (not (= 0 (mod v_~b~0_8 256)))) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_8, ~x~0=v_~x~0_6} OutVars{~b~0=v_~b~0_7, ~x~0=v_~x~0_6} AuxVars[] AssignedVars[~b~0][236], [Black: 316#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 318#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 307#(<= (+ ~s~0 1) ~t~0), 220#(<= (+ ~s~0 4) ~t~0), Black: 248#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0)), Black: 190#(and (<= ~b~0 (* (div ~b~0 256) 256)) (<= 0 ~b~0)), Black: 251#(and (<= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1)) (<= 0 ~b~0)), Black: 186#(and (= ~x~0 0) (= ~t~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 255#(and (= ~b~0 (* (div ~b~0 256) 256)) (<= ~m1~0 ~s~0) (not (= ~x~0 1))), Black: 187#(and (= ~x~0 0) (<= ~m5~0 ~s~0) (= ~b~0 (* (div ~b~0 256) 256))), Black: 250#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), Black: 188#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 104#L74true, 84#L131true, 271#(<= (+ ~s~0 4) ~t~0), Black: 208#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0)), Black: 206#(and (<= (+ ~m1~0 1) ~t~0) (<= (+ ~s~0 1) ~m2~0) (= ~s~0 ~m1~0)), Black: 203#(<= (+ ~s~0 1) ~t~0), 98#L161-1true, 80#L55true, 328#(<= (+ 2 ~s~0) ~t~0), 148#L112true, Black: 298#(and (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 290#(<= (+ ~s~0 1) ~t~0), Black: 296#(and (= ~s~0 ~m1~0) (<= (+ 2 ~s~0) ~m5~0) (<= (+ 2 ~s~0) ~t~0)), Black: 238#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), Black: 218#(<= (+ 2 ~s~0) ~t~0), Black: 219#(<= (+ 3 ~s~0) ~t~0), Black: 217#(<= (+ ~s~0 1) ~t~0), Black: 232#(and (<= (+ ~s~0 4) ~t~0) (<= (+ 3 ~s~0) ~m2~0)), 291#(<= (+ 2 ~s~0) ~t~0), 199#true, 309#(<= (+ 3 ~s~0) ~t~0), 31#thread3EXITtrue]) [2023-08-24 08:29:35,298 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 08:29:35,298 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:29:35,298 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:29:35,298 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 08:29:36,487 INFO L124 PetriNetUnfolderBase]: 75652/114758 cut-off events. [2023-08-24 08:29:36,487 INFO L125 PetriNetUnfolderBase]: For 738879/787126 co-relation queries the response was YES. [2023-08-24 08:29:37,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 563971 conditions, 114758 events. 75652/114758 cut-off events. For 738879/787126 co-relation queries the response was YES. Maximal size of possible extension queue 5346. Compared 976765 event pairs, 12784 based on Foata normal form. 9454/119273 useless extension candidates. Maximal degree in co-relation 298137. Up to 39220 conditions per place. [2023-08-24 08:29:37,828 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 225 selfloop transitions, 318 changer transitions 0/574 dead transitions. [2023-08-24 08:29:37,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 574 transitions, 7270 flow [2023-08-24 08:29:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 08:29:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 08:29:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1342 transitions. [2023-08-24 08:29:37,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306445235270858 [2023-08-24 08:29:37,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1342 transitions. [2023-08-24 08:29:37,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1342 transitions. [2023-08-24 08:29:37,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:29:37,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1342 transitions. [2023-08-24 08:29:37,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.11111111111111) internal successors, (1342), 9 states have internal predecessors, (1342), 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-24 08:29:37,836 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-24 08:29:37,837 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-24 08:29:37,837 INFO L175 Difference]: Start difference. First operand has 120 places, 400 transitions, 4787 flow. Second operand 9 states and 1342 transitions. [2023-08-24 08:29:37,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 574 transitions, 7270 flow [2023-08-24 08:29:44,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 574 transitions, 7237 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-24 08:29:44,223 INFO L231 Difference]: Finished difference. Result has 128 places, 464 transitions, 6550 flow [2023-08-24 08:29:44,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=4727, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6550, PETRI_PLACES=128, PETRI_TRANSITIONS=464} [2023-08-24 08:29:44,224 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 70 predicate places. [2023-08-24 08:29:44,224 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 464 transitions, 6550 flow [2023-08-24 08:29:44,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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-24 08:29:44,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:29:44,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:29:44,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 08:29:44,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:29:44,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:29:44,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2115747749, now seen corresponding path program 9 times [2023-08-24 08:29:44,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:29:44,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386231672] [2023-08-24 08:29:44,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:29:44,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:29:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:29:44,413 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-24 08:29:44,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:29:44,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386231672] [2023-08-24 08:29:44,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386231672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:29:44,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:29:44,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 08:29:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77890922] [2023-08-24 08:29:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:29:44,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 08:29:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:29:44,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 08:29:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 08:29:44,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:29:44,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 464 transitions, 6550 flow. Second operand has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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-24 08:29:44,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:29:44,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:29:44,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:29:56,456 INFO L124 PetriNetUnfolderBase]: 71059/108595 cut-off events. [2023-08-24 08:29:56,456 INFO L125 PetriNetUnfolderBase]: For 842523/895042 co-relation queries the response was YES. [2023-08-24 08:29:57,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581816 conditions, 108595 events. 71059/108595 cut-off events. For 842523/895042 co-relation queries the response was YES. Maximal size of possible extension queue 5135. Compared 929018 event pairs, 12590 based on Foata normal form. 8902/113082 useless extension candidates. Maximal degree in co-relation 307908. Up to 38357 conditions per place. [2023-08-24 08:29:57,806 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 225 selfloop transitions, 375 changer transitions 5/636 dead transitions. [2023-08-24 08:29:57,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 636 transitions, 9350 flow [2023-08-24 08:29:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 08:29:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 08:29:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1346 transitions. [2023-08-24 08:29:57,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5322261763542903 [2023-08-24 08:29:57,809 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1346 transitions. [2023-08-24 08:29:57,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1346 transitions. [2023-08-24 08:29:57,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:29:57,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1346 transitions. [2023-08-24 08:29:57,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.55555555555554) internal successors, (1346), 9 states have internal predecessors, (1346), 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-24 08:29:57,815 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-24 08:29:57,815 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-24 08:29:57,816 INFO L175 Difference]: Start difference. First operand has 128 places, 464 transitions, 6550 flow. Second operand 9 states and 1346 transitions. [2023-08-24 08:29:57,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 636 transitions, 9350 flow [2023-08-24 08:30:03,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 636 transitions, 8846 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-24 08:30:03,553 INFO L231 Difference]: Finished difference. Result has 133 places, 522 transitions, 8156 flow [2023-08-24 08:30:03,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=5812, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8156, PETRI_PLACES=133, PETRI_TRANSITIONS=522} [2023-08-24 08:30:03,554 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 75 predicate places. [2023-08-24 08:30:03,554 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 522 transitions, 8156 flow [2023-08-24 08:30:03,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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-24 08:30:03,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:30:03,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:30:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 08:30:03,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 08:30:03,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:30:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -139390393, now seen corresponding path program 10 times [2023-08-24 08:30:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:30:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688884058] [2023-08-24 08:30:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:30:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:30:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:30:03,730 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-24 08:30:03,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:30:03,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688884058] [2023-08-24 08:30:03,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688884058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:30:03,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:30:03,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 08:30:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103182234] [2023-08-24 08:30:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:30:03,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 08:30:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:30:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 08:30:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 08:30:03,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 281 [2023-08-24 08:30:03,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 522 transitions, 8156 flow. Second operand has 8 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-24 08:30:03,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:30:03,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 281 [2023-08-24 08:30:03,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:30:16,888 INFO L124 PetriNetUnfolderBase]: 72495/112290 cut-off events. [2023-08-24 08:30:16,889 INFO L125 PetriNetUnfolderBase]: For 1002216/1059454 co-relation queries the response was YES. [2023-08-24 08:30:17,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622702 conditions, 112290 events. 72495/112290 cut-off events. For 1002216/1059454 co-relation queries the response was YES. Maximal size of possible extension queue 5173. Compared 986258 event pairs, 12739 based on Foata normal form. 11680/119569 useless extension candidates. Maximal degree in co-relation 309807. Up to 37177 conditions per place.