/usr/bin/java -Xmx8000000000 -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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:16:36,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:16:36,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:16:36,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:16:36,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:16:36,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:16:36,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:16:36,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:16:36,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:16:36,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:16:36,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:16:36,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:16:36,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:16:36,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:16:36,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:16:36,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:16:36,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:16:36,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:16:36,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:16:36,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:16:36,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:16:36,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:16:36,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:16:36,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:16:36,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:16:36,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:16:36,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:16:36,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:16:36,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:16:36,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:16:36,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:16:36,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:16:36,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:16:36,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:16:36,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:16:36,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:16:36,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:16:36,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:16:36,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:16:36,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:16:36,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:16:36,170 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-RepeatedSemanticLbe.epf [2022-12-13 01:16:36,204 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:16:36,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:16:36,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:16:36,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:16:36,206 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:16:36,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:16:36,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:16:36,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:16:36,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:16:36,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:16:36,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:16:36,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:16:36,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:16:36,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:16:36,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:16:36,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:16:36,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:16:36,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:16:36,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:16:36,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:16:36,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-13 01:16:36,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:16:36,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:16:36,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:16:36,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:16:36,495 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:16:36,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-13 01:16:37,432 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:16:37,646 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:16:37,646 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-13 01:16:37,654 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7c36793/41115fb95073492bbb7734d26c924086/FLAG69d46852d [2022-12-13 01:16:37,667 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7c36793/41115fb95073492bbb7734d26c924086 [2022-12-13 01:16:37,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:16:37,669 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:16:37,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:16:37,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:16:37,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:16:37,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f4cc40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37, skipping insertion in model container [2022-12-13 01:16:37,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:16:37,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:16:37,845 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-12-13 01:16:37,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:16:37,859 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:16:37,890 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-12-13 01:16:37,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:16:37,901 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:16:37,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37 WrapperNode [2022-12-13 01:16:37,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:16:37,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:16:37,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:16:37,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:16:37,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,939 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-13 01:16:37,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:16:37,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:16:37,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:16:37,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:16:37,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,969 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:16:37,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:16:37,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:16:37,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:16:37,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (1/1) ... [2022-12-13 01:16:37,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:16:37,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:16:37,995 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) [2022-12-13 01:16:38,011 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 [2022-12-13 01:16:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:16:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:16:38,035 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:16:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:16:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:16:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 01:16:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 01:16:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 01:16:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 01:16:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:16:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:16:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:16:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:16:38,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:16:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:16:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:16:38,038 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 01:16:38,126 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:16:38,127 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:16:38,277 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:16:38,283 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:16:38,283 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 01:16:38,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:38 BoogieIcfgContainer [2022-12-13 01:16:38,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:16:38,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:16:38,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:16:38,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:16:38,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:16:37" (1/3) ... [2022-12-13 01:16:38,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c36a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:38, skipping insertion in model container [2022-12-13 01:16:38,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:37" (2/3) ... [2022-12-13 01:16:38,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c36a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:38, skipping insertion in model container [2022-12-13 01:16:38,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:38" (3/3) ... [2022-12-13 01:16:38,290 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2022-12-13 01:16:38,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:16:38,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:16:38,302 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:16:38,373 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 01:16:38,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 122 transitions, 276 flow [2022-12-13 01:16:38,454 INFO L130 PetriNetUnfolder]: 10/118 cut-off events. [2022-12-13 01:16:38,455 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:16:38,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 118 events. 10/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 01:16:38,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 122 transitions, 276 flow [2022-12-13 01:16:38,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 236 flow [2022-12-13 01:16:38,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:38,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-13 01:16:38,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 236 flow [2022-12-13 01:16:38,539 INFO L130 PetriNetUnfolder]: 10/106 cut-off events. [2022-12-13 01:16:38,540 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:16:38,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 106 events. 10/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 01:16:38,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-13 01:16:38,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-13 01:16:41,516 INFO L241 LiptonReduction]: Total number of compositions: 81 [2022-12-13 01:16:41,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:16:41,544 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=REPEATED_LIPTON_PN, 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;@4f68949f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:16:41,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 01:16:41,548 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 01:16:41,549 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:16:41,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:41,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:16:41,550 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:16:41,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2713954, now seen corresponding path program 1 times [2022-12-13 01:16:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:41,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255847633] [2022-12-13 01:16:41,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:42,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255847633] [2022-12-13 01:16:42,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255847633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:16:42,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:16:42,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 01:16:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140485909] [2022-12-13 01:16:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:16:42,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:16:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:16:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:16:42,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:16:42,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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) [2022-12-13 01:16:42,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:42,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:16:42,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:42,190 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-13 01:16:42,190 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-13 01:16:42,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1782 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-13 01:16:42,199 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-13 01:16:42,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-13 01:16:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:16:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:16:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 01:16:42,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 01:16:42,212 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-13 01:16:42,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-13 01:16:42,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-13 01:16:42,224 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-13 01:16:42,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-13 01:16:42,231 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-13 01:16:42,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:42,232 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 91 flow [2022-12-13 01:16:42,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:42,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:42,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-13 01:16:42,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 91 flow [2022-12-13 01:16:42,239 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0][18], [Black: 130#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 15#L38-1true, 90#L65-1true, 32#L56-1true, 128#true, 103#L47-1true, 95#L89-4true]) [2022-12-13 01:16:42,239 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,239 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,239 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,239 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,242 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2022-12-13 01:16:42,242 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:16:42,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 55 events. 19/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-13 01:16:42,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-13 01:16:42,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 01:16:42,246 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:16:42,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 01:16:42,247 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-13 01:16:42,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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) [2022-12-13 01:16:42,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:42,247 INFO L214 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] [2022-12-13 01:16:42,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:16:42,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:16:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1247836044, now seen corresponding path program 1 times [2022-12-13 01:16:42,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:42,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160820762] [2022-12-13 01:16:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:42,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:42,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:42,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160820762] [2022-12-13 01:16:42,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160820762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:16:42,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:16:42,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:16:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344577219] [2022-12-13 01:16:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:16:42,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:16:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:16:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:16:42,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:16:42,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-13 01:16:42,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:42,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:16:42,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:42,606 INFO L130 PetriNetUnfolder]: 467/647 cut-off events. [2022-12-13 01:16:42,606 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-13 01:16:42,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 647 events. 467/647 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1768 event pairs, 43 based on Foata normal form. 30/677 useless extension candidates. Maximal degree in co-relation 439. Up to 441 conditions per place. [2022-12-13 01:16:42,609 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 46 selfloop transitions, 9 changer transitions 5/60 dead transitions. [2022-12-13 01:16:42,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2022-12-13 01:16:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:16:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:16:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-13 01:16:42,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-13 01:16:42,612 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 62 transitions. [2022-12-13 01:16:42,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2022-12-13 01:16:42,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:16:42,614 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2022-12-13 01:16:42,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-13 01:16:42,614 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 01:16:42,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:42,615 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 127 flow [2022-12-13 01:16:42,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:42,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:42,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-13 01:16:42,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 127 flow [2022-12-13 01:16:42,641 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0][24], [132#true, Black: 130#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 15#L38-1true, 90#L65-1true, 32#L56-1true, Black: 134#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 103#L47-1true, 95#L89-4true]) [2022-12-13 01:16:42,641 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,641 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,641 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,641 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,642 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base][22], [65#thread4EXITtrue, 132#true, Black: 130#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 15#L38-1true, 32#L56-1true, Black: 134#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 103#L47-1true, 95#L89-4true]) [2022-12-13 01:16:42,642 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,642 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,642 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,642 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-13 01:16:42,646 INFO L130 PetriNetUnfolder]: 34/83 cut-off events. [2022-12-13 01:16:42,646 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 01:16:42,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 83 events. 34/83 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 175 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 106. Up to 32 conditions per place. [2022-12-13 01:16:42,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-13 01:16:42,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-13 01:16:42,649 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:16:42,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 01:16:42,650 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-13 01:16:42,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-13 01:16:42,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:42,651 INFO L214 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] [2022-12-13 01:16:42,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:16:42,651 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:16:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 514294809, now seen corresponding path program 1 times [2022-12-13 01:16:42,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:42,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212989225] [2022-12-13 01:16:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:42,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212989225] [2022-12-13 01:16:42,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212989225] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:16:42,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728512370] [2022-12-13 01:16:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:16:42,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:16:42,848 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) [2022-12-13 01:16:42,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 01:16:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:42,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:16:42,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:16:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:43,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:16:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:43,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728512370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:16:43,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:16:43,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 01:16:43,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322299770] [2022-12-13 01:16:43,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:16:43,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:16:43,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:43,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:16:43,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:16:43,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:16:43,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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) [2022-12-13 01:16:43,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:43,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:16:43,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:43,399 INFO L130 PetriNetUnfolder]: 845/1165 cut-off events. [2022-12-13 01:16:43,399 INFO L131 PetriNetUnfolder]: For 561/561 co-relation queries the response was YES. [2022-12-13 01:16:43,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3259 conditions, 1165 events. 845/1165 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3643 event pairs, 155 based on Foata normal form. 30/1195 useless extension candidates. Maximal degree in co-relation 853. Up to 458 conditions per place. [2022-12-13 01:16:43,404 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 83 selfloop transitions, 12 changer transitions 3/98 dead transitions. [2022-12-13 01:16:43,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 98 transitions, 508 flow [2022-12-13 01:16:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:16:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:16:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-13 01:16:43,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 01:16:43,412 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 6 states and 96 transitions. [2022-12-13 01:16:43,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 98 transitions, 508 flow [2022-12-13 01:16:43,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 98 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:16:43,415 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 179 flow [2022-12-13 01:16:43,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2022-12-13 01:16:43,416 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-13 01:16:43,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:43,416 INFO L89 Accepts]: Start accepts. Operand has 38 places, 38 transitions, 179 flow [2022-12-13 01:16:43,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:43,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:43,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 38 transitions, 179 flow [2022-12-13 01:16:43,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 179 flow [2022-12-13 01:16:43,422 INFO L130 PetriNetUnfolder]: 30/86 cut-off events. [2022-12-13 01:16:43,422 INFO L131 PetriNetUnfolder]: For 55/71 co-relation queries the response was YES. [2022-12-13 01:16:43,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 86 events. 30/86 cut-off events. For 55/71 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 191 event pairs, 2 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 148. Up to 33 conditions per place. [2022-12-13 01:16:43,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 38 transitions, 179 flow [2022-12-13 01:16:43,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-13 01:16:43,424 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:16:43,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 01:16:43,425 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 179 flow [2022-12-13 01:16:43,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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) [2022-12-13 01:16:43,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:43,425 INFO L214 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] [2022-12-13 01:16:43,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 01:16:43,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:16:43,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:16:43,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:43,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1135419108, now seen corresponding path program 2 times [2022-12-13 01:16:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:43,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081354812] [2022-12-13 01:16:43,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:43,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:43,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081354812] [2022-12-13 01:16:43,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081354812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:16:43,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889777413] [2022-12-13 01:16:43,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:16:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:16:43,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:16:43,813 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) [2022-12-13 01:16:43,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 01:16:43,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:16:43,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:16:43,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:16:43,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:16:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:44,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:16:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:44,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889777413] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:16:44,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:16:44,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 01:16:44,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909841896] [2022-12-13 01:16:44,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:16:44,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:16:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:16:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:16:44,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 01:16:44,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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) [2022-12-13 01:16:44,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:44,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 01:16:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:44,383 INFO L130 PetriNetUnfolder]: 997/1379 cut-off events. [2022-12-13 01:16:44,383 INFO L131 PetriNetUnfolder]: For 1408/1408 co-relation queries the response was YES. [2022-12-13 01:16:44,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 1379 events. 997/1379 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4539 event pairs, 143 based on Foata normal form. 28/1407 useless extension candidates. Maximal degree in co-relation 2423. Up to 605 conditions per place. [2022-12-13 01:16:44,392 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 86 selfloop transitions, 12 changer transitions 3/101 dead transitions. [2022-12-13 01:16:44,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 101 transitions, 580 flow [2022-12-13 01:16:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:16:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:16:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-13 01:16:44,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-13 01:16:44,406 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 179 flow. Second operand 6 states and 96 transitions. [2022-12-13 01:16:44,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 101 transitions, 580 flow [2022-12-13 01:16:44,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 101 transitions, 571 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 01:16:44,413 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 228 flow [2022-12-13 01:16:44,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-13 01:16:44,415 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-13 01:16:44,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:44,415 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 228 flow [2022-12-13 01:16:44,416 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:44,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:44,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 228 flow [2022-12-13 01:16:44,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 228 flow [2022-12-13 01:16:44,423 INFO L130 PetriNetUnfolder]: 37/99 cut-off events. [2022-12-13 01:16:44,423 INFO L131 PetriNetUnfolder]: For 133/161 co-relation queries the response was YES. [2022-12-13 01:16:44,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 99 events. 37/99 cut-off events. For 133/161 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 246 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 221. Up to 43 conditions per place. [2022-12-13 01:16:44,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 228 flow [2022-12-13 01:16:44,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-13 01:16:44,431 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [339] L56-1-->L56-1: Formula: (and (< (mod v_~x3~0_27 4294967296) (mod v_~n~0_15 4294967296)) (= (* v_~x3~0_27 4) v_~x3~0_25)) InVars {~x3~0=v_~x3~0_27, ~n~0=v_~n~0_15} OutVars{~x3~0=v_~x3~0_25, ~n~0=v_~n~0_15} AuxVars[] AssignedVars[~x3~0] [2022-12-13 01:16:44,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:16:44,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 01:16:44,483 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 238 flow [2022-12-13 01:16:44,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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) [2022-12-13 01:16:44,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:44,483 INFO L214 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] [2022-12-13 01:16:44,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 01:16:44,684 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,SelfDestructingSolverStorable3 [2022-12-13 01:16:44,684 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:16:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1474747795, now seen corresponding path program 1 times [2022-12-13 01:16:44,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:44,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339522320] [2022-12-13 01:16:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:44,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339522320] [2022-12-13 01:16:44,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339522320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:16:44,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:16:44,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:16:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652525913] [2022-12-13 01:16:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:16:44,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:16:44,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:16:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:16:44,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 01:16:44,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-13 01:16:44,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:44,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 01:16:44,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:45,008 INFO L130 PetriNetUnfolder]: 961/1343 cut-off events. [2022-12-13 01:16:45,008 INFO L131 PetriNetUnfolder]: For 2821/2821 co-relation queries the response was YES. [2022-12-13 01:16:45,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 1343 events. 961/1343 cut-off events. For 2821/2821 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4547 event pairs, 161 based on Foata normal form. 36/1379 useless extension candidates. Maximal degree in co-relation 2960. Up to 1137 conditions per place. [2022-12-13 01:16:45,016 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 56 selfloop transitions, 11 changer transitions 7/74 dead transitions. [2022-12-13 01:16:45,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 514 flow [2022-12-13 01:16:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 01:16:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 01:16:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-13 01:16:45,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-13 01:16:45,018 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 238 flow. Second operand 4 states and 63 transitions. [2022-12-13 01:16:45,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 514 flow [2022-12-13 01:16:45,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 473 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-13 01:16:45,029 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 254 flow [2022-12-13 01:16:45,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-13 01:16:45,030 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-13 01:16:45,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:45,030 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 254 flow [2022-12-13 01:16:45,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:45,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:45,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 254 flow [2022-12-13 01:16:45,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 254 flow [2022-12-13 01:16:45,044 INFO L130 PetriNetUnfolder]: 74/159 cut-off events. [2022-12-13 01:16:45,044 INFO L131 PetriNetUnfolder]: For 137/183 co-relation queries the response was YES. [2022-12-13 01:16:45,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 159 events. 74/159 cut-off events. For 137/183 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 455 event pairs, 2 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 406. Up to 76 conditions per place. [2022-12-13 01:16:45,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 254 flow [2022-12-13 01:16:45,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 01:16:45,047 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:16:45,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 01:16:45,047 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 254 flow [2022-12-13 01:16:45,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-13 01:16:45,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:45,047 INFO L214 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] [2022-12-13 01:16:45,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:16:45,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:16:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash 608143865, now seen corresponding path program 1 times [2022-12-13 01:16:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:45,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976786399] [2022-12-13 01:16:45,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976786399] [2022-12-13 01:16:45,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976786399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:16:45,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452461773] [2022-12-13 01:16:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:16:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:16:45,408 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) [2022-12-13 01:16:45,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 01:16:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:46,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 01:16:46,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:16:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:47,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:16:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:48,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452461773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:16:48,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:16:48,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2022-12-13 01:16:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466251784] [2022-12-13 01:16:48,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:16:48,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 01:16:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:48,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 01:16:48,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 01:16:48,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-13 01:16:48,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 254 flow. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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) [2022-12-13 01:16:48,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:48,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-13 01:16:48,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:51,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:16:53,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:16:56,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:16:58,669 INFO L130 PetriNetUnfolder]: 2401/3283 cut-off events. [2022-12-13 01:16:58,670 INFO L131 PetriNetUnfolder]: For 5163/5163 co-relation queries the response was YES. [2022-12-13 01:16:58,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12153 conditions, 3283 events. 2401/3283 cut-off events. For 5163/5163 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12621 event pairs, 293 based on Foata normal form. 16/3299 useless extension candidates. Maximal degree in co-relation 7850. Up to 1661 conditions per place. [2022-12-13 01:16:58,682 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 147 selfloop transitions, 54 changer transitions 9/210 dead transitions. [2022-12-13 01:16:58,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 210 transitions, 1366 flow [2022-12-13 01:16:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 01:16:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 01:16:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2022-12-13 01:16:58,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6121794871794872 [2022-12-13 01:16:58,684 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 254 flow. Second operand 12 states and 191 transitions. [2022-12-13 01:16:58,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 210 transitions, 1366 flow [2022-12-13 01:16:58,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 210 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 01:16:58,694 INFO L231 Difference]: Finished difference. Result has 61 places, 91 transitions, 713 flow [2022-12-13 01:16:58,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=713, PETRI_PLACES=61, PETRI_TRANSITIONS=91} [2022-12-13 01:16:58,694 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-12-13 01:16:58,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:58,694 INFO L89 Accepts]: Start accepts. Operand has 61 places, 91 transitions, 713 flow [2022-12-13 01:16:58,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:58,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:58,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 91 transitions, 713 flow [2022-12-13 01:16:58,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 91 transitions, 713 flow [2022-12-13 01:16:58,717 INFO L130 PetriNetUnfolder]: 236/442 cut-off events. [2022-12-13 01:16:58,718 INFO L131 PetriNetUnfolder]: For 1308/1417 co-relation queries the response was YES. [2022-12-13 01:16:58,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1893 conditions, 442 events. 236/442 cut-off events. For 1308/1417 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1724 event pairs, 11 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 1765. Up to 251 conditions per place. [2022-12-13 01:16:58,721 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 91 transitions, 713 flow [2022-12-13 01:16:58,722 INFO L226 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-13 01:16:58,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [339] L56-1-->L56-1: Formula: (and (< (mod v_~x3~0_27 4294967296) (mod v_~n~0_15 4294967296)) (= (* v_~x3~0_27 4) v_~x3~0_25)) InVars {~x3~0=v_~x3~0_27, ~n~0=v_~n~0_15} OutVars{~x3~0=v_~x3~0_25, ~n~0=v_~n~0_15} AuxVars[] AssignedVars[~x3~0] [2022-12-13 01:16:58,790 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:16:58,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 01:16:58,790 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 91 transitions, 724 flow [2022-12-13 01:16:58,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 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) [2022-12-13 01:16:58,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:58,791 INFO L214 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] [2022-12-13 01:16:58,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 01:16:58,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:16:58,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:16:58,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:16:58,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1667699092, now seen corresponding path program 1 times [2022-12-13 01:16:58,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:16:58,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939176017] [2022-12-13 01:16:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:58,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:16:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:59,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:16:59,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939176017] [2022-12-13 01:16:59,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939176017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:16:59,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164833401] [2022-12-13 01:16:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:16:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:16:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:16:59,087 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) [2022-12-13 01:16:59,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 01:16:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:16:59,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:16:59,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:16:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:59,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:16:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:16:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164833401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:16:59,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:16:59,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-13 01:16:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890934495] [2022-12-13 01:16:59,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:16:59,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:16:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:16:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:16:59,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:16:59,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 01:16:59,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 91 transitions, 724 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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) [2022-12-13 01:16:59,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:16:59,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 01:16:59,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:16:59,692 INFO L130 PetriNetUnfolder]: 3631/5008 cut-off events. [2022-12-13 01:16:59,692 INFO L131 PetriNetUnfolder]: For 16471/16471 co-relation queries the response was YES. [2022-12-13 01:16:59,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23080 conditions, 5008 events. 3631/5008 cut-off events. For 16471/16471 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 21427 event pairs, 395 based on Foata normal form. 146/5142 useless extension candidates. Maximal degree in co-relation 21216. Up to 2227 conditions per place. [2022-12-13 01:16:59,728 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 178 selfloop transitions, 37 changer transitions 4/219 dead transitions. [2022-12-13 01:16:59,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 219 transitions, 2011 flow [2022-12-13 01:16:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:16:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:16:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 01:16:59,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2022-12-13 01:16:59,730 INFO L175 Difference]: Start difference. First operand has 61 places, 91 transitions, 724 flow. Second operand 6 states and 106 transitions. [2022-12-13 01:16:59,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 219 transitions, 2011 flow [2022-12-13 01:16:59,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 219 transitions, 1890 flow, removed 56 selfloop flow, removed 1 redundant places. [2022-12-13 01:16:59,763 INFO L231 Difference]: Finished difference. Result has 68 places, 112 transitions, 903 flow [2022-12-13 01:16:59,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=903, PETRI_PLACES=68, PETRI_TRANSITIONS=112} [2022-12-13 01:16:59,764 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2022-12-13 01:16:59,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:16:59,764 INFO L89 Accepts]: Start accepts. Operand has 68 places, 112 transitions, 903 flow [2022-12-13 01:16:59,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:16:59,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:16:59,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 112 transitions, 903 flow [2022-12-13 01:16:59,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 112 transitions, 903 flow [2022-12-13 01:16:59,805 INFO L130 PetriNetUnfolder]: 329/681 cut-off events. [2022-12-13 01:16:59,805 INFO L131 PetriNetUnfolder]: For 2184/2440 co-relation queries the response was YES. [2022-12-13 01:16:59,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2867 conditions, 681 events. 329/681 cut-off events. For 2184/2440 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3408 event pairs, 15 based on Foata normal form. 4/648 useless extension candidates. Maximal degree in co-relation 2645. Up to 293 conditions per place. [2022-12-13 01:16:59,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 112 transitions, 903 flow [2022-12-13 01:16:59,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-13 01:16:59,812 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [395] L47-1-->L47-1: Formula: (and (< (mod v_~x2~0_51 4294967296) (mod v_~n~0_49 4294967296)) (= v_~x2~0_49 (* v_~x2~0_51 4))) InVars {~x2~0=v_~x2~0_51, ~n~0=v_~n~0_49} OutVars{~x2~0=v_~x2~0_49, ~n~0=v_~n~0_49} AuxVars[] AssignedVars[~x2~0] [2022-12-13 01:16:59,854 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [395] L47-1-->L47-1: Formula: (and (< (mod v_~x2~0_51 4294967296) (mod v_~n~0_49 4294967296)) (= v_~x2~0_49 (* v_~x2~0_51 4))) InVars {~x2~0=v_~x2~0_51, ~n~0=v_~n~0_49} OutVars{~x2~0=v_~x2~0_49, ~n~0=v_~n~0_49} AuxVars[] AssignedVars[~x2~0] [2022-12-13 01:16:59,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [395] L47-1-->L47-1: Formula: (and (< (mod v_~x2~0_51 4294967296) (mod v_~n~0_49 4294967296)) (= v_~x2~0_49 (* v_~x2~0_51 4))) InVars {~x2~0=v_~x2~0_51, ~n~0=v_~n~0_49} OutVars{~x2~0=v_~x2~0_49, ~n~0=v_~n~0_49} AuxVars[] AssignedVars[~x2~0] [2022-12-13 01:16:59,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.base_Out_2| 0) (not (< (mod v_~x4~0_In_3 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_3} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_2|, ~x4~0=v_~x4~0_In_3, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_2|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:16:59,978 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:16:59,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 214 [2022-12-13 01:16:59,978 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 112 transitions, 947 flow [2022-12-13 01:16:59,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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) [2022-12-13 01:16:59,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:16:59,979 INFO L214 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] [2022-12-13 01:16:59,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 01:17:00,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:00,179 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:00,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1469776079, now seen corresponding path program 2 times [2022-12-13 01:17:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:00,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792524522] [2022-12-13 01:17:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792524522] [2022-12-13 01:17:00,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792524522] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:17:00,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126029674] [2022-12-13 01:17:00,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 01:17:00,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:00,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:17:00,255 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) [2022-12-13 01:17:00,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 01:17:00,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 01:17:00,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 01:17:00,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 01:17:00,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:17:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:00,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:17:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:00,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126029674] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:17:00,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:17:00,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-13 01:17:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440840882] [2022-12-13 01:17:00,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:17:00,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:17:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:17:00,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:17:00,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 01:17:00,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 112 transitions, 947 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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) [2022-12-13 01:17:00,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:00,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 01:17:00,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:00,993 INFO L130 PetriNetUnfolder]: 4085/5642 cut-off events. [2022-12-13 01:17:00,993 INFO L131 PetriNetUnfolder]: For 27398/27398 co-relation queries the response was YES. [2022-12-13 01:17:01,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28139 conditions, 5642 events. 4085/5642 cut-off events. For 27398/27398 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 24463 event pairs, 1109 based on Foata normal form. 124/5754 useless extension candidates. Maximal degree in co-relation 26094. Up to 2299 conditions per place. [2022-12-13 01:17:01,022 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 182 selfloop transitions, 39 changer transitions 1/222 dead transitions. [2022-12-13 01:17:01,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 222 transitions, 2192 flow [2022-12-13 01:17:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:17:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:17:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 01:17:01,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 01:17:01,023 INFO L175 Difference]: Start difference. First operand has 68 places, 112 transitions, 947 flow. Second operand 5 states and 94 transitions. [2022-12-13 01:17:01,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 222 transitions, 2192 flow [2022-12-13 01:17:01,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 222 transitions, 2181 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 01:17:01,061 INFO L231 Difference]: Finished difference. Result has 73 places, 124 transitions, 1172 flow [2022-12-13 01:17:01,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1172, PETRI_PLACES=73, PETRI_TRANSITIONS=124} [2022-12-13 01:17:01,062 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2022-12-13 01:17:01,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:17:01,062 INFO L89 Accepts]: Start accepts. Operand has 73 places, 124 transitions, 1172 flow [2022-12-13 01:17:01,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:17:01,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:17:01,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 124 transitions, 1172 flow [2022-12-13 01:17:01,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 124 transitions, 1172 flow [2022-12-13 01:17:01,116 INFO L130 PetriNetUnfolder]: 391/789 cut-off events. [2022-12-13 01:17:01,116 INFO L131 PetriNetUnfolder]: For 3368/3958 co-relation queries the response was YES. [2022-12-13 01:17:01,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 789 events. 391/789 cut-off events. For 3368/3958 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4077 event pairs, 26 based on Foata normal form. 9/755 useless extension candidates. Maximal degree in co-relation 3340. Up to 359 conditions per place. [2022-12-13 01:17:01,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 124 transitions, 1172 flow [2022-12-13 01:17:01,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 1294 [2022-12-13 01:17:01,131 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L47-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:01,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L47-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [421] L65-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_77 4294967296))) (and (not (< (mod v_~x4~0_90 4294967296) .cse0)) (< (mod v_~x1~0_71 4294967296) .cse0) (= |v_thread4Thread1of1ForFork2_#res.offset_29| 0) (= v_~x1~0_70 (* v_~x1~0_71 4)) (= |v_thread4Thread1of1ForFork2_#res.base_29| 0))) InVars {~x4~0=v_~x4~0_90, ~n~0=v_~n~0_77, ~x1~0=v_~x1~0_71} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_29|, ~x4~0=v_~x4~0_90, ~n~0=v_~n~0_77, ~x1~0=v_~x1~0_70, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_29|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, ~x1~0, thread4Thread1of1ForFork2_#res.base] [2022-12-13 01:17:01,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L47-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:01,321 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L47-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:01,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L47-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:01,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L47-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:01,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [414] L47-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork3_#res.base_Out_2| 0) (not (< (mod v_~x2~0_In_3 4294967296) (mod v_~n~0_In_7 4294967296))) (= 0 |v_thread2Thread1of1ForFork3_#res.offset_Out_2|)) InVars {~n~0=v_~n~0_In_7, ~x2~0=v_~x2~0_In_3} OutVars{~x2~0=v_~x2~0_In_3, ~n~0=v_~n~0_In_7, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_Out_2|, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, thread2Thread1of1ForFork3_#res.offset] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:01,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L47-1-->L47-1: Formula: (and (< (mod v_~x2~0_51 4294967296) (mod v_~n~0_49 4294967296)) (= v_~x2~0_49 (* v_~x2~0_51 4))) InVars {~x2~0=v_~x2~0_51, ~n~0=v_~n~0_49} OutVars{~x2~0=v_~x2~0_49, ~n~0=v_~n~0_49} AuxVars[] AssignedVars[~x2~0] and [386] L38-1-->L38-1: Formula: (and (= (* v_~x1~0_40 4) v_~x1~0_39) (< (mod v_~x1~0_40 4294967296) (mod v_~n~0_39 4294967296))) InVars {~n~0=v_~n~0_39, ~x1~0=v_~x1~0_40} OutVars{~n~0=v_~n~0_39, ~x1~0=v_~x1~0_39} AuxVars[] AssignedVars[~x1~0] [2022-12-13 01:17:01,517 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:17:01,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 456 [2022-12-13 01:17:01,518 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 124 transitions, 1248 flow [2022-12-13 01:17:01,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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) [2022-12-13 01:17:01,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:17:01,518 INFO L214 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] [2022-12-13 01:17:01,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 01:17:01,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:01,719 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:17:01,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:17:01,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1246207825, now seen corresponding path program 1 times [2022-12-13 01:17:01,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:17:01,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87660917] [2022-12-13 01:17:01,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:01,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:17:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:17:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87660917] [2022-12-13 01:17:02,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87660917] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:17:02,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916378402] [2022-12-13 01:17:02,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:17:02,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:17:02,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:17:02,101 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) [2022-12-13 01:17:02,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 01:17:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:17:08,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 01:17:08,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:17:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:16,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:17:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:17:21,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916378402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:17:21,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:17:21,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2022-12-13 01:17:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526951715] [2022-12-13 01:17:21,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:17:21,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 01:17:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:17:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 01:17:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=135, Unknown=4, NotChecked=0, Total=182 [2022-12-13 01:17:21,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 01:17:21,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 124 transitions, 1248 flow. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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) [2022-12-13 01:17:21,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:17:21,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 01:17:21,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:17:24,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:26,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:29,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:31,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:34,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:36,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:38,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:45,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:47,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:49,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:52,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:54,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:56,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:17:58,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:00,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:02,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:04,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:10,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:12,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:14,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:17,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:19,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:20,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:23,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:25,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:27,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:29,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:32,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:34,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:36,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:38,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:40,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:43,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:46,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:48,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:50,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:52,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=false, quantifiers [] [2022-12-13 01:18:54,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:56,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:18:57,222 INFO L130 PetriNetUnfolder]: 5213/7170 cut-off events. [2022-12-13 01:18:57,222 INFO L131 PetriNetUnfolder]: For 43840/43840 co-relation queries the response was YES. [2022-12-13 01:18:57,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38697 conditions, 7170 events. 5213/7170 cut-off events. For 43840/43840 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 32553 event pairs, 483 based on Foata normal form. 2/7160 useless extension candidates. Maximal degree in co-relation 36501. Up to 5864 conditions per place. [2022-12-13 01:18:57,313 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 219 selfloop transitions, 41 changer transitions 6/266 dead transitions. [2022-12-13 01:18:57,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 266 transitions, 2607 flow [2022-12-13 01:18:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 01:18:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 01:18:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2022-12-13 01:18:57,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.465 [2022-12-13 01:18:57,315 INFO L175 Difference]: Start difference. First operand has 73 places, 124 transitions, 1248 flow. Second operand 10 states and 186 transitions. [2022-12-13 01:18:57,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 266 transitions, 2607 flow [2022-12-13 01:18:57,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 266 transitions, 2490 flow, removed 46 selfloop flow, removed 1 redundant places. [2022-12-13 01:18:57,463 INFO L231 Difference]: Finished difference. Result has 87 places, 156 transitions, 1578 flow [2022-12-13 01:18:57,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1578, PETRI_PLACES=87, PETRI_TRANSITIONS=156} [2022-12-13 01:18:57,464 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 53 predicate places. [2022-12-13 01:18:57,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:18:57,464 INFO L89 Accepts]: Start accepts. Operand has 87 places, 156 transitions, 1578 flow [2022-12-13 01:18:57,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:18:57,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:18:57,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 156 transitions, 1578 flow [2022-12-13 01:18:57,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 156 transitions, 1578 flow [2022-12-13 01:18:57,591 INFO L130 PetriNetUnfolder]: 564/1119 cut-off events. [2022-12-13 01:18:57,592 INFO L131 PetriNetUnfolder]: For 6291/7409 co-relation queries the response was YES. [2022-12-13 01:18:57,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5396 conditions, 1119 events. 564/1119 cut-off events. For 6291/7409 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6474 event pairs, 60 based on Foata normal form. 22/1047 useless extension candidates. Maximal degree in co-relation 4925. Up to 474 conditions per place. [2022-12-13 01:18:57,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 156 transitions, 1578 flow [2022-12-13 01:18:57,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 1726 [2022-12-13 01:18:57,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L47-1-->L47-1: Formula: (and (< (mod v_~x2~0_51 4294967296) (mod v_~n~0_49 4294967296)) (= v_~x2~0_49 (* v_~x2~0_51 4))) InVars {~x2~0=v_~x2~0_51, ~n~0=v_~n~0_49} OutVars{~x2~0=v_~x2~0_49, ~n~0=v_~n~0_49} AuxVars[] AssignedVars[~x2~0] and [388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0] [2022-12-13 01:18:57,783 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L47-1-->L47-1: Formula: (and (< (mod v_~x2~0_51 4294967296) (mod v_~n~0_49 4294967296)) (= v_~x2~0_49 (* v_~x2~0_51 4))) InVars {~x2~0=v_~x2~0_51, ~n~0=v_~n~0_49} OutVars{~x2~0=v_~x2~0_49, ~n~0=v_~n~0_49} AuxVars[] AssignedVars[~x2~0] and [339] L56-1-->L56-1: Formula: (and (< (mod v_~x3~0_27 4294967296) (mod v_~n~0_15 4294967296)) (= (* v_~x3~0_27 4) v_~x3~0_25)) InVars {~x3~0=v_~x3~0_27, ~n~0=v_~n~0_15} OutVars{~x3~0=v_~x3~0_25, ~n~0=v_~n~0_15} AuxVars[] AssignedVars[~x3~0] [2022-12-13 01:18:57,805 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] L47-1-->L47-1: Formula: (and (< (mod v_~x2~0_51 4294967296) (mod v_~n~0_49 4294967296)) (= v_~x2~0_49 (* v_~x2~0_51 4))) InVars {~x2~0=v_~x2~0_51, ~n~0=v_~n~0_49} OutVars{~x2~0=v_~x2~0_49, ~n~0=v_~n~0_49} AuxVars[] AssignedVars[~x2~0] and [409] L56-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< (mod v_~x3~0_In_1 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~x3~0=v_~x3~0_In_1, ~n~0=v_~n~0_In_1} OutVars{~x3~0=v_~x3~0_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_1, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-13 01:18:57,848 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:18:57,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 385 [2022-12-13 01:18:57,849 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 156 transitions, 1620 flow [2022-12-13 01:18:57,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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) [2022-12-13 01:18:57,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:18:57,849 INFO L214 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] [2022-12-13 01:18:57,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 01:18:58,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:18:58,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:18:58,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:18:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1985616804, now seen corresponding path program 1 times [2022-12-13 01:18:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:18:58,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674194738] [2022-12-13 01:18:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:18:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:18:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:18:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:18:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:18:58,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674194738] [2022-12-13 01:18:58,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674194738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:18:58,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703925495] [2022-12-13 01:18:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:18:58,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:18:58,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:18:58,536 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) [2022-12-13 01:18:58,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 01:19:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:19:00,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 01:19:00,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 01:19:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:19:36,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 01:19:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:19:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703925495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 01:19:45,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 01:19:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 13 [2022-12-13 01:19:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907584269] [2022-12-13 01:19:45,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 01:19:45,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 01:19:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:19:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 01:19:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=137, Unknown=15, NotChecked=0, Total=210 [2022-12-13 01:19:45,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 01:19:45,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 156 transitions, 1620 flow. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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) [2022-12-13 01:19:45,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:19:45,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 01:19:45,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:19:47,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:20:09,127 WARN L233 SmtUtils]: Spent 17.24s on a formula simplification. DAG size of input: 66 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:20:11,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:20:13,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:20:15,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:20:17,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:20:18,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:11,080 WARN L233 SmtUtils]: Spent 50.42s on a formula simplification. DAG size of input: 88 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 01:21:13,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:14,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:16,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:18,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:20,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:22,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:24,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:26,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:29,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:31,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:33,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:41,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:43,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:45,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:47,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:49,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:51,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:53,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:55,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:21:57,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:01,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:05,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:07,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:11,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:13,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:15,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:16,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:17,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:20,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:22,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:24,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:26,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:29,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:31,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:34,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:36,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:38,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:41,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:44,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:45,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 01:22:45,744 INFO L130 PetriNetUnfolder]: 5443/7501 cut-off events. [2022-12-13 01:22:45,744 INFO L131 PetriNetUnfolder]: For 53452/53452 co-relation queries the response was YES. [2022-12-13 01:22:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43327 conditions, 7501 events. 5443/7501 cut-off events. For 53452/53452 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 34543 event pairs, 560 based on Foata normal form. 19/7504 useless extension candidates. Maximal degree in co-relation 41297. Up to 6814 conditions per place. [2022-12-13 01:22:45,803 INFO L137 encePairwiseOnDemand]: 30/45 looper letters, 197 selfloop transitions, 41 changer transitions 15/253 dead transitions. [2022-12-13 01:22:45,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 253 transitions, 2780 flow [2022-12-13 01:22:45,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 01:22:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 01:22:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2022-12-13 01:22:45,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36790123456790125 [2022-12-13 01:22:45,804 INFO L175 Difference]: Start difference. First operand has 87 places, 156 transitions, 1620 flow. Second operand 9 states and 149 transitions. [2022-12-13 01:22:45,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 253 transitions, 2780 flow [2022-12-13 01:22:45,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 253 transitions, 2669 flow, removed 51 selfloop flow, removed 1 redundant places. [2022-12-13 01:22:45,915 INFO L231 Difference]: Finished difference. Result has 99 places, 174 transitions, 1837 flow [2022-12-13 01:22:45,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1837, PETRI_PLACES=99, PETRI_TRANSITIONS=174} [2022-12-13 01:22:45,916 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2022-12-13 01:22:45,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:22:45,916 INFO L89 Accepts]: Start accepts. Operand has 99 places, 174 transitions, 1837 flow [2022-12-13 01:22:45,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:22:45,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:22:45,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 174 transitions, 1837 flow [2022-12-13 01:22:45,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 174 transitions, 1837 flow [2022-12-13 01:22:46,020 INFO L130 PetriNetUnfolder]: 830/1545 cut-off events. [2022-12-13 01:22:46,020 INFO L131 PetriNetUnfolder]: For 10205/12217 co-relation queries the response was YES. [2022-12-13 01:22:46,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 1545 events. 830/1545 cut-off events. For 10205/12217 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 9209 event pairs, 100 based on Foata normal form. 27/1395 useless extension candidates. Maximal degree in co-relation 7813. Up to 648 conditions per place. [2022-12-13 01:22:46,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 174 transitions, 1837 flow [2022-12-13 01:22:46,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 1850 [2022-12-13 01:22:46,071 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L56-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_2| 0) (not (< (mod v_~x3~0_In_1 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~x3~0=v_~x3~0_In_1, ~n~0=v_~n~0_In_1} OutVars{~x3~0=v_~x3~0_In_1, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_2|, ~n~0=v_~n~0_In_1, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_2|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0] [2022-12-13 01:22:46,126 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L47-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_85 4294967296))) (and (= (* v_~x1~0_87 4) v_~x1~0_86) (= |v_thread2Thread1of1ForFork3_#res.offset_29| 0) (not (< (mod v_~x2~0_100 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork3_#res.base_29| 0) (< (mod v_~x1~0_87 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_100, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_87} OutVars{~x2~0=v_~x2~0_100, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_29|, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_86, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, ~x1~0, thread2Thread1of1ForFork3_#res.offset] and [352] L89-4-->L90-1: Formula: (= (select (select |v_#memory_int_33| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_10|) InVars {#memory_int=|v_#memory_int_33|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_9|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_10|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_5|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-13 01:22:46,309 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L47-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_85 4294967296))) (and (= (* v_~x1~0_87 4) v_~x1~0_86) (= |v_thread2Thread1of1ForFork3_#res.offset_29| 0) (not (< (mod v_~x2~0_100 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork3_#res.base_29| 0) (< (mod v_~x1~0_87 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_100, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_87} OutVars{~x2~0=v_~x2~0_100, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_29|, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_86, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, ~x1~0, thread2Thread1of1ForFork3_#res.offset] and [339] L56-1-->L56-1: Formula: (and (< (mod v_~x3~0_27 4294967296) (mod v_~n~0_15 4294967296)) (= (* v_~x3~0_27 4) v_~x3~0_25)) InVars {~x3~0=v_~x3~0_27, ~n~0=v_~n~0_15} OutVars{~x3~0=v_~x3~0_25, ~n~0=v_~n~0_15} AuxVars[] AssignedVars[~x3~0] [2022-12-13 01:22:46,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [425] L47-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_85 4294967296))) (and (= (* v_~x1~0_87 4) v_~x1~0_86) (= |v_thread2Thread1of1ForFork3_#res.offset_29| 0) (not (< (mod v_~x2~0_100 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork3_#res.base_29| 0) (< (mod v_~x1~0_87 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_100, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_87} OutVars{~x2~0=v_~x2~0_100, thread2Thread1of1ForFork3_#res.base=|v_thread2Thread1of1ForFork3_#res.base_29|, ~n~0=v_~n~0_85, ~x1~0=v_~x1~0_86, thread2Thread1of1ForFork3_#res.offset=|v_thread2Thread1of1ForFork3_#res.offset_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#res.base, ~x1~0, thread2Thread1of1ForFork3_#res.offset] and [388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0] [2022-12-13 01:22:46,414 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:22:46,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 498 [2022-12-13 01:22:46,414 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 173 transitions, 1867 flow [2022-12-13 01:22:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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) [2022-12-13 01:22:46,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:22:46,415 INFO L214 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] [2022-12-13 01:22:46,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 01:22:46,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:22:46,615 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 01:22:46,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:22:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1242268399, now seen corresponding path program 1 times [2022-12-13 01:22:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:22:46,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061441172] [2022-12-13 01:22:46,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:22:46,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:22:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:22:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:22:47,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:22:47,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061441172] [2022-12-13 01:22:47,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061441172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 01:22:47,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946523678] [2022-12-13 01:22:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:22:47,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 01:22:47,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:22:47,116 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) [2022-12-13 01:22:47,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process Received shutdown request... [2022-12-13 01:31:18,447 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 01:31:18,447 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 [2022-12-13 01:31:19,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-12-13 01:31:19,653 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forcibly destroying the process [2022-12-13 01:31:19,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 137 [2022-12-13 01:31:19,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 01:31:19,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-13 01:31:19,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2022-12-13 01:31:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109958269] [2022-12-13 01:31:19,663 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-13 01:31:19,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 01:31:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:31:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 01:31:19,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 01:31:19,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-13 01:31:19,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 173 transitions, 1867 flow. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2022-12-13 01:31:19,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:31:19,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-13 01:31:19,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:31:19,666 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 01:31:19,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 01:31:19,666 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-13 01:31:19,667 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 01:31:19,667 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 01:31:19,668 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 01:31:19,668 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 01:31:19,668 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:31:19,670 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:31:19,670 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:31:19,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:31:19 BasicIcfg [2022-12-13 01:31:19,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:31:19,672 INFO L158 Benchmark]: Toolchain (without parser) took 882002.58ms. Allocated memory was 206.6MB in the beginning and 360.7MB in the end (delta: 154.1MB). Free memory was 181.6MB in the beginning and 202.8MB in the end (delta: -21.2MB). Peak memory consumption was 132.5MB. Max. memory is 8.0GB. [2022-12-13 01:31:19,672 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory is still 183.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:31:19,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.76ms. Allocated memory is still 206.6MB. Free memory was 181.2MB in the beginning and 170.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 01:31:19,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.98ms. Allocated memory is still 206.6MB. Free memory was 170.2MB in the beginning and 168.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 01:31:19,672 INFO L158 Benchmark]: Boogie Preprocessor took 32.40ms. Allocated memory is still 206.6MB. Free memory was 168.5MB in the beginning and 167.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:31:19,673 INFO L158 Benchmark]: RCFGBuilder took 312.13ms. Allocated memory is still 206.6MB. Free memory was 167.1MB in the beginning and 152.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 01:31:19,673 INFO L158 Benchmark]: TraceAbstraction took 881385.22ms. Allocated memory was 206.6MB in the beginning and 360.7MB in the end (delta: 154.1MB). Free memory was 150.9MB in the beginning and 202.8MB in the end (delta: -51.9MB). Peak memory consumption was 102.1MB. Max. memory is 8.0GB. [2022-12-13 01:31:19,673 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.10ms. Allocated memory is still 206.6MB. Free memory is still 183.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.76ms. Allocated memory is still 206.6MB. Free memory was 181.2MB in the beginning and 170.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.98ms. Allocated memory is still 206.6MB. Free memory was 170.2MB in the beginning and 168.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.40ms. Allocated memory is still 206.6MB. Free memory was 168.5MB in the beginning and 167.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 312.13ms. Allocated memory is still 206.6MB. Free memory was 167.1MB in the beginning and 152.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 881385.22ms. Allocated memory was 206.6MB in the beginning and 360.7MB in the end (delta: 154.1MB). Free memory was 150.9MB in the beginning and 202.8MB in the end (delta: -51.9MB). Peak memory consumption was 102.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 109 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 25 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 33 ConcurrentYvCompositions, 6 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 763, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 763, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 763, unknown conditional: 0, unknown unconditional: 763] , Statistics on independence cache: Total cache size (in pairs): 1257, Positive cache size: 1257, Positive conditional cache size: 0, Positive unconditional cache size: 1257, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 68 PlacesBefore, 68 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 31, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 73 PlacesBefore, 73 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 1294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 228, independent: 228, independent conditional: 228, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 228, independent: 228, independent conditional: 228, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 228, independent: 228, independent conditional: 228, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 228, independent: 228, independent conditional: 228, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, independent: 207, independent conditional: 207, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 59, Positive conditional cache size: 59, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 87 PlacesBefore, 87 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 1726 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 93, Positive conditional cache size: 93, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 98 PlacesBefore, 97 PlacesAfterwards, 174 TransitionsBefore, 173 TransitionsAfterwards, 1850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 119, Positive conditional cache size: 119, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - 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 executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 141 locations, 5 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: 881.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 288.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 73 mSolverCounterUnknown, 745 SdHoareTripleChecker+Valid, 198.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 745 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 197.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2719 IncrementalHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 0 mSDtfsCounter, 2719 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 264 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 141.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1867occurred in iteration=10, InterpolantAutomatonStates: 65, 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, 10.4s SatisfiabilityAnalysisTime, 62.6s InterpolantComputationTime, 397 NumberOfCodeBlocks, 397 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 527 ConstructedInterpolants, 0 QuantifiedInterpolants, 17470 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1409 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 2/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown