/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 02:16:00,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 02:16:00,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 02:16:00,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 02:16:00,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 02:16:00,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 02:16:00,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 02:16:00,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 02:16:00,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 02:16:00,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 02:16:00,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 02:16:00,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 02:16:00,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 02:16:00,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 02:16:00,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 02:16:00,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 02:16:00,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 02:16:00,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 02:16:00,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 02:16:00,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 02:16:00,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 02:16:00,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 02:16:00,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 02:16:00,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 02:16:00,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 02:16:00,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 02:16:00,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 02:16:00,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 02:16:00,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 02:16:00,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 02:16:00,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 02:16:00,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 02:16:00,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 02:16:00,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 02:16:00,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 02:16:00,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 02:16:00,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 02:16:00,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 02:16:00,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 02:16:00,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 02:16:00,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 02:16:00,211 INFO L101 SettingsManager]: Beginning 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-01-28 02:16:00,227 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 02:16:00,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 02:16:00,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 02:16:00,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 02:16:00,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 02:16:00,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 02:16:00,229 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 02:16:00,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 02:16:00,229 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 02:16:00,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 02:16:00,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 02:16:00,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 02:16:00,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 02:16:00,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 02:16:00,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 02:16:00,230 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 02:16:00,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 02:16:00,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 02:16:00,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 02:16:00,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 02:16:00,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 02:16:00,232 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 02:16:00,232 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 02:16:00,232 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 02:16:00,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 02:16:00,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 02:16:00,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 02:16:00,403 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 02:16:00,403 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 02:16:00,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-01-28 02:16:01,419 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 02:16:01,560 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 02:16:01,560 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-01-28 02:16:01,565 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade44c61/b688c786e9c945ef987ac059cf38cc5f/FLAG32fec42c0 [2023-01-28 02:16:01,578 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade44c61/b688c786e9c945ef987ac059cf38cc5f [2023-01-28 02:16:01,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 02:16:01,581 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 02:16:01,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 02:16:01,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 02:16:01,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 02:16:01,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38dca388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01, skipping insertion in model container [2023-01-28 02:16:01,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 02:16:01,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 02:16:01,724 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2023-01-28 02:16:01,727 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 02:16:01,736 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 02:16:01,754 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2023-01-28 02:16:01,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 02:16:01,772 INFO L208 MainTranslator]: Completed translation [2023-01-28 02:16:01,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01 WrapperNode [2023-01-28 02:16:01,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 02:16:01,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 02:16:01,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 02:16:01,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 02:16:01,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,802 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2023-01-28 02:16:01,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 02:16:01,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 02:16:01,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 02:16:01,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 02:16:01,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,827 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 02:16:01,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 02:16:01,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 02:16:01,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 02:16:01,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (1/1) ... [2023-01-28 02:16:01,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 02:16:01,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 02:16:01,858 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-01-28 02:16:01,880 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-01-28 02:16:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 02:16:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 02:16:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 02:16:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 02:16:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 02:16:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 02:16:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 02:16:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 02:16:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 02:16:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 02:16:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 02:16:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 02:16:01,889 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 02:16:01,982 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 02:16:01,984 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 02:16:02,130 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 02:16:02,134 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 02:16:02,135 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-28 02:16:02,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 02:16:02 BoogieIcfgContainer [2023-01-28 02:16:02,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 02:16:02,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 02:16:02,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 02:16:02,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 02:16:02,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 02:16:01" (1/3) ... [2023-01-28 02:16:02,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@916152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 02:16:02, skipping insertion in model container [2023-01-28 02:16:02,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 02:16:01" (2/3) ... [2023-01-28 02:16:02,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@916152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 02:16:02, skipping insertion in model container [2023-01-28 02:16:02,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 02:16:02" (3/3) ... [2023-01-28 02:16:02,152 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-01-28 02:16:02,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 02:16:02,164 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 02:16:02,164 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 02:16:02,224 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 02:16:02,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2023-01-28 02:16:02,294 INFO L130 PetriNetUnfolder]: 6/75 cut-off events. [2023-01-28 02:16:02,294 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 02:16:02,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-01-28 02:16:02,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2023-01-28 02:16:02,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2023-01-28 02:16:02,301 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 02:16:02,317 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2023-01-28 02:16:02,319 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2023-01-28 02:16:02,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2023-01-28 02:16:02,344 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2023-01-28 02:16:02,344 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 02:16:02,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 67 events. 6/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-01-28 02:16:02,347 INFO L119 LiptonReduction]: Number of co-enabled transitions 252 [2023-01-28 02:16:03,841 INFO L134 LiptonReduction]: Checked pairs total: 297 [2023-01-28 02:16:03,841 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-01-28 02:16:03,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 02:16:03,855 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;@76573ec2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 02:16:03,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 02:16:03,858 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2023-01-28 02:16:03,858 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 02:16:03,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:16:03,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:16:03,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:16:03,862 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:16:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1136073076, now seen corresponding path program 1 times [2023-01-28 02:16:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:16:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032114904] [2023-01-28 02:16:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:16:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:16:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:16:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:16:04,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032114904] [2023-01-28 02:16:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032114904] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 02:16:04,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 02:16:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 02:16:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029079303] [2023-01-28 02:16:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 02:16:04,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 02:16:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:16:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 02:16:04,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 02:16:04,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 142 [2023-01-28 02:16:04,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-01-28 02:16:04,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:16:04,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 142 [2023-01-28 02:16:04,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:16:04,281 INFO L130 PetriNetUnfolder]: 41/77 cut-off events. [2023-01-28 02:16:04,282 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-28 02:16:04,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 165 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2023-01-28 02:16:04,283 INFO L137 encePairwiseOnDemand]: 138/142 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2023-01-28 02:16:04,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2023-01-28 02:16:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 02:16:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 02:16:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-01-28 02:16:04,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507042253521127 [2023-01-28 02:16:04,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-01-28 02:16:04,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-01-28 02:16:04,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:16:04,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-01-28 02:16:04,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-01-28 02:16:04,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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-01-28 02:16:04,301 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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-01-28 02:16:04,302 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 192 transitions. [2023-01-28 02:16:04,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2023-01-28 02:16:04,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 02:16:04,308 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2023-01-28 02:16:04,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2023-01-28 02:16:04,312 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2023-01-28 02:16:04,312 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2023-01-28 02:16:04,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-01-28 02:16:04,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:16:04,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:16:04,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 02:16:04,312 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:16:04,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:16:04,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1884749856, now seen corresponding path program 1 times [2023-01-28 02:16:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:16:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687714699] [2023-01-28 02:16:04,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:16:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:16:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:16:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:16:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687714699] [2023-01-28 02:16:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687714699] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 02:16:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 02:16:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 02:16:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677588367] [2023-01-28 02:16:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 02:16:04,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 02:16:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:16:04,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 02:16:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 02:16:04,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 02:16:04,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-01-28 02:16:04,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:16:04,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 02:16:04,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:16:04,511 INFO L130 PetriNetUnfolder]: 39/75 cut-off events. [2023-01-28 02:16:04,511 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-01-28 02:16:04,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 75 events. 39/75 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 165 event pairs, 2 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 55. Up to 28 conditions per place. [2023-01-28 02:16:04,513 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 24 selfloop transitions, 6 changer transitions 4/34 dead transitions. [2023-01-28 02:16:04,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 34 transitions, 165 flow [2023-01-28 02:16:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 02:16:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 02:16:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2023-01-28 02:16:04,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295774647887324 [2023-01-28 02:16:04,518 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 305 transitions. [2023-01-28 02:16:04,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 305 transitions. [2023-01-28 02:16:04,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:16:04,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 305 transitions. [2023-01-28 02:16:04,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 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-01-28 02:16:04,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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-01-28 02:16:04,521 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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-01-28 02:16:04,521 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 5 states and 305 transitions. [2023-01-28 02:16:04,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 34 transitions, 165 flow [2023-01-28 02:16:04,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 34 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 02:16:04,522 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 70 flow [2023-01-28 02:16:04,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2023-01-28 02:16:04,522 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2023-01-28 02:16:04,522 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 70 flow [2023-01-28 02:16:04,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-01-28 02:16:04,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:16:04,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:16:04,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 02:16:04,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:16:04,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:16:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1479151157, now seen corresponding path program 1 times [2023-01-28 02:16:04,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:16:04,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826208525] [2023-01-28 02:16:04,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:16:04,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:16:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:16:04,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:04,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:16:04,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826208525] [2023-01-28 02:16:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826208525] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 02:16:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 02:16:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 02:16:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646753856] [2023-01-28 02:16:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 02:16:04,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 02:16:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:16:04,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 02:16:04,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 02:16:04,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 02:16:04,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-01-28 02:16:04,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:16:04,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 02:16:04,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:16:04,682 INFO L130 PetriNetUnfolder]: 32/66 cut-off events. [2023-01-28 02:16:04,682 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2023-01-28 02:16:04,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 66 events. 32/66 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 6 based on Foata normal form. 4/70 useless extension candidates. Maximal degree in co-relation 57. Up to 45 conditions per place. [2023-01-28 02:16:04,683 INFO L137 encePairwiseOnDemand]: 138/142 looper letters, 15 selfloop transitions, 3 changer transitions 8/26 dead transitions. [2023-01-28 02:16:04,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 142 flow [2023-01-28 02:16:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 02:16:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 02:16:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2023-01-28 02:16:04,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4278169014084507 [2023-01-28 02:16:04,685 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 243 transitions. [2023-01-28 02:16:04,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 243 transitions. [2023-01-28 02:16:04,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:16:04,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 243 transitions. [2023-01-28 02:16:04,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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-01-28 02:16:04,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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-01-28 02:16:04,688 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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-01-28 02:16:04,688 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 70 flow. Second operand 4 states and 243 transitions. [2023-01-28 02:16:04,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 142 flow [2023-01-28 02:16:04,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 02:16:04,689 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 62 flow [2023-01-28 02:16:04,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-01-28 02:16:04,690 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2023-01-28 02:16:04,692 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 62 flow [2023-01-28 02:16:04,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 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-01-28 02:16:04,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:16:04,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:16:04,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 02:16:04,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:16:04,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:16:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1582616416, now seen corresponding path program 2 times [2023-01-28 02:16:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:16:04,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080898224] [2023-01-28 02:16:04,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:16:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:16:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:16:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:04,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:16:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080898224] [2023-01-28 02:16:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080898224] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 02:16:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556698599] [2023-01-28 02:16:04,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 02:16:04,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:16:04,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 02:16:04,773 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-01-28 02:16:04,781 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-01-28 02:16:04,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 02:16:04,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 02:16:04,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-28 02:16:04,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 02:16:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:05,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 02:16:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:05,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556698599] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 02:16:05,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 02:16:05,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-01-28 02:16:05,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211086027] [2023-01-28 02:16:05,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 02:16:05,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 02:16:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:16:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 02:16:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 02:16:05,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 02:16:05,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 02:16:05,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:16:05,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 02:16:05,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:16:05,248 INFO L130 PetriNetUnfolder]: 34/63 cut-off events. [2023-01-28 02:16:05,250 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-01-28 02:16:05,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 63 events. 34/63 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 4 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 49. Up to 39 conditions per place. [2023-01-28 02:16:05,253 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-01-28 02:16:05,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 155 flow [2023-01-28 02:16:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 02:16:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 02:16:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2023-01-28 02:16:05,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225352112676056 [2023-01-28 02:16:05,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 300 transitions. [2023-01-28 02:16:05,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 300 transitions. [2023-01-28 02:16:05,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:16:05,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 300 transitions. [2023-01-28 02:16:05,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 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-01-28 02:16:05,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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-01-28 02:16:05,257 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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-01-28 02:16:05,257 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 62 flow. Second operand 5 states and 300 transitions. [2023-01-28 02:16:05,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 155 flow [2023-01-28 02:16:05,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 147 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 02:16:05,258 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2023-01-28 02:16:05,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2023-01-28 02:16:05,259 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2023-01-28 02:16:05,260 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2023-01-28 02:16:05,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 02:16:05,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:16:05,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:16:05,271 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-01-28 02:16:05,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:16:05,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:16:05,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:16:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 410010517, now seen corresponding path program 2 times [2023-01-28 02:16:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:16:05,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170331570] [2023-01-28 02:16:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:16:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:16:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:16:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:05,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:16:05,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170331570] [2023-01-28 02:16:05,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170331570] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 02:16:05,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 02:16:05,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 02:16:05,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342919760] [2023-01-28 02:16:05,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 02:16:05,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 02:16:05,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:16:05,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 02:16:05,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 02:16:05,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2023-01-28 02:16:05,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 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-01-28 02:16:05,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:16:05,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2023-01-28 02:16:05,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:16:05,618 INFO L130 PetriNetUnfolder]: 40/73 cut-off events. [2023-01-28 02:16:05,619 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-01-28 02:16:05,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 73 events. 40/73 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 4 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 119. Up to 61 conditions per place. [2023-01-28 02:16:05,622 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-01-28 02:16:05,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 178 flow [2023-01-28 02:16:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 02:16:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 02:16:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2023-01-28 02:16:05,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3816901408450704 [2023-01-28 02:16:05,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 271 transitions. [2023-01-28 02:16:05,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 271 transitions. [2023-01-28 02:16:05,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:16:05,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 271 transitions. [2023-01-28 02:16:05,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 02:16:05,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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-01-28 02:16:05,626 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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-01-28 02:16:05,626 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 5 states and 271 transitions. [2023-01-28 02:16:05,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 178 flow [2023-01-28 02:16:05,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 02:16:05,630 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 127 flow [2023-01-28 02:16:05,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-01-28 02:16:05,632 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 12 predicate places. [2023-01-28 02:16:05,632 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 127 flow [2023-01-28 02:16:05,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 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-01-28 02:16:05,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:16:05,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:16:05,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 02:16:05,633 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:16:05,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:16:05,633 INFO L85 PathProgramCache]: Analyzing trace with hash 656812837, now seen corresponding path program 1 times [2023-01-28 02:16:05,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:16:05,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177719309] [2023-01-28 02:16:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:16:05,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:16:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:16:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:16:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177719309] [2023-01-28 02:16:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177719309] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 02:16:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294873773] [2023-01-28 02:16:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:16:05,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:16:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 02:16:05,921 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-01-28 02:16:05,936 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-01-28 02:16:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:16:06,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 02:16:06,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 02:16:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:21,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 02:16:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:16:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294873773] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 02:16:25,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 02:16:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-01-28 02:16:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926177701] [2023-01-28 02:16:25,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 02:16:25,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 02:16:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:16:25,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 02:16:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=147, Unknown=7, NotChecked=0, Total=210 [2023-01-28 02:16:25,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 02:16:25,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 127 flow. Second operand has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 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-01-28 02:16:25,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:16:25,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 02:16:25,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:16:27,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:16:42,262 WARN L222 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 52 DAG size of output: 17 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 02:16:44,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:16:46,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:02,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:04,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:06,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:08,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:29,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:31,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:40,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:17:40,909 INFO L130 PetriNetUnfolder]: 122/236 cut-off events. [2023-01-28 02:17:40,909 INFO L131 PetriNetUnfolder]: For 401/401 co-relation queries the response was YES. [2023-01-28 02:17:40,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 236 events. 122/236 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 830 event pairs, 0 based on Foata normal form. 7/243 useless extension candidates. Maximal degree in co-relation 580. Up to 79 conditions per place. [2023-01-28 02:17:40,910 INFO L137 encePairwiseOnDemand]: 136/142 looper letters, 53 selfloop transitions, 29 changer transitions 22/104 dead transitions. [2023-01-28 02:17:40,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 104 transitions, 719 flow [2023-01-28 02:17:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 02:17:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 02:17:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1018 transitions. [2023-01-28 02:17:40,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217067108533554 [2023-01-28 02:17:40,915 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1018 transitions. [2023-01-28 02:17:40,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1018 transitions. [2023-01-28 02:17:40,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:17:40,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1018 transitions. [2023-01-28 02:17:40,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 59.88235294117647) internal successors, (1018), 17 states have internal predecessors, (1018), 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-01-28 02:17:40,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 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-01-28 02:17:40,922 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 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-01-28 02:17:40,922 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 127 flow. Second operand 17 states and 1018 transitions. [2023-01-28 02:17:40,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 104 transitions, 719 flow [2023-01-28 02:17:40,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 104 transitions, 692 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-01-28 02:17:40,927 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 403 flow [2023-01-28 02:17:40,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=403, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-01-28 02:17:40,927 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 33 predicate places. [2023-01-28 02:17:40,928 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 403 flow [2023-01-28 02:17:40,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 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-01-28 02:17:40,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:17:40,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:17:40,936 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-01-28 02:17:41,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-28 02:17:41,133 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:17:41,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:17:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1905891163, now seen corresponding path program 2 times [2023-01-28 02:17:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:17:41,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150481488] [2023-01-28 02:17:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:17:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:17:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:17:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:17:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:17:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150481488] [2023-01-28 02:17:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150481488] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 02:17:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963019581] [2023-01-28 02:17:41,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 02:17:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:17:41,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 02:17:41,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 02:17:41,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 02:17:41,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 02:17:41,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 02:17:41,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 02:17:41,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 02:17:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:17:46,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 02:17:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:17:49,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963019581] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 02:17:49,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 02:17:49,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-01-28 02:17:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988979250] [2023-01-28 02:17:49,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 02:17:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 02:17:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:17:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 02:17:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-01-28 02:17:49,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 02:17:49,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 403 flow. Second operand has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 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-01-28 02:17:49,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:17:49,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 02:17:49,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:17:51,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:18:01,018 WARN L222 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 02:18:12,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:18:21,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:18:29,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:18:31,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:18:35,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:18:36,632 INFO L130 PetriNetUnfolder]: 193/382 cut-off events. [2023-01-28 02:18:36,632 INFO L131 PetriNetUnfolder]: For 1011/1011 co-relation queries the response was YES. [2023-01-28 02:18:36,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 382 events. 193/382 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1627 event pairs, 14 based on Foata normal form. 5/387 useless extension candidates. Maximal degree in co-relation 1729. Up to 179 conditions per place. [2023-01-28 02:18:36,635 INFO L137 encePairwiseOnDemand]: 136/142 looper letters, 92 selfloop transitions, 31 changer transitions 13/136 dead transitions. [2023-01-28 02:18:36,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 136 transitions, 1172 flow [2023-01-28 02:18:36,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 02:18:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 02:18:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1028 transitions. [2023-01-28 02:18:36,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258492129246065 [2023-01-28 02:18:36,650 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1028 transitions. [2023-01-28 02:18:36,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1028 transitions. [2023-01-28 02:18:36,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:18:36,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1028 transitions. [2023-01-28 02:18:36,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 60.470588235294116) internal successors, (1028), 17 states have internal predecessors, (1028), 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-01-28 02:18:36,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 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-01-28 02:18:36,656 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 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-01-28 02:18:36,656 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 403 flow. Second operand 17 states and 1028 transitions. [2023-01-28 02:18:36,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 136 transitions, 1172 flow [2023-01-28 02:18:36,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 136 transitions, 936 flow, removed 114 selfloop flow, removed 4 redundant places. [2023-01-28 02:18:36,663 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 567 flow [2023-01-28 02:18:36,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=567, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2023-01-28 02:18:36,664 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 52 predicate places. [2023-01-28 02:18:36,664 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 567 flow [2023-01-28 02:18:36,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 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-01-28 02:18:36,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:18:36,664 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:18:36,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 02:18:36,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:18:36,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:18:36,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:18:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash -977596715, now seen corresponding path program 3 times [2023-01-28 02:18:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:18:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121739100] [2023-01-28 02:18:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:18:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:18:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:18:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:18:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:18:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121739100] [2023-01-28 02:18:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121739100] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 02:18:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169414591] [2023-01-28 02:18:37,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 02:18:37,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:18:37,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 02:18:37,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 02:18:37,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 02:18:38,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 02:18:38,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 02:18:38,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-01-28 02:18:38,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 02:18:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 02:18:38,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 02:18:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169414591] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 02:18:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 02:18:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2023-01-28 02:18:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627992866] [2023-01-28 02:18:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 02:18:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 02:18:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:18:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 02:18:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-28 02:18:38,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 142 [2023-01-28 02:18:38,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-01-28 02:18:38,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:18:38,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 142 [2023-01-28 02:18:38,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:18:38,812 INFO L130 PetriNetUnfolder]: 109/217 cut-off events. [2023-01-28 02:18:38,812 INFO L131 PetriNetUnfolder]: For 946/946 co-relation queries the response was YES. [2023-01-28 02:18:38,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 217 events. 109/217 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 762 event pairs, 20 based on Foata normal form. 4/221 useless extension candidates. Maximal degree in co-relation 1094. Up to 213 conditions per place. [2023-01-28 02:18:38,814 INFO L137 encePairwiseOnDemand]: 139/142 looper letters, 43 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-01-28 02:18:38,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 495 flow [2023-01-28 02:18:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 02:18:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 02:18:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2023-01-28 02:18:38,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.431924882629108 [2023-01-28 02:18:38,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 184 transitions. [2023-01-28 02:18:38,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 184 transitions. [2023-01-28 02:18:38,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:18:38,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 184 transitions. [2023-01-28 02:18:38,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-01-28 02:18:38,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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-01-28 02:18:38,816 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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-01-28 02:18:38,817 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 567 flow. Second operand 3 states and 184 transitions. [2023-01-28 02:18:38,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 495 flow [2023-01-28 02:18:38,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 350 flow, removed 65 selfloop flow, removed 8 redundant places. [2023-01-28 02:18:38,822 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 262 flow [2023-01-28 02:18:38,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-01-28 02:18:38,824 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 32 predicate places. [2023-01-28 02:18:38,824 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 262 flow [2023-01-28 02:18:38,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-01-28 02:18:38,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:18:38,825 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:18:38,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 02:18:39,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:18:39,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:18:39,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:18:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash -570227179, now seen corresponding path program 4 times [2023-01-28 02:18:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:18:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57075831] [2023-01-28 02:18:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:18:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:18:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:18:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:18:39,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:18:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57075831] [2023-01-28 02:18:39,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57075831] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 02:18:39,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545628312] [2023-01-28 02:18:39,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 02:18:39,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:18:39,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 02:18:39,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 02:18:39,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 02:18:40,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 02:18:40,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 02:18:40,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-01-28 02:18:40,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 02:18:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:18:52,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 02:20:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:20:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545628312] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 02:20:05,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 02:20:05,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2023-01-28 02:20:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931701412] [2023-01-28 02:20:05,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 02:20:05,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-28 02:20:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:20:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-28 02:20:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=175, Unknown=6, NotChecked=0, Total=240 [2023-01-28 02:20:05,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 02:20:05,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 262 flow. Second operand has 16 states, 16 states have (on average 56.375) internal successors, (902), 16 states have internal predecessors, (902), 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-01-28 02:20:05,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:20:05,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 02:20:05,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:20:07,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:09,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:11,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:21,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:23,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:25,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:34,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:36,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:38,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:40,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:57,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:20:59,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:01,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:03,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:06,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:08,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:12,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:14,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:19,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:21,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:24,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:26,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:29,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:34,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:40,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:44,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:21:53,186 WARN L222 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 114 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 02:21:58,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:22:00,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:22:15,509 WARN L222 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 103 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 02:22:18,403 INFO L130 PetriNetUnfolder]: 167/336 cut-off events. [2023-01-28 02:22:18,404 INFO L131 PetriNetUnfolder]: For 948/948 co-relation queries the response was YES. [2023-01-28 02:22:18,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 336 events. 167/336 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1421 event pairs, 10 based on Foata normal form. 9/339 useless extension candidates. Maximal degree in co-relation 1225. Up to 130 conditions per place. [2023-01-28 02:22:18,405 INFO L137 encePairwiseOnDemand]: 136/142 looper letters, 78 selfloop transitions, 39 changer transitions 17/134 dead transitions. [2023-01-28 02:22:18,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 134 transitions, 933 flow [2023-01-28 02:22:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 02:22:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-28 02:22:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1351 transitions. [2023-01-28 02:22:18,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4136558481322719 [2023-01-28 02:22:18,409 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1351 transitions. [2023-01-28 02:22:18,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1351 transitions. [2023-01-28 02:22:18,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 02:22:18,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1351 transitions. [2023-01-28 02:22:18,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 58.73913043478261) internal successors, (1351), 23 states have internal predecessors, (1351), 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-01-28 02:22:18,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 142.0) internal successors, (3408), 24 states have internal predecessors, (3408), 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-01-28 02:22:18,414 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 142.0) internal successors, (3408), 24 states have internal predecessors, (3408), 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-01-28 02:22:18,414 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 262 flow. Second operand 23 states and 1351 transitions. [2023-01-28 02:22:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 134 transitions, 933 flow [2023-01-28 02:22:18,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 134 transitions, 913 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-28 02:22:18,419 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 504 flow [2023-01-28 02:22:18,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=504, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-01-28 02:22:18,420 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 57 predicate places. [2023-01-28 02:22:18,420 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 504 flow [2023-01-28 02:22:18,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 56.375) internal successors, (902), 16 states have internal predecessors, (902), 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-01-28 02:22:18,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 02:22:18,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 02:22:18,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 02:22:18,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:22:18,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 02:22:18,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 02:22:18,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1425533833, now seen corresponding path program 5 times [2023-01-28 02:22:18,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 02:22:18,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145919591] [2023-01-28 02:22:18,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 02:22:18,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 02:22:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 02:22:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:22:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 02:22:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145919591] [2023-01-28 02:22:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145919591] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 02:22:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262566229] [2023-01-28 02:22:18,725 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 02:22:18,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 02:22:18,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 02:22:18,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 02:22:18,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 02:26:33,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 02:26:33,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 02:26:33,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-01-28 02:26:33,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 02:26:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:26:40,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 02:27:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 02:27:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262566229] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 02:27:27,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 02:27:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-01-28 02:27:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390872126] [2023-01-28 02:27:27,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 02:27:27,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 02:27:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 02:27:27,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 02:27:27,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=145, Unknown=5, NotChecked=0, Total=210 [2023-01-28 02:27:27,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 02:27:27,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 504 flow. Second operand has 15 states, 15 states have (on average 56.46666666666667) internal successors, (847), 15 states have internal predecessors, (847), 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-01-28 02:27:27,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 02:27:27,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 02:27:27,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 02:27:33,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:36,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:38,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:40,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:46,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:48,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:50,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:52,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:54,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:56,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:27:59,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:01,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:39,810 WARN L222 SmtUtils]: Spent 27.92s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 02:28:41,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:43,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:45,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:46,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:48,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:50,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:52,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:54,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:56,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:28:59,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:01,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:03,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:05,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:13,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:15,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:17,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:19,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:21,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:23,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:25,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:27,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:30,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:32,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:34,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:36,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:39,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:41,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:43,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:45,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:48,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:52,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:54,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:57,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:29:59,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:30:00,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 02:30:14,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-01-28 02:30:41,831 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 02:30:41,856 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 02:30:42,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 02:30:43,032 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-28 02:30:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 02:30:43,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 02:30:43,037 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-28 02:30:43,040 INFO L158 Benchmark]: Toolchain (without parser) took 881459.10ms. Allocated memory was 427.8MB in the beginning and 513.8MB in the end (delta: 86.0MB). Free memory was 379.1MB in the beginning and 297.1MB in the end (delta: 82.1MB). Peak memory consumption was 170.9MB. Max. memory is 16.0GB. [2023-01-28 02:30:43,040 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 02:30:43,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.97ms. Allocated memory is still 427.8MB. Free memory was 378.9MB in the beginning and 368.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 02:30:43,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.10ms. Allocated memory is still 427.8MB. Free memory was 368.4MB in the beginning and 366.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 02:30:43,040 INFO L158 Benchmark]: Boogie Preprocessor took 26.25ms. Allocated memory is still 427.8MB. Free memory was 366.8MB in the beginning and 365.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 02:30:43,040 INFO L158 Benchmark]: RCFGBuilder took 306.20ms. Allocated memory is still 427.8MB. Free memory was 365.6MB in the beginning and 353.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 02:30:43,041 INFO L158 Benchmark]: TraceAbstraction took 880893.38ms. Allocated memory was 427.8MB in the beginning and 513.8MB in the end (delta: 86.0MB). Free memory was 352.7MB in the beginning and 297.1MB in the end (delta: 55.7MB). Peak memory consumption was 143.6MB. Max. memory is 16.0GB. [2023-01-28 02:30:43,041 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-01-28 02:30:43,036 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 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 190.97ms. Allocated memory is still 427.8MB. Free memory was 378.9MB in the beginning and 368.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.10ms. Allocated memory is still 427.8MB. Free memory was 368.4MB in the beginning and 366.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.25ms. Allocated memory is still 427.8MB. Free memory was 366.8MB in the beginning and 365.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 306.20ms. Allocated memory is still 427.8MB. Free memory was 365.6MB in the beginning and 353.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 880893.38ms. Allocated memory was 427.8MB in the beginning and 513.8MB in the end (delta: 86.0MB). Free memory was 352.7MB in the beginning and 297.1MB in the end (delta: 55.7MB). Peak memory consumption was 143.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 68 PlacesBefore, 18 PlacesAfterwards, 67 TransitionsBefore, 13 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 65 TotalNumberOfCompositions, 297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 297, independent conditional: 0, independent unconditional: 297, 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: 140, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 297, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown