/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:55:47,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:55:47,098 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-27 03:55:47,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:55:47,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:55:47,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:55:47,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:55:47,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:55:47,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:55:47,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:55:47,135 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:55:47,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:55:47,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:55:47,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:55:47,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:55:47,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:55:47,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:55:47,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:55:47,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:55:47,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:55:47,137 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:55:47,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:55:47,138 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:55:47,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:55:47,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:55:47,138 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:55:47,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:55:47,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:55:47,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:55:47,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:55:47,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:55:47,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:55:47,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:55:47,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:55:47,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:55:47,140 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:55:47,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:55:47,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:55:47,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:55:47,381 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:55:47,383 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:55:47,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2023-08-27 03:55:48,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:55:48,498 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:55:48,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2023-08-27 03:55:48,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02567b0b/4ae63ed931bd4e8c95c7b3e19e1e0736/FLAGdf0e34105 [2023-08-27 03:55:48,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f02567b0b/4ae63ed931bd4e8c95c7b3e19e1e0736 [2023-08-27 03:55:48,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:55:48,528 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:55:48,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:55:48,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:55:48,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:55:48,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2b8400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48, skipping insertion in model container [2023-08-27 03:55:48,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,573 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:55:48,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:55:48,834 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:55:48,857 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:55:48,859 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:55:48,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:55:48,907 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:55:48,907 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:55:48,912 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:55:48,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48 WrapperNode [2023-08-27 03:55:48,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:55:48,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:55:48,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:55:48,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:55:48,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,960 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-08-27 03:55:48,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:55:48,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:55:48,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:55:48,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:55:48,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:48,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:55:49,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:55:49,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:55:49,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:55:49,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (1/1) ... [2023-08-27 03:55:49,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:55:49,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:55:49,039 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-27 03:55:49,055 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-27 03:55:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 03:55:49,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:55:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:55:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:55:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:55:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:55:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:55:49,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:55:49,068 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:55:49,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:55:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:55:49,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:55:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:55:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:55:49,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:55:49,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:55:49,071 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:55:49,191 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:55:49,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:55:49,548 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:55:49,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:55:49,696 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:55:49,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:55:49 BoogieIcfgContainer [2023-08-27 03:55:49,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:55:49,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:55:49,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:55:49,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:55:49,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:55:48" (1/3) ... [2023-08-27 03:55:49,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efc28cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:55:49, skipping insertion in model container [2023-08-27 03:55:49,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:55:48" (2/3) ... [2023-08-27 03:55:49,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efc28cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:55:49, skipping insertion in model container [2023-08-27 03:55:49,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:55:49" (3/3) ... [2023-08-27 03:55:49,704 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2023-08-27 03:55:49,714 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:55:49,715 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-27 03:55:49,715 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:55:49,771 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:55:49,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 03:55:49,852 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 03:55:49,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:55:49,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 03:55:49,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 283 flow [2023-08-27 03:55:49,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-08-27 03:55:49,864 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:55:49,880 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 03:55:49,882 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-27 03:55:49,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-08-27 03:55:49,903 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-27 03:55:49,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:55:49,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-27 03:55:49,905 INFO L119 LiptonReduction]: Number of co-enabled transitions 2402 [2023-08-27 03:55:55,563 INFO L134 LiptonReduction]: Checked pairs total: 8570 [2023-08-27 03:55:55,563 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-27 03:55:55,571 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:55:55,575 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;@7455367b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:55:55,576 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-27 03:55:55,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:55:55,578 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:55:55,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:55:55,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:55,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:55:55,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:55,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash 755816390, now seen corresponding path program 1 times [2023-08-27 03:55:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:55,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158571088] [2023-08-27 03:55:55,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:55,826 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-27 03:55:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:55,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158571088] [2023-08-27 03:55:55,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158571088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:55,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:55,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:55:55,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380998574] [2023-08-27 03:55:55,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:55,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:55:55,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:55,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:55:55,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:55:55,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2023-08-27 03:55:55,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-27 03:55:55,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:55,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2023-08-27 03:55:55,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:56,170 INFO L124 PetriNetUnfolderBase]: 1175/1823 cut-off events. [2023-08-27 03:55:56,170 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-27 03:55:56,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 1823 events. 1175/1823 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8578 event pairs, 367 based on Foata normal form. 0/1357 useless extension candidates. Maximal degree in co-relation 3681. Up to 1383 conditions per place. [2023-08-27 03:55:56,181 INFO L140 encePairwiseOnDemand]: 247/257 looper letters, 38 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2023-08-27 03:55:56,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 185 flow [2023-08-27 03:55:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:55:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:55:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-27 03:55:56,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490272373540856 [2023-08-27 03:55:56,196 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-27 03:55:56,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-27 03:55:56,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:56,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-27 03:55:56,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:55:56,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-27 03:55:56,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-27 03:55:56,209 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 61 flow. Second operand 3 states and 378 transitions. [2023-08-27 03:55:56,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 185 flow [2023-08-27 03:55:56,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:55:56,213 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 94 flow [2023-08-27 03:55:56,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2023-08-27 03:55:56,216 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-27 03:55:56,216 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 94 flow [2023-08-27 03:55:56,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-27 03:55:56,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:56,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:56,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:55:56,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:56,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1786475574, now seen corresponding path program 1 times [2023-08-27 03:55:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514905793] [2023-08-27 03:55:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:56,501 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-27 03:55:56,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514905793] [2023-08-27 03:55:56,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514905793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:56,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:56,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:55:56,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379529491] [2023-08-27 03:55:56,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:56,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:55:56,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:56,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:55:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:55:56,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 03:55:56,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-27 03:55:56,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:56,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 03:55:56,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:56,724 INFO L124 PetriNetUnfolderBase]: 950/1608 cut-off events. [2023-08-27 03:55:56,724 INFO L125 PetriNetUnfolderBase]: For 151/171 co-relation queries the response was YES. [2023-08-27 03:55:56,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 1608 events. 950/1608 cut-off events. For 151/171 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8289 event pairs, 241 based on Foata normal form. 0/1349 useless extension candidates. Maximal degree in co-relation 3804. Up to 1146 conditions per place. [2023-08-27 03:55:56,731 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 36 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-27 03:55:56,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 210 flow [2023-08-27 03:55:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:55:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:55:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-27 03:55:56,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48378728923476005 [2023-08-27 03:55:56,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-27 03:55:56,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-27 03:55:56,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:56,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-27 03:55:56,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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-27 03:55:56,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-27 03:55:56,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-27 03:55:56,737 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 94 flow. Second operand 3 states and 373 transitions. [2023-08-27 03:55:56,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 210 flow [2023-08-27 03:55:56,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:55:56,740 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 98 flow [2023-08-27 03:55:56,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 03:55:56,741 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-27 03:55:56,741 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 98 flow [2023-08-27 03:55:56,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-27 03:55:56,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:56,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:56,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:55:56,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:56,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:56,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1428631184, now seen corresponding path program 1 times [2023-08-27 03:55:56,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:56,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360681182] [2023-08-27 03:55:56,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:56,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:56,806 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-27 03:55:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360681182] [2023-08-27 03:55:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360681182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:56,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:55:56,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12149602] [2023-08-27 03:55:56,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:56,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:55:56,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:56,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:55:56,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:55:56,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2023-08-27 03:55:56,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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-27 03:55:56,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:56,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2023-08-27 03:55:56,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:57,014 INFO L124 PetriNetUnfolderBase]: 872/1348 cut-off events. [2023-08-27 03:55:57,015 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-08-27 03:55:57,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1348 events. 872/1348 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5941 event pairs, 286 based on Foata normal form. 0/1201 useless extension candidates. Maximal degree in co-relation 3358. Up to 937 conditions per place. [2023-08-27 03:55:57,020 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 35 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-27 03:55:57,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 201 flow [2023-08-27 03:55:57,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:55:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:55:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-27 03:55:57,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4688715953307393 [2023-08-27 03:55:57,022 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-27 03:55:57,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-27 03:55:57,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:57,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-27 03:55:57,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:55:57,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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-27 03:55:57,025 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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-27 03:55:57,025 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 98 flow. Second operand 4 states and 482 transitions. [2023-08-27 03:55:57,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 201 flow [2023-08-27 03:55:57,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:55:57,026 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 90 flow [2023-08-27 03:55:57,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-27 03:55:57,027 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2023-08-27 03:55:57,027 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 90 flow [2023-08-27 03:55:57,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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-27 03:55:57,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:57,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:57,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:55:57,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:57,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1428544695, now seen corresponding path program 1 times [2023-08-27 03:55:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934685695] [2023-08-27 03:55:57,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:57,079 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-27 03:55:57,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:57,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934685695] [2023-08-27 03:55:57,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934685695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:57,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:57,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:55:57,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339609417] [2023-08-27 03:55:57,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:57,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:55:57,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:57,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:55:57,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:55:57,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2023-08-27 03:55:57,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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-27 03:55:57,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:57,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2023-08-27 03:55:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:57,262 INFO L124 PetriNetUnfolderBase]: 683/1052 cut-off events. [2023-08-27 03:55:57,262 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2023-08-27 03:55:57,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 1052 events. 683/1052 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4376 event pairs, 251 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 2654. Up to 437 conditions per place. [2023-08-27 03:55:57,266 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 47 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-08-27 03:55:57,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 274 flow [2023-08-27 03:55:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:55:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:55:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2023-08-27 03:55:57,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48346303501945526 [2023-08-27 03:55:57,268 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2023-08-27 03:55:57,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2023-08-27 03:55:57,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:57,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2023-08-27 03:55:57,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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-27 03:55:57,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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-27 03:55:57,271 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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-27 03:55:57,271 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 90 flow. Second operand 4 states and 497 transitions. [2023-08-27 03:55:57,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 274 flow [2023-08-27 03:55:57,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 55 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:55:57,272 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 129 flow [2023-08-27 03:55:57,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 03:55:57,273 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-27 03:55:57,274 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 129 flow [2023-08-27 03:55:57,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 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-27 03:55:57,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:57,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:57,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:55:57,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:57,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:57,275 INFO L85 PathProgramCache]: Analyzing trace with hash 452591036, now seen corresponding path program 1 times [2023-08-27 03:55:57,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:57,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129843916] [2023-08-27 03:55:57,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:57,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:57,386 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-27 03:55:57,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:57,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129843916] [2023-08-27 03:55:57,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129843916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:57,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:57,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:55:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483203242] [2023-08-27 03:55:57,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:57,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:55:57,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:57,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:55:57,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:55:57,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-08-27 03:55:57,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-27 03:55:57,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:57,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-08-27 03:55:57,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:57,529 INFO L124 PetriNetUnfolderBase]: 654/1005 cut-off events. [2023-08-27 03:55:57,529 INFO L125 PetriNetUnfolderBase]: For 775/775 co-relation queries the response was YES. [2023-08-27 03:55:57,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1005 events. 654/1005 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4200 event pairs, 178 based on Foata normal form. 12/998 useless extension candidates. Maximal degree in co-relation 2890. Up to 841 conditions per place. [2023-08-27 03:55:57,533 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 41 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-27 03:55:57,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 272 flow [2023-08-27 03:55:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:55:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:55:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-27 03:55:57,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48638132295719844 [2023-08-27 03:55:57,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-27 03:55:57,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-27 03:55:57,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:57,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-27 03:55:57,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-27 03:55:57,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-27 03:55:57,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 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-27 03:55:57,537 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 129 flow. Second operand 3 states and 375 transitions. [2023-08-27 03:55:57,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 272 flow [2023-08-27 03:55:57,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 250 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 03:55:57,540 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 123 flow [2023-08-27 03:55:57,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-27 03:55:57,541 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-27 03:55:57,541 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 123 flow [2023-08-27 03:55:57,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-27 03:55:57,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:57,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:57,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:55:57,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:57,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1145418869, now seen corresponding path program 1 times [2023-08-27 03:55:57,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:57,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694908636] [2023-08-27 03:55:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:57,670 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-27 03:55:57,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:57,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694908636] [2023-08-27 03:55:57,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694908636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:57,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:57,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:55:57,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298302962] [2023-08-27 03:55:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:57,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:55:57,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:57,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:55:57,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:55:57,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2023-08-27 03:55:57,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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-27 03:55:57,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:57,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2023-08-27 03:55:57,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:57,907 INFO L124 PetriNetUnfolderBase]: 1071/1639 cut-off events. [2023-08-27 03:55:57,907 INFO L125 PetriNetUnfolderBase]: For 933/933 co-relation queries the response was YES. [2023-08-27 03:55:57,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4591 conditions, 1639 events. 1071/1639 cut-off events. For 933/933 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6974 event pairs, 296 based on Foata normal form. 51/1663 useless extension candidates. Maximal degree in co-relation 4576. Up to 597 conditions per place. [2023-08-27 03:55:57,914 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 53 selfloop transitions, 3 changer transitions 3/59 dead transitions. [2023-08-27 03:55:57,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 363 flow [2023-08-27 03:55:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:55:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:55:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-27 03:55:57,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776264591439689 [2023-08-27 03:55:57,915 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-27 03:55:57,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-27 03:55:57,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:57,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-27 03:55:57,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-27 03:55:57,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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-27 03:55:57,918 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 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-27 03:55:57,918 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 123 flow. Second operand 4 states and 491 transitions. [2023-08-27 03:55:57,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 363 flow [2023-08-27 03:55:57,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:55:57,922 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 138 flow [2023-08-27 03:55:57,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-27 03:55:57,924 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-27 03:55:57,926 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 138 flow [2023-08-27 03:55:57,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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-27 03:55:57,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:57,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:57,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:55:57,926 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:57,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1148197162, now seen corresponding path program 1 times [2023-08-27 03:55:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:57,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305886751] [2023-08-27 03:55:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:57,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:58,709 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-27 03:55:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305886751] [2023-08-27 03:55:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305886751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:55:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76146788] [2023-08-27 03:55:58,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:58,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:55:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:58,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:55:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:55:58,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 257 [2023-08-27 03:55:58,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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-27 03:55:58,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:58,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 257 [2023-08-27 03:55:58,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:59,034 INFO L124 PetriNetUnfolderBase]: 922/1462 cut-off events. [2023-08-27 03:55:59,034 INFO L125 PetriNetUnfolderBase]: For 1025/1026 co-relation queries the response was YES. [2023-08-27 03:55:59,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 1462 events. 922/1462 cut-off events. For 1025/1026 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6623 event pairs, 351 based on Foata normal form. 10/1445 useless extension candidates. Maximal degree in co-relation 4263. Up to 1165 conditions per place. [2023-08-27 03:55:59,039 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 55 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2023-08-27 03:55:59,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 398 flow [2023-08-27 03:55:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:55:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:55:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2023-08-27 03:55:59,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.383916990920882 [2023-08-27 03:55:59,041 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 592 transitions. [2023-08-27 03:55:59,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 592 transitions. [2023-08-27 03:55:59,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:59,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 592 transitions. [2023-08-27 03:55:59,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 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-27 03:55:59,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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-27 03:55:59,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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-27 03:55:59,044 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 138 flow. Second operand 6 states and 592 transitions. [2023-08-27 03:55:59,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 398 flow [2023-08-27 03:55:59,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 386 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 03:55:59,046 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 171 flow [2023-08-27 03:55:59,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-27 03:55:59,047 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-27 03:55:59,047 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 171 flow [2023-08-27 03:55:59,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 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-27 03:55:59,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:59,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:59,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:55:59,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:59,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:59,048 INFO L85 PathProgramCache]: Analyzing trace with hash -476175036, now seen corresponding path program 1 times [2023-08-27 03:55:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:59,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001990180] [2023-08-27 03:55:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:59,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:59,161 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-27 03:55:59,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:59,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001990180] [2023-08-27 03:55:59,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001990180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:59,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:59,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:55:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761065141] [2023-08-27 03:55:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:59,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:55:59,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:59,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:55:59,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:55:59,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2023-08-27 03:55:59,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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-27 03:55:59,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:59,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2023-08-27 03:55:59,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:55:59,348 INFO L124 PetriNetUnfolderBase]: 700/1185 cut-off events. [2023-08-27 03:55:59,348 INFO L125 PetriNetUnfolderBase]: For 816/821 co-relation queries the response was YES. [2023-08-27 03:55:59,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3565 conditions, 1185 events. 700/1185 cut-off events. For 816/821 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5663 event pairs, 139 based on Foata normal form. 111/1262 useless extension candidates. Maximal degree in co-relation 3548. Up to 778 conditions per place. [2023-08-27 03:55:59,354 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 69 selfloop transitions, 8 changer transitions 3/81 dead transitions. [2023-08-27 03:55:59,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 516 flow [2023-08-27 03:55:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:55:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:55:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-08-27 03:55:59,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466147859922179 [2023-08-27 03:55:59,355 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-08-27 03:55:59,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-08-27 03:55:59,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:55:59,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-08-27 03:55:59,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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-27 03:55:59,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-27 03:55:59,358 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-27 03:55:59,358 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 171 flow. Second operand 5 states and 599 transitions. [2023-08-27 03:55:59,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 516 flow [2023-08-27 03:55:59,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 516 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:55:59,360 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 228 flow [2023-08-27 03:55:59,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-27 03:55:59,361 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2023-08-27 03:55:59,361 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 228 flow [2023-08-27 03:55:59,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 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-27 03:55:59,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:55:59,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:55:59,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:55:59,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:55:59,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:55:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash 440723025, now seen corresponding path program 1 times [2023-08-27 03:55:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:55:59,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343427242] [2023-08-27 03:55:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:55:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:55:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:55:59,986 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-27 03:55:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:55:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343427242] [2023-08-27 03:55:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343427242] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:55:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:55:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:55:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373265820] [2023-08-27 03:55:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:55:59,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:55:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:55:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:55:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:55:59,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 257 [2023-08-27 03:55:59,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 101.75) internal successors, (814), 8 states have internal predecessors, (814), 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-27 03:55:59,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:55:59,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 257 [2023-08-27 03:55:59,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:00,523 INFO L124 PetriNetUnfolderBase]: 1387/2414 cut-off events. [2023-08-27 03:56:00,523 INFO L125 PetriNetUnfolderBase]: For 2927/2939 co-relation queries the response was YES. [2023-08-27 03:56:00,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8035 conditions, 2414 events. 1387/2414 cut-off events. For 2927/2939 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14360 event pairs, 320 based on Foata normal form. 33/2381 useless extension candidates. Maximal degree in co-relation 8013. Up to 1151 conditions per place. [2023-08-27 03:56:00,535 INFO L140 encePairwiseOnDemand]: 248/257 looper letters, 99 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2023-08-27 03:56:00,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 134 transitions, 1032 flow [2023-08-27 03:56:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:56:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:56:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 882 transitions. [2023-08-27 03:56:00,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428988326848249 [2023-08-27 03:56:00,537 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 882 transitions. [2023-08-27 03:56:00,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 882 transitions. [2023-08-27 03:56:00,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:00,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 882 transitions. [2023-08-27 03:56:00,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 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-27 03:56:00,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 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-27 03:56:00,541 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 257.0) internal successors, (2313), 9 states have internal predecessors, (2313), 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-27 03:56:00,541 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 228 flow. Second operand 8 states and 882 transitions. [2023-08-27 03:56:00,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 134 transitions, 1032 flow [2023-08-27 03:56:00,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 134 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:00,546 INFO L231 Difference]: Finished difference. Result has 61 places, 70 transitions, 449 flow [2023-08-27 03:56:00,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=449, PETRI_PLACES=61, PETRI_TRANSITIONS=70} [2023-08-27 03:56:00,547 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2023-08-27 03:56:00,547 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 70 transitions, 449 flow [2023-08-27 03:56:00,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.75) internal successors, (814), 8 states have internal predecessors, (814), 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-27 03:56:00,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:00,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:00,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:56:00,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:56:00,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash -662360229, now seen corresponding path program 1 times [2023-08-27 03:56:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665568872] [2023-08-27 03:56:00,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:00,697 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-27 03:56:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:00,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665568872] [2023-08-27 03:56:00,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665568872] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:00,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:00,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436350013] [2023-08-27 03:56:00,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:00,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:56:00,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:56:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:56:00,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2023-08-27 03:56:00,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 70 transitions, 449 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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-27 03:56:00,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:00,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2023-08-27 03:56:00,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:00,981 INFO L124 PetriNetUnfolderBase]: 977/1791 cut-off events. [2023-08-27 03:56:00,981 INFO L125 PetriNetUnfolderBase]: For 3744/3755 co-relation queries the response was YES. [2023-08-27 03:56:00,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7169 conditions, 1791 events. 977/1791 cut-off events. For 3744/3755 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10619 event pairs, 101 based on Foata normal form. 149/1863 useless extension candidates. Maximal degree in co-relation 7143. Up to 445 conditions per place. [2023-08-27 03:56:00,991 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 175 selfloop transitions, 15 changer transitions 3/194 dead transitions. [2023-08-27 03:56:00,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 194 transitions, 1518 flow [2023-08-27 03:56:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:56:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:56:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-27 03:56:00,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46470261256253476 [2023-08-27 03:56:00,993 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-27 03:56:00,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-27 03:56:00,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:00,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-27 03:56:00,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 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-27 03:56:00,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-27 03:56:00,997 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-27 03:56:00,997 INFO L175 Difference]: Start difference. First operand has 61 places, 70 transitions, 449 flow. Second operand 7 states and 836 transitions. [2023-08-27 03:56:00,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 194 transitions, 1518 flow [2023-08-27 03:56:01,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 194 transitions, 1507 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-27 03:56:01,006 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 496 flow [2023-08-27 03:56:01,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=496, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2023-08-27 03:56:01,006 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2023-08-27 03:56:01,007 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 496 flow [2023-08-27 03:56:01,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 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-27 03:56:01,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:01,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:01,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:56:01,007 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:56:01,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2101141438, now seen corresponding path program 1 times [2023-08-27 03:56:01,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:01,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111925783] [2023-08-27 03:56:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:01,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:01,059 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-27 03:56:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:01,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111925783] [2023-08-27 03:56:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111925783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:56:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315940391] [2023-08-27 03:56:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:01,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:56:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:01,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:56:01,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:56:01,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2023-08-27 03:56:01,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 496 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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-27 03:56:01,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:01,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2023-08-27 03:56:01,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:01,305 INFO L124 PetriNetUnfolderBase]: 938/1684 cut-off events. [2023-08-27 03:56:01,305 INFO L125 PetriNetUnfolderBase]: For 5070/5081 co-relation queries the response was YES. [2023-08-27 03:56:01,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7752 conditions, 1684 events. 938/1684 cut-off events. For 5070/5081 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9708 event pairs, 139 based on Foata normal form. 2/1680 useless extension candidates. Maximal degree in co-relation 7722. Up to 674 conditions per place. [2023-08-27 03:56:01,312 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 53 selfloop transitions, 10 changer transitions 58/122 dead transitions. [2023-08-27 03:56:01,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 1044 flow [2023-08-27 03:56:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:56:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:56:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-27 03:56:01,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46848249027237354 [2023-08-27 03:56:01,313 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-27 03:56:01,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-27 03:56:01,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:01,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-27 03:56:01,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 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-27 03:56:01,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-27 03:56:01,316 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 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-27 03:56:01,316 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 496 flow. Second operand 5 states and 602 transitions. [2023-08-27 03:56:01,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 1044 flow [2023-08-27 03:56:01,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 122 transitions, 1005 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-27 03:56:01,329 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 281 flow [2023-08-27 03:56:01,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2023-08-27 03:56:01,330 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2023-08-27 03:56:01,330 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 281 flow [2023-08-27 03:56:01,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 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-27 03:56:01,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:01,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:01,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:56:01,330 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:56:01,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1760776928, now seen corresponding path program 1 times [2023-08-27 03:56:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:01,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477747540] [2023-08-27 03:56:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:02,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-27 03:56:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477747540] [2023-08-27 03:56:02,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477747540] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:02,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:02,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:56:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664357026] [2023-08-27 03:56:02,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:02,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:56:02,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:02,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:56:02,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:56:02,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 257 [2023-08-27 03:56:02,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 281 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-27 03:56:02,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:02,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 257 [2023-08-27 03:56:02,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:02,661 INFO L124 PetriNetUnfolderBase]: 217/463 cut-off events. [2023-08-27 03:56:02,661 INFO L125 PetriNetUnfolderBase]: For 1834/1836 co-relation queries the response was YES. [2023-08-27 03:56:02,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2251 conditions, 463 events. 217/463 cut-off events. For 1834/1836 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2162 event pairs, 37 based on Foata normal form. 8/471 useless extension candidates. Maximal degree in co-relation 2222. Up to 257 conditions per place. [2023-08-27 03:56:02,668 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 61 selfloop transitions, 18 changer transitions 6/86 dead transitions. [2023-08-27 03:56:02,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 799 flow [2023-08-27 03:56:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:56:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:56:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 721 transitions. [2023-08-27 03:56:02,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40077821011673154 [2023-08-27 03:56:02,672 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 721 transitions. [2023-08-27 03:56:02,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 721 transitions. [2023-08-27 03:56:02,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:02,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 721 transitions. [2023-08-27 03:56:02,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 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-27 03:56:02,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-27 03:56:02,678 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-27 03:56:02,678 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 281 flow. Second operand 7 states and 721 transitions. [2023-08-27 03:56:02,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 799 flow [2023-08-27 03:56:02,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 589 flow, removed 51 selfloop flow, removed 14 redundant places. [2023-08-27 03:56:02,682 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 308 flow [2023-08-27 03:56:02,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-27 03:56:02,683 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2023-08-27 03:56:02,683 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 308 flow [2023-08-27 03:56:02,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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-27 03:56:02,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:02,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:02,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:56:02,684 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:56:02,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash -596363547, now seen corresponding path program 1 times [2023-08-27 03:56:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:02,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287215042] [2023-08-27 03:56:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:02,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:02,838 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-27 03:56:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:02,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287215042] [2023-08-27 03:56:02,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287215042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:02,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:02,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:56:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750967061] [2023-08-27 03:56:02,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:02,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:02,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:02,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:02,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 257 [2023-08-27 03:56:02,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 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-27 03:56:02,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:02,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 257 [2023-08-27 03:56:02,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:02,944 INFO L124 PetriNetUnfolderBase]: 168/368 cut-off events. [2023-08-27 03:56:02,944 INFO L125 PetriNetUnfolderBase]: For 673/675 co-relation queries the response was YES. [2023-08-27 03:56:02,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 368 events. 168/368 cut-off events. For 673/675 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1674 event pairs, 11 based on Foata normal form. 29/396 useless extension candidates. Maximal degree in co-relation 1506. Up to 130 conditions per place. [2023-08-27 03:56:02,948 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 68 selfloop transitions, 10 changer transitions 20/99 dead transitions. [2023-08-27 03:56:02,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 835 flow [2023-08-27 03:56:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:56:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:56:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 804 transitions. [2023-08-27 03:56:02,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44691495275152865 [2023-08-27 03:56:02,951 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 804 transitions. [2023-08-27 03:56:02,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 804 transitions. [2023-08-27 03:56:02,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:02,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 804 transitions. [2023-08-27 03:56:02,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 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-27 03:56:02,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-27 03:56:02,954 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 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-27 03:56:02,954 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 308 flow. Second operand 7 states and 804 transitions. [2023-08-27 03:56:02,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 835 flow [2023-08-27 03:56:02,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 785 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-27 03:56:02,958 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 310 flow [2023-08-27 03:56:02,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-27 03:56:02,958 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-27 03:56:02,958 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 310 flow [2023-08-27 03:56:02,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 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-27 03:56:02,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:02,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:02,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:56:02,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:56:02,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:02,959 INFO L85 PathProgramCache]: Analyzing trace with hash -763533940, now seen corresponding path program 1 times [2023-08-27 03:56:02,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:02,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761118964] [2023-08-27 03:56:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:03,885 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-27 03:56:03,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:03,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761118964] [2023-08-27 03:56:03,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761118964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:03,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:03,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:56:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169813263] [2023-08-27 03:56:03,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:03,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:56:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:56:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:56:03,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 257 [2023-08-27 03:56:03,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 101.25) internal successors, (810), 8 states have internal predecessors, (810), 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-27 03:56:03,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:03,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 257 [2023-08-27 03:56:03,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:04,033 INFO L124 PetriNetUnfolderBase]: 178/388 cut-off events. [2023-08-27 03:56:04,033 INFO L125 PetriNetUnfolderBase]: For 979/981 co-relation queries the response was YES. [2023-08-27 03:56:04,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 388 events. 178/388 cut-off events. For 979/981 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1816 event pairs, 39 based on Foata normal form. 3/391 useless extension candidates. Maximal degree in co-relation 1716. Up to 160 conditions per place. [2023-08-27 03:56:04,035 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 41 selfloop transitions, 8 changer transitions 25/75 dead transitions. [2023-08-27 03:56:04,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 652 flow [2023-08-27 03:56:04,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:56:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:56:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 632 transitions. [2023-08-27 03:56:04,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4098573281452659 [2023-08-27 03:56:04,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 632 transitions. [2023-08-27 03:56:04,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 632 transitions. [2023-08-27 03:56:04,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:04,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 632 transitions. [2023-08-27 03:56:04,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.33333333333333) internal successors, (632), 6 states have internal predecessors, (632), 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-27 03:56:04,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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-27 03:56:04,040 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 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-27 03:56:04,040 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 310 flow. Second operand 6 states and 632 transitions. [2023-08-27 03:56:04,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 652 flow [2023-08-27 03:56:04,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 580 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-27 03:56:04,043 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 252 flow [2023-08-27 03:56:04,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-27 03:56:04,043 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-27 03:56:04,043 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 252 flow [2023-08-27 03:56:04,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.25) internal successors, (810), 8 states have internal predecessors, (810), 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-27 03:56:04,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:04,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:04,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:56:04,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-27 03:56:04,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -785801430, now seen corresponding path program 2 times [2023-08-27 03:56:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:04,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394335982] [2023-08-27 03:56:04,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:56:04,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:56:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:56:04,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:56:04,176 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:56:04,176 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (15 of 16 remaining) [2023-08-27 03:56:04,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-08-27 03:56:04,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-08-27 03:56:04,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-08-27 03:56:04,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-08-27 03:56:04,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-08-27 03:56:04,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:56:04,179 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:04,183 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:56:04,183 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:56:04,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:56:04 BasicIcfg [2023-08-27 03:56:04,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:56:04,245 INFO L158 Benchmark]: Toolchain (without parser) took 15716.70ms. Allocated memory was 375.4MB in the beginning and 662.7MB in the end (delta: 287.3MB). Free memory was 350.7MB in the beginning and 316.3MB in the end (delta: 34.3MB). Peak memory consumption was 323.1MB. Max. memory is 16.0GB. [2023-08-27 03:56:04,245 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory was 352.1MB in the beginning and 352.0MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:56:04,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.02ms. Allocated memory is still 375.4MB. Free memory was 350.3MB in the beginning and 325.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:56:04,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 375.4MB. Free memory was 325.9MB in the beginning and 323.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:56:04,245 INFO L158 Benchmark]: Boogie Preprocessor took 38.47ms. Allocated memory is still 375.4MB. Free memory was 323.4MB in the beginning and 320.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:56:04,245 INFO L158 Benchmark]: RCFGBuilder took 697.42ms. Allocated memory is still 375.4MB. Free memory was 320.9MB in the beginning and 308.0MB in the end (delta: 12.9MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. [2023-08-27 03:56:04,245 INFO L158 Benchmark]: TraceAbstraction took 14545.30ms. Allocated memory was 375.4MB in the beginning and 662.7MB in the end (delta: 287.3MB). Free memory was 307.1MB in the beginning and 316.3MB in the end (delta: -9.2MB). Peak memory consumption was 278.8MB. Max. memory is 16.0GB. [2023-08-27 03:56:04,246 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory was 352.1MB in the beginning and 352.0MB in the end (delta: 80.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 382.02ms. Allocated memory is still 375.4MB. Free memory was 350.3MB in the beginning and 325.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 375.4MB. Free memory was 325.9MB in the beginning and 323.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.47ms. Allocated memory is still 375.4MB. Free memory was 323.4MB in the beginning and 320.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 697.42ms. Allocated memory is still 375.4MB. Free memory was 320.9MB in the beginning and 308.0MB in the end (delta: 12.9MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. * TraceAbstraction took 14545.30ms. Allocated memory was 375.4MB in the beginning and 662.7MB in the end (delta: 287.3MB). Free memory was 307.1MB in the beginning and 316.3MB in the end (delta: -9.2MB). Peak memory consumption was 278.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 138 PlacesBefore, 36 PlacesAfterwards, 131 TransitionsBefore, 26 TransitionsAfterwards, 2402 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 123 TotalNumberOfCompositions, 8570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3417, independent: 3121, independent conditional: 0, independent unconditional: 3121, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1339, independent: 1283, independent conditional: 0, independent unconditional: 1283, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3417, independent: 1838, independent conditional: 0, independent unconditional: 1838, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 1339, unknown conditional: 0, unknown unconditional: 1339] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=-1, t2216={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=0, t2216={7:0}, t2217={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=1, t2216={7:0}, t2217={5:0}, t2218={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L799] EXPR 2 __unbuffered_cnt + 1 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] EXPR 3 __unbuffered_cnt + 1 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] EXPR 1 __unbuffered_cnt + 1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={7:0}, t2217={5:0}, t2218={8:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe018_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 163 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1264 IncrementalHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 4 mSDtfsCounter, 1264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=10, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:56:04,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...