/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/28_buggy_simple_loop1_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 11:50:22,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 11:50:22,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 11:50:22,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 11:50:22,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 11:50:22,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 11:50:22,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 11:50:22,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 11:50:22,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 11:50:22,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 11:50:22,899 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 11:50:22,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 11:50:22,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 11:50:22,901 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 11:50:22,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 11:50:22,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 11:50:22,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 11:50:22,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 11:50:22,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 11:50:22,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 11:50:22,902 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 11:50:22,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 11:50:22,902 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 11:50:22,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 11:50:22,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 11:50:22,903 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 11:50:22,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 11:50:22,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:50:22,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 11:50:22,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 11:50:22,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 11:50:22,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 11:50:22,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 11:50:22,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 11:50:22,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 11:50:22,905 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 11:50:23,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 11:50:23,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 11:50:23,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 11:50:23,182 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 11:50:23,182 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 11:50:23,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/28_buggy_simple_loop1_vf.i [2023-08-26 11:50:24,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 11:50:24,347 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 11:50:24,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/28_buggy_simple_loop1_vf.i [2023-08-26 11:50:24,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/181f93ac3/e71d742ab1fb4272ac0d2699bc8c143a/FLAG8999ca12d [2023-08-26 11:50:24,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/181f93ac3/e71d742ab1fb4272ac0d2699bc8c143a [2023-08-26 11:50:24,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 11:50:24,375 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 11:50:24,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 11:50:24,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 11:50:24,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 11:50:24,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cbe688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24, skipping insertion in model container [2023-08-26 11:50:24,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,419 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 11:50:24,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:50:24,646 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 11:50:24,673 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-26 11:50:24,675 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [250] [2023-08-26 11:50:24,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:50:24,717 INFO L206 MainTranslator]: Completed translation [2023-08-26 11:50:24,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24 WrapperNode [2023-08-26 11:50:24,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 11:50:24,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 11:50:24,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 11:50:24,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 11:50:24,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,753 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2023-08-26 11:50:24,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 11:50:24,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 11:50:24,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 11:50:24,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 11:50:24,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 11:50:24,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 11:50:24,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 11:50:24,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 11:50:24,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (1/1) ... [2023-08-26 11:50:24,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:50:24,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:50:24,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 11:50:24,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 11:50:24,828 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-26 11:50:24,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-26 11:50:24,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 11:50:24,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 11:50:24,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 11:50:24,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 11:50:24,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 11:50:24,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 11:50:24,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 11:50:24,830 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 11:50:24,910 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 11:50:24,912 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 11:50:25,036 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 11:50:25,040 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 11:50:25,041 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 11:50:25,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:50:25 BoogieIcfgContainer [2023-08-26 11:50:25,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 11:50:25,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 11:50:25,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 11:50:25,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 11:50:25,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:50:24" (1/3) ... [2023-08-26 11:50:25,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1305ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:50:25, skipping insertion in model container [2023-08-26 11:50:25,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:50:24" (2/3) ... [2023-08-26 11:50:25,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1305ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:50:25, skipping insertion in model container [2023-08-26 11:50:25,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:50:25" (3/3) ... [2023-08-26 11:50:25,047 INFO L112 eAbstractionObserver]: Analyzing ICFG 28_buggy_simple_loop1_vf.i [2023-08-26 11:50:25,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 11:50:25,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-26 11:50:25,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 11:50:25,110 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 11:50:25,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 73 transitions, 151 flow [2023-08-26 11:50:25,161 INFO L124 PetriNetUnfolderBase]: 11/85 cut-off events. [2023-08-26 11:50:25,161 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:50:25,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 85 events. 11/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2023-08-26 11:50:25,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 73 transitions, 151 flow [2023-08-26 11:50:25,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 73 transitions, 151 flow [2023-08-26 11:50:25,171 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:50:25,177 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 73 transitions, 151 flow [2023-08-26 11:50:25,179 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 73 transitions, 151 flow [2023-08-26 11:50:25,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 73 transitions, 151 flow [2023-08-26 11:50:25,193 INFO L124 PetriNetUnfolderBase]: 11/85 cut-off events. [2023-08-26 11:50:25,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:50:25,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 85 events. 11/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2023-08-26 11:50:25,195 INFO L119 LiptonReduction]: Number of co-enabled transitions 1410 [2023-08-26 11:50:26,582 INFO L134 LiptonReduction]: Checked pairs total: 1109 [2023-08-26 11:50:26,583 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-26 11:50:26,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:50:26,596 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75c7fb15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:50:26,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-26 11:50:26,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:50:26,597 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-26 11:50:26,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:50:26,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:50:26,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 11:50:26,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-08-26 11:50:26,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:50:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 10682, now seen corresponding path program 1 times [2023-08-26 11:50:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:50:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534727051] [2023-08-26 11:50:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:50:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:50:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:50:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:50:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:50:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534727051] [2023-08-26 11:50:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534727051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:50:26,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:50:26,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:50:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304975567] [2023-08-26 11:50:26,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:50:26,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:50:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:50:26,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:50:26,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:50:26,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 138 [2023-08-26 11:50:26,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 19 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:50:26,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 138 [2023-08-26 11:50:26,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:50:26,802 INFO L124 PetriNetUnfolderBase]: 34/67 cut-off events. [2023-08-26 11:50:26,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:50:26,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 67 events. 34/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 174 event pairs, 18 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 122. Up to 65 conditions per place. [2023-08-26 11:50:26,803 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 14 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2023-08-26 11:50:26,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 16 transitions, 67 flow [2023-08-26 11:50:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:50:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:50:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-08-26 11:50:26,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2023-08-26 11:50:26,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 180 transitions. [2023-08-26 11:50:26,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 180 transitions. [2023-08-26 11:50:26,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:50:26,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 180 transitions. [2023-08-26 11:50:26,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,819 INFO L175 Difference]: Start difference. First operand has 17 places, 19 transitions, 43 flow. Second operand 3 states and 180 transitions. [2023-08-26 11:50:26,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 16 transitions, 67 flow [2023-08-26 11:50:26,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 16 transitions, 67 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 11:50:26,821 INFO L231 Difference]: Finished difference. Result has 17 places, 16 transitions, 39 flow [2023-08-26 11:50:26,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=39, PETRI_PLACES=17, PETRI_TRANSITIONS=16} [2023-08-26 11:50:26,824 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 0 predicate places. [2023-08-26 11:50:26,824 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 16 transitions, 39 flow [2023-08-26 11:50:26,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:50:26,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 11:50:26,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 11:50:26,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-08-26 11:50:26,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:50:26,825 INFO L85 PathProgramCache]: Analyzing trace with hash 10683, now seen corresponding path program 1 times [2023-08-26 11:50:26,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:50:26,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405150887] [2023-08-26 11:50:26,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:50:26,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:50:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:50:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:50:26,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:50:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405150887] [2023-08-26 11:50:26,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405150887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:50:26,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:50:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:50:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683521459] [2023-08-26 11:50:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:50:26,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:50:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:50:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:50:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:50:26,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 138 [2023-08-26 11:50:26,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 16 transitions, 39 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:50:26,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 138 [2023-08-26 11:50:26,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:50:26,907 INFO L124 PetriNetUnfolderBase]: 24/49 cut-off events. [2023-08-26 11:50:26,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:50:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 49 events. 24/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 115 event pairs, 12 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 98. Up to 47 conditions per place. [2023-08-26 11:50:26,908 INFO L140 encePairwiseOnDemand]: 136/138 looper letters, 13 selfloop transitions, 1 changer transitions 0/15 dead transitions. [2023-08-26 11:50:26,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 15 transitions, 65 flow [2023-08-26 11:50:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:50:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:50:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-08-26 11:50:26,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2023-08-26 11:50:26,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 180 transitions. [2023-08-26 11:50:26,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 180 transitions. [2023-08-26 11:50:26,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:50:26,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 180 transitions. [2023-08-26 11:50:26,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,914 INFO L175 Difference]: Start difference. First operand has 17 places, 16 transitions, 39 flow. Second operand 3 states and 180 transitions. [2023-08-26 11:50:26,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 15 transitions, 65 flow [2023-08-26 11:50:26,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 15 transitions, 64 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 11:50:26,915 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 38 flow [2023-08-26 11:50:26,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2023-08-26 11:50:26,916 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 0 predicate places. [2023-08-26 11:50:26,916 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 38 flow [2023-08-26 11:50:26,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:26,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:50:26,916 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-26 11:50:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 11:50:26,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-08-26 11:50:26,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:50:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1281610012, now seen corresponding path program 1 times [2023-08-26 11:50:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:50:26,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018057007] [2023-08-26 11:50:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:50:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:50:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:50:26,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 11:50:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:50:26,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 11:50:26,983 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 11:50:26,984 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-08-26 11:50:26,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONASSERT (3 of 5 remaining) [2023-08-26 11:50:26,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-08-26 11:50:26,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-08-26 11:50:26,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONASSERT (0 of 5 remaining) [2023-08-26 11:50:26,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 11:50:26,987 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-26 11:50:26,990 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 11:50:26,990 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 11:50:27,022 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 11:50:27,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 121 transitions, 254 flow [2023-08-26 11:50:27,044 INFO L124 PetriNetUnfolderBase]: 21/147 cut-off events. [2023-08-26 11:50:27,044 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 11:50:27,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 147 events. 21/147 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 330 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 108. Up to 6 conditions per place. [2023-08-26 11:50:27,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 121 transitions, 254 flow [2023-08-26 11:50:27,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 121 transitions, 254 flow [2023-08-26 11:50:27,046 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:50:27,046 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 121 transitions, 254 flow [2023-08-26 11:50:27,046 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 121 transitions, 254 flow [2023-08-26 11:50:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 121 transitions, 254 flow [2023-08-26 11:50:27,077 INFO L124 PetriNetUnfolderBase]: 21/147 cut-off events. [2023-08-26 11:50:27,077 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 11:50:27,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 147 events. 21/147 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 330 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 108. Up to 6 conditions per place. [2023-08-26 11:50:27,081 INFO L119 LiptonReduction]: Number of co-enabled transitions 7332 [2023-08-26 11:50:28,987 INFO L134 LiptonReduction]: Checked pairs total: 5640 [2023-08-26 11:50:28,988 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-26 11:50:28,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:50:28,990 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75c7fb15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:50:28,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-26 11:50:28,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:50:28,991 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 11:50:28,991 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:50:28,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:50:28,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 11:50:28,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-08-26 11:50:28,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:50:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash 19579, now seen corresponding path program 1 times [2023-08-26 11:50:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:50:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464376162] [2023-08-26 11:50:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:50:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:50:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:50:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:50:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:50:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464376162] [2023-08-26 11:50:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464376162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:50:29,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:50:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:50:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069581514] [2023-08-26 11:50:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:50:29,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:50:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:50:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:50:29,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:50:29,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 232 [2023-08-26 11:50:29,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:50:29,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 232 [2023-08-26 11:50:29,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:50:29,093 INFO L124 PetriNetUnfolderBase]: 402/596 cut-off events. [2023-08-26 11:50:29,094 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-26 11:50:29,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 596 events. 402/596 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2465 event pairs, 222 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 216. Up to 573 conditions per place. [2023-08-26 11:50:29,097 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 24 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2023-08-26 11:50:29,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 28 transitions, 118 flow [2023-08-26 11:50:29,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:50:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:50:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-08-26 11:50:29,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4511494252873563 [2023-08-26 11:50:29,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-08-26 11:50:29,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-08-26 11:50:29,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:50:29,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-08-26 11:50:29,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,102 INFO L175 Difference]: Start difference. First operand has 27 places, 32 transitions, 76 flow. Second operand 3 states and 314 transitions. [2023-08-26 11:50:29,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 28 transitions, 118 flow [2023-08-26 11:50:29,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-26 11:50:29,103 INFO L231 Difference]: Finished difference. Result has 27 places, 28 transitions, 68 flow [2023-08-26 11:50:29,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=27, PETRI_TRANSITIONS=28} [2023-08-26 11:50:29,104 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2023-08-26 11:50:29,104 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 28 transitions, 68 flow [2023-08-26 11:50:29,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:50:29,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 11:50:29,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 11:50:29,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-08-26 11:50:29,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:50:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash 19580, now seen corresponding path program 1 times [2023-08-26 11:50:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:50:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269345277] [2023-08-26 11:50:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:50:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:50:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:50:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 11:50:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:50:29,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269345277] [2023-08-26 11:50:29,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269345277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:50:29,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:50:29,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:50:29,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105571007] [2023-08-26 11:50:29,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:50:29,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:50:29,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:50:29,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:50:29,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:50:29,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 232 [2023-08-26 11:50:29,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:50:29,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 232 [2023-08-26 11:50:29,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:50:29,194 INFO L124 PetriNetUnfolderBase]: 252/389 cut-off events. [2023-08-26 11:50:29,194 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-26 11:50:29,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 389 events. 252/389 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1453 event pairs, 132 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 783. Up to 366 conditions per place. [2023-08-26 11:50:29,195 INFO L140 encePairwiseOnDemand]: 230/232 looper letters, 23 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-26 11:50:29,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 114 flow [2023-08-26 11:50:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:50:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:50:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2023-08-26 11:50:29,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44971264367816094 [2023-08-26 11:50:29,203 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2023-08-26 11:50:29,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2023-08-26 11:50:29,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:50:29,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2023-08-26 11:50:29,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,211 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 68 flow. Second operand 3 states and 313 transitions. [2023-08-26 11:50:29,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 114 flow [2023-08-26 11:50:29,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 113 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 11:50:29,212 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 67 flow [2023-08-26 11:50:29,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-08-26 11:50:29,213 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2023-08-26 11:50:29,214 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 67 flow [2023-08-26 11:50:29,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:50:29,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:50:29,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 11:50:29,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 11:50:29,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONASSERT === [thr1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-08-26 11:50:29,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:50:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash 915496135, now seen corresponding path program 1 times [2023-08-26 11:50:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:50:29,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75592759] [2023-08-26 11:50:29,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:50:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:50:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:50:29,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 11:50:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:50:29,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 11:50:29,279 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 11:50:29,279 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONASSERT (5 of 6 remaining) [2023-08-26 11:50:29,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONASSERT (4 of 6 remaining) [2023-08-26 11:50:29,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-08-26 11:50:29,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-08-26 11:50:29,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-26 11:50:29,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONASSERT (0 of 6 remaining) [2023-08-26 11:50:29,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 11:50:29,280 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-26 11:50:29,285 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-26 11:50:29,285 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:50:29,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:50:29 BasicIcfg [2023-08-26 11:50:29,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:50:29,309 INFO L158 Benchmark]: Toolchain (without parser) took 4933.34ms. Allocated memory was 331.4MB in the beginning and 398.5MB in the end (delta: 67.1MB). Free memory was 305.5MB in the beginning and 300.5MB in the end (delta: 5.0MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2023-08-26 11:50:29,309 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 331.4MB. Free memory was 308.8MB in the beginning and 308.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:50:29,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.86ms. Allocated memory is still 331.4MB. Free memory was 305.5MB in the beginning and 286.4MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 11:50:29,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.95ms. Allocated memory is still 331.4MB. Free memory was 286.4MB in the beginning and 284.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:50:29,309 INFO L158 Benchmark]: Boogie Preprocessor took 14.13ms. Allocated memory is still 331.4MB. Free memory was 284.3MB in the beginning and 283.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:50:29,310 INFO L158 Benchmark]: RCFGBuilder took 273.77ms. Allocated memory is still 331.4MB. Free memory was 283.0MB in the beginning and 269.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 11:50:29,310 INFO L158 Benchmark]: TraceAbstraction took 4264.62ms. Allocated memory was 331.4MB in the beginning and 398.5MB in the end (delta: 67.1MB). Free memory was 268.3MB in the beginning and 300.5MB in the end (delta: -32.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-26 11:50:29,311 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 331.4MB. Free memory was 308.8MB in the beginning and 308.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 340.86ms. Allocated memory is still 331.4MB. Free memory was 305.5MB in the beginning and 286.4MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.95ms. Allocated memory is still 331.4MB. Free memory was 286.4MB in the beginning and 284.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 14.13ms. Allocated memory is still 331.4MB. Free memory was 284.3MB in the beginning and 283.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 273.77ms. Allocated memory is still 331.4MB. Free memory was 283.0MB in the beginning and 269.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 4264.62ms. Allocated memory was 331.4MB in the beginning and 398.5MB in the end (delta: 67.1MB). Free memory was 268.3MB in the beginning and 300.5MB in the end (delta: -32.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] - GenericResultAtLocation [Line: 250]: Unsoundness Warning unspecified type, defaulting to int C: short [250] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 66 PlacesBefore, 17 PlacesAfterwards, 73 TransitionsBefore, 19 TransitionsAfterwards, 1410 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 5 ChoiceCompositions, 65 TotalNumberOfCompositions, 1109 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1109, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 677, independent: 677, independent conditional: 0, independent unconditional: 677, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1109, independent: 432, independent conditional: 0, independent unconditional: 432, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 677, unknown conditional: 0, unknown unconditional: 677] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 0, Positive unconditional cache size: 11, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 107 PlacesBefore, 27 PlacesAfterwards, 121 TransitionsBefore, 32 TransitionsAfterwards, 7332 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 9 ChoiceCompositions, 111 TotalNumberOfCompositions, 5640 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5640, independent: 5640, independent conditional: 0, independent unconditional: 5640, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3662, independent: 3662, independent conditional: 0, independent unconditional: 3662, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5640, independent: 1978, independent conditional: 0, independent unconditional: 1978, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3662, unknown conditional: 0, unknown unconditional: 3662] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 33, Positive conditional cache size: 0, Positive unconditional cache size: 33, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 12]: assertion can be violated assertion can be violated We found a FailurePath: [L700] 0 pthread_t t; VAL [t={3:0}] [L701] COND TRUE 0 1 [L703] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [pthread_create(&t, 0, thr1, 0)=-1, t={3:0}] [L686] 1 unsigned int x=__VERIFIER_nondet_uint(), y=__VERIFIER_nondet_uint(), z=__VERIFIER_nondet_uint(); [L686] 1 unsigned int x=__VERIFIER_nondet_uint(), y=__VERIFIER_nondet_uint(), z=__VERIFIER_nondet_uint(); [L686] 1 unsigned int x=__VERIFIER_nondet_uint(), y=__VERIFIER_nondet_uint(), z=__VERIFIER_nondet_uint(); [L687] 1 int i, j=1, k=1; [L688] 1 i=0 VAL [arg={0:0}, arg={0:0}, i=0, j=1, k=1] [L688] COND FALSE 1 !(i