/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_21-deref_read_racing_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:49:49,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:49:49,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:49:49,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:49:49,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:49:49,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:49:49,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:49:49,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:49:49,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:49:49,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:49:49,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:49:49,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:49:49,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:49:49,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:49:49,185 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:49:49,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:49:49,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:49:49,189 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:49:49,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:49:49,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:49:49,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:49:49,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:49:49,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:49:49,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:49:49,192 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:49:49,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:49:49,193 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:49:49,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:49:49,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:49:49,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:49:49,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:49:49,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:49:49,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:49:49,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:49:49,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:49:49,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:49:49,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:49:49,195 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:49:49,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:49:49,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:49:49,196 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:49:49,196 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 03:49:49,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:49:49,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:49:49,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:49:49,419 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:49:49,421 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:49:49,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_21-deref_read_racing_bound2.i [2023-08-04 03:49:50,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:49:50,879 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:49:50,880 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_21-deref_read_racing_bound2.i [2023-08-04 03:49:50,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335665dd4/2a13169fd14743889707e050c7b36b45/FLAGe9a90418e [2023-08-04 03:49:50,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/335665dd4/2a13169fd14743889707e050c7b36b45 [2023-08-04 03:49:50,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:49:50,918 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:49:50,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:49:50,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:49:50,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:49:50,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:49:50" (1/1) ... [2023-08-04 03:49:50,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad0f8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:50, skipping insertion in model container [2023-08-04 03:49:50,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:49:50" (1/1) ... [2023-08-04 03:49:50,980 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:49:51,277 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_21-deref_read_racing_bound2.i[30176,30189] [2023-08-04 03:49:51,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:49:51,319 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:49:51,349 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:49:51,351 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-04 03:49:51,361 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_21-deref_read_racing_bound2.i[30176,30189] [2023-08-04 03:49:51,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:49:51,396 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:49:51,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51 WrapperNode [2023-08-04 03:49:51,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:49:51,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:49:51,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:49:51,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:49:51,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,444 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-08-04 03:49:51,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:49:51,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:49:51,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:49:51,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:49:51,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:49:51,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:49:51,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:49:51,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:49:51,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (1/1) ... [2023-08-04 03:49:51,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:49:51,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:49:51,502 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-04 03:49:51,504 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-04 03:49:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:49:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:49:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 03:49:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:49:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:49:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 03:49:51,554 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 03:49:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:49:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:49:51,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:49:51,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:49:51,558 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 03:49:51,666 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:49:51,668 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:49:51,808 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:49:51,816 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:49:51,817 INFO L302 CfgBuilder]: Removed 9 assume(true) statements. [2023-08-04 03:49:51,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:49:51 BoogieIcfgContainer [2023-08-04 03:49:51,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:49:51,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:49:51,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:49:51,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:49:51,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:49:50" (1/3) ... [2023-08-04 03:49:51,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c17113f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:49:51, skipping insertion in model container [2023-08-04 03:49:51,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:51" (2/3) ... [2023-08-04 03:49:51,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c17113f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:49:51, skipping insertion in model container [2023-08-04 03:49:51,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:49:51" (3/3) ... [2023-08-04 03:49:51,826 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_21-deref_read_racing_bound2.i [2023-08-04 03:49:51,835 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:49:51,841 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:49:51,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 03:49:51,842 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:49:51,910 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 03:49:51,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:51,992 INFO L124 PetriNetUnfolderBase]: 14/125 cut-off events. [2023-08-04 03:49:51,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:51,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 14/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 265 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-04 03:49:51,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:52,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:52,007 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:49:52,014 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:52,028 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:52,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:52,055 INFO L124 PetriNetUnfolderBase]: 14/125 cut-off events. [2023-08-04 03:49:52,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:52,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 14/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 265 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-04 03:49:52,058 INFO L119 LiptonReduction]: Number of co-enabled transitions 2176 [2023-08-04 03:49:54,573 INFO L134 LiptonReduction]: Checked pairs total: 3921 [2023-08-04 03:49:54,573 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-04 03:49:54,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:49:54,590 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=true, 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;@3c4efcd6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:49:54,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:49:54,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:49:54,594 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-04 03:49:54,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:54,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:54,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 03:49:54,595 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:54,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 11721076, now seen corresponding path program 1 times [2023-08-04 03:49:54,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724503106] [2023-08-04 03:49:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:54,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:54,818 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-04 03:49:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:49:54,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724503106] [2023-08-04 03:49:54,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724503106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:49:54,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:49:54,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:49:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960293364] [2023-08-04 03:49:54,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:49:54,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:49:54,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:49:54,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:49:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:49:54,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 179 [2023-08-04 03:49:54,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 29 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:54,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:49:54,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 179 [2023-08-04 03:49:54,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:49:54,958 INFO L124 PetriNetUnfolderBase]: 63/156 cut-off events. [2023-08-04 03:49:54,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:54,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 156 events. 63/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 476 event pairs, 48 based on Foata normal form. 16/152 useless extension candidates. Maximal degree in co-relation 293. Up to 134 conditions per place. [2023-08-04 03:49:54,962 INFO L140 encePairwiseOnDemand]: 168/179 looper letters, 23 selfloop transitions, 2 changer transitions 4/31 dead transitions. [2023-08-04 03:49:54,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 31 transitions, 123 flow [2023-08-04 03:49:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:49:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:49:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-04 03:49:54,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325884543761639 [2023-08-04 03:49:54,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-04 03:49:54,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-04 03:49:54,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:49:54,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-04 03:49:54,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:54,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,003 INFO L175 Difference]: Start difference. First operand has 24 places, 29 transitions, 63 flow. Second operand 3 states and 286 transitions. [2023-08-04 03:49:55,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 31 transitions, 123 flow [2023-08-04 03:49:55,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 123 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:49:55,008 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 47 flow [2023-08-04 03:49:55,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=24, 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=47, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-04 03:49:55,014 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-08-04 03:49:55,014 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 47 flow [2023-08-04 03:49:55,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:55,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:49:55,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:49:55,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:55,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1643081957, now seen corresponding path program 1 times [2023-08-04 03:49:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:55,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093998535] [2023-08-04 03:49:55,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:49:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:49:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093998535] [2023-08-04 03:49:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093998535] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:49:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270212200] [2023-08-04 03:49:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:55,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:49:55,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:49:55,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:49:55,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 03:49:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:55,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:49:55,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:49:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:49:55,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:49:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:49:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270212200] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:49:55,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:49:55,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:49:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115852735] [2023-08-04 03:49:55,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:49:55,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:49:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:49:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:49:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:49:55,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 179 [2023-08-04 03:49:55,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 47 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:49:55,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 179 [2023-08-04 03:49:55,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:49:55,333 INFO L124 PetriNetUnfolderBase]: 18/54 cut-off events. [2023-08-04 03:49:55,333 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-04 03:49:55,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 54 events. 18/54 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 8 based on Foata normal form. 10/64 useless extension candidates. Maximal degree in co-relation 118. Up to 38 conditions per place. [2023-08-04 03:49:55,334 INFO L140 encePairwiseOnDemand]: 176/179 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2023-08-04 03:49:55,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 25 transitions, 105 flow [2023-08-04 03:49:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:49:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:49:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2023-08-04 03:49:55,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48044692737430167 [2023-08-04 03:49:55,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 344 transitions. [2023-08-04 03:49:55,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 344 transitions. [2023-08-04 03:49:55,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:49:55,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 344 transitions. [2023-08-04 03:49:55,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,353 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,353 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 47 flow. Second operand 4 states and 344 transitions. [2023-08-04 03:49:55,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 25 transitions, 105 flow [2023-08-04 03:49:55,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 25 transitions, 99 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 03:49:55,354 INFO L231 Difference]: Finished difference. Result has 21 places, 0 transitions, 0 flow [2023-08-04 03:49:55,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=21, PETRI_TRANSITIONS=0} [2023-08-04 03:49:55,355 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -3 predicate places. [2023-08-04 03:49:55,355 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 0 transitions, 0 flow [2023-08-04 03:49:55,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:49:55,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 03:49:55,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 03:49:55,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:49:55,568 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 03:49:55,570 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 03:49:55,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:55,585 INFO L124 PetriNetUnfolderBase]: 14/125 cut-off events. [2023-08-04 03:49:55,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:55,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 14/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 265 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-04 03:49:55,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:55,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:55,587 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:49:55,587 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:55,587 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:55,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 199 flow [2023-08-04 03:49:55,598 INFO L124 PetriNetUnfolderBase]: 14/125 cut-off events. [2023-08-04 03:49:55,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:55,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 125 events. 14/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 265 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 65. Up to 4 conditions per place. [2023-08-04 03:49:55,600 INFO L119 LiptonReduction]: Number of co-enabled transitions 2176 [2023-08-04 03:49:58,079 INFO L134 LiptonReduction]: Checked pairs total: 3901 [2023-08-04 03:49:58,080 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-04 03:49:58,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:49:58,082 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=true, 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;@3c4efcd6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:49:58,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:49:58,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:49:58,085 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2023-08-04 03:49:58,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:58,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:58,085 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 03:49:58,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:49:58,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash 810137424, now seen corresponding path program 1 times [2023-08-04 03:49:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264620510] [2023-08-04 03:49:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:49:58,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:49:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:49:58,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:49:58,151 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:49:58,152 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 03:49:58,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 03:49:58,152 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 03:49:58,153 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 03:49:58,153 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:49:58,154 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:49:58,175 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 03:49:58,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 130 transitions, 272 flow [2023-08-04 03:49:58,206 INFO L124 PetriNetUnfolderBase]: 24/191 cut-off events. [2023-08-04 03:49:58,206 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 03:49:58,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 24/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 501 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 126. Up to 6 conditions per place. [2023-08-04 03:49:58,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 130 transitions, 272 flow [2023-08-04 03:49:58,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 130 transitions, 272 flow [2023-08-04 03:49:58,212 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:49:58,212 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 130 transitions, 272 flow [2023-08-04 03:49:58,212 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 130 transitions, 272 flow [2023-08-04 03:49:58,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 130 transitions, 272 flow [2023-08-04 03:49:58,229 INFO L124 PetriNetUnfolderBase]: 24/191 cut-off events. [2023-08-04 03:49:58,230 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 03:49:58,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 24/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 501 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 126. Up to 6 conditions per place. [2023-08-04 03:49:58,235 INFO L119 LiptonReduction]: Number of co-enabled transitions 6464 [2023-08-04 03:50:00,575 INFO L134 LiptonReduction]: Checked pairs total: 13025 [2023-08-04 03:50:00,575 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-04 03:50:00,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:50:00,585 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=true, 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;@3c4efcd6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:50:00,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:50:00,587 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:50:00,587 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-04 03:50:00,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:50:00,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:50:00,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 03:50:00,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:50:00,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:50:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash 22365766, now seen corresponding path program 1 times [2023-08-04 03:50:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:50:00,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531579649] [2023-08-04 03:50:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:50:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:50:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:50:00,643 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-04 03:50:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:50:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531579649] [2023-08-04 03:50:00,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531579649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:50:00,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:50:00,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:50:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197179543] [2023-08-04 03:50:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:50:00,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:50:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:50:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:50:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:50:00,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 231 [2023-08-04 03:50:00,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:00,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:50:00,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 231 [2023-08-04 03:50:00,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:50:00,862 INFO L124 PetriNetUnfolderBase]: 1271/2276 cut-off events. [2023-08-04 03:50:00,862 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 03:50:00,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4405 conditions, 2276 events. 1271/2276 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12832 event pairs, 560 based on Foata normal form. 320/2356 useless extension candidates. Maximal degree in co-relation 419. Up to 2062 conditions per place. [2023-08-04 03:50:00,871 INFO L140 encePairwiseOnDemand]: 214/231 looper letters, 34 selfloop transitions, 2 changer transitions 3/45 dead transitions. [2023-08-04 03:50:00,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 178 flow [2023-08-04 03:50:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:50:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:50:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-04 03:50:00,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483405483405484 [2023-08-04 03:50:00,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-04 03:50:00,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-04 03:50:00,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:50:00,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-04 03:50:00,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:00,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:00,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:00,883 INFO L175 Difference]: Start difference. First operand has 39 places, 48 transitions, 108 flow. Second operand 3 states and 380 transitions. [2023-08-04 03:50:00,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 178 flow [2023-08-04 03:50:00,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 176 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 03:50:00,886 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 82 flow [2023-08-04 03:50:00,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-04 03:50:00,888 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-04 03:50:00,888 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 82 flow [2023-08-04 03:50:00,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:00,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:50:00,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:50:00,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 03:50:00,890 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:50:00,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:50:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1441717168, now seen corresponding path program 1 times [2023-08-04 03:50:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:50:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564943324] [2023-08-04 03:50:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:50:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:50:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:50:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:50:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:50:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564943324] [2023-08-04 03:50:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564943324] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:50:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400613916] [2023-08-04 03:50:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:50:00,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:50:00,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:50:00,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:50:00,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 03:50:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:50:01,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:50:01,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:50:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:50:01,054 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:50:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:50:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400613916] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:50:01,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:50:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 03:50:01,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006781615] [2023-08-04 03:50:01,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:50:01,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:50:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:50:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:50:01,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 03:50:01,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-04 03:50:01,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:01,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:50:01,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-04 03:50:01,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:50:01,241 INFO L124 PetriNetUnfolderBase]: 904/1508 cut-off events. [2023-08-04 03:50:01,241 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-04 03:50:01,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 1508 events. 904/1508 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7669 event pairs, 232 based on Foata normal form. 10/1514 useless extension candidates. Maximal degree in co-relation 2819. Up to 1005 conditions per place. [2023-08-04 03:50:01,249 INFO L140 encePairwiseOnDemand]: 227/231 looper letters, 50 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2023-08-04 03:50:01,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 246 flow [2023-08-04 03:50:01,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:50:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:50:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 03:50:01,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183982683982684 [2023-08-04 03:50:01,251 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 03:50:01,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 03:50:01,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:50:01,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 03:50:01,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:01,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:01,255 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:01,256 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 82 flow. Second operand 4 states and 479 transitions. [2023-08-04 03:50:01,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 246 flow [2023-08-04 03:50:01,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:50:01,258 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2023-08-04 03:50:01,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-04 03:50:01,258 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-04 03:50:01,259 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2023-08-04 03:50:01,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:01,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:50:01,259 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 03:50:01,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 03:50:01,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:50:01,464 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:50:01,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:50:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash -247429959, now seen corresponding path program 1 times [2023-08-04 03:50:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:50:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903291811] [2023-08-04 03:50:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:50:01,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:50:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:50:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:50:01,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:50:01,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903291811] [2023-08-04 03:50:01,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903291811] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:50:01,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197209306] [2023-08-04 03:50:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:50:01,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:50:01,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:50:01,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:50:01,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 03:50:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:50:01,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-04 03:50:01,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:50:01,800 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 03:50:01,801 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 03:50:01,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 03:50:01,888 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 03:50:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:50:01,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:50:01,972 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_56 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_56) c_~p~0.base) c_~p~0.offset) 0)) is different from false [2023-08-04 03:50:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-08-04 03:50:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197209306] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:50:01,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:50:01,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-04 03:50:01,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948673561] [2023-08-04 03:50:01,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:50:01,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-04 03:50:01,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:50:01,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-04 03:50:01,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=38, Unknown=1, NotChecked=12, Total=72 [2023-08-04 03:50:02,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 231 [2023-08-04 03:50:02,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 9 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:50:02,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 231 [2023-08-04 03:50:02,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:50:02,244 INFO L124 PetriNetUnfolderBase]: 804/1387 cut-off events. [2023-08-04 03:50:02,244 INFO L125 PetriNetUnfolderBase]: For 988/988 co-relation queries the response was YES. [2023-08-04 03:50:02,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 1387 events. 804/1387 cut-off events. For 988/988 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6704 event pairs, 422 based on Foata normal form. 12/1398 useless extension candidates. Maximal degree in co-relation 2478. Up to 1203 conditions per place. [2023-08-04 03:50:02,254 INFO L140 encePairwiseOnDemand]: 226/231 looper letters, 41 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2023-08-04 03:50:02,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 250 flow [2023-08-04 03:50:02,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:50:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:50:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2023-08-04 03:50:02,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4004329004329004 [2023-08-04 03:50:02,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 370 transitions. [2023-08-04 03:50:02,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 370 transitions. [2023-08-04 03:50:02,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:50:02,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 370 transitions. [2023-08-04 03:50:02,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,261 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 4 states and 370 transitions. [2023-08-04 03:50:02,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 250 flow [2023-08-04 03:50:02,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 238 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 03:50:02,264 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 128 flow [2023-08-04 03:50:02,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-04 03:50:02,266 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2023-08-04 03:50:02,268 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 128 flow [2023-08-04 03:50:02,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:50:02,268 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:50:02,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 03:50:02,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:50:02,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:50:02,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:50:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1454634080, now seen corresponding path program 1 times [2023-08-04 03:50:02,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:50:02,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513456583] [2023-08-04 03:50:02,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:50:02,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:50:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:50:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:50:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:50:02,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513456583] [2023-08-04 03:50:02,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513456583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:50:02,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:50:02,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 03:50:02,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276149811] [2023-08-04 03:50:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:50:02,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:50:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:50:02,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:50:02,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:50:02,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 231 [2023-08-04 03:50:02,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:50:02,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 231 [2023-08-04 03:50:02,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:50:02,692 INFO L124 PetriNetUnfolderBase]: 389/809 cut-off events. [2023-08-04 03:50:02,693 INFO L125 PetriNetUnfolderBase]: For 915/915 co-relation queries the response was YES. [2023-08-04 03:50:02,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 809 events. 389/809 cut-off events. For 915/915 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3943 event pairs, 153 based on Foata normal form. 157/966 useless extension candidates. Maximal degree in co-relation 1705. Up to 450 conditions per place. [2023-08-04 03:50:02,698 INFO L140 encePairwiseOnDemand]: 220/231 looper letters, 44 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2023-08-04 03:50:02,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 315 flow [2023-08-04 03:50:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:50:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:50:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-04 03:50:02,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49927849927849927 [2023-08-04 03:50:02,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-04 03:50:02,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-04 03:50:02,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:50:02,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-04 03:50:02,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,704 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 128 flow. Second operand 3 states and 346 transitions. [2023-08-04 03:50:02,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 315 flow [2023-08-04 03:50:02,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 315 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:50:02,708 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 185 flow [2023-08-04 03:50:02,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-08-04 03:50:02,709 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-04 03:50:02,709 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 185 flow [2023-08-04 03:50:02,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:50:02,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:50:02,710 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:50:02,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 03:50:02,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:50:02,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:50:02,710 INFO L85 PathProgramCache]: Analyzing trace with hash 684536979, now seen corresponding path program 1 times [2023-08-04 03:50:02,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:50:02,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878065453] [2023-08-04 03:50:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:50:02,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:50:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:50:02,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:50:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:50:02,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:50:02,746 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:50:02,746 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 03:50:02,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 03:50:02,746 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 03:50:02,747 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 03:50:02,749 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 03:50:02,750 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 03:50:02,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 03:50:02 BasicIcfg [2023-08-04 03:50:02,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 03:50:02,809 INFO L158 Benchmark]: Toolchain (without parser) took 11891.53ms. Allocated memory was 385.9MB in the beginning and 673.2MB in the end (delta: 287.3MB). Free memory was 325.8MB in the beginning and 494.8MB in the end (delta: -169.0MB). Peak memory consumption was 120.5MB. Max. memory is 16.0GB. [2023-08-04 03:50:02,810 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 385.9MB. Free memory is still 335.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 03:50:02,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.19ms. Allocated memory is still 385.9MB. Free memory was 325.5MB in the beginning and 306.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 03:50:02,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.68ms. Allocated memory is still 385.9MB. Free memory was 305.8MB in the beginning and 304.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 03:50:02,810 INFO L158 Benchmark]: Boogie Preprocessor took 22.90ms. Allocated memory is still 385.9MB. Free memory was 304.0MB in the beginning and 302.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 03:50:02,810 INFO L158 Benchmark]: RCFGBuilder took 350.60ms. Allocated memory was 385.9MB in the beginning and 559.9MB in the end (delta: 174.1MB). Free memory was 302.2MB in the beginning and 515.7MB in the end (delta: -213.6MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. [2023-08-04 03:50:02,811 INFO L158 Benchmark]: TraceAbstraction took 10987.73ms. Allocated memory was 559.9MB in the beginning and 673.2MB in the end (delta: 113.2MB). Free memory was 515.2MB in the beginning and 494.8MB in the end (delta: 20.3MB). Peak memory consumption was 134.6MB. Max. memory is 16.0GB. [2023-08-04 03:50:02,812 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.12ms. Allocated memory is still 385.9MB. Free memory is still 335.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 478.19ms. Allocated memory is still 385.9MB. Free memory was 325.5MB in the beginning and 306.1MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 46.68ms. Allocated memory is still 385.9MB. Free memory was 305.8MB in the beginning and 304.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 22.90ms. Allocated memory is still 385.9MB. Free memory was 304.0MB in the beginning and 302.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 350.60ms. Allocated memory was 385.9MB in the beginning and 559.9MB in the end (delta: 174.1MB). Free memory was 302.2MB in the beginning and 515.7MB in the end (delta: -213.6MB). Peak memory consumption was 11.1MB. Max. memory is 16.0GB. * TraceAbstraction took 10987.73ms. Allocated memory was 559.9MB in the beginning and 673.2MB in the end (delta: 113.2MB). Free memory was 515.2MB in the beginning and 494.8MB in the end (delta: 20.3MB). Peak memory consumption was 134.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 90 PlacesBefore, 24 PlacesAfterwards, 97 TransitionsBefore, 29 TransitionsAfterwards, 2176 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 3921 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2120, independent: 1970, independent conditional: 0, independent unconditional: 1970, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1215, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2120, independent: 791, independent conditional: 0, independent unconditional: 791, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 1215, unknown conditional: 0, unknown unconditional: 1215] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 90 PlacesBefore, 24 PlacesAfterwards, 97 TransitionsBefore, 29 TransitionsAfterwards, 2176 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 3901 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2149, independent: 1999, independent conditional: 0, independent unconditional: 1999, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1200, independent: 1166, independent conditional: 0, independent unconditional: 1166, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2149, independent: 833, independent conditional: 0, independent unconditional: 833, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 1200, unknown conditional: 0, unknown unconditional: 1200] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 119 PlacesBefore, 39 PlacesAfterwards, 130 TransitionsBefore, 48 TransitionsAfterwards, 6464 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 13025 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5427, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3233, independent: 3179, independent conditional: 0, independent unconditional: 3179, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5427, independent: 1999, independent conditional: 0, independent unconditional: 1999, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 3233, unknown conditional: 0, unknown unconditional: 3233] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 691]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L696] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L697] 0 int data = 0; [L698] 0 int *p = &data, *q; [L699] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L707] 0 pthread_t t_ids[2]; [L707] 0 int i=0; VAL [__global_lock={3:0}, data={4:0}, i=0, mutex={5:0}, p={4:0}, q={0:0}, t_ids={6:0}] [L707] COND TRUE 0 i<2 [L707] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, arg={0:0}, data={4:0}, i=0, mutex={5:0}, p={4:0}, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, q={0:0}, t_ids={6:0}] [L707] 0 i++ VAL [__global_lock={3:0}, arg={0:0}, data={4:0}, i=1, mutex={5:0}, p={4:0}, q={0:0}, t_ids={6:0}] [L707] COND TRUE 0 i<2 [L707] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, arg={0:0}, arg={0:0}, data={4:0}, i=1, mutex={5:0}, p={4:0}, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=0, q={0:0}, t_ids={6:0}] [L707] 0 i++ VAL [__global_lock={3:0}, arg={0:0}, arg={0:0}, data={4:0}, i=2, mutex={5:0}, p={4:0}, q={0:0}, t_ids={6:0}] [L702] EXPR 1 \read(*p) VAL [\read(*p)=0, __global_lock={3:0}, arg={0:0}, arg={0:0}, data={4:0}, mutex={5:0}, p={4:0}, q={0:0}] [L702] 1 (*p)++ [L707] COND FALSE 0 !(i<2) [L708] 0 q = p VAL [(*p)++=0, __global_lock={3:0}, arg={0:0}, arg={0:0}, data={4:0}, i=2, mutex={5:0}, p={4:0}, q={4:0}, t_ids={6:0}] [L709] EXPR 0 \read(*q) [L709] CALL 0 __VERIFIER_assert((*q) == 0) [L691] COND TRUE 0 !(cond) [L691] 0 reach_error() VAL [\old(cond)=0, __global_lock={3:0}, arg={0:0}, arg={0:0}, cond=0, data={4:0}, mutex={5:0}, p={4:0}, q={4:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 locations, 2 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: 3.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 7, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 142 locations, 2 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: 4.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 64 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 9 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 0.6s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 73 ConstructedInterpolants, 5 QuantifiedInterpolants, 487 SizeOfPredicates, 5 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 9/27 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 115 locations, 2 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: 2.6s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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-04 03:50:02,842 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...