/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 -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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:21:59,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:21:59,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:21:59,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:21:59,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:21:59,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:21:59,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:21:59,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:21:59,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:21:59,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:21:59,108 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:21:59,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:21:59,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:21:59,110 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:21:59,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:21:59,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:21:59,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:21:59,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:21:59,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:21:59,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:21:59,111 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:21:59,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:21:59,111 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:21:59,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:21:59,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:21:59,112 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:21:59,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:21:59,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:21:59,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:21:59,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:21:59,113 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:21:59,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:21:59,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:21:59,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:21:59,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:21:59,114 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.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-26 21:21:59,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:21:59,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:21:59,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:21:59,370 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:21:59,371 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:21:59,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 21:22:00,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:22:00,491 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:22:00,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 21:22:00,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e582de80/d8abc906c9964fcbb9593a36cf361e05/FLAG2c5398939 [2023-08-26 21:22:00,510 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e582de80/d8abc906c9964fcbb9593a36cf361e05 [2023-08-26 21:22:00,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:22:00,513 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:22:00,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:22:00,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:22:00,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:22:00,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77fc59ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00, skipping insertion in model container [2023-08-26 21:22:00,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,541 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:22:00,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:22:00,737 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:22:00,749 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:22:00,750 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:22:00,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:22:00,798 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:22:00,798 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:22:00,803 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:22:00,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00 WrapperNode [2023-08-26 21:22:00,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:22:00,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:22:00,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:22:00,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:22:00,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,863 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 145 [2023-08-26 21:22:00,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:22:00,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:22:00,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:22:00,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:22:00,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:22:00,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:22:00,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:22:00,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:22:00,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (1/1) ... [2023-08-26 21:22:00,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:22:00,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:22:00,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:22:00,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:22:00,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:22:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:22:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:22:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:22:00,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:22:00,971 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:22:01,103 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:22:01,106 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:22:01,347 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:22:01,429 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:22:01,430 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:22:01,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:22:01 BoogieIcfgContainer [2023-08-26 21:22:01,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:22:01,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:22:01,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:22:01,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:22:01,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:22:00" (1/3) ... [2023-08-26 21:22:01,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5876150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:22:01, skipping insertion in model container [2023-08-26 21:22:01,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:22:00" (2/3) ... [2023-08-26 21:22:01,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5876150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:22:01, skipping insertion in model container [2023-08-26 21:22:01,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:22:01" (3/3) ... [2023-08-26 21:22:01,436 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 21:22:01,447 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:22:01,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 21:22:01,447 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:22:01,472 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:22:01,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 21:22:01,538 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 21:22:01,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:22:01,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-26 21:22:01,542 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 21:22:01,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-26 21:22:01,547 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:22:01,557 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 21:22:01,561 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 21:22:01,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-26 21:22:01,587 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 21:22:01,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:22:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2023-08-26 21:22:01,589 INFO L119 LiptonReduction]: Number of co-enabled transitions 1644 [2023-08-26 21:22:05,000 INFO L134 LiptonReduction]: Checked pairs total: 5109 [2023-08-26 21:22:05,001 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-26 21:22:05,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:22:05,013 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;@2825cab4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:22:05,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-26 21:22:05,015 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:22:05,016 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-26 21:22:05,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:22:05,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:05,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:22:05,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:05,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash 451358377, now seen corresponding path program 1 times [2023-08-26 21:22:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:05,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075407759] [2023-08-26 21:22:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075407759] [2023-08-26 21:22:05,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075407759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:05,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:22:05,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744645160] [2023-08-26 21:22:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:05,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:22:05,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:05,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:22:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:22:05,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 194 [2023-08-26 21:22:05,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:05,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 194 [2023-08-26 21:22:05,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:05,440 INFO L124 PetriNetUnfolderBase]: 184/399 cut-off events. [2023-08-26 21:22:05,440 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 21:22:05,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 399 events. 184/399 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1934 event pairs, 24 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 725. Up to 261 conditions per place. [2023-08-26 21:22:05,445 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 22 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-26 21:22:05,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 29 transitions, 112 flow [2023-08-26 21:22:05,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:22:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:22:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-26 21:22:05,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46563573883161513 [2023-08-26 21:22:05,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-26 21:22:05,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-26 21:22:05,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:05,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-26 21:22:05,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,471 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 271 transitions. [2023-08-26 21:22:05,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 29 transitions, 112 flow [2023-08-26 21:22:05,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:22:05,474 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2023-08-26 21:22:05,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-08-26 21:22:05,477 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-08-26 21:22:05,477 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2023-08-26 21:22:05,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:05,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:22:05,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:22:05,478 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:05,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1106351911, now seen corresponding path program 1 times [2023-08-26 21:22:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:05,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242142168] [2023-08-26 21:22:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:05,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:05,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:05,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242142168] [2023-08-26 21:22:05,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242142168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:05,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:05,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:22:05,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143570381] [2023-08-26 21:22:05,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:05,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:22:05,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:05,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:22:05,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:22:05,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 194 [2023-08-26 21:22:05,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:05,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 194 [2023-08-26 21:22:05,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:05,636 INFO L124 PetriNetUnfolderBase]: 127/250 cut-off events. [2023-08-26 21:22:05,637 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 21:22:05,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 250 events. 127/250 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 988 event pairs, 56 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 510. Up to 129 conditions per place. [2023-08-26 21:22:05,640 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 27 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-26 21:22:05,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 138 flow [2023-08-26 21:22:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:22:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:22:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-26 21:22:05,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46563573883161513 [2023-08-26 21:22:05,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-26 21:22:05,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-26 21:22:05,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:05,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-26 21:22:05,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,647 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 3 states and 271 transitions. [2023-08-26 21:22:05,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 138 flow [2023-08-26 21:22:05,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:22:05,649 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 71 flow [2023-08-26 21:22:05,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-08-26 21:22:05,650 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-08-26 21:22:05,650 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 71 flow [2023-08-26 21:22:05,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:05,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:05,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:22:05,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:05,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash -36250130, now seen corresponding path program 1 times [2023-08-26 21:22:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:05,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820822944] [2023-08-26 21:22:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:05,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820822944] [2023-08-26 21:22:05,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820822944] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:05,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:22:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510151890] [2023-08-26 21:22:05,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:05,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:22:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:05,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:22:05,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:22:05,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 194 [2023-08-26 21:22:05,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:05,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 194 [2023-08-26 21:22:05,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:05,928 INFO L124 PetriNetUnfolderBase]: 136/274 cut-off events. [2023-08-26 21:22:05,929 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-26 21:22:05,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 274 events. 136/274 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1075 event pairs, 49 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 624. Up to 168 conditions per place. [2023-08-26 21:22:05,930 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 23 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2023-08-26 21:22:05,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 136 flow [2023-08-26 21:22:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:22:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:22:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-08-26 21:22:05,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587628865979381 [2023-08-26 21:22:05,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-08-26 21:22:05,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-08-26 21:22:05,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:05,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-08-26 21:22:05,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,934 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 71 flow. Second operand 3 states and 267 transitions. [2023-08-26 21:22:05,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 136 flow [2023-08-26 21:22:05,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:22:05,935 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 76 flow [2023-08-26 21:22:05,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-26 21:22:05,936 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-26 21:22:05,936 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 76 flow [2023-08-26 21:22:05,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:05,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:05,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:05,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:22:05,940 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:05,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash -477760498, now seen corresponding path program 1 times [2023-08-26 21:22:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:05,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695757296] [2023-08-26 21:22:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695757296] [2023-08-26 21:22:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695757296] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:22:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968111953] [2023-08-26 21:22:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:06,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:22:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:22:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:22:06,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 194 [2023-08-26 21:22:06,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:06,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:06,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 194 [2023-08-26 21:22:06,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:06,423 INFO L124 PetriNetUnfolderBase]: 155/306 cut-off events. [2023-08-26 21:22:06,423 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-26 21:22:06,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 306 events. 155/306 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1185 event pairs, 17 based on Foata normal form. 5/286 useless extension candidates. Maximal degree in co-relation 704. Up to 189 conditions per place. [2023-08-26 21:22:06,425 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 36 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-26 21:22:06,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 212 flow [2023-08-26 21:22:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:22:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:22:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-08-26 21:22:06,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4247422680412371 [2023-08-26 21:22:06,427 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-08-26 21:22:06,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-08-26 21:22:06,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:06,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-08-26 21:22:06,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:06,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:06,429 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:06,429 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 76 flow. Second operand 5 states and 412 transitions. [2023-08-26 21:22:06,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 212 flow [2023-08-26 21:22:06,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:22:06,431 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 114 flow [2023-08-26 21:22:06,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-08-26 21:22:06,431 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2023-08-26 21:22:06,431 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 114 flow [2023-08-26 21:22:06,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.6) internal successors, (378), 5 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:06,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:06,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:06,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:22:06,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:06,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 353149049, now seen corresponding path program 1 times [2023-08-26 21:22:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:06,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851464948] [2023-08-26 21:22:06,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:06,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:06,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851464948] [2023-08-26 21:22:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851464948] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:06,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:06,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:22:06,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998636204] [2023-08-26 21:22:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:06,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:22:06,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:06,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:22:06,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:22:06,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 194 [2023-08-26 21:22:06,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:06,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:06,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 194 [2023-08-26 21:22:06,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:07,026 INFO L124 PetriNetUnfolderBase]: 147/312 cut-off events. [2023-08-26 21:22:07,027 INFO L125 PetriNetUnfolderBase]: For 187/194 co-relation queries the response was YES. [2023-08-26 21:22:07,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 900 conditions, 312 events. 147/312 cut-off events. For 187/194 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1379 event pairs, 40 based on Foata normal form. 26/309 useless extension candidates. Maximal degree in co-relation 885. Up to 193 conditions per place. [2023-08-26 21:22:07,028 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 44 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2023-08-26 21:22:07,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 301 flow [2023-08-26 21:22:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:22:07,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:22:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2023-08-26 21:22:07,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4020618556701031 [2023-08-26 21:22:07,030 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 390 transitions. [2023-08-26 21:22:07,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 390 transitions. [2023-08-26 21:22:07,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:07,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 390 transitions. [2023-08-26 21:22:07,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,032 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,032 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 114 flow. Second operand 5 states and 390 transitions. [2023-08-26 21:22:07,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 301 flow [2023-08-26 21:22:07,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:22:07,034 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 146 flow [2023-08-26 21:22:07,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-26 21:22:07,034 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2023-08-26 21:22:07,034 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 146 flow [2023-08-26 21:22:07,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:07,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:07,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:22:07,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:07,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1431615555, now seen corresponding path program 2 times [2023-08-26 21:22:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724102566] [2023-08-26 21:22:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:07,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:07,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724102566] [2023-08-26 21:22:07,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724102566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:07,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:07,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:22:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660547922] [2023-08-26 21:22:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:07,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:22:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:22:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:22:07,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 194 [2023-08-26 21:22:07,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:07,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 194 [2023-08-26 21:22:07,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:07,224 INFO L124 PetriNetUnfolderBase]: 87/235 cut-off events. [2023-08-26 21:22:07,225 INFO L125 PetriNetUnfolderBase]: For 276/284 co-relation queries the response was YES. [2023-08-26 21:22:07,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 235 events. 87/235 cut-off events. For 276/284 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1126 event pairs, 20 based on Foata normal form. 23/225 useless extension candidates. Maximal degree in co-relation 741. Up to 93 conditions per place. [2023-08-26 21:22:07,226 INFO L140 encePairwiseOnDemand]: 189/194 looper letters, 39 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-26 21:22:07,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 304 flow [2023-08-26 21:22:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:22:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:22:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-08-26 21:22:07,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44716494845360827 [2023-08-26 21:22:07,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-08-26 21:22:07,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-08-26 21:22:07,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:07,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-08-26 21:22:07,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,229 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,229 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 146 flow. Second operand 4 states and 347 transitions. [2023-08-26 21:22:07,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 304 flow [2023-08-26 21:22:07,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:22:07,231 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 169 flow [2023-08-26 21:22:07,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-26 21:22:07,232 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2023-08-26 21:22:07,232 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 169 flow [2023-08-26 21:22:07,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:07,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:07,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:22:07,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:07,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash -84229241, now seen corresponding path program 1 times [2023-08-26 21:22:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:07,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332689890] [2023-08-26 21:22:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332689890] [2023-08-26 21:22:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332689890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:22:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929549966] [2023-08-26 21:22:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:07,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:22:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:07,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:22:07,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:22:07,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 194 [2023-08-26 21:22:07,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:07,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 194 [2023-08-26 21:22:07,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:07,423 INFO L124 PetriNetUnfolderBase]: 52/159 cut-off events. [2023-08-26 21:22:07,423 INFO L125 PetriNetUnfolderBase]: For 337/349 co-relation queries the response was YES. [2023-08-26 21:22:07,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 159 events. 52/159 cut-off events. For 337/349 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 706 event pairs, 22 based on Foata normal form. 12/156 useless extension candidates. Maximal degree in co-relation 554. Up to 64 conditions per place. [2023-08-26 21:22:07,424 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 24 selfloop transitions, 7 changer transitions 1/36 dead transitions. [2023-08-26 21:22:07,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 252 flow [2023-08-26 21:22:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:22:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:22:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 415 transitions. [2023-08-26 21:22:07,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42783505154639173 [2023-08-26 21:22:07,426 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 415 transitions. [2023-08-26 21:22:07,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 415 transitions. [2023-08-26 21:22:07,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:07,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 415 transitions. [2023-08-26 21:22:07,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,428 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 194.0) internal successors, (1164), 6 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,428 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 169 flow. Second operand 5 states and 415 transitions. [2023-08-26 21:22:07,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 252 flow [2023-08-26 21:22:07,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 239 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 21:22:07,430 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 181 flow [2023-08-26 21:22:07,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-08-26 21:22:07,431 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2023-08-26 21:22:07,431 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 181 flow [2023-08-26 21:22:07,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:07,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:07,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:22:07,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:07,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1978177437, now seen corresponding path program 1 times [2023-08-26 21:22:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:07,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649983004] [2023-08-26 21:22:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:22:07,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649983004] [2023-08-26 21:22:07,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649983004] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:07,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:07,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:22:07,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330429485] [2023-08-26 21:22:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:07,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:22:07,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:22:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:22:07,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 194 [2023-08-26 21:22:07,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:07,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 194 [2023-08-26 21:22:07,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:07,521 INFO L124 PetriNetUnfolderBase]: 50/148 cut-off events. [2023-08-26 21:22:07,521 INFO L125 PetriNetUnfolderBase]: For 386/398 co-relation queries the response was YES. [2023-08-26 21:22:07,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 148 events. 50/148 cut-off events. For 386/398 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 647 event pairs, 20 based on Foata normal form. 9/150 useless extension candidates. Maximal degree in co-relation 552. Up to 65 conditions per place. [2023-08-26 21:22:07,522 INFO L140 encePairwiseOnDemand]: 189/194 looper letters, 24 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2023-08-26 21:22:07,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 251 flow [2023-08-26 21:22:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:22:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:22:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 340 transitions. [2023-08-26 21:22:07,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4381443298969072 [2023-08-26 21:22:07,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 340 transitions. [2023-08-26 21:22:07,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 340 transitions. [2023-08-26 21:22:07,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:07,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 340 transitions. [2023-08-26 21:22:07,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,525 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,526 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 181 flow. Second operand 4 states and 340 transitions. [2023-08-26 21:22:07,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 251 flow [2023-08-26 21:22:07,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 237 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 21:22:07,528 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 163 flow [2023-08-26 21:22:07,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-26 21:22:07,529 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2023-08-26 21:22:07,530 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 163 flow [2023-08-26 21:22:07,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:07,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:07,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:22:07,530 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:07,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash -635576401, now seen corresponding path program 1 times [2023-08-26 21:22:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810335880] [2023-08-26 21:22:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:22:07,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-26 21:22:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:22:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810335880] [2023-08-26 21:22:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810335880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:22:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:22:07,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:22:07,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277059099] [2023-08-26 21:22:07,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:22:07,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:22:07,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:22:07,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:22:07,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:22:07,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 194 [2023-08-26 21:22:07,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:07,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:22:07,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 194 [2023-08-26 21:22:07,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:22:08,068 INFO L124 PetriNetUnfolderBase]: 99/225 cut-off events. [2023-08-26 21:22:08,068 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2023-08-26 21:22:08,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 225 events. 99/225 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 893 event pairs, 20 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 854. Up to 122 conditions per place. [2023-08-26 21:22:08,069 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 19 selfloop transitions, 3 changer transitions 31/53 dead transitions. [2023-08-26 21:22:08,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 428 flow [2023-08-26 21:22:08,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:22:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:22:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2023-08-26 21:22:08,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38831615120274915 [2023-08-26 21:22:08,070 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 452 transitions. [2023-08-26 21:22:08,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 452 transitions. [2023-08-26 21:22:08,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:22:08,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 452 transitions. [2023-08-26 21:22:08,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:08,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:08,073 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:08,073 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 163 flow. Second operand 6 states and 452 transitions. [2023-08-26 21:22:08,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 428 flow [2023-08-26 21:22:08,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 403 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 21:22:08,074 INFO L231 Difference]: Finished difference. Result has 46 places, 20 transitions, 117 flow [2023-08-26 21:22:08,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=20} [2023-08-26 21:22:08,075 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2023-08-26 21:22:08,075 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 20 transitions, 117 flow [2023-08-26 21:22:08,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:22:08,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:22:08,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:08,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:22:08,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-26 21:22:08,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:22:08,076 INFO L85 PathProgramCache]: Analyzing trace with hash -263911055, now seen corresponding path program 2 times [2023-08-26 21:22:08,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:22:08,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560261722] [2023-08-26 21:22:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:22:08,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:22:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:22:08,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:22:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:22:08,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:22:08,126 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:22:08,126 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (9 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (2 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-26 21:22:08,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-26 21:22:08,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:22:08,129 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 21:22:08,132 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:22:08,132 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:22:08,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:22:08 BasicIcfg [2023-08-26 21:22:08,159 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:22:08,160 INFO L158 Benchmark]: Toolchain (without parser) took 7647.23ms. Allocated memory was 360.7MB in the beginning and 572.5MB in the end (delta: 211.8MB). Free memory was 335.7MB in the beginning and 242.1MB in the end (delta: 93.6MB). Peak memory consumption was 303.8MB. Max. memory is 16.0GB. [2023-08-26 21:22:08,160 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 360.7MB. Free memory is still 337.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:22:08,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.89ms. Allocated memory is still 360.7MB. Free memory was 335.2MB in the beginning and 312.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:22:08,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.15ms. Allocated memory is still 360.7MB. Free memory was 312.6MB in the beginning and 310.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:22:08,160 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 360.7MB. Free memory was 310.0MB in the beginning and 307.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:22:08,160 INFO L158 Benchmark]: RCFGBuilder took 536.43ms. Allocated memory is still 360.7MB. Free memory was 307.9MB in the beginning and 330.0MB in the end (delta: -22.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-26 21:22:08,161 INFO L158 Benchmark]: TraceAbstraction took 6726.84ms. Allocated memory was 360.7MB in the beginning and 572.5MB in the end (delta: 211.8MB). Free memory was 330.0MB in the beginning and 242.1MB in the end (delta: 87.9MB). Peak memory consumption was 299.6MB. Max. memory is 16.0GB. [2023-08-26 21:22:08,161 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.09ms. Allocated memory is still 360.7MB. Free memory is still 337.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 290.89ms. Allocated memory is still 360.7MB. Free memory was 335.2MB in the beginning and 312.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.15ms. Allocated memory is still 360.7MB. Free memory was 312.6MB in the beginning and 310.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 360.7MB. Free memory was 310.0MB in the beginning and 307.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 536.43ms. Allocated memory is still 360.7MB. Free memory was 307.9MB in the beginning and 330.0MB in the end (delta: -22.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 6726.84ms. Allocated memory was 360.7MB in the beginning and 572.5MB in the end (delta: 211.8MB). Free memory was 330.0MB in the beginning and 242.1MB in the end (delta: 87.9MB). Peak memory consumption was 299.6MB. 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.4s, 101 PlacesBefore, 29 PlacesAfterwards, 97 TransitionsBefore, 22 TransitionsAfterwards, 1644 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 95 TotalNumberOfCompositions, 5109 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2287, independent: 2097, independent conditional: 0, independent unconditional: 2097, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 972, independent: 930, independent conditional: 0, independent unconditional: 930, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2287, independent: 1167, independent conditional: 0, independent unconditional: 1167, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 972, unknown conditional: 0, unknown unconditional: 972] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] EXPR 1 __unbuffered_cnt + 1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L787] EXPR 2 __unbuffered_cnt + 1 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] 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", "rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={53:54}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 753]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 122 locations, 13 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: 6.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 407 IncrementalHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 16 mSDtfsCounter, 407 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:22:08,183 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...