/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 20:41:06,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 20:41:06,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 20:41:06,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 20:41:06,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 20:41:06,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 20:41:06,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 20:41:06,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 20:41:06,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 20:41:06,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 20:41:06,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 20:41:06,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 20:41:06,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 20:41:06,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 20:41:06,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 20:41:06,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 20:41:06,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 20:41:06,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 20:41:06,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 20:41:06,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 20:41:06,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 20:41:06,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 20:41:06,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 20:41:06,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 20:41:06,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 20:41:06,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 20:41:06,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 20:41:06,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 20:41:06,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 20:41:06,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 20:41:06,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 20:41:06,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 20:41:06,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 20:41:06,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 20:41:06,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 20:41:06,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 20:41:06,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 20:41:06,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 20:41:06,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 20:41:06,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 20:41:06,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 20:41:06,606 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-27 20:41:06,619 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 20:41:06,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 20:41:06,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 20:41:06,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 20:41:06,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 20:41:06,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 20:41:06,621 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 20:41:06,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 20:41:06,621 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 20:41:06,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 20:41:06,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 20:41:06,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 20:41:06,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 20:41:06,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 20:41:06,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 20:41:06,622 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 20:41:06,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 20:41:06,622 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 20:41:06,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 20:41:06,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 20:41:06,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 20:41:06,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 20:41:06,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 20:41:06,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 20:41:06,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 20:41:06,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 20:41:06,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 20:41:06,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 20:41:06,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 20:41:06,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 20:41:06,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 20:41:06,624 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 [2023-01-27 20:41:06,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 20:41:06,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 20:41:06,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 20:41:06,818 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 20:41:06,818 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 20:41:06,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2023-01-27 20:41:07,732 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 20:41:07,917 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 20:41:07,917 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2023-01-27 20:41:07,921 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5a85579/1fe358fe0fc9421b96382f55fba53f74/FLAGca5563acb [2023-01-27 20:41:07,933 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5a85579/1fe358fe0fc9421b96382f55fba53f74 [2023-01-27 20:41:07,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 20:41:07,936 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 20:41:07,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 20:41:07,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 20:41:07,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 20:41:07,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 08:41:07" (1/1) ... [2023-01-27 20:41:07,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f673e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:07, skipping insertion in model container [2023-01-27 20:41:07,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 08:41:07" (1/1) ... [2023-01-27 20:41:07,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 20:41:07,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 20:41:08,075 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/loop-tiling-eq.wvr.c[2618,2631] [2023-01-27 20:41:08,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 20:41:08,094 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 20:41:08,126 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/loop-tiling-eq.wvr.c[2618,2631] [2023-01-27 20:41:08,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 20:41:08,142 INFO L208 MainTranslator]: Completed translation [2023-01-27 20:41:08,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08 WrapperNode [2023-01-27 20:41:08,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 20:41:08,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 20:41:08,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 20:41:08,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 20:41:08,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,183 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 193 [2023-01-27 20:41:08,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 20:41:08,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 20:41:08,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 20:41:08,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 20:41:08,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 20:41:08,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 20:41:08,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 20:41:08,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 20:41:08,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (1/1) ... [2023-01-27 20:41:08,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 20:41:08,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:08,251 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-27 20:41:08,257 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-27 20:41:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 20:41:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-01-27 20:41:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 20:41:08,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 20:41:08,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 20:41:08,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 20:41:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 20:41:08,280 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 20:41:08,408 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 20:41:08,410 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 20:41:08,738 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 20:41:08,748 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 20:41:08,748 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-01-27 20:41:08,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 08:41:08 BoogieIcfgContainer [2023-01-27 20:41:08,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 20:41:08,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 20:41:08,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 20:41:08,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 20:41:08,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 08:41:07" (1/3) ... [2023-01-27 20:41:08,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75540ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 08:41:08, skipping insertion in model container [2023-01-27 20:41:08,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 08:41:08" (2/3) ... [2023-01-27 20:41:08,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75540ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 08:41:08, skipping insertion in model container [2023-01-27 20:41:08,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 08:41:08" (3/3) ... [2023-01-27 20:41:08,760 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2023-01-27 20:41:08,774 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 20:41:08,775 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 20:41:08,775 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 20:41:08,829 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 20:41:08,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 257 transitions, 530 flow [2023-01-27 20:41:08,915 INFO L130 PetriNetUnfolder]: 26/255 cut-off events. [2023-01-27 20:41:08,915 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 20:41:08,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 255 events. 26/255 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 273 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 191. Up to 2 conditions per place. [2023-01-27 20:41:08,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 257 transitions, 530 flow [2023-01-27 20:41:08,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 247 transitions, 506 flow [2023-01-27 20:41:08,932 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 20:41:08,948 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 247 transitions, 506 flow [2023-01-27 20:41:08,950 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 247 transitions, 506 flow [2023-01-27 20:41:08,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 247 transitions, 506 flow [2023-01-27 20:41:09,002 INFO L130 PetriNetUnfolder]: 26/247 cut-off events. [2023-01-27 20:41:09,002 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 20:41:09,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 247 events. 26/247 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 273 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 191. Up to 2 conditions per place. [2023-01-27 20:41:09,004 INFO L119 LiptonReduction]: Number of co-enabled transitions 972 [2023-01-27 20:41:24,865 INFO L134 LiptonReduction]: Checked pairs total: 1519 [2023-01-27 20:41:24,865 INFO L136 LiptonReduction]: Total number of compositions: 276 [2023-01-27 20:41:24,874 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 20:41:24,878 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;@8f6c388, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 20:41:24,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-27 20:41:24,883 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2023-01-27 20:41:24,883 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 20:41:24,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:24,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:24,884 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-27 20:41:24,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2101152341, now seen corresponding path program 1 times [2023-01-27 20:41:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:24,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009860597] [2023-01-27 20:41:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:24,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:24,958 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:24,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540263730] [2023-01-27 20:41:24,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:24,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:24,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:24,961 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-27 20:41:24,985 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-27 20:41:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:25,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-27 20:41:25,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:25,133 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-27 20:41:25,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 20:41:25,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:41:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009860597] [2023-01-27 20:41:25,134 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:41:25,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540263730] [2023-01-27 20:41:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540263730] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:41:25,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:41:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 20:41:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590110979] [2023-01-27 20:41:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:41:25,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 20:41:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:41:25,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 20:41:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 20:41:25,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 533 [2023-01-27 20:41:25,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 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-27 20:41:25,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:41:25,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 533 [2023-01-27 20:41:25,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:41:25,327 INFO L130 PetriNetUnfolder]: 205/348 cut-off events. [2023-01-27 20:41:25,328 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-01-27 20:41:25,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 348 events. 205/348 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1363 event pairs, 100 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 278. Up to 166 conditions per place. [2023-01-27 20:41:25,330 INFO L137 encePairwiseOnDemand]: 529/533 looper letters, 26 selfloop transitions, 2 changer transitions 16/47 dead transitions. [2023-01-27 20:41:25,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 206 flow [2023-01-27 20:41:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 20:41:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 20:41:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 909 transitions. [2023-01-27 20:41:25,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4263602251407129 [2023-01-27 20:41:25,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 909 transitions. [2023-01-27 20:41:25,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 909 transitions. [2023-01-27 20:41:25,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:41:25,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 909 transitions. [2023-01-27 20:41:25,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 227.25) internal successors, (909), 4 states have internal predecessors, (909), 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-27 20:41:25,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 533.0) internal successors, (2665), 5 states have internal predecessors, (2665), 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-27 20:41:25,354 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 533.0) internal successors, (2665), 5 states have internal predecessors, (2665), 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-27 20:41:25,356 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 68 flow. Second operand 4 states and 909 transitions. [2023-01-27 20:41:25,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 47 transitions, 206 flow [2023-01-27 20:41:25,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 20:41:25,359 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 74 flow [2023-01-27 20:41:25,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-01-27 20:41:25,362 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2023-01-27 20:41:25,362 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 74 flow [2023-01-27 20:41:25,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 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-27 20:41:25,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:25,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:25,370 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-27 20:41:25,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-01-27 20:41:25,569 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-27 20:41:25,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1311819515, now seen corresponding path program 1 times [2023-01-27 20:41:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687171635] [2023-01-27 20:41:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:25,580 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:25,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844894616] [2023-01-27 20:41:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:25,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:25,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:25,581 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-27 20:41:25,593 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-27 20:41:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:25,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2023-01-27 20:41:25,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:25,688 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-27 20:41:25,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:41:25,713 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-27 20:41:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:41:25,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687171635] [2023-01-27 20:41:25,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:41:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844894616] [2023-01-27 20:41:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844894616] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:41:25,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:41:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-01-27 20:41:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50691740] [2023-01-27 20:41:25,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-01-27 20:41:25,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 20:41:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:41:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 20:41:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-27 20:41:25,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 533 [2023-01-27 20:41:25,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 214.16666666666666) internal successors, (1285), 6 states have internal predecessors, (1285), 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-27 20:41:25,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:41:25,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 533 [2023-01-27 20:41:25,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:41:25,826 INFO L130 PetriNetUnfolder]: 194/311 cut-off events. [2023-01-27 20:41:25,826 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-01-27 20:41:25,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 311 events. 194/311 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1013 event pairs, 32 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 629. Up to 114 conditions per place. [2023-01-27 20:41:25,831 INFO L137 encePairwiseOnDemand]: 527/533 looper letters, 40 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2023-01-27 20:41:25,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 204 flow [2023-01-27 20:41:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 20:41:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 20:41:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1312 transitions. [2023-01-27 20:41:25,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2023-01-27 20:41:25,835 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1312 transitions. [2023-01-27 20:41:25,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1312 transitions. [2023-01-27 20:41:25,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:41:25,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1312 transitions. [2023-01-27 20:41:25,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 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-27 20:41:25,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 533.0) internal successors, (3731), 7 states have internal predecessors, (3731), 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-27 20:41:25,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 533.0) internal successors, (3731), 7 states have internal predecessors, (3731), 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-27 20:41:25,843 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 74 flow. Second operand 6 states and 1312 transitions. [2023-01-27 20:41:25,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 204 flow [2023-01-27 20:41:25,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 47 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 20:41:25,844 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 103 flow [2023-01-27 20:41:25,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2023-01-27 20:41:25,845 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2023-01-27 20:41:25,846 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 103 flow [2023-01-27 20:41:25,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.16666666666666) internal successors, (1285), 6 states have internal predecessors, (1285), 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-27 20:41:25,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:25,847 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:25,852 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-27 20:41:26,051 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,SelfDestructingSolverStorable1 [2023-01-27 20:41:26,052 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-27 20:41:26,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:26,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1014923716, now seen corresponding path program 1 times [2023-01-27 20:41:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:26,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714887241] [2023-01-27 20:41:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:26,063 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [192435352] [2023-01-27 20:41:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:26,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:26,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:26,064 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-27 20:41:26,066 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-27 20:41:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:26,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2023-01-27 20:41:26,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 20:41:26,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 20:41:26,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:41:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714887241] [2023-01-27 20:41:26,176 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:41:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192435352] [2023-01-27 20:41:26,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192435352] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:41:26,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:41:26,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 20:41:26,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924163731] [2023-01-27 20:41:26,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:41:26,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 20:41:26,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:41:26,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 20:41:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 20:41:26,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 533 [2023-01-27 20:41:26,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 193.5) internal successors, (774), 4 states have internal predecessors, (774), 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-27 20:41:26,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:41:26,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 533 [2023-01-27 20:41:26,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:41:26,319 INFO L130 PetriNetUnfolder]: 528/850 cut-off events. [2023-01-27 20:41:26,319 INFO L131 PetriNetUnfolder]: For 135/171 co-relation queries the response was YES. [2023-01-27 20:41:26,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 850 events. 528/850 cut-off events. For 135/171 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3736 event pairs, 312 based on Foata normal form. 38/766 useless extension candidates. Maximal degree in co-relation 1272. Up to 285 conditions per place. [2023-01-27 20:41:26,323 INFO L137 encePairwiseOnDemand]: 529/533 looper letters, 28 selfloop transitions, 3 changer transitions 46/79 dead transitions. [2023-01-27 20:41:26,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 79 transitions, 403 flow [2023-01-27 20:41:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:41:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:41:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1015 transitions. [2023-01-27 20:41:26,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3808630393996248 [2023-01-27 20:41:26,325 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1015 transitions. [2023-01-27 20:41:26,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1015 transitions. [2023-01-27 20:41:26,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:41:26,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1015 transitions. [2023-01-27 20:41:26,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 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-27 20:41:26,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:26,331 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:26,332 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 103 flow. Second operand 5 states and 1015 transitions. [2023-01-27 20:41:26,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 79 transitions, 403 flow [2023-01-27 20:41:26,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 20:41:26,335 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 125 flow [2023-01-27 20:41:26,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-01-27 20:41:26,336 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2023-01-27 20:41:26,337 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 125 flow [2023-01-27 20:41:26,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.5) internal successors, (774), 4 states have internal predecessors, (774), 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-27 20:41:26,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:26,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:26,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-27 20:41:26,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:26,542 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-27 20:41:26,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:26,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1495140604, now seen corresponding path program 1 times [2023-01-27 20:41:26,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:26,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788369752] [2023-01-27 20:41:26,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:26,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:26,554 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410291024] [2023-01-27 20:41:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:26,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:26,565 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-27 20:41:26,567 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-27 20:41:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:26,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 20:41:26,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:41:26,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:41:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 20:41:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:41:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788369752] [2023-01-27 20:41:26,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:41:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410291024] [2023-01-27 20:41:26,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410291024] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:41:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 20:41:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-01-27 20:41:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233356632] [2023-01-27 20:41:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:41:26,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 20:41:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:41:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 20:41:26,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:41:26,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 533 [2023-01-27 20:41:26,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 188.8) internal successors, (944), 5 states have internal predecessors, (944), 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-27 20:41:26,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:41:26,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 533 [2023-01-27 20:41:26,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:41:26,924 INFO L130 PetriNetUnfolder]: 212/348 cut-off events. [2023-01-27 20:41:26,924 INFO L131 PetriNetUnfolder]: For 60/68 co-relation queries the response was YES. [2023-01-27 20:41:26,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 348 events. 212/348 cut-off events. For 60/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1057 event pairs, 56 based on Foata normal form. 28/323 useless extension candidates. Maximal degree in co-relation 798. Up to 176 conditions per place. [2023-01-27 20:41:26,926 INFO L137 encePairwiseOnDemand]: 524/533 looper letters, 35 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2023-01-27 20:41:26,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 254 flow [2023-01-27 20:41:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:41:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:41:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 965 transitions. [2023-01-27 20:41:26,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3621013133208255 [2023-01-27 20:41:26,929 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 965 transitions. [2023-01-27 20:41:26,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 965 transitions. [2023-01-27 20:41:26,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:41:26,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 965 transitions. [2023-01-27 20:41:26,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-27 20:41:26,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:26,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:26,935 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 125 flow. Second operand 5 states and 965 transitions. [2023-01-27 20:41:26,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 254 flow [2023-01-27 20:41:26,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 239 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-27 20:41:26,937 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 178 flow [2023-01-27 20:41:26,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-01-27 20:41:26,938 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2023-01-27 20:41:26,938 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 178 flow [2023-01-27 20:41:26,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.8) internal successors, (944), 5 states have internal predecessors, (944), 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-27 20:41:26,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:26,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:26,946 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-27 20:41:27,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:27,144 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-27 20:41:27,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash 894191198, now seen corresponding path program 1 times [2023-01-27 20:41:27,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:27,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701238115] [2023-01-27 20:41:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:27,155 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:27,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214745815] [2023-01-27 20:41:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:27,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:27,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:27,157 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-27 20:41:27,159 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-27 20:41:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:27,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 20:41:27,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:27,458 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-27 20:41:27,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 20:41:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:41:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701238115] [2023-01-27 20:41:27,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:41:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214745815] [2023-01-27 20:41:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214745815] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 20:41:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 20:41:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 20:41:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295547252] [2023-01-27 20:41:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:41:27,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 20:41:27,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:41:27,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 20:41:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-27 20:41:27,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 533 [2023-01-27 20:41:27,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 178.66666666666666) internal successors, (1072), 6 states have internal predecessors, (1072), 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-27 20:41:27,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:41:27,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 533 [2023-01-27 20:41:27,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:41:27,638 INFO L130 PetriNetUnfolder]: 212/350 cut-off events. [2023-01-27 20:41:27,638 INFO L131 PetriNetUnfolder]: For 127/135 co-relation queries the response was YES. [2023-01-27 20:41:27,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 350 events. 212/350 cut-off events. For 127/135 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1056 event pairs, 128 based on Foata normal form. 9/307 useless extension candidates. Maximal degree in co-relation 925. Up to 339 conditions per place. [2023-01-27 20:41:27,640 INFO L137 encePairwiseOnDemand]: 526/533 looper letters, 31 selfloop transitions, 2 changer transitions 7/42 dead transitions. [2023-01-27 20:41:27,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 282 flow [2023-01-27 20:41:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 20:41:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 20:41:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1435 transitions. [2023-01-27 20:41:27,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33653846153846156 [2023-01-27 20:41:27,643 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1435 transitions. [2023-01-27 20:41:27,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1435 transitions. [2023-01-27 20:41:27,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:41:27,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1435 transitions. [2023-01-27 20:41:27,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 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-27 20:41:27,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 533.0) internal successors, (4797), 9 states have internal predecessors, (4797), 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-27 20:41:27,650 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 533.0) internal successors, (4797), 9 states have internal predecessors, (4797), 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-27 20:41:27,650 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 178 flow. Second operand 8 states and 1435 transitions. [2023-01-27 20:41:27,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 282 flow [2023-01-27 20:41:27,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 20:41:27,652 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 162 flow [2023-01-27 20:41:27,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2023-01-27 20:41:27,652 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 24 predicate places. [2023-01-27 20:41:27,653 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 162 flow [2023-01-27 20:41:27,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.66666666666666) internal successors, (1072), 6 states have internal predecessors, (1072), 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-27 20:41:27,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:27,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:27,658 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-27 20:41:27,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:27,859 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-27 20:41:27,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1413036971, now seen corresponding path program 1 times [2023-01-27 20:41:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931536734] [2023-01-27 20:41:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:27,869 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:27,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019527482] [2023-01-27 20:41:27,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:27,871 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-27 20:41:27,872 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-27 20:41:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:27,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 20:41:27,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 20:41:28,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:41:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 20:41:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:41:28,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931536734] [2023-01-27 20:41:28,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:41:28,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019527482] [2023-01-27 20:41:28,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019527482] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:41:28,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 20:41:28,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-01-27 20:41:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797382777] [2023-01-27 20:41:28,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:41:28,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 20:41:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:41:28,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 20:41:28,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:41:28,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 533 [2023-01-27 20:41:28,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 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-27 20:41:28,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:41:28,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 533 [2023-01-27 20:41:28,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:41:28,090 INFO L130 PetriNetUnfolder]: 178/310 cut-off events. [2023-01-27 20:41:28,091 INFO L131 PetriNetUnfolder]: For 137/145 co-relation queries the response was YES. [2023-01-27 20:41:28,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 310 events. 178/310 cut-off events. For 137/145 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 972 event pairs, 104 based on Foata normal form. 9/274 useless extension candidates. Maximal degree in co-relation 818. Up to 286 conditions per place. [2023-01-27 20:41:28,092 INFO L137 encePairwiseOnDemand]: 528/533 looper letters, 29 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-01-27 20:41:28,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 36 transitions, 232 flow [2023-01-27 20:41:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:41:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:41:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 998 transitions. [2023-01-27 20:41:28,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.374484052532833 [2023-01-27 20:41:28,095 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 998 transitions. [2023-01-27 20:41:28,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 998 transitions. [2023-01-27 20:41:28,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:41:28,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 998 transitions. [2023-01-27 20:41:28,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 199.6) internal successors, (998), 5 states have internal predecessors, (998), 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-27 20:41:28,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:28,099 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:28,099 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 162 flow. Second operand 5 states and 998 transitions. [2023-01-27 20:41:28,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 36 transitions, 232 flow [2023-01-27 20:41:28,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 212 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-01-27 20:41:28,101 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 160 flow [2023-01-27 20:41:28,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-01-27 20:41:28,101 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 17 predicate places. [2023-01-27 20:41:28,102 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 160 flow [2023-01-27 20:41:28,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 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-27 20:41:28,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:28,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:28,116 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-27 20:41:28,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:28,307 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-27 20:41:28,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash 527810065, now seen corresponding path program 1 times [2023-01-27 20:41:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:28,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129855610] [2023-01-27 20:41:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:28,317 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:28,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479212509] [2023-01-27 20:41:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:28,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:28,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:28,319 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:41:28,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 20:41:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:28,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 20:41:28,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 20:41:28,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:41:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-01-27 20:41:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:41:28,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129855610] [2023-01-27 20:41:28,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:41:28,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479212509] [2023-01-27 20:41:28,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479212509] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 20:41:28,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 20:41:28,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-01-27 20:41:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724602131] [2023-01-27 20:41:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 20:41:28,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 20:41:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:41:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 20:41:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-01-27 20:41:28,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 533 [2023-01-27 20:41:28,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 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-27 20:41:28,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:41:28,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 533 [2023-01-27 20:41:28,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:41:28,549 INFO L130 PetriNetUnfolder]: 193/340 cut-off events. [2023-01-27 20:41:28,549 INFO L131 PetriNetUnfolder]: For 262/276 co-relation queries the response was YES. [2023-01-27 20:41:28,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 340 events. 193/340 cut-off events. For 262/276 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1080 event pairs, 78 based on Foata normal form. 14/332 useless extension candidates. Maximal degree in co-relation 912. Up to 197 conditions per place. [2023-01-27 20:41:28,551 INFO L137 encePairwiseOnDemand]: 527/533 looper letters, 41 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-01-27 20:41:28,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 309 flow [2023-01-27 20:41:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 20:41:28,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 20:41:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 982 transitions. [2023-01-27 20:41:28,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36848030018761724 [2023-01-27 20:41:28,554 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 982 transitions. [2023-01-27 20:41:28,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 982 transitions. [2023-01-27 20:41:28,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:41:28,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 982 transitions. [2023-01-27 20:41:28,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.4) internal successors, (982), 5 states have internal predecessors, (982), 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-27 20:41:28,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:28,559 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 533.0) internal successors, (3198), 6 states have internal predecessors, (3198), 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-27 20:41:28,559 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 160 flow. Second operand 5 states and 982 transitions. [2023-01-27 20:41:28,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 309 flow [2023-01-27 20:41:28,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 20:41:28,561 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 178 flow [2023-01-27 20:41:28,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-01-27 20:41:28,562 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 21 predicate places. [2023-01-27 20:41:28,563 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 178 flow [2023-01-27 20:41:28,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 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-27 20:41:28,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:41:28,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:41:28,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 20:41:28,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:28,769 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-27 20:41:28,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:41:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1892160258, now seen corresponding path program 1 times [2023-01-27 20:41:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:41:28,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217645736] [2023-01-27 20:41:28,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:41:28,784 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:41:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [877024056] [2023-01-27 20:41:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:41:28,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:41:28,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:41:28,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:41:28,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 20:41:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 20:41:28,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 82 conjunts are in the unsatisfiable core [2023-01-27 20:41:28,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:41:29,013 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-01-27 20:41:29,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2023-01-27 20:41:29,058 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-27 20:41:29,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-27 20:41:29,110 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-27 20:41:29,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-27 20:41:29,159 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-27 20:41:29,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 20:41:29,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 20:41:29,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:41:29,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-01-27 20:41:29,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:41:29,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-01-27 20:41:29,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-01-27 20:41:29,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-01-27 20:41:29,795 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-27 20:41:29,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2023-01-27 20:41:29,810 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-01-27 20:41:29,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2023-01-27 20:41:29,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-01-27 20:41:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 20:41:29,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:41:30,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:41:30,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 290 [2023-01-27 20:41:30,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 137 [2023-01-27 20:42:27,696 WARN L222 SmtUtils]: Spent 53.45s on a formula simplification. DAG size of input: 96 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:42:47,399 WARN L222 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:43:09,050 WARN L222 SmtUtils]: Spent 7.47s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:43:19,664 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2023-01-27 20:43:19,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2320 treesize of output 1754 [2023-01-27 20:43:21,855 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2023-01-27 20:43:21,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1629 treesize of output 1427 [2023-01-27 20:43:28,344 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2023-01-27 20:43:28,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1693 treesize of output 1491 [2023-01-27 20:43:32,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:43:32,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2023-01-27 20:43:32,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:43:32,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 151 [2023-01-27 20:43:32,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2023-01-27 20:43:32,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 128 [2023-01-27 20:43:32,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 124 [2023-01-27 20:43:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 20:43:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 20:43:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217645736] [2023-01-27 20:43:32,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-01-27 20:43:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877024056] [2023-01-27 20:43:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877024056] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 20:43:32,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-01-27 20:43:32,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2023-01-27 20:43:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376746250] [2023-01-27 20:43:32,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-01-27 20:43:32,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-27 20:43:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 20:43:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-27 20:43:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=967, Unknown=37, NotChecked=0, Total=1122 [2023-01-27 20:43:32,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 533 [2023-01-27 20:43:32,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 178 flow. Second operand has 34 states, 34 states have (on average 128.64705882352942) internal successors, (4374), 34 states have internal predecessors, (4374), 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-27 20:43:32,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 20:43:32,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 533 [2023-01-27 20:43:32,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 20:43:58,814 WARN L222 SmtUtils]: Spent 12.50s on a formula simplification. DAG size of input: 138 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:44:24,284 WARN L222 SmtUtils]: Spent 16.49s on a formula simplification. DAG size of input: 181 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:44:26,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:45:04,112 WARN L222 SmtUtils]: Spent 26.69s on a formula simplification. DAG size of input: 167 DAG size of output: 129 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:46:14,590 WARN L222 SmtUtils]: Spent 50.61s on a formula simplification. DAG size of input: 210 DAG size of output: 162 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:47:18,267 WARN L222 SmtUtils]: Spent 40.08s on a formula simplification. DAG size of input: 189 DAG size of output: 151 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:48:26,290 WARN L222 SmtUtils]: Spent 41.18s on a formula simplification. DAG size of input: 232 DAG size of output: 177 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:48:28,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:48:30,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:48:33,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:49:31,607 WARN L222 SmtUtils]: Spent 31.55s on a formula simplification. DAG size of input: 199 DAG size of output: 168 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:49:35,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:49:37,938 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse53 (select |c_#memory_$Pointer$.base| c_~B~0.base))) (let ((.cse1 (select .cse53 (+ (* c_thread2Thread1of1ForFork1_~i~1 4) c_~B~0.offset))) (.cse26 (store |c_#memory_int| c_~A~0.base (store (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)) |c_thread1Thread1of1ForFork0_#t~mem2|))) (.cse7 (select .cse53 c_~B~0.offset)) (.cse35 (* c_thread2Thread1of1ForFork1_~j~0 4)) (.cse51 (select |c_#memory_int| c_~F~0.base)) (.cse52 (* (* c_thread2Thread1of1ForFork1_~i~1 c_~M~0) 4))) (let ((.cse4 (select .cse51 (+ .cse52 c_~F~0.offset))) (.cse11 (+ 2 c_~B~0.base)) (.cse32 (select .cse53 0)) (.cse19 (select |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base|)) (.cse20 (+ .cse35 |c_thread2Thread1of1ForFork1_#t~mem5.offset|)) (.cse9 (select |c_#memory_int| .cse7)) (.cse10 (select .cse51 c_~F~0.offset)) (.cse27 (select (select .cse26 c_~F~0.base) c_~F~0.offset)) (.cse3 (select |c_#memory_int| .cse1)) (.cse21 (select .cse51 (+ .cse35 .cse52 c_~F~0.offset))) (.cse5 (not (= .cse1 c_~B~0.base)))) (and (or (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (let ((.cse0 (store |c_#memory_int| .cse1 (store .cse3 v_arrayElimCell_17 .cse4))) (.cse2 (* v_~b~0_54 4))) (= (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse2)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse2)))) (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (< v_~b~0_54 0))) .cse5) (= c_~F~0.offset 0) (not (= c_~F~0.base c_~A~0.base)) (forall ((v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (< v_~b~0_54 0) (let ((.cse6 (store |c_#memory_int| .cse7 (store .cse9 v_arrayElimCell_17 .cse10))) (.cse8 (* v_~b~0_54 4))) (= (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_17 .cse8)) (select (select .cse6 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse8)))))) (<= .cse11 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (let ((.cse12 (store |c_#memory_int| .cse1 (store .cse3 v_arrayElimCell_17 .cse4))) (.cse13 (* v_~b~0_54 4))) (= (select (select .cse12 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_17 .cse13)) (select (select .cse12 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse13)))) (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (< v_~b~0_54 0))) (<= c_~M~0 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_arrayElimCell_16 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (= v_~a~0_52 c_thread2Thread1of1ForFork1_~i~1) (< v_~b~0_54 0) (let ((.cse14 (store |c_#memory_int| .cse1 (store .cse3 v_arrayElimCell_16 .cse4))) (.cse15 (* v_~b~0_54 4))) (= (select (select .cse14 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse15)) (select (select .cse14 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse15)))))) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|) (forall ((v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_ArrVal_707 (Array Int Int)) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (let ((.cse16 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse19 .cse20 .cse21))) (.cse17 (* v_~b~0_54 4))) (= (select (select .cse16 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse17)) (let ((.cse18 (+ (* v_~a~0_52 4) c_~B~0.offset))) (select (select .cse16 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_705) c_~B~0.base) .cse18)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_707) c_~B~0.base) .cse18) .cse17))))) (< v_~b~0_54 0))) (forall ((v_ArrVal_704 (Array Int Int)) (v_arrayElimCell_18 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_arrayElimCell_16 Int) (v_~b~0_54 Int)) (or (let ((.cse23 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_704))) (let ((.cse24 (select (select .cse23 c_~B~0.base) c_~B~0.offset))) (let ((.cse22 (store .cse26 .cse24 (store (select .cse26 .cse24) v_arrayElimCell_16 .cse27))) (.cse25 (* v_~b~0_54 4))) (= (select (select .cse22 (select (select (store .cse23 .cse24 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse25)) (select (select .cse22 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse25)))))) (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (= v_~a~0_52 0) (< v_~b~0_54 0))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_704 (Array Int Int)) (v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (let ((.cse30 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_704))) (let ((.cse31 (select (select .cse30 c_~B~0.base) c_~B~0.offset))) (let ((.cse28 (store .cse26 .cse31 (store (select .cse26 .cse31) v_arrayElimCell_17 .cse27))) (.cse29 (* v_~b~0_54 4))) (= (select (select .cse28 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse29)) (select (select .cse28 (select (select (store .cse30 .cse31 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_17 .cse29)))))) (< v_~b~0_54 0))) (not (= .cse32 c_~A~0.base)) (<= c_~N~0 1) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (let ((.cse33 (store |c_#memory_int| .cse1 (store .cse3 (+ .cse35 v_arrayElimCell_17) .cse21))) (.cse34 (* v_~b~0_54 4))) (= (select (select .cse33 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse34)) (select (select .cse33 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_17 .cse34)))) (< v_~a~0_52 0) (< v_~b~0_54 0))) (= c_~B~0.offset 0) (<= |c_ULTIMATE.start_main_~i~2#1| 1) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_arrayElimCell_16 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (let ((.cse36 (store |c_#memory_int| .cse1 (store .cse3 (+ .cse35 v_arrayElimCell_16) .cse21))) (.cse37 (* v_~b~0_54 4))) (= (select (select .cse36 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse37)) (select (select .cse36 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse37)))) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (= v_~a~0_52 c_thread2Thread1of1ForFork1_~i~1) (< v_~b~0_54 0))) (not (= .cse32 c_~B~0.base)) (forall ((v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_ArrVal_707 (Array Int Int)) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (< v_~b~0_54 0) (let ((.cse38 (store |c_#memory_int| |c_thread2Thread1of1ForFork1_#t~mem5.base| (store .cse19 .cse20 |c_thread2Thread1of1ForFork1_#t~mem6|))) (.cse39 (* v_~b~0_54 4))) (= (select (select .cse38 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse39)) (let ((.cse40 (+ (* v_~a~0_52 4) c_~B~0.offset))) (select (select .cse38 (select (select (store |c_#memory_$Pointer$.base| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_705) c_~B~0.base) .cse40)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_thread2Thread1of1ForFork1_#t~mem5.base| v_ArrVal_707) c_~B~0.base) .cse40) .cse39))))))) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (or (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (< v_~b~0_54 0) (let ((.cse41 (store |c_#memory_int| .cse7 (store .cse9 v_arrayElimCell_17 .cse10))) (.cse42 (* v_~b~0_54 4))) (= (select (select .cse41 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse42)) (select (select .cse41 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse42)))))) (not (= c_~B~0.base .cse7))) (forall ((v_arrayElimCell_18 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_arrayElimCell_16 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (= v_~a~0_52 0) (let ((.cse43 (store |c_#memory_int| .cse7 (store .cse9 v_arrayElimCell_16 .cse10))) (.cse44 (* v_~b~0_54 4))) (= (select (select .cse43 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse44)) (select (select .cse43 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse44)))) (< v_~b~0_54 0))) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_704 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_704))) (let ((.cse45 (select (select .cse47 c_~B~0.base) c_~B~0.offset))) (or (not (= .cse45 c_~B~0.base)) (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (< v_~a~0_52 0) (let ((.cse46 (store .cse26 .cse45 (store (select .cse26 .cse45) v_arrayElimCell_17 .cse27))) (.cse48 (* v_~b~0_54 4))) (= (select (select .cse46 (select (select (store .cse47 .cse45 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse48)) (select (select .cse46 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse48)))) (< v_~b~0_54 0))))))) (or (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_17 Int) (v_ArrVal_705 (Array Int Int)) (v_~a~0_52 Int) (v_~b~0_54 Int)) (or (<= c_~N~0 v_~a~0_52) (<= c_~M~0 v_~b~0_54) (let ((.cse49 (store |c_#memory_int| .cse1 (store .cse3 (+ .cse35 v_arrayElimCell_17) .cse21))) (.cse50 (* v_~b~0_54 4))) (= (select (select .cse49 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_52 c_~M~0) 4) .cse50)) (select (select .cse49 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_705) c_~B~0.base) (+ (* v_~a~0_52 4) c_~B~0.offset))) (+ v_arrayElimCell_18 .cse50)))) (< v_~a~0_52 0) (< v_~b~0_54 0))) .cse5) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from true [2023-01-27 20:49:39,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:49:42,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:49:45,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:39,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:41,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:43,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:45,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:46,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:48,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:50,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:51,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:53,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:55,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:50:57,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:51:42,760 WARN L222 SmtUtils]: Spent 8.70s on a formula simplification. DAG size of input: 192 DAG size of output: 151 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:51:45,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=true, quantifiers [1] [2023-01-27 20:51:47,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:51:49,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:51:51,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-01-27 20:51:54,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-01-27 20:51:56,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:51:57,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:00,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:02,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:04,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:06,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:08,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:11,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:13,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:15,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:18,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:19,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:21,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:23,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:25,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:27,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:29,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:31,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:33,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:47,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:48,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:50,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:52,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:55,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:57,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:52:59,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:02,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:04,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:06,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:09,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:12,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:13,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:15,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:18,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:20,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:22,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-01-27 20:53:22,686 INFO L130 PetriNetUnfolder]: 1063/1798 cut-off events. [2023-01-27 20:53:22,686 INFO L131 PetriNetUnfolder]: For 1624/1624 co-relation queries the response was YES. [2023-01-27 20:53:22,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5698 conditions, 1798 events. 1063/1798 cut-off events. For 1624/1624 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8335 event pairs, 134 based on Foata normal form. 3/1801 useless extension candidates. Maximal degree in co-relation 5668. Up to 500 conditions per place. [2023-01-27 20:53:22,694 INFO L137 encePairwiseOnDemand]: 514/533 looper letters, 204 selfloop transitions, 85 changer transitions 6/295 dead transitions. [2023-01-27 20:53:22,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 295 transitions, 1835 flow [2023-01-27 20:53:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-27 20:53:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-01-27 20:53:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5366 transitions. [2023-01-27 20:53:22,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25168855534709195 [2023-01-27 20:53:22,704 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 5366 transitions. [2023-01-27 20:53:22,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 5366 transitions. [2023-01-27 20:53:22,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 20:53:22,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 5366 transitions. [2023-01-27 20:53:22,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 134.15) internal successors, (5366), 40 states have internal predecessors, (5366), 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-27 20:53:22,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 533.0) internal successors, (21853), 41 states have internal predecessors, (21853), 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-27 20:53:22,732 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 533.0) internal successors, (21853), 41 states have internal predecessors, (21853), 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-27 20:53:22,732 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 178 flow. Second operand 40 states and 5366 transitions. [2023-01-27 20:53:22,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 295 transitions, 1835 flow [2023-01-27 20:53:22,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 295 transitions, 1784 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 20:53:22,740 INFO L231 Difference]: Finished difference. Result has 110 places, 120 transitions, 921 flow [2023-01-27 20:53:22,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=533, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=921, PETRI_PLACES=110, PETRI_TRANSITIONS=120} [2023-01-27 20:53:22,741 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 82 predicate places. [2023-01-27 20:53:22,741 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 120 transitions, 921 flow [2023-01-27 20:53:22,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 128.64705882352942) internal successors, (4374), 34 states have internal predecessors, (4374), 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-27 20:53:22,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 20:53:22,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:53:22,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 20:53:22,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-01-27 20:53:22,950 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-27 20:53:22,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 20:53:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash -965089616, now seen corresponding path program 2 times [2023-01-27 20:53:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 20:53:22,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759542755] [2023-01-27 20:53:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 20:53:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 20:53:22,968 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-01-27 20:53:22,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056935495] [2023-01-27 20:53:22,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 20:53:22,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:53:22,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 20:53:22,981 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 20:53:22,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 20:53:23,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 20:53:23,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 20:53:23,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 89 conjunts are in the unsatisfiable core [2023-01-27 20:53:23,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 20:53:23,398 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-01-27 20:53:23,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2023-01-27 20:53:23,428 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-27 20:53:23,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-01-27 20:53:23,474 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-27 20:53:23,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-27 20:53:23,545 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-27 20:53:23,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 20:53:23,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 20:53:23,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 20:53:23,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:53:23,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-01-27 20:53:23,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:53:23,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 20:53:23,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:53:23,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 20:53:23,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 20:53:23,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-01-27 20:53:24,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 20:53:24,221 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-01-27 20:53:24,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2023-01-27 20:53:24,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-01-27 20:53:24,390 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-27 20:53:24,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2023-01-27 20:53:24,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 20:53:24,410 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-01-27 20:53:24,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 29 [2023-01-27 20:53:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 20:53:24,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 20:53:27,516 INFO L321 Elim1Store]: treesize reduction 4, result has 98.0 percent of original size [2023-01-27 20:53:27,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3044 treesize of output 2593 [2023-01-27 20:53:38,893 WARN L222 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:53:52,499 WARN L222 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:54:03,378 WARN L222 SmtUtils]: Spent 7.15s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:54:15,079 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:54:38,167 WARN L222 SmtUtils]: Spent 13.41s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:55:00,811 WARN L222 SmtUtils]: Spent 16.97s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 20:55:01,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:01,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1902 treesize of output 1639 [2023-01-27 20:55:01,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:01,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1626 treesize of output 1195 [2023-01-27 20:55:07,018 WARN L222 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 289 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-01-27 20:55:07,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:07,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 589397 treesize of output 561297 [2023-01-27 20:55:08,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:08,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7554 treesize of output 7543 [2023-01-27 20:55:09,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7534 treesize of output 7486 [2023-01-27 20:55:09,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:09,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7486 treesize of output 7455 [2023-01-27 20:55:15,002 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:15,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 125159 treesize of output 116595 [2023-01-27 20:55:18,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:18,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10736 treesize of output 10701 [2023-01-27 20:55:19,301 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 20:55:19,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:19,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10692 treesize of output 10679 [2023-01-27 20:55:20,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10670 treesize of output 10646 [2023-01-27 20:55:20,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10646 treesize of output 10550 [2023-01-27 20:55:21,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10550 treesize of output 10502 [2023-01-27 20:55:22,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10502 treesize of output 10454 [2023-01-27 20:55:22,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10454 treesize of output 10442 [2023-01-27 20:55:23,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10442 treesize of output 10418 [2023-01-27 20:55:24,168 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:24,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10418 treesize of output 10407 [2023-01-27 20:55:24,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10398 treesize of output 10382 [2023-01-27 20:55:25,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10382 treesize of output 10334 [2023-01-27 20:55:26,068 INFO L208 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2023-01-27 20:55:26,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10334 treesize of output 10310 [2023-01-27 20:55:26,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:26,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10310 treesize of output 10309 [2023-01-27 20:55:27,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10300 treesize of output 10252 [2023-01-27 20:55:28,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10252 treesize of output 10156 [2023-01-27 20:55:28,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10156 treesize of output 10108 [2023-01-27 20:55:29,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10108 treesize of output 10102 [2023-01-27 20:55:30,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10102 treesize of output 10092 [2023-01-27 20:55:30,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10092 treesize of output 10080 [2023-01-27 20:55:31,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10080 treesize of output 10060 [2023-01-27 20:55:32,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:32,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10060 treesize of output 10033 [2023-01-27 20:55:32,726 INFO L208 tifierPushTermWalker]: Run 30 iterations without descend maybe there is a nontermination bug. [2023-01-27 20:55:32,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:32,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10024 treesize of output 9961 [2023-01-27 20:55:33,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9952 treesize of output 9904 [2023-01-27 20:55:34,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9904 treesize of output 9880 [2023-01-27 20:55:34,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9880 treesize of output 9832 [2023-01-27 20:55:35,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9832 treesize of output 9736 [2023-01-27 20:55:36,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9736 treesize of output 9724 [2023-01-27 20:55:36,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:36,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9724 treesize of output 9699 [2023-01-27 20:55:37,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9690 treesize of output 9594 [2023-01-27 20:55:38,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 20:55:38,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9594 treesize of output 9547 Received shutdown request... [2023-01-27 20:55:38,558 WARN L238 SmtUtils]: Removed 1 from assertion stack [2023-01-27 20:55:38,560 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-27 20:55:38,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-27 20:55:38,570 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 20:55:38,570 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-27 20:55:38,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 20:55:38,767 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-12-10-3-2-3-2-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-12-10-3-2-3-2-3-3-3-2-2-1 context. [2023-01-27 20:55:38,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-27 20:55:38,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-27 20:55:38,768 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 20:55:38,770 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 20:55:38,771 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 20:55:38,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 08:55:38 BasicIcfg [2023-01-27 20:55:38,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 20:55:38,772 INFO L158 Benchmark]: Toolchain (without parser) took 870836.59ms. Allocated memory was 358.6MB in the beginning and 432.0MB in the end (delta: 73.4MB). Free memory was 327.8MB in the beginning and 325.3MB in the end (delta: 2.6MB). Peak memory consumption was 268.6MB. Max. memory is 16.0GB. [2023-01-27 20:55:38,773 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 20:55:38,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.23ms. Allocated memory is still 358.6MB. Free memory was 327.1MB in the beginning and 315.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 20:55:38,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.00ms. Allocated memory is still 358.6MB. Free memory was 315.2MB in the beginning and 313.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 20:55:38,773 INFO L158 Benchmark]: Boogie Preprocessor took 38.14ms. Allocated memory is still 358.6MB. Free memory was 313.1MB in the beginning and 311.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 20:55:38,773 INFO L158 Benchmark]: RCFGBuilder took 531.46ms. Allocated memory is still 358.6MB. Free memory was 311.1MB in the beginning and 288.5MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-27 20:55:38,773 INFO L158 Benchmark]: TraceAbstraction took 870016.48ms. Allocated memory was 358.6MB in the beginning and 432.0MB in the end (delta: 73.4MB). Free memory was 287.6MB in the beginning and 325.3MB in the end (delta: -37.7MB). Peak memory consumption was 228.7MB. Max. memory is 16.0GB. [2023-01-27 20:55:38,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 207.23ms. Allocated memory is still 358.6MB. Free memory was 327.1MB in the beginning and 315.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.00ms. Allocated memory is still 358.6MB. Free memory was 315.2MB in the beginning and 313.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.14ms. Allocated memory is still 358.6MB. Free memory was 313.1MB in the beginning and 311.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 531.46ms. Allocated memory is still 358.6MB. Free memory was 311.1MB in the beginning and 288.5MB in the end (delta: 22.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 870016.48ms. Allocated memory was 358.6MB in the beginning and 432.0MB in the end (delta: 73.4MB). Free memory was 287.6MB in the beginning and 325.3MB in the end (delta: -37.7MB). Peak memory consumption was 228.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.9s, 228 PlacesBefore, 28 PlacesAfterwards, 247 TransitionsBefore, 28 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 8 FixpointIterations, 173 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 55 TrivialYvCompositions, 6 ConcurrentYvCompositions, 19 ChoiceCompositions, 276 TotalNumberOfCompositions, 1519 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1157, independent: 1082, independent conditional: 0, independent unconditional: 1082, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 511, independent: 492, independent conditional: 0, independent unconditional: 492, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1157, independent: 590, independent conditional: 0, independent unconditional: 590, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 511, unknown conditional: 0, unknown unconditional: 511] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-12-10-3-2-3-2-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-12-10-3-2-3-2-3-3-3-2-2-1 context. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-12-10-3-2-3-2-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-12-10-3-2-3-2-3-3-3-2-2-1 context. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-123-12-10-3-2-3-2-3-3-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-12-10-3-2-3-2-3-3-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 263 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 869.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 590.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.0s, HoareTripleCheckerStatistics: 104 mSolverCounterUnknown, 700 SdHoareTripleChecker+Valid, 137.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 136.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 96 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2142 IncrementalHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 8 mSDtfsCounter, 2142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 219 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 563.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=8, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 124.4s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 283 ConstructedInterpolants, 33 QuantifiedInterpolants, 5844 SizeOfPredicates, 51 NumberOfNonLiveVariables, 2431 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 35/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown