/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_19-callback_racing_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:49:33,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:49:33,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:49:33,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:49:33,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:49:33,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:49:33,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:49:33,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:49:33,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:49:33,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:49:33,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:49:33,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:49:33,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:49:33,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:49:33,339 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:49:33,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:49:33,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:49:33,340 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:49:33,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:49:33,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:49:33,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:49:33,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:49:33,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:49:33,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:49:33,342 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:49:33,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:49:33,342 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:49:33,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:49:33,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:49:33,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:49:33,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:49:33,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:49:33,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:49:33,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:49:33,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:49:33,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:49:33,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:49:33,345 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:49:33,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:49:33,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:49:33,345 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:49:33,346 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:33,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:49:33,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:49:33,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:49:33,616 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:49:33,617 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:49:33,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_19-callback_racing_bound2.i [2023-08-04 03:49:34,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:49:34,998 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:49:34,999 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/goblint-regression_28-race_reach_19-callback_racing_bound2.i [2023-08-04 03:49:35,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6eb8435/c02736d5b9e341ba812c1fee362f77f4/FLAG2716d47b0 [2023-08-04 03:49:35,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6eb8435/c02736d5b9e341ba812c1fee362f77f4 [2023-08-04 03:49:35,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:49:35,037 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:49:35,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:49:35,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:49:35,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:49:35,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:49:35" (1/1) ... [2023-08-04 03:49:35,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4e84e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:35, skipping insertion in model container [2023-08-04 03:49:35,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:49:35" (1/1) ... [2023-08-04 03:49:35,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:49:35,335 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_19-callback_racing_bound2.i[30212,30225] [2023-08-04 03:49:35,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:49:35,379 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:49:35,402 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [245] [2023-08-04 03:49:35,409 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [245] [2023-08-04 03:49:35,419 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_19-callback_racing_bound2.i[30212,30225] [2023-08-04 03:49:35,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:49:35,477 WARN L667 CHandler]: The function callback is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 03:49:35,483 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:49:35,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:35 WrapperNode [2023-08-04 03:49:35,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:49:35,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:49:35,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:49:35,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:49:35,491 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:35" (1/1) ... [2023-08-04 03:49:35,505 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:35" (1/1) ... [2023-08-04 03:49:35,529 INFO L138 Inliner]: procedures = 173, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2023-08-04 03:49:35,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:49:35,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:49:35,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:49:35,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:49:35,538 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:35" (1/1) ... [2023-08-04 03:49:35,538 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:35" (1/1) ... [2023-08-04 03:49:35,541 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:35" (1/1) ... [2023-08-04 03:49:35,541 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:35" (1/1) ... [2023-08-04 03:49:35,546 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:35" (1/1) ... [2023-08-04 03:49:35,550 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:35" (1/1) ... [2023-08-04 03:49:35,551 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:35" (1/1) ... [2023-08-04 03:49:35,566 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:35" (1/1) ... [2023-08-04 03:49:35,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:49:35,570 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:49:35,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:49:35,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:49:35,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:35" (1/1) ... [2023-08-04 03:49:35,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:49:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:49:35,607 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:35,610 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:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:49:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:49:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-04 03:49:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:49:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:49:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-04 03:49:35,642 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-04 03:49:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:49:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:49:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:49:35,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:49:35,644 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:35,751 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:49:35,752 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:49:35,962 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:49:35,969 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:49:35,969 INFO L302 CfgBuilder]: Removed 11 assume(true) statements. [2023-08-04 03:49:35,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:49:35 BoogieIcfgContainer [2023-08-04 03:49:35,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:49:35,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:49:35,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:49:35,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:49:35,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:49:35" (1/3) ... [2023-08-04 03:49:35,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63743ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:49:35, skipping insertion in model container [2023-08-04 03:49:35,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:49:35" (2/3) ... [2023-08-04 03:49:35,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63743ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:49:35, skipping insertion in model container [2023-08-04 03:49:35,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:49:35" (3/3) ... [2023-08-04 03:49:35,978 INFO L112 eAbstractionObserver]: Analyzing ICFG goblint-regression_28-race_reach_19-callback_racing_bound2.i [2023-08-04 03:49:35,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:49:35,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:49:35,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 03:49:35,994 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:49:36,042 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-04 03:49:36,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 135 transitions, 278 flow [2023-08-04 03:49:36,136 INFO L124 PetriNetUnfolderBase]: 26/205 cut-off events. [2023-08-04 03:49:36,137 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 03:49:36,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 205 events. 26/205 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 529 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2023-08-04 03:49:36,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 135 transitions, 278 flow [2023-08-04 03:49:36,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:36,157 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:49:36,166 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:36,168 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:36,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:36,205 INFO L124 PetriNetUnfolderBase]: 25/200 cut-off events. [2023-08-04 03:49:36,205 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:36,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 200 events. 25/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 492 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2023-08-04 03:49:36,209 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2023-08-04 03:49:39,455 INFO L134 LiptonReduction]: Checked pairs total: 4311 [2023-08-04 03:49:39,456 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 03:49:39,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:49:39,474 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;@433f9879, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:49:39,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 03:49:39,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:49:39,480 INFO L124 PetriNetUnfolderBase]: 8/29 cut-off events. [2023-08-04 03:49:39,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:39,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:39,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:49:39,481 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:39,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2099220035, now seen corresponding path program 1 times [2023-08-04 03:49:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808027754] [2023-08-04 03:49:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:39,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:39,783 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:39,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:49:39,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808027754] [2023-08-04 03:49:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808027754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:49:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:49:39,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 03:49:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351991201] [2023-08-04 03:49:39,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:49:39,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:49:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:49:39,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:49:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:49:39,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 254 [2023-08-04 03:49:39,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 34 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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:39,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:49:39,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 254 [2023-08-04 03:49:39,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:49:39,926 INFO L124 PetriNetUnfolderBase]: 88/207 cut-off events. [2023-08-04 03:49:39,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:39,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 207 events. 88/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 731 event pairs, 32 based on Foata normal form. 29/194 useless extension candidates. Maximal degree in co-relation 356. Up to 122 conditions per place. [2023-08-04 03:49:39,928 INFO L140 encePairwiseOnDemand]: 241/254 looper letters, 20 selfloop transitions, 2 changer transitions 8/32 dead transitions. [2023-08-04 03:49:39,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 127 flow [2023-08-04 03:49:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:49:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:49:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-04 03:49:39,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.520997375328084 [2023-08-04 03:49:39,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-04 03:49:39,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-04 03:49:39,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:49:39,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-04 03:49:39,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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:39,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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:39,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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:39,965 INFO L175 Difference]: Start difference. First operand has 26 places, 34 transitions, 73 flow. Second operand 3 states and 397 transitions. [2023-08-04 03:49:39,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 127 flow [2023-08-04 03:49:39,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 127 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:49:39,969 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 53 flow [2023-08-04 03:49:39,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-08-04 03:49:39,974 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2023-08-04 03:49:39,974 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 53 flow [2023-08-04 03:49:39,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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:39,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:39,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:49:39,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:49:39,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:39,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:39,976 INFO L85 PathProgramCache]: Analyzing trace with hash -818669102, now seen corresponding path program 1 times [2023-08-04 03:49:39,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:39,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400311288] [2023-08-04 03:49:39,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:40,050 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:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:49:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400311288] [2023-08-04 03:49:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400311288] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:49:40,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732764801] [2023-08-04 03:49:40,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:40,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:49:40,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:49:40,065 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:40,087 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:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:40,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:49:40,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:49:40,191 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:40,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:49:40,210 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:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732764801] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:49:40,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:49:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:49:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142762545] [2023-08-04 03:49:40,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:49:40,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:49:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:49:40,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:49:40,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:49:40,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 254 [2023-08-04 03:49:40,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 53 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:40,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:49:40,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 254 [2023-08-04 03:49:40,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:49:40,241 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-08-04 03:49:40,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:40,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 21. Up to 6 conditions per place. [2023-08-04 03:49:40,242 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 0 selfloop transitions, 0 changer transitions 8/8 dead transitions. [2023-08-04 03:49:40,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 8 transitions, 36 flow [2023-08-04 03:49:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:49:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:49:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-08-04 03:49:40,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46161417322834647 [2023-08-04 03:49:40,244 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-08-04 03:49:40,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-08-04 03:49:40,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:49:40,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-08-04 03:49:40,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 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:40,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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:40,250 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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:40,250 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 53 flow. Second operand 4 states and 469 transitions. [2023-08-04 03:49:40,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 8 transitions, 36 flow [2023-08-04 03:49:40,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:49:40,250 INFO L231 Difference]: Finished difference. Result has 13 places, 0 transitions, 0 flow [2023-08-04 03:49:40,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=13, PETRI_TRANSITIONS=0} [2023-08-04 03:49:40,251 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -13 predicate places. [2023-08-04 03:49:40,252 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 0 transitions, 0 flow [2023-08-04 03:49:40,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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:40,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-08-04 03:49:40,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-08-04 03:49:40,268 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:40,461 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:40,462 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 03:49:40,465 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-08-04 03:49:40,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 135 transitions, 278 flow [2023-08-04 03:49:40,485 INFO L124 PetriNetUnfolderBase]: 26/205 cut-off events. [2023-08-04 03:49:40,485 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 03:49:40,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 205 events. 26/205 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 529 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2023-08-04 03:49:40,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 135 transitions, 278 flow [2023-08-04 03:49:40,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:40,487 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:49:40,487 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:40,488 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:40,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 130 transitions, 265 flow [2023-08-04 03:49:40,501 INFO L124 PetriNetUnfolderBase]: 25/200 cut-off events. [2023-08-04 03:49:40,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:40,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 200 events. 25/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 492 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2023-08-04 03:49:40,503 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2023-08-04 03:49:43,414 INFO L134 LiptonReduction]: Checked pairs total: 4336 [2023-08-04 03:49:43,414 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-04 03:49:43,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:49:43,417 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;@433f9879, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:49:43,417 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:49:43,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:49:43,420 INFO L124 PetriNetUnfolderBase]: 9/33 cut-off events. [2023-08-04 03:49:43,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:49:43,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:43,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 03:49:43,420 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:49:43,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1349788018, now seen corresponding path program 1 times [2023-08-04 03:49:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:43,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095478336] [2023-08-04 03:49:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:49:43,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:49:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:49:43,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:49:43,459 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:49:43,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 03:49:43,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 03:49:43,459 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 03:49:43,460 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 03:49:43,460 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:49:43,461 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:49:43,475 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-04 03:49:43,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 157 transitions, 332 flow [2023-08-04 03:49:43,504 INFO L124 PetriNetUnfolderBase]: 43/321 cut-off events. [2023-08-04 03:49:43,505 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 03:49:43,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 321 events. 43/321 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1104 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 207. Up to 9 conditions per place. [2023-08-04 03:49:43,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 157 transitions, 332 flow [2023-08-04 03:49:43,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 157 transitions, 332 flow [2023-08-04 03:49:43,509 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:49:43,509 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 157 transitions, 332 flow [2023-08-04 03:49:43,509 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 157 transitions, 332 flow [2023-08-04 03:49:43,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 157 transitions, 332 flow [2023-08-04 03:49:43,532 INFO L124 PetriNetUnfolderBase]: 43/321 cut-off events. [2023-08-04 03:49:43,533 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 03:49:43,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 321 events. 43/321 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1104 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 207. Up to 9 conditions per place. [2023-08-04 03:49:43,539 INFO L119 LiptonReduction]: Number of co-enabled transitions 7320 [2023-08-04 03:49:46,468 INFO L134 LiptonReduction]: Checked pairs total: 11823 [2023-08-04 03:49:46,469 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-04 03:49:46,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:49:46,471 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;@433f9879, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:49:46,472 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 03:49:46,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:49:46,475 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-08-04 03:49:46,475 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 03:49:46,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:46,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 03:49:46,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:46,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2076059207, now seen corresponding path program 1 times [2023-08-04 03:49:46,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:46,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187684664] [2023-08-04 03:49:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:46,580 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:46,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:49:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187684664] [2023-08-04 03:49:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187684664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:49:46,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:49:46,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 03:49:46,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442737295] [2023-08-04 03:49:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:49:46,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:49:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:49:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:49:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:49:46,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 293 [2023-08-04 03:49:46,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:46,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:49:46,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 293 [2023-08-04 03:49:46,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:49:46,879 INFO L124 PetriNetUnfolderBase]: 1755/2921 cut-off events. [2023-08-04 03:49:46,880 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-04 03:49:46,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5818 conditions, 2921 events. 1755/2921 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14392 event pairs, 731 based on Foata normal form. 100/2494 useless extension candidates. Maximal degree in co-relation 2292. Up to 1793 conditions per place. [2023-08-04 03:49:46,894 INFO L140 encePairwiseOnDemand]: 279/293 looper letters, 45 selfloop transitions, 2 changer transitions 7/57 dead transitions. [2023-08-04 03:49:46,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 244 flow [2023-08-04 03:49:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:49:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:49:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-08-04 03:49:46,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.534698521046644 [2023-08-04 03:49:46,897 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-08-04 03:49:46,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-08-04 03:49:46,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:49:46,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-08-04 03:49:46,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 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:46,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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:46,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 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:46,908 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 112 flow. Second operand 3 states and 470 transitions. [2023-08-04 03:49:46,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 244 flow [2023-08-04 03:49:46,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 57 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:49:46,911 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 100 flow [2023-08-04 03:49:46,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-04 03:49:46,912 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-04 03:49:46,912 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 100 flow [2023-08-04 03:49:46,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:46,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:46,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:49:46,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 03:49:46,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:46,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:46,916 INFO L85 PathProgramCache]: Analyzing trace with hash -976056897, now seen corresponding path program 1 times [2023-08-04 03:49:46,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999115883] [2023-08-04 03:49:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:46,993 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:46,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:49:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999115883] [2023-08-04 03:49:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999115883] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:49:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814534532] [2023-08-04 03:49:46,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:46,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:49:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:49:46,998 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:49:47,022 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:49:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:47,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:49:47,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:49:47,089 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:47,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:49:47,108 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:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814534532] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:49:47,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:49:47,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:49:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42603066] [2023-08-04 03:49:47,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:49:47,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:49:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:49:47,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:49:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:49:47,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 293 [2023-08-04 03:49:47,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 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:47,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:49:47,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 293 [2023-08-04 03:49:47,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:49:47,354 INFO L124 PetriNetUnfolderBase]: 1655/2770 cut-off events. [2023-08-04 03:49:47,354 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-08-04 03:49:47,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5760 conditions, 2770 events. 1655/2770 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 13415 event pairs, 181 based on Foata normal form. 0/2451 useless extension candidates. Maximal degree in co-relation 2074. Up to 2459 conditions per place. [2023-08-04 03:49:47,370 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 48 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2023-08-04 03:49:47,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow [2023-08-04 03:49:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:49:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:49:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-04 03:49:47,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492320819112628 [2023-08-04 03:49:47,372 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-04 03:49:47,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-04 03:49:47,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:49:47,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-04 03:49:47,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 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:47,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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:47,377 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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:47,377 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 100 flow. Second operand 4 states and 577 transitions. [2023-08-04 03:49:47,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow [2023-08-04 03:49:47,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:49:47,380 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow [2023-08-04 03:49:47,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-08-04 03:49:47,381 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-04 03:49:47,381 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow [2023-08-04 03:49:47,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 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:47,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:47,382 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:49:47,387 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:49:47,587 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:49:47,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:47,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1613153733, now seen corresponding path program 1 times [2023-08-04 03:49:47,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910158539] [2023-08-04 03:49:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:49:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:49:47,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:49:47,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910158539] [2023-08-04 03:49:47,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910158539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:49:47,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:49:47,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:49:47,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535469388] [2023-08-04 03:49:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:49:47,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:49:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:49:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:49:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:49:47,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 293 [2023-08-04 03:49:47,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 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:47,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:49:47,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 293 [2023-08-04 03:49:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:49:48,065 INFO L124 PetriNetUnfolderBase]: 1128/2087 cut-off events. [2023-08-04 03:49:48,065 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2023-08-04 03:49:48,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 2087 events. 1128/2087 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11193 event pairs, 497 based on Foata normal form. 172/1975 useless extension candidates. Maximal degree in co-relation 1872. Up to 1123 conditions per place. [2023-08-04 03:49:48,074 INFO L140 encePairwiseOnDemand]: 282/293 looper letters, 49 selfloop transitions, 11 changer transitions 4/67 dead transitions. [2023-08-04 03:49:48,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 333 flow [2023-08-04 03:49:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:49:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:49:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-04 03:49:48,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47440273037542663 [2023-08-04 03:49:48,076 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-04 03:49:48,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-04 03:49:48,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:49:48,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-04 03:49:48,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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:48,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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:48,081 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 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:48,081 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 4 states and 556 transitions. [2023-08-04 03:49:48,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 333 flow [2023-08-04 03:49:48,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:49:48,084 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 160 flow [2023-08-04 03:49:48,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-04 03:49:48,085 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2023-08-04 03:49:48,085 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 160 flow [2023-08-04 03:49:48,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 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:48,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:49:48,086 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:49:48,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 03:49:48,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:49:48,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:49:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2141361534, now seen corresponding path program 1 times [2023-08-04 03:49:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:49:48,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431097773] [2023-08-04 03:49:48,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:49:48,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:49:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:49:48,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:49:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:49:48,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:49:48,119 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:49:48,119 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 03:49:48,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 03:49:48,120 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 03:49:48,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 03:49:48,120 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 03:49:48,120 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 03:49:48,122 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 03:49:48,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 03:49:48,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 03:49:48 BasicIcfg [2023-08-04 03:49:48,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 03:49:48,153 INFO L158 Benchmark]: Toolchain (without parser) took 13116.09ms. Allocated memory was 339.7MB in the beginning and 713.0MB in the end (delta: 373.3MB). Free memory was 287.4MB in the beginning and 597.5MB in the end (delta: -310.1MB). Peak memory consumption was 67.4MB. Max. memory is 16.0GB. [2023-08-04 03:49:48,153 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 339.7MB. Free memory is still 292.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 03:49:48,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.49ms. Allocated memory is still 339.7MB. Free memory was 287.0MB in the beginning and 266.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-04 03:49:48,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.25ms. Allocated memory is still 339.7MB. Free memory was 266.8MB in the beginning and 264.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 03:49:48,154 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 339.7MB. Free memory was 264.4MB in the beginning and 262.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 03:49:48,154 INFO L158 Benchmark]: RCFGBuilder took 401.07ms. Allocated memory was 339.7MB in the beginning and 593.5MB in the end (delta: 253.8MB). Free memory was 262.9MB in the beginning and 555.4MB in the end (delta: -292.4MB). Peak memory consumption was 19.8MB. Max. memory is 16.0GB. [2023-08-04 03:49:48,154 INFO L158 Benchmark]: TraceAbstraction took 12179.68ms. Allocated memory was 593.5MB in the beginning and 713.0MB in the end (delta: 119.5MB). Free memory was 555.4MB in the beginning and 597.5MB in the end (delta: -42.1MB). Peak memory consumption was 79.0MB. Max. memory is 16.0GB. [2023-08-04 03:49:48,155 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 339.7MB. Free memory is still 292.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 444.49ms. Allocated memory is still 339.7MB. Free memory was 287.0MB in the beginning and 266.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.25ms. Allocated memory is still 339.7MB. Free memory was 266.8MB in the beginning and 264.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 339.7MB. Free memory was 264.4MB in the beginning and 262.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 401.07ms. Allocated memory was 339.7MB in the beginning and 593.5MB in the end (delta: 253.8MB). Free memory was 262.9MB in the beginning and 555.4MB in the end (delta: -292.4MB). Peak memory consumption was 19.8MB. Max. memory is 16.0GB. * TraceAbstraction took 12179.68ms. Allocated memory was 593.5MB in the beginning and 713.0MB in the end (delta: 119.5MB). Free memory was 555.4MB in the beginning and 597.5MB in the end (delta: -42.1MB). Peak memory consumption was 79.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 245]: Unsoundness Warning unspecified type, defaulting to int C: short [245] - GenericResultAtLocation [Line: 245]: Unsoundness Warning unspecified type, defaulting to int C: short [245] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 119 PlacesBefore, 26 PlacesAfterwards, 130 TransitionsBefore, 34 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 24 ConcurrentYvCompositions, 3 ChoiceCompositions, 119 TotalNumberOfCompositions, 4311 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2788, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1638, independent: 1606, independent conditional: 0, independent unconditional: 1606, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2788, independent: 1063, independent conditional: 0, independent unconditional: 1063, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 1638, unknown conditional: 0, unknown unconditional: 1638] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 119 PlacesBefore, 25 PlacesAfterwards, 130 TransitionsBefore, 32 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 24 ConcurrentYvCompositions, 4 ChoiceCompositions, 120 TotalNumberOfCompositions, 4336 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2636, independent: 2510, independent conditional: 0, independent unconditional: 2510, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1606, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2636, independent: 936, independent conditional: 0, independent unconditional: 936, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 1606, unknown conditional: 0, unknown unconditional: 1606] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, 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: 3.0s, 143 PlacesBefore, 38 PlacesAfterwards, 157 TransitionsBefore, 47 TransitionsAfterwards, 7320 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 5 ChoiceCompositions, 136 TotalNumberOfCompositions, 11823 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6604, independent: 6423, independent conditional: 0, independent unconditional: 6423, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3859, independent: 3804, independent conditional: 0, independent unconditional: 3804, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6604, independent: 2619, independent conditional: 0, independent unconditional: 2619, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 3859, unknown conditional: 0, unknown unconditional: 3859] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 692]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L697] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L704] 0 int glob; [L705] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L706] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L720] 0 pthread_t t_ids[2]; [L720] 0 int i=0; VAL [__global_lock={3:0}, glob=0, i=0, mutex1={4:0}, mutex2={5:0}, t_ids={6:0}] [L720] COND TRUE 0 i<2 [L720] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, glob=0, i=0, mutex1={4:0}, mutex2={5:0}, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, t_ids={6:0}] [L720] 0 i++ VAL [__global_lock={3:0}, glob=0, i=1, mutex1={4:0}, mutex2={5:0}, t_ids={6:0}] [L720] COND TRUE 0 i<2 [L720] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [__global_lock={3:0}, glob=0, i=1, mutex1={4:0}, mutex2={5:0}, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=0, t_ids={6:0}] [L720] 0 i++ VAL [__global_lock={3:0}, glob=0, i=2, mutex1={4:0}, mutex2={5:0}, t_ids={6:0}] [L720] COND FALSE 0 !(i<2) [L721] CALL 0 foo(bar) [L699] 0 int i = 0; VAL [__global_lock={3:0}, callback={-1:1}, callback={-1:1}, glob=0, i=0, mutex1={4:0}, mutex2={5:0}] [L699] COND TRUE 0 i < 10 [L700] COND TRUE 0 __VERIFIER_nondet_int() [L701] CALL 0 callback() [L709] 0 (glob)++ [L715] CALL 1 __VERIFIER_assert((glob) == 0) [L692] COND TRUE 1 !(cond) [L692] 1 reach_error() VAL [\old(cond)=0, __global_lock={3:0}, cond=0, glob=1, mutex1={4:0}, mutex2={5:0}] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 139 locations, 3 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.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 2 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 167 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, 157 locations, 4 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: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 7 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 11, 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.3s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6/9 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, 139 locations, 3 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.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred 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:49:48,176 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...