./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 a1648913be4b4e88120f8ece4966a58804b334c451c87254dfc42f8e396f396f --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 20:26:05,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 20:26:05,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 20:26:05,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 20:26:05,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 20:26:05,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 20:26:05,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 20:26:05,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 20:26:05,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 20:26:05,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 20:26:05,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 20:26:05,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 20:26:05,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 20:26:05,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 20:26:05,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 20:26:05,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 20:26:05,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 20:26:05,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 20:26:05,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 20:26:05,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 20:26:05,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 20:26:05,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 20:26:05,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 20:26:05,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 20:26:05,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 20:26:05,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 20:26:05,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 20:26:05,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 20:26:05,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 20:26:05,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 20:26:05,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 20:26:05,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 20:26:05,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 20:26:05,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 20:26:05,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 20:26:05,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 20:26:05,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 20:26:05,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 20:26:05,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 20:26:05,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 20:26:05,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 20:26:05,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 20:26:05,756 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 20:26:05,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 20:26:05,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 20:26:05,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 20:26:05,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 20:26:05,758 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 20:26:05,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 20:26:05,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 20:26:05,759 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 20:26:05,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 20:26:05,760 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 20:26:05,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 20:26:05,761 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 20:26:05,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 20:26:05,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 20:26:05,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 20:26:05,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 20:26:05,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:26:05,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 20:26:05,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 20:26:05,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 20:26:05,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 20:26:05,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 20:26:05,762 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 20:26:05,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 20:26:05,763 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 20:26:05,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 20:26:05,763 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 20:26:05,763 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a1648913be4b4e88120f8ece4966a58804b334c451c87254dfc42f8e396f396f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 20:26:06,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 20:26:06,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 20:26:06,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 20:26:06,100 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 20:26:06,101 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 20:26:06,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2023-08-30 20:26:07,216 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 20:26:07,406 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 20:26:07,407 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c [2023-08-30 20:26:07,426 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540221391/1fa4fa7cc2244e96a979ccd4a252a069/FLAG673010645 [2023-08-30 20:26:07,442 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/540221391/1fa4fa7cc2244e96a979ccd4a252a069 [2023-08-30 20:26:07,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 20:26:07,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 20:26:07,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 20:26:07,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 20:26:07,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 20:26:07,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74932eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07, skipping insertion in model container [2023-08-30 20:26:07,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 20:26:07,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 20:26:07,640 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c[3271,3284] [2023-08-30 20:26:07,653 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:26:07,660 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 20:26:07,691 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-inc-dec.wvr.c[3271,3284] [2023-08-30 20:26:07,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:26:07,707 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:26:07,708 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:26:07,712 INFO L208 MainTranslator]: Completed translation [2023-08-30 20:26:07,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07 WrapperNode [2023-08-30 20:26:07,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 20:26:07,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 20:26:07,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 20:26:07,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 20:26:07,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,764 INFO L138 Inliner]: procedures = 27, calls = 75, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 176 [2023-08-30 20:26:07,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 20:26:07,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 20:26:07,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 20:26:07,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 20:26:07,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,806 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 20:26:07,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 20:26:07,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 20:26:07,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 20:26:07,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (1/1) ... [2023-08-30 20:26:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:26:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:26:07,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 20:26:07,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 20:26:07,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 20:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 20:26:07,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 20:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 20:26:07,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 20:26:07,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 20:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 20:26:07,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 20:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 20:26:07,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 20:26:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 20:26:07,940 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 20:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 20:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-30 20:26:07,941 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-30 20:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 20:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 20:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 20:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 20:26:07,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 20:26:07,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 20:26:07,943 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 20:26:08,055 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 20:26:08,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 20:26:08,339 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 20:26:08,401 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 20:26:08,401 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-30 20:26:08,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:26:08 BoogieIcfgContainer [2023-08-30 20:26:08,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 20:26:08,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 20:26:08,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 20:26:08,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 20:26:08,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:26:07" (1/3) ... [2023-08-30 20:26:08,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d40439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:26:08, skipping insertion in model container [2023-08-30 20:26:08,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:26:07" (2/3) ... [2023-08-30 20:26:08,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d40439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:26:08, skipping insertion in model container [2023-08-30 20:26:08,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:26:08" (3/3) ... [2023-08-30 20:26:08,423 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc-dec.wvr.c [2023-08-30 20:26:08,429 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 20:26:08,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 20:26:08,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 20:26:08,436 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 20:26:08,524 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-08-30 20:26:08,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 185 transitions, 410 flow [2023-08-30 20:26:08,629 INFO L130 PetriNetUnfolder]: 14/180 cut-off events. [2023-08-30 20:26:08,629 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 20:26:08,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 180 events. 14/180 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-08-30 20:26:08,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 185 transitions, 410 flow [2023-08-30 20:26:08,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 166 transitions, 362 flow [2023-08-30 20:26:08,645 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 20:26:08,655 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 166 transitions, 362 flow [2023-08-30 20:26:08,658 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 166 transitions, 362 flow [2023-08-30 20:26:08,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 166 transitions, 362 flow [2023-08-30 20:26:08,721 INFO L130 PetriNetUnfolder]: 14/166 cut-off events. [2023-08-30 20:26:08,721 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 20:26:08,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 166 events. 14/166 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 134 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2023-08-30 20:26:08,725 INFO L119 LiptonReduction]: Number of co-enabled transitions 3806 [2023-08-30 20:26:14,589 INFO L134 LiptonReduction]: Checked pairs total: 5582 [2023-08-30 20:26:14,589 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-08-30 20:26:14,607 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 20:26:14,614 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@62652987, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 20:26:14,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-30 20:26:14,633 INFO L130 PetriNetUnfolder]: 5/37 cut-off events. [2023-08-30 20:26:14,634 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-30 20:26:14,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:26:14,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:26:14,635 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 3 more)] === [2023-08-30 20:26:14,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:26:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash 177751736, now seen corresponding path program 1 times [2023-08-30 20:26:14,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:26:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895702947] [2023-08-30 20:26:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:26:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:26:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:26:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:26:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:26:15,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895702947] [2023-08-30 20:26:15,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895702947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:26:15,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:26:15,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:26:15,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427772568] [2023-08-30 20:26:15,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:26:15,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:26:15,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:26:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:26:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:26:15,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-08-30 20:26:15,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:15,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:26:15,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-08-30 20:26:15,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:26:15,690 INFO L130 PetriNetUnfolder]: 6110/7594 cut-off events. [2023-08-30 20:26:15,690 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2023-08-30 20:26:15,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15782 conditions, 7594 events. 6110/7594 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30132 event pairs, 2980 based on Foata normal form. 0/5304 useless extension candidates. Maximal degree in co-relation 13404. Up to 6012 conditions per place. [2023-08-30 20:26:15,721 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 52 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-30 20:26:15,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 266 flow [2023-08-30 20:26:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:26:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:26:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 672 transitions. [2023-08-30 20:26:15,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029940119760479 [2023-08-30 20:26:15,732 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 672 transitions. [2023-08-30 20:26:15,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 672 transitions. [2023-08-30 20:26:15,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:26:15,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 672 transitions. [2023-08-30 20:26:15,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:15,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:15,743 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:15,744 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 106 flow. Second operand 4 states and 672 transitions. [2023-08-30 20:26:15,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 266 flow [2023-08-30 20:26:15,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 10 redundant places. [2023-08-30 20:26:15,755 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 100 flow [2023-08-30 20:26:15,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-30 20:26:15,758 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-08-30 20:26:15,758 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 100 flow [2023-08-30 20:26:15,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:15,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:26:15,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:26:15,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 20:26:15,759 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 3 more)] === [2023-08-30 20:26:15,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:26:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2063376111, now seen corresponding path program 1 times [2023-08-30 20:26:15,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:26:15,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56623273] [2023-08-30 20:26:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:26:15,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:26:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:26:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:26:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:26:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56623273] [2023-08-30 20:26:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56623273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:26:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:26:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:26:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140877795] [2023-08-30 20:26:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:26:15,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:26:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:26:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:26:15,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:26:15,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-08-30 20:26:15,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:15,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:26:15,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-08-30 20:26:15,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:26:16,444 INFO L130 PetriNetUnfolder]: 7432/9228 cut-off events. [2023-08-30 20:26:16,444 INFO L131 PetriNetUnfolder]: For 1669/1669 co-relation queries the response was YES. [2023-08-30 20:26:16,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20378 conditions, 9228 events. 7432/9228 cut-off events. For 1669/1669 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 37509 event pairs, 3779 based on Foata normal form. 0/6511 useless extension candidates. Maximal degree in co-relation 6677. Up to 7480 conditions per place. [2023-08-30 20:26:16,512 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 54 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-30 20:26:16,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 268 flow [2023-08-30 20:26:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:26:16,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:26:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 672 transitions. [2023-08-30 20:26:16,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029940119760479 [2023-08-30 20:26:16,514 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 672 transitions. [2023-08-30 20:26:16,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 672 transitions. [2023-08-30 20:26:16,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:26:16,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 672 transitions. [2023-08-30 20:26:16,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:16,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:16,518 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:16,518 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 100 flow. Second operand 4 states and 672 transitions. [2023-08-30 20:26:16,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 268 flow [2023-08-30 20:26:16,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 258 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 20:26:16,521 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 108 flow [2023-08-30 20:26:16,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-30 20:26:16,521 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2023-08-30 20:26:16,521 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 108 flow [2023-08-30 20:26:16,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:16,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:26:16,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:26:16,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 20:26:16,522 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 3 more)] === [2023-08-30 20:26:16,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:26:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1327335702, now seen corresponding path program 1 times [2023-08-30 20:26:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:26:16,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163879060] [2023-08-30 20:26:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:26:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:26:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:26:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:26:16,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:26:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163879060] [2023-08-30 20:26:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163879060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:26:16,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:26:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:26:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134098566] [2023-08-30 20:26:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:26:16,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:26:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:26:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:26:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:26:16,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-08-30 20:26:16,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:16,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:26:16,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-08-30 20:26:16,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:26:17,265 INFO L130 PetriNetUnfolder]: 9317/11685 cut-off events. [2023-08-30 20:26:17,266 INFO L131 PetriNetUnfolder]: For 2961/2961 co-relation queries the response was YES. [2023-08-30 20:26:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27111 conditions, 11685 events. 9317/11685 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 47277 event pairs, 4111 based on Foata normal form. 0/8912 useless extension candidates. Maximal degree in co-relation 12566. Up to 8724 conditions per place. [2023-08-30 20:26:17,306 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 59 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-30 20:26:17,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 298 flow [2023-08-30 20:26:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:26:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:26:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 675 transitions. [2023-08-30 20:26:17,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052395209580839 [2023-08-30 20:26:17,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 675 transitions. [2023-08-30 20:26:17,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 675 transitions. [2023-08-30 20:26:17,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:26:17,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 675 transitions. [2023-08-30 20:26:17,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:17,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:17,312 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:17,312 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 108 flow. Second operand 4 states and 675 transitions. [2023-08-30 20:26:17,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 298 flow [2023-08-30 20:26:17,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 288 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 20:26:17,315 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 116 flow [2023-08-30 20:26:17,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-08-30 20:26:17,316 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-30 20:26:17,316 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 116 flow [2023-08-30 20:26:17,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:17,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:26:17,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:26:17,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 20:26:17,317 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 3 more)] === [2023-08-30 20:26:17,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:26:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1929929813, now seen corresponding path program 1 times [2023-08-30 20:26:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:26:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847101595] [2023-08-30 20:26:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:26:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:26:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:26:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:26:17,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:26:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847101595] [2023-08-30 20:26:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847101595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:26:17,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:26:17,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:26:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283921995] [2023-08-30 20:26:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:26:17,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:26:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:26:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:26:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:26:17,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 334 [2023-08-30 20:26:17,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:17,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:26:17,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 334 [2023-08-30 20:26:17,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:26:18,106 INFO L130 PetriNetUnfolder]: 8748/11085 cut-off events. [2023-08-30 20:26:18,106 INFO L131 PetriNetUnfolder]: For 3227/3953 co-relation queries the response was YES. [2023-08-30 20:26:18,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28117 conditions, 11085 events. 8748/11085 cut-off events. For 3227/3953 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 44716 event pairs, 4945 based on Foata normal form. 726/9683 useless extension candidates. Maximal degree in co-relation 9657. Up to 8498 conditions per place. [2023-08-30 20:26:18,145 INFO L137 encePairwiseOnDemand]: 330/334 looper letters, 61 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-30 20:26:18,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 315 flow [2023-08-30 20:26:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:26:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:26:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 675 transitions. [2023-08-30 20:26:18,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052395209580839 [2023-08-30 20:26:18,147 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 675 transitions. [2023-08-30 20:26:18,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 675 transitions. [2023-08-30 20:26:18,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:26:18,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 675 transitions. [2023-08-30 20:26:18,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,151 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 116 flow. Second operand 4 states and 675 transitions. [2023-08-30 20:26:18,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 315 flow [2023-08-30 20:26:18,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 20:26:18,154 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 124 flow [2023-08-30 20:26:18,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-30 20:26:18,155 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-08-30 20:26:18,155 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 124 flow [2023-08-30 20:26:18,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:26:18,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:26:18,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 20:26:18,156 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 3 more)] === [2023-08-30 20:26:18,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:26:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1825103121, now seen corresponding path program 1 times [2023-08-30 20:26:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:26:18,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136146282] [2023-08-30 20:26:18,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:26:18,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:26:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:26:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 20:26:18,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:26:18,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136146282] [2023-08-30 20:26:18,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136146282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:26:18,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:26:18,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 20:26:18,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177459807] [2023-08-30 20:26:18,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:26:18,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 20:26:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:26:18,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 20:26:18,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 20:26:18,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 334 [2023-08-30 20:26:18,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:26:18,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 334 [2023-08-30 20:26:18,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:26:18,833 INFO L130 PetriNetUnfolder]: 6702/8564 cut-off events. [2023-08-30 20:26:18,833 INFO L131 PetriNetUnfolder]: For 2867/3870 co-relation queries the response was YES. [2023-08-30 20:26:18,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22689 conditions, 8564 events. 6702/8564 cut-off events. For 2867/3870 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34262 event pairs, 4945 based on Foata normal form. 1003/7780 useless extension candidates. Maximal degree in co-relation 7845. Up to 8499 conditions per place. [2023-08-30 20:26:18,864 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-30 20:26:18,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 208 flow [2023-08-30 20:26:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 20:26:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 20:26:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-08-30 20:26:18,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501996007984032 [2023-08-30 20:26:18,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-08-30 20:26:18,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-08-30 20:26:18,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:26:18,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-08-30 20:26:18,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,869 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 124 flow. Second operand 3 states and 503 transitions. [2023-08-30 20:26:18,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 208 flow [2023-08-30 20:26:18,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 20:26:18,873 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 130 flow [2023-08-30 20:26:18,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-08-30 20:26:18,873 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2023-08-30 20:26:18,874 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 130 flow [2023-08-30 20:26:18,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:18,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:26:18,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:26:18,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 20:26:18,875 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 3 more)] === [2023-08-30 20:26:18,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:26:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash 865740571, now seen corresponding path program 1 times [2023-08-30 20:26:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:26:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561443010] [2023-08-30 20:26:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:26:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:26:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:26:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:26:19,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:26:19,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561443010] [2023-08-30 20:26:19,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561443010] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:26:19,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564397783] [2023-08-30 20:26:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:26:19,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:26:19,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:26:19,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 20:26:19,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 20:26:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:26:19,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-30 20:26:19,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:26:19,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 20:26:19,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 20:26:19,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:26:19,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 20:26:19,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:26:19,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-30 20:26:20,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-30 20:26:20,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:26:20,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-08-30 20:26:20,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-08-30 20:26:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:26:20,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:26:23,179 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (< v_ArrVal_284 (+ (select .cse0 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= c_~min~0 (+ v_ArrVal_284 1)))))) is different from false [2023-08-30 20:26:23,639 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (.cse1 (select .cse2 c_~A~0.base))) (or (< .cse0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (<= 2147483647 v_ArrVal_284) (< .cse0 (+ v_ArrVal_284 3)) (< v_ArrVal_284 (+ (select .cse1 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse5 (select .cse6 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (<= (select (select .cse4 c_~A~0.base) c_~A~0.offset) (+ v_ArrVal_284 1)) (< v_ArrVal_284 (+ (select .cse5 c_~A~0.offset) 1)) (<= (+ (select (select (store (store .cse6 c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0))))))) is different from false [2023-08-30 20:26:23,719 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< v_ArrVal_284 (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (<= 2147483647 v_ArrVal_284) (<= (+ (select (select (store (store .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_284 1))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< v_ArrVal_284 (+ (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (<= 2147483647 v_ArrVal_284) (< .cse4 (+ v_ArrVal_284 3)) (<= (+ (select (select (store (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (< .cse4 (+ (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))))))) is different from false [2023-08-30 20:26:23,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:26:23,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2023-08-30 20:26:23,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 826 treesize of output 814 [2023-08-30 20:26:23,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2023-08-30 20:26:23,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2023-08-30 20:26:23,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 230 [2023-08-30 20:26:23,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2023-08-30 20:26:23,946 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-30 20:26:23,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 1 [2023-08-30 20:26:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-30 20:26:23,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564397783] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:26:23,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:26:23,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 17] total 41 [2023-08-30 20:26:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443523257] [2023-08-30 20:26:23,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:26:23,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-08-30 20:26:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:26:23,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-08-30 20:26:23,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1304, Unknown=34, NotChecked=234, Total=1806 [2023-08-30 20:26:24,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 334 [2023-08-30 20:26:24,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 130 flow. Second operand has 43 states, 43 states have (on average 100.65116279069767) internal successors, (4328), 43 states have internal predecessors, (4328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:26:24,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:26:24,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 334 [2023-08-30 20:26:24,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:26:46,994 WARN L222 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 102 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:27:09,485 WARN L222 SmtUtils]: Spent 22.29s on a formula simplification. DAG size of input: 104 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:27:32,635 WARN L222 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 133 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:27:43,526 WARN L222 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 78 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:28:07,556 WARN L222 SmtUtils]: Spent 23.21s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:28:19,592 WARN L222 SmtUtils]: Spent 11.93s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:28:42,024 WARN L222 SmtUtils]: Spent 22.25s on a formula simplification. DAG size of input: 134 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:29:10,814 WARN L222 SmtUtils]: Spent 19.42s on a formula simplification. DAG size of input: 95 DAG size of output: 93 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:29:19,317 WARN L222 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 76 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:30:01,454 WARN L222 SmtUtils]: Spent 24.12s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:30:03,491 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 [1] [2023-08-30 20:30:05,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:30:07,540 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 [1] [2023-08-30 20:30:09,574 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 [1] [2023-08-30 20:30:11,580 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 [1] [2023-08-30 20:30:54,736 WARN L222 SmtUtils]: Spent 35.00s on a formula simplification. DAG size of input: 119 DAG size of output: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:30:56,883 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 [1] [2023-08-30 20:30:58,889 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 [1] [2023-08-30 20:31:00,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:31:27,737 WARN L222 SmtUtils]: Spent 26.69s on a formula simplification. DAG size of input: 80 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:31:50,029 WARN L222 SmtUtils]: Spent 22.24s on a formula simplification. DAG size of input: 104 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:31:53,181 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 [1] [2023-08-30 20:31:55,189 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 [1] [2023-08-30 20:31:57,197 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 [1] [2023-08-30 20:31:59,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:32:01,220 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 [1] [2023-08-30 20:32:03,280 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 [1] [2023-08-30 20:32:05,287 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 [1] [2023-08-30 20:32:43,838 WARN L222 SmtUtils]: Spent 30.40s on a formula simplification. DAG size of input: 108 DAG size of output: 106 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:32:45,850 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 [1] [2023-08-30 20:32:47,860 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 [1] [2023-08-30 20:33:02,050 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 [1] [2023-08-30 20:33:12,869 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 [1] [2023-08-30 20:33:14,878 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 [1] [2023-08-30 20:33:16,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:33:18,907 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 [1] [2023-08-30 20:34:01,887 WARN L222 SmtUtils]: Spent 34.56s on a formula simplification. DAG size of input: 120 DAG size of output: 94 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:34:03,914 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 [1] [2023-08-30 20:34:05,956 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 [1] [2023-08-30 20:34:07,976 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 [1] [2023-08-30 20:34:10,474 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 [1] [2023-08-30 20:34:12,489 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 [1] [2023-08-30 20:34:31,799 WARN L222 SmtUtils]: Spent 18.95s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:34:54,198 WARN L222 SmtUtils]: Spent 22.26s on a formula simplification. DAG size of input: 106 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:34:57,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:34:59,522 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 [1] [2023-08-30 20:35:01,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:35:03,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:35:05,379 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 [1] [2023-08-30 20:35:15,673 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 [1] [2023-08-30 20:35:17,922 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 [1] [2023-08-30 20:35:19,928 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 [1] [2023-08-30 20:36:02,782 WARN L222 SmtUtils]: Spent 36.50s on a formula simplification. DAG size of input: 134 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:36:04,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:36:06,807 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 [1] [2023-08-30 20:36:08,832 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 [1] [2023-08-30 20:36:10,925 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 [1] [2023-08-30 20:36:12,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:36:14,949 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 [1] [2023-08-30 20:36:17,000 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 [1] [2023-08-30 20:36:19,011 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 [1] [2023-08-30 20:36:21,018 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 [1] [2023-08-30 20:36:23,038 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 [1] [2023-08-30 20:36:25,044 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 [1] [2023-08-30 20:36:27,052 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 [1] [2023-08-30 20:36:29,059 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 [1] [2023-08-30 20:36:43,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:37:34,117 WARN L222 SmtUtils]: Spent 40.86s on a formula simplification. DAG size of input: 86 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:37:36,121 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 [1] [2023-08-30 20:37:38,130 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 [1] [2023-08-30 20:37:40,163 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 [1] [2023-08-30 20:37:42,170 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 [1] [2023-08-30 20:37:52,503 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 [1] [2023-08-30 20:37:54,512 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 [1] [2023-08-30 20:38:00,694 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 [1] [2023-08-30 20:38:02,699 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 [1] [2023-08-30 20:38:04,711 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 [1] [2023-08-30 20:38:07,290 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 [1] [2023-08-30 20:38:09,295 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 [1] [2023-08-30 20:38:11,306 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 [1] [2023-08-30 20:38:13,327 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 [1] [2023-08-30 20:38:15,335 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 [1] [2023-08-30 20:38:17,345 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 [1] [2023-08-30 20:38:19,351 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 [1] [2023-08-30 20:38:21,364 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 [1] [2023-08-30 20:38:23,370 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 [1] [2023-08-30 20:38:25,380 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 [1] [2023-08-30 20:38:27,388 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 [1] [2023-08-30 20:38:29,395 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 [1] [2023-08-30 20:38:31,461 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 [1] [2023-08-30 20:38:58,677 WARN L222 SmtUtils]: Spent 24.32s on a formula simplification. DAG size of input: 135 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:39:23,260 WARN L222 SmtUtils]: Spent 18.31s on a formula simplification. DAG size of input: 97 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:39:25,414 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 [1] [2023-08-30 20:39:27,691 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 [1] [2023-08-30 20:40:19,918 WARN L222 SmtUtils]: Spent 39.45s on a formula simplification. DAG size of input: 117 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:40:21,923 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 [1] [2023-08-30 20:40:23,927 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 [1] [2023-08-30 20:40:25,938 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 [1] [2023-08-30 20:40:27,945 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 [1] [2023-08-30 20:40:34,625 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 [1] [2023-08-30 20:40:36,635 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 [1] [2023-08-30 20:40:43,339 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 [1] Killed by 15