/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/mix033_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:45:24,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:45:24,220 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:45:24,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:45:24,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:45:24,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:45:24,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:45:24,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:45:24,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:45:24,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:45:24,239 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:45:24,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:45:24,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:45:24,240 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:45:24,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:45:24,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:45:24,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:45:24,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:45:24,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:45:24,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:45:24,242 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:45:24,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:45:24,242 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:45:24,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:45:24,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:45:24,243 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:45:24,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:45:24,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:24,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:45:24,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:45:24,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:45:24,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:45:24,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:45:24,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:45:24,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:45:24,246 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:45:24,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:45:24,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:45:24,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:45:24,537 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:45:24,537 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:45:24,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:45:25,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:45:25,814 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:45:25,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:45:25,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91d659df/e37fd210aaff4dd9b4c780db2b15cefc/FLAG6a18ce170 [2023-08-27 03:45:25,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91d659df/e37fd210aaff4dd9b4c780db2b15cefc [2023-08-27 03:45:25,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:45:25,841 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:45:25,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:25,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:45:25,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:45:25,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:25" (1/1) ... [2023-08-27 03:45:25,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4f9211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:25, skipping insertion in model container [2023-08-27 03:45:25,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:25" (1/1) ... [2023-08-27 03:45:25,869 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:45:26,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:26,154 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:45:26,177 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:26,178 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:26,213 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:26,239 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:26,240 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:26,244 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:45:26,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26 WrapperNode [2023-08-27 03:45:26,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:26,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:26,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:45:26,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:45:26,251 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:45:26" (1/1) ... [2023-08-27 03:45:26,278 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:45:26" (1/1) ... [2023-08-27 03:45:26,297 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2023-08-27 03:45:26,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:26,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:45:26,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:45:26,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:45:26,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:45:26,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:45:26,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:45:26,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:45:26,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (1/1) ... [2023-08-27 03:45:26,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:26,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:45:26,367 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:45:26,373 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:45:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:45:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:45:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:45:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:45:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:45:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:45:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:45:26,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:45:26,393 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:45:26,483 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:45:26,484 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:45:26,703 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:45:26,805 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:45:26,805 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:45:26,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:26 BoogieIcfgContainer [2023-08-27 03:45:26,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:45:26,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:45:26,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:45:26,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:45:26,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:45:25" (1/3) ... [2023-08-27 03:45:26,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31be3707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:26, skipping insertion in model container [2023-08-27 03:45:26,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:26" (2/3) ... [2023-08-27 03:45:26,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31be3707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:26, skipping insertion in model container [2023-08-27 03:45:26,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:26" (3/3) ... [2023-08-27 03:45:26,814 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:45:26,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:45:26,827 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:45:26,827 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:45:26,889 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:45:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 267 flow [2023-08-27 03:45:26,977 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-08-27 03:45:26,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:26,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-08-27 03:45:26,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 126 transitions, 267 flow [2023-08-27 03:45:26,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:26,990 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:45:26,995 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:26,997 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:26,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 255 flow [2023-08-27 03:45:27,041 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-08-27 03:45:27,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:27,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-08-27 03:45:27,043 INFO L119 LiptonReduction]: Number of co-enabled transitions 3228 [2023-08-27 03:45:30,085 INFO L134 LiptonReduction]: Checked pairs total: 10678 [2023-08-27 03:45:30,085 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-27 03:45:30,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:45:30,099 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;@7087aac6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:45:30,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:45:30,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:45:30,104 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 03:45:30,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:30,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:30,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:45:30,106 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:30,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash 564477, now seen corresponding path program 1 times [2023-08-27 03:45:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077598620] [2023-08-27 03:45:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:30,396 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:45:30,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:30,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077598620] [2023-08-27 03:45:30,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077598620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:30,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:30,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:30,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691535040] [2023-08-27 03:45:30,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:30,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:30,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:30,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-27 03:45:30,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:45:30,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:30,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-27 03:45:30,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:30,813 INFO L124 PetriNetUnfolderBase]: 2064/3328 cut-off events. [2023-08-27 03:45:30,814 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-27 03:45:30,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6395 conditions, 3328 events. 2064/3328 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19420 event pairs, 597 based on Foata normal form. 0/2653 useless extension candidates. Maximal degree in co-relation 6384. Up to 2549 conditions per place. [2023-08-27 03:45:30,836 INFO L140 encePairwiseOnDemand]: 234/238 looper letters, 40 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-27 03:45:30,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 195 flow [2023-08-27 03:45:30,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-27 03:45:30,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-08-27 03:45:30,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-27 03:45:30,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-27 03:45:30,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:30,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-27 03:45:30,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:30,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:30,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:30,864 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 3 states and 360 transitions. [2023-08-27 03:45:30,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 195 flow [2023-08-27 03:45:30,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:30,869 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 70 flow [2023-08-27 03:45:30,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-27 03:45:30,874 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-27 03:45:30,874 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2023-08-27 03:45:30,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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:45:30,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:30,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:45:30,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:45:30,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:30,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -363110832, now seen corresponding path program 1 times [2023-08-27 03:45:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:30,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500555219] [2023-08-27 03:45:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:30,948 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:45:30,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:30,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500555219] [2023-08-27 03:45:30,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500555219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:30,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:30,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850549637] [2023-08-27 03:45:30,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:30,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:30,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:30,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-08-27 03:45:30,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:45:30,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:30,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-08-27 03:45:30,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:31,165 INFO L124 PetriNetUnfolderBase]: 1615/2462 cut-off events. [2023-08-27 03:45:31,165 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-08-27 03:45:31,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 2462 events. 1615/2462 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12267 event pairs, 559 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 5110. Up to 1741 conditions per place. [2023-08-27 03:45:31,177 INFO L140 encePairwiseOnDemand]: 228/238 looper letters, 42 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-27 03:45:31,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 206 flow [2023-08-27 03:45:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-27 03:45:31,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49719887955182074 [2023-08-27 03:45:31,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-27 03:45:31,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-27 03:45:31,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:31,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-27 03:45:31,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:45:31,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:31,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:31,184 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 355 transitions. [2023-08-27 03:45:31,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 206 flow [2023-08-27 03:45:31,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:31,186 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2023-08-27 03:45:31,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-27 03:45:31,187 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-27 03:45:31,188 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2023-08-27 03:45:31,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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:45:31,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:31,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:31,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:45:31,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:31,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1458931104, now seen corresponding path program 1 times [2023-08-27 03:45:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438288252] [2023-08-27 03:45:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:31,428 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:45:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438288252] [2023-08-27 03:45:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438288252] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:31,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:31,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734661243] [2023-08-27 03:45:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:31,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:31,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 238 [2023-08-27 03:45:31,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:45:31,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:31,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 238 [2023-08-27 03:45:31,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:31,884 INFO L124 PetriNetUnfolderBase]: 3917/6085 cut-off events. [2023-08-27 03:45:31,885 INFO L125 PetriNetUnfolderBase]: For 574/636 co-relation queries the response was YES. [2023-08-27 03:45:31,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14309 conditions, 6085 events. 3917/6085 cut-off events. For 574/636 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 34643 event pairs, 1376 based on Foata normal form. 0/5416 useless extension candidates. Maximal degree in co-relation 14298. Up to 3620 conditions per place. [2023-08-27 03:45:31,911 INFO L140 encePairwiseOnDemand]: 229/238 looper letters, 47 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2023-08-27 03:45:31,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 285 flow [2023-08-27 03:45:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-27 03:45:31,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469187675070028 [2023-08-27 03:45:31,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-27 03:45:31,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-27 03:45:31,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:31,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-27 03:45:31,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:45:31,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:31,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:31,915 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 3 states and 335 transitions. [2023-08-27 03:45:31,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 285 flow [2023-08-27 03:45:31,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:31,918 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 160 flow [2023-08-27 03:45:31,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-27 03:45:31,919 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-27 03:45:31,919 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 160 flow [2023-08-27 03:45:31,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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:45:31,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:31,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:31,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:45:31,923 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:31,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2017776774, now seen corresponding path program 1 times [2023-08-27 03:45:31,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:31,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872078569] [2023-08-27 03:45:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:31,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:32,036 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:45:32,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:32,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872078569] [2023-08-27 03:45:32,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872078569] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:32,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:32,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:32,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901522893] [2023-08-27 03:45:32,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:32,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:32,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-08-27 03:45:32,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:45:32,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:32,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-08-27 03:45:32,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:32,380 INFO L124 PetriNetUnfolderBase]: 3218/5243 cut-off events. [2023-08-27 03:45:32,380 INFO L125 PetriNetUnfolderBase]: For 2581/2607 co-relation queries the response was YES. [2023-08-27 03:45:32,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14086 conditions, 5243 events. 3218/5243 cut-off events. For 2581/2607 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 32130 event pairs, 938 based on Foata normal form. 54/4848 useless extension candidates. Maximal degree in co-relation 14072. Up to 3495 conditions per place. [2023-08-27 03:45:32,402 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 50 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-27 03:45:32,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 338 flow [2023-08-27 03:45:32,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-27 03:45:32,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-27 03:45:32,404 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-27 03:45:32,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-27 03:45:32,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:32,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-27 03:45:32,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:45:32,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:32,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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:45:32,406 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 160 flow. Second operand 3 states and 350 transitions. [2023-08-27 03:45:32,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 338 flow [2023-08-27 03:45:32,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:32,415 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 155 flow [2023-08-27 03:45:32,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-08-27 03:45:32,416 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-27 03:45:32,416 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 155 flow [2023-08-27 03:45:32,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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:45:32,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:32,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:32,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:45:32,417 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:32,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash 53402817, now seen corresponding path program 1 times [2023-08-27 03:45:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665013978] [2023-08-27 03:45:32,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:32,497 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:45:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665013978] [2023-08-27 03:45:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665013978] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:32,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008121011] [2023-08-27 03:45:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:32,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:32,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:32,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 238 [2023-08-27 03:45:32,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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:45:32,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:32,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 238 [2023-08-27 03:45:32,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:32,884 INFO L124 PetriNetUnfolderBase]: 3591/5610 cut-off events. [2023-08-27 03:45:32,885 INFO L125 PetriNetUnfolderBase]: For 2031/2081 co-relation queries the response was YES. [2023-08-27 03:45:32,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15119 conditions, 5610 events. 3591/5610 cut-off events. For 2031/2081 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 31252 event pairs, 924 based on Foata normal form. 44/5208 useless extension candidates. Maximal degree in co-relation 15104. Up to 2474 conditions per place. [2023-08-27 03:45:32,903 INFO L140 encePairwiseOnDemand]: 229/238 looper letters, 63 selfloop transitions, 9 changer transitions 0/75 dead transitions. [2023-08-27 03:45:32,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 423 flow [2023-08-27 03:45:32,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:32,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-27 03:45:32,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46218487394957986 [2023-08-27 03:45:32,905 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-27 03:45:32,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-27 03:45:32,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:32,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-27 03:45:32,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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:45:32,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:45:32,907 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:45:32,907 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 155 flow. Second operand 4 states and 440 transitions. [2023-08-27 03:45:32,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 423 flow [2023-08-27 03:45:32,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:32,910 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 218 flow [2023-08-27 03:45:32,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-27 03:45:32,910 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-27 03:45:32,910 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 218 flow [2023-08-27 03:45:32,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 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:45:32,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:32,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:32,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:45:32,911 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:32,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1390151181, now seen corresponding path program 1 times [2023-08-27 03:45:32,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:32,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127021271] [2023-08-27 03:45:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:32,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:32,948 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:45:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127021271] [2023-08-27 03:45:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127021271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514517808] [2023-08-27 03:45:32,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:32,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:32,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:32,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:32,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-08-27 03:45:32,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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:45:32,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:32,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-08-27 03:45:32,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:33,306 INFO L124 PetriNetUnfolderBase]: 2731/4297 cut-off events. [2023-08-27 03:45:33,306 INFO L125 PetriNetUnfolderBase]: For 4361/4473 co-relation queries the response was YES. [2023-08-27 03:45:33,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12589 conditions, 4297 events. 2731/4297 cut-off events. For 4361/4473 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 24649 event pairs, 831 based on Foata normal form. 22/3866 useless extension candidates. Maximal degree in co-relation 12571. Up to 2609 conditions per place. [2023-08-27 03:45:33,320 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 51 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-27 03:45:33,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 414 flow [2023-08-27 03:45:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-08-27 03:45:33,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726890756302521 [2023-08-27 03:45:33,322 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-08-27 03:45:33,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-08-27 03:45:33,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:33,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-08-27 03:45:33,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:45:33,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:45:33,325 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:45:33,325 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 218 flow. Second operand 4 states and 450 transitions. [2023-08-27 03:45:33,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 414 flow [2023-08-27 03:45:33,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:45:33,328 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 211 flow [2023-08-27 03:45:33,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2023-08-27 03:45:33,328 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-27 03:45:33,329 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 211 flow [2023-08-27 03:45:33,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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:45:33,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:33,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:33,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:45:33,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:33,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1282601472, now seen corresponding path program 1 times [2023-08-27 03:45:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:33,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986559417] [2023-08-27 03:45:33,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:33,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:33,363 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:45:33,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:33,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986559417] [2023-08-27 03:45:33,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986559417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:33,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:33,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:45:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356050645] [2023-08-27 03:45:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:33,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:33,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:33,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:33,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:33,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 238 [2023-08-27 03:45:33,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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:45:33,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:33,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 238 [2023-08-27 03:45:33,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:33,711 INFO L124 PetriNetUnfolderBase]: 2298/3586 cut-off events. [2023-08-27 03:45:33,711 INFO L125 PetriNetUnfolderBase]: For 3972/4082 co-relation queries the response was YES. [2023-08-27 03:45:33,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10949 conditions, 3586 events. 2298/3586 cut-off events. For 3972/4082 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20056 event pairs, 758 based on Foata normal form. 20/3461 useless extension candidates. Maximal degree in co-relation 10930. Up to 1446 conditions per place. [2023-08-27 03:45:33,724 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 70 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2023-08-27 03:45:33,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 557 flow [2023-08-27 03:45:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:45:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:45:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-08-27 03:45:33,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49054621848739494 [2023-08-27 03:45:33,725 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-08-27 03:45:33,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-08-27 03:45:33,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:33,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-08-27 03:45:33,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 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:45:33,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:45:33,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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:45:33,728 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 211 flow. Second operand 4 states and 467 transitions. [2023-08-27 03:45:33,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 557 flow [2023-08-27 03:45:33,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 86 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:33,731 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 250 flow [2023-08-27 03:45:33,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-27 03:45:33,731 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-27 03:45:33,732 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 250 flow [2023-08-27 03:45:33,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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:45:33,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:33,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:33,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:45:33,732 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:33,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:33,733 INFO L85 PathProgramCache]: Analyzing trace with hash -850253820, now seen corresponding path program 1 times [2023-08-27 03:45:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:33,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430429359] [2023-08-27 03:45:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:33,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:33,820 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:45:33,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:33,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430429359] [2023-08-27 03:45:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430429359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:33,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:33,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:45:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144351459] [2023-08-27 03:45:33,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:33,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:45:33,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:33,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:45:33,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:45:33,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2023-08-27 03:45:33,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:33,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:33,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2023-08-27 03:45:33,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:34,068 INFO L124 PetriNetUnfolderBase]: 1488/2529 cut-off events. [2023-08-27 03:45:34,068 INFO L125 PetriNetUnfolderBase]: For 3234/3298 co-relation queries the response was YES. [2023-08-27 03:45:34,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8339 conditions, 2529 events. 1488/2529 cut-off events. For 3234/3298 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14579 event pairs, 260 based on Foata normal form. 249/2675 useless extension candidates. Maximal degree in co-relation 8319. Up to 1490 conditions per place. [2023-08-27 03:45:34,076 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 78 selfloop transitions, 8 changer transitions 3/98 dead transitions. [2023-08-27 03:45:34,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 685 flow [2023-08-27 03:45:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:45:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:45:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2023-08-27 03:45:34,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722689075630252 [2023-08-27 03:45:34,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 562 transitions. [2023-08-27 03:45:34,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 562 transitions. [2023-08-27 03:45:34,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:34,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 562 transitions. [2023-08-27 03:45:34,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 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:45:34,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:45:34,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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:45:34,081 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 250 flow. Second operand 5 states and 562 transitions. [2023-08-27 03:45:34,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 685 flow [2023-08-27 03:45:34,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 659 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:34,085 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 293 flow [2023-08-27 03:45:34,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-08-27 03:45:34,087 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-08-27 03:45:34,087 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 293 flow [2023-08-27 03:45:34,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:34,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:34,087 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:45:34,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:45:34,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:34,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash 975417330, now seen corresponding path program 1 times [2023-08-27 03:45:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:34,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293104671] [2023-08-27 03:45:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:34,234 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:45:34,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:34,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293104671] [2023-08-27 03:45:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293104671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261979249] [2023-08-27 03:45:34,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:34,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:34,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:34,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:34,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2023-08-27 03:45:34,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:34,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:34,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2023-08-27 03:45:34,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:34,500 INFO L124 PetriNetUnfolderBase]: 1034/1839 cut-off events. [2023-08-27 03:45:34,500 INFO L125 PetriNetUnfolderBase]: For 2842/2892 co-relation queries the response was YES. [2023-08-27 03:45:34,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 1839 events. 1034/1839 cut-off events. For 2842/2892 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10576 event pairs, 159 based on Foata normal form. 139/1883 useless extension candidates. Maximal degree in co-relation 6461. Up to 432 conditions per place. [2023-08-27 03:45:34,506 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 96 selfloop transitions, 15 changer transitions 3/123 dead transitions. [2023-08-27 03:45:34,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 123 transitions, 849 flow [2023-08-27 03:45:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2023-08-27 03:45:34,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47118847539015607 [2023-08-27 03:45:34,508 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2023-08-27 03:45:34,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2023-08-27 03:45:34,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:34,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2023-08-27 03:45:34,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 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:45:34,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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:45:34,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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:45:34,512 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 293 flow. Second operand 7 states and 785 transitions. [2023-08-27 03:45:34,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 123 transitions, 849 flow [2023-08-27 03:45:34,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:34,523 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 351 flow [2023-08-27 03:45:34,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-27 03:45:34,523 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-27 03:45:34,523 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 351 flow [2023-08-27 03:45:34,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:34,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:34,524 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:45:34,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:45:34,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:34,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1115000746, now seen corresponding path program 1 times [2023-08-27 03:45:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:34,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111863164] [2023-08-27 03:45:34,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:34,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:34,655 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:45:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111863164] [2023-08-27 03:45:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111863164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:45:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012250984] [2023-08-27 03:45:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:34,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:45:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:45:34,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:45:34,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 238 [2023-08-27 03:45:34,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:34,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:34,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 238 [2023-08-27 03:45:34,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:35,006 INFO L124 PetriNetUnfolderBase]: 1928/3266 cut-off events. [2023-08-27 03:45:35,006 INFO L125 PetriNetUnfolderBase]: For 8822/8822 co-relation queries the response was YES. [2023-08-27 03:45:35,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13293 conditions, 3266 events. 1928/3266 cut-off events. For 8822/8822 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18629 event pairs, 167 based on Foata normal form. 13/3205 useless extension candidates. Maximal degree in co-relation 13267. Up to 1173 conditions per place. [2023-08-27 03:45:35,020 INFO L140 encePairwiseOnDemand]: 228/238 looper letters, 132 selfloop transitions, 21 changer transitions 4/157 dead transitions. [2023-08-27 03:45:35,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 157 transitions, 1401 flow [2023-08-27 03:45:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:45:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:45:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-27 03:45:35,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4530812324929972 [2023-08-27 03:45:35,021 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-27 03:45:35,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-27 03:45:35,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:35,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-27 03:45:35,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 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:45:35,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 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:45:35,026 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 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:45:35,026 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 351 flow. Second operand 6 states and 647 transitions. [2023-08-27 03:45:35,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 157 transitions, 1401 flow [2023-08-27 03:45:35,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 157 transitions, 1288 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-27 03:45:35,043 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 490 flow [2023-08-27 03:45:35,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-08-27 03:45:35,043 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-27 03:45:35,044 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 490 flow [2023-08-27 03:45:35,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:35,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:35,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:45:35,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:45:35,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:35,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1422368798, now seen corresponding path program 2 times [2023-08-27 03:45:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001400909] [2023-08-27 03:45:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:35,243 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:45:35,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:35,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001400909] [2023-08-27 03:45:35,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001400909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:35,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:35,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486339881] [2023-08-27 03:45:35,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:35,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:45:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:45:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:45:35,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2023-08-27 03:45:35,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 490 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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:45:35,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:35,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2023-08-27 03:45:35,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:35,553 INFO L124 PetriNetUnfolderBase]: 1397/2415 cut-off events. [2023-08-27 03:45:35,553 INFO L125 PetriNetUnfolderBase]: For 5620/5656 co-relation queries the response was YES. [2023-08-27 03:45:35,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9439 conditions, 2415 events. 1397/2415 cut-off events. For 5620/5656 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 14634 event pairs, 164 based on Foata normal form. 56/2409 useless extension candidates. Maximal degree in co-relation 9410. Up to 650 conditions per place. [2023-08-27 03:45:35,561 INFO L140 encePairwiseOnDemand]: 229/238 looper letters, 52 selfloop transitions, 14 changer transitions 72/146 dead transitions. [2023-08-27 03:45:35,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 146 transitions, 1239 flow [2023-08-27 03:45:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:45:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:45:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 984 transitions. [2023-08-27 03:45:35,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45938375350140054 [2023-08-27 03:45:35,563 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 984 transitions. [2023-08-27 03:45:35,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 984 transitions. [2023-08-27 03:45:35,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:35,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 984 transitions. [2023-08-27 03:45:35,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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:45:35,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 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:45:35,568 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 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:45:35,568 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 490 flow. Second operand 9 states and 984 transitions. [2023-08-27 03:45:35,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 146 transitions, 1239 flow [2023-08-27 03:45:35,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 146 transitions, 1199 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-27 03:45:35,596 INFO L231 Difference]: Finished difference. Result has 71 places, 41 transitions, 295 flow [2023-08-27 03:45:35,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=295, PETRI_PLACES=71, PETRI_TRANSITIONS=41} [2023-08-27 03:45:35,597 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-27 03:45:35,597 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 41 transitions, 295 flow [2023-08-27 03:45:35,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 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:45:35,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:35,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:35,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:45:35,597 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:35,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:35,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1551284214, now seen corresponding path program 1 times [2023-08-27 03:45:35,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:35,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178440898] [2023-08-27 03:45:35,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:35,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:36,361 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:45:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:36,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178440898] [2023-08-27 03:45:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178440898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225950492] [2023-08-27 03:45:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:36,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:45:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:45:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:45:36,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 238 [2023-08-27 03:45:36,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 41 transitions, 295 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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:45:36,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:36,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 238 [2023-08-27 03:45:36,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:36,687 INFO L124 PetriNetUnfolderBase]: 1004/1976 cut-off events. [2023-08-27 03:45:36,687 INFO L125 PetriNetUnfolderBase]: For 6952/6956 co-relation queries the response was YES. [2023-08-27 03:45:36,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8253 conditions, 1976 events. 1004/1976 cut-off events. For 6952/6956 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13276 event pairs, 171 based on Foata normal form. 2/1943 useless extension candidates. Maximal degree in co-relation 8228. Up to 746 conditions per place. [2023-08-27 03:45:36,696 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 54 selfloop transitions, 6 changer transitions 55/123 dead transitions. [2023-08-27 03:45:36,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 123 transitions, 1129 flow [2023-08-27 03:45:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:45:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:45:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-27 03:45:36,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45028011204481794 [2023-08-27 03:45:36,698 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-27 03:45:36,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-27 03:45:36,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:36,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-27 03:45:36,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 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:45:36,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 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:45:36,701 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 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:45:36,701 INFO L175 Difference]: Start difference. First operand has 71 places, 41 transitions, 295 flow. Second operand 6 states and 643 transitions. [2023-08-27 03:45:36,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 123 transitions, 1129 flow [2023-08-27 03:45:36,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 123 transitions, 913 flow, removed 31 selfloop flow, removed 13 redundant places. [2023-08-27 03:45:36,711 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 265 flow [2023-08-27 03:45:36,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-08-27 03:45:36,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-27 03:45:36,712 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 265 flow [2023-08-27 03:45:36,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 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:45:36,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:36,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:36,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:45:36,713 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:36,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -556674126, now seen corresponding path program 2 times [2023-08-27 03:45:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254114313] [2023-08-27 03:45:36,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:36,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:37,153 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:45:37,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:37,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254114313] [2023-08-27 03:45:37,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254114313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:37,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:45:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064467516] [2023-08-27 03:45:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:37,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:45:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:45:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:45:37,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2023-08-27 03:45:37,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 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:45:37,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:37,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2023-08-27 03:45:37,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:37,451 INFO L124 PetriNetUnfolderBase]: 860/1786 cut-off events. [2023-08-27 03:45:37,452 INFO L125 PetriNetUnfolderBase]: For 3561/3620 co-relation queries the response was YES. [2023-08-27 03:45:37,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7169 conditions, 1786 events. 860/1786 cut-off events. For 3561/3620 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12319 event pairs, 216 based on Foata normal form. 22/1774 useless extension candidates. Maximal degree in co-relation 7150. Up to 770 conditions per place. [2023-08-27 03:45:37,457 INFO L140 encePairwiseOnDemand]: 230/238 looper letters, 43 selfloop transitions, 7 changer transitions 49/107 dead transitions. [2023-08-27 03:45:37,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 107 transitions, 831 flow [2023-08-27 03:45:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:45:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:45:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2023-08-27 03:45:37,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45138055222088835 [2023-08-27 03:45:37,460 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2023-08-27 03:45:37,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2023-08-27 03:45:37,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:37,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2023-08-27 03:45:37,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 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:45:37,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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:45:37,463 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 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:45:37,463 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 265 flow. Second operand 7 states and 752 transitions. [2023-08-27 03:45:37,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 107 transitions, 831 flow [2023-08-27 03:45:37,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 107 transitions, 823 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 03:45:37,472 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 292 flow [2023-08-27 03:45:37,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2023-08-27 03:45:37,473 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-08-27 03:45:37,473 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 292 flow [2023-08-27 03:45:37,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 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:45:37,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:37,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:37,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:45:37,474 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:45:37,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash -240317942, now seen corresponding path program 3 times [2023-08-27 03:45:37,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:37,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849908394] [2023-08-27 03:45:37,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:37,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:45:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:45:37,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:45:37,591 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:45:37,592 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:45:37,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-27 03:45:37,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:45:37,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 03:45:37,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:45:37,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:45:37,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:45:37,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:45:37,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:45:37,597 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:45:37,602 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:45:37,602 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:45:37,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:45:37 BasicIcfg [2023-08-27 03:45:37,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:45:37,670 INFO L158 Benchmark]: Toolchain (without parser) took 11829.84ms. Allocated memory was 434.1MB in the beginning and 916.5MB in the end (delta: 482.3MB). Free memory was 407.9MB in the beginning and 439.9MB in the end (delta: -32.0MB). Peak memory consumption was 451.0MB. Max. memory is 16.0GB. [2023-08-27 03:45:37,671 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 434.1MB. Free memory is still 411.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:45:37,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.20ms. Allocated memory is still 434.1MB. Free memory was 407.9MB in the beginning and 384.5MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:37,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.06ms. Allocated memory is still 434.1MB. Free memory was 384.5MB in the beginning and 381.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:45:37,671 INFO L158 Benchmark]: Boogie Preprocessor took 36.68ms. Allocated memory is still 434.1MB. Free memory was 381.6MB in the beginning and 379.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:45:37,671 INFO L158 Benchmark]: RCFGBuilder took 472.61ms. Allocated memory is still 434.1MB. Free memory was 379.5MB in the beginning and 341.1MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-27 03:45:37,672 INFO L158 Benchmark]: TraceAbstraction took 10861.05ms. Allocated memory was 434.1MB in the beginning and 916.5MB in the end (delta: 482.3MB). Free memory was 340.4MB in the beginning and 439.9MB in the end (delta: -99.4MB). Peak memory consumption was 383.9MB. Max. memory is 16.0GB. [2023-08-27 03:45:37,672 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.11ms. Allocated memory is still 434.1MB. Free memory is still 411.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 404.20ms. Allocated memory is still 434.1MB. Free memory was 407.9MB in the beginning and 384.5MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.06ms. Allocated memory is still 434.1MB. Free memory was 384.5MB in the beginning and 381.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.68ms. Allocated memory is still 434.1MB. Free memory was 381.6MB in the beginning and 379.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 472.61ms. Allocated memory is still 434.1MB. Free memory was 379.5MB in the beginning and 341.1MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 10861.05ms. Allocated memory was 434.1MB in the beginning and 916.5MB in the end (delta: 482.3MB). Free memory was 340.4MB in the beginning and 439.9MB in the end (delta: -99.4MB). Peak memory consumption was 383.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 130 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 3228 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 10678 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4256, independent: 3986, independent conditional: 0, independent unconditional: 3986, dependent: 270, dependent conditional: 0, dependent unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1887, independent: 1829, independent conditional: 0, independent unconditional: 1829, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4256, independent: 2157, independent conditional: 0, independent unconditional: 2157, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 1887, unknown conditional: 0, unknown unconditional: 1887] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t873; [L854] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t873, ((void *)0), P0, ((void *)0))=-2, t873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t874; [L856] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t874, ((void *)0), P1, ((void *)0))=-1, t873={5:0}, t874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t875; [L858] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t875, ((void *)0), P2, ((void *)0))=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L799] EXPR 2 __unbuffered_cnt + 1 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L773] EXPR 1 __unbuffered_cnt + 1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L838] EXPR 3 __unbuffered_cnt + 1 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t873={5:0}, t874={6:0}, t875={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 773]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 773]: 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: 838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 162 locations, 18 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: 10.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1359 IncrementalHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 21 mSDtfsCounter, 1359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=10, InterpolantAutomatonStates: 64, 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.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 1364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:45:37,709 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...