./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:44:40,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:44:40,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:44:40,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:44:40,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:44:40,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:44:40,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:44:40,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:44:40,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:44:40,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:44:40,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:44:40,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:44:40,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:44:40,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:44:40,409 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:44:40,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:44:40,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:44:40,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:44:40,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:44:40,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:44:40,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:44:40,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:44:40,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:44:40,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:44:40,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:44:40,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:44:40,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:44:40,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:44:40,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:44:40,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:40,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:40,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:40,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:40,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:44:40,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:44:40,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:40,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:44:40,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:44:40,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:44:40,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-01-09 16:44:40,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:44:40,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:44:40,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:44:40,683 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:44:40,683 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:44:40,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-01-09 16:44:41,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e4cadb66/f386bace10a842b2aa66e451bdd2c462/FLAG7e3ee293b [2025-01-09 16:44:42,127 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:44:42,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-01-09 16:44:42,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e4cadb66/f386bace10a842b2aa66e451bdd2c462/FLAG7e3ee293b [2025-01-09 16:44:42,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e4cadb66/f386bace10a842b2aa66e451bdd2c462 [2025-01-09 16:44:42,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:44:42,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:44:42,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:42,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:44:42,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:44:42,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7607d17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42, skipping insertion in model container [2025-01-09 16:44:42,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:44:42,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-01-09 16:44:42,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:42,357 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:44:42,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c[2423,2436] [2025-01-09 16:44:42,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:44:42,400 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:44:42,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42 WrapperNode [2025-01-09 16:44:42,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:44:42,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:42,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:44:42,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:44:42,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,432 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-01-09 16:44:42,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:44:42,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:44:42,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:44:42,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:44:42,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,455 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-09 16:44:42,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:44:42,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:44:42,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:44:42,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:44:42,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (1/1) ... [2025-01-09 16:44:42,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:44:42,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:42,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:44:42,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:44:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:44:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:44:42,524 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:44:42,524 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:44:42,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:44:42,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:44:42,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:44:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:44:42,527 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:44:42,616 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:44:42,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:44:42,995 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:44:42,995 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:44:43,362 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:44:43,362 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:44:43,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:43 BoogieIcfgContainer [2025-01-09 16:44:43,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:44:43,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:44:43,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:44:43,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:44:43,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:44:42" (1/3) ... [2025-01-09 16:44:43,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f77c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:43, skipping insertion in model container [2025-01-09 16:44:43,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:44:42" (2/3) ... [2025-01-09 16:44:43,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152f77c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:44:43, skipping insertion in model container [2025-01-09 16:44:43,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:44:43" (3/3) ... [2025-01-09 16:44:43,371 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-01-09 16:44:43,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:44:43,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 29 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 16:44:43,385 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:44:43,444 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:44:43,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 87 flow [2025-01-09 16:44:43,510 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2025-01-09 16:44:43,515 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:44:43,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 5/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-01-09 16:44:43,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 87 flow [2025-01-09 16:44:43,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 29 transitions, 76 flow [2025-01-09 16:44:43,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:44:43,545 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1810ba2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:44:43,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:44:43,557 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:44:43,558 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-01-09 16:44:43,558 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:44:43,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:43,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:43,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:44:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1205649186, now seen corresponding path program 1 times [2025-01-09 16:44:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662717789] [2025-01-09 16:44:43,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:43,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:44:43,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:44:43,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:43,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:43,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662717789] [2025-01-09 16:44:43,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662717789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:43,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:44:43,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977158985] [2025-01-09 16:44:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:43,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:44:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:43,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:44:43,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:44:43,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:44:43,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-09 16:44:43,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:43,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:44:43,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:44,264 INFO L124 PetriNetUnfolderBase]: 818/1181 cut-off events. [2025-01-09 16:44:44,264 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-01-09 16:44:44,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2482 conditions, 1181 events. 818/1181 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4425 event pairs, 226 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 2122. Up to 803 conditions per place. [2025-01-09 16:44:44,281 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 42 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-01-09 16:44:44,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 223 flow [2025-01-09 16:44:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:44:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:44:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-01-09 16:44:44,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-01-09 16:44:44,296 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 76 flow. Second operand 3 states and 60 transitions. [2025-01-09 16:44:44,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 223 flow [2025-01-09 16:44:44,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 48 transitions, 201 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:44:44,308 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 90 flow [2025-01-09 16:44:44,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2025-01-09 16:44:44,313 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-01-09 16:44:44,313 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 90 flow [2025-01-09 16:44:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2025-01-09 16:44:44,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:44,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:44,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:44:44,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:44:44,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash -625090606, now seen corresponding path program 1 times [2025-01-09 16:44:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:44,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253328991] [2025-01-09 16:44:44,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:44,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:44,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:44:44,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:44:44,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:44,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:44:44,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:44,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253328991] [2025-01-09 16:44:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253328991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:44,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:44,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:44:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675676573] [2025-01-09 16:44:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:44:44,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:44,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:44:44,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:44:44,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:44:44,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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) [2025-01-09 16:44:44,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:44,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:44:44,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:44,762 INFO L124 PetriNetUnfolderBase]: 714/1072 cut-off events. [2025-01-09 16:44:44,763 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-01-09 16:44:44,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2362 conditions, 1072 events. 714/1072 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4065 event pairs, 478 based on Foata normal form. 1/932 useless extension candidates. Maximal degree in co-relation 776. Up to 991 conditions per place. [2025-01-09 16:44:44,772 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 25 selfloop transitions, 4 changer transitions 1/35 dead transitions. [2025-01-09 16:44:44,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 156 flow [2025-01-09 16:44:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:44:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:44:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-01-09 16:44:44,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-01-09 16:44:44,775 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 90 flow. Second operand 4 states and 56 transitions. [2025-01-09 16:44:44,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 156 flow [2025-01-09 16:44:44,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:44:44,778 INFO L231 Difference]: Finished difference. Result has 35 places, 34 transitions, 112 flow [2025-01-09 16:44:44,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=34} [2025-01-09 16:44:44,779 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-01-09 16:44:44,779 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 34 transitions, 112 flow [2025-01-09 16:44:44,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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) [2025-01-09 16:44:44,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:44,780 INFO L206 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] [2025-01-09 16:44:44,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:44:44,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:44:44,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:44,781 INFO L85 PathProgramCache]: Analyzing trace with hash 197998498, now seen corresponding path program 1 times [2025-01-09 16:44:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:44,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381767653] [2025-01-09 16:44:44,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:44,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:44:44,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:44:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:44:44,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381767653] [2025-01-09 16:44:44,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381767653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:44:44,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:44:44,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:44:44,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550596231] [2025-01-09 16:44:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:44,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:44:44,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:44,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:44:44,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:44:44,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:44:44,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) [2025-01-09 16:44:44,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:44,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:44:44,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:45,121 INFO L124 PetriNetUnfolderBase]: 719/1084 cut-off events. [2025-01-09 16:44:45,123 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-01-09 16:44:45,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 1084 events. 719/1084 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4146 event pairs, 254 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 2303. Up to 528 conditions per place. [2025-01-09 16:44:45,131 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-01-09 16:44:45,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 224 flow [2025-01-09 16:44:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:44:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:44:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-01-09 16:44:45,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2025-01-09 16:44:45,134 INFO L175 Difference]: Start difference. First operand has 35 places, 34 transitions, 112 flow. Second operand 4 states and 62 transitions. [2025-01-09 16:44:45,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 224 flow [2025-01-09 16:44:45,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 214 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:44:45,136 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 123 flow [2025-01-09 16:44:45,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-01-09 16:44:45,138 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-01-09 16:44:45,139 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 123 flow [2025-01-09 16:44:45,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) [2025-01-09 16:44:45,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:45,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:45,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:44:45,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:44:45,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1077165365, now seen corresponding path program 1 times [2025-01-09 16:44:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:45,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216772243] [2025-01-09 16:44:45,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:45,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:44:45,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:44:45,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:45,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:44:45,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216772243] [2025-01-09 16:44:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216772243] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:45,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056510493] [2025-01-09 16:44:45,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:45,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:45,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:45,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:45,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:44:45,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:44:45,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:44:45,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:45,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:44:45,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:44:45,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:44:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:44:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056510493] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:45,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:44:45,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-09 16:44:45,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901552065] [2025-01-09 16:44:45,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:44:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:44:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:44:45,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:44:45,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:44:45,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:44:45,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-01-09 16:44:45,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:44:45,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:44:45,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:44:45,810 INFO L124 PetriNetUnfolderBase]: 760/1123 cut-off events. [2025-01-09 16:44:45,811 INFO L125 PetriNetUnfolderBase]: For 489/502 co-relation queries the response was YES. [2025-01-09 16:44:45,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 1123 events. 760/1123 cut-off events. For 489/502 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4283 event pairs, 324 based on Foata normal form. 94/1124 useless extension candidates. Maximal degree in co-relation 2830. Up to 805 conditions per place. [2025-01-09 16:44:45,819 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-01-09 16:44:45,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 263 flow [2025-01-09 16:44:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:44:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:44:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-01-09 16:44:45,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-01-09 16:44:45,821 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 123 flow. Second operand 5 states and 72 transitions. [2025-01-09 16:44:45,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 263 flow [2025-01-09 16:44:45,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:44:45,824 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 140 flow [2025-01-09 16:44:45,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-01-09 16:44:45,826 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2025-01-09 16:44:45,827 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 140 flow [2025-01-09 16:44:45,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2025-01-09 16:44:45,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:44:45,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:44:45,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:44:46,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:46,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:44:46,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:44:46,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2083766397, now seen corresponding path program 1 times [2025-01-09 16:44:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:44:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770625179] [2025-01-09 16:44:46,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:44:46,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:44:46,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:44:46,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:46,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:44:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770625179] [2025-01-09 16:44:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770625179] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:44:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682205435] [2025-01-09 16:44:47,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:44:47,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:44:47,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:44:47,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:44:47,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:44:47,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:44:47,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:44:47,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:44:47,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:44:47,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 16:44:47,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:44:47,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 16:44:47,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:44:47,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:44:47,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 16:44:47,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:44:47,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 16:44:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:44:48,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:06,604 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-01-09 16:45:06,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1578 treesize of output 1148 [2025-01-09 16:45:06,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:45:06,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 809 treesize of output 749 [2025-01-09 16:45:50,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:45:50,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 64 [2025-01-09 16:45:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682205435] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:45:54,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:45:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-01-09 16:45:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806084365] [2025-01-09 16:45:54,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:45:54,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 16:45:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:54,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 16:45:54,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=641, Unknown=3, NotChecked=0, Total=756 [2025-01-09 16:45:55,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:45:55,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 140 flow. Second operand has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 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) [2025-01-09 16:45:55,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:55,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:45:55,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:59,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:46:03,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]